lostinmidlands's library 21 articles Export Sort

Hide details

	Alternation [My Copy] J. ACM, Vol. 28, No. 1. (January 1981), pp. 114-133. by Ashok K. Chandra, Dexter C. Kozen, Larry J. Stockmeyer posted to mju-lib hybrid-automata by lostinmidlands on 2007-01-17 17:02:50 as along with 2 people JakubSzymanik masteraka
	Discrete-time control for rectangular hybrid automata [My Copy] Theoretical Computer Science, Vol. 221, No. 1-2. (28 June 1999), pp. 369-392. by Thomas A. Henzinger, Peter W. Kopke posted to game-theory hybrid-automata mju-ashu timed-automata by lostinmidlands on 2006-12-29 13:04:11 as
	The Element of Surprise in Timed Games [My Copy] : CONCUR 2003 - Concurrency Theory (2003), pp. 144-158. by Luca de Alfaro, Marco Faella, Thomas A. Henzinger, Rupak Majumdar, Mariã«lle Stoelinga posted to game-theory mju-ashu timed-automata by lostinmidlands on 2006-12-29 13:02:02 as
	A Comparison of Control Problems for Timed and Hybrid Systems [My Copy] : Hybrid Systems: Computation and Control: 5th International Workshop, HSCC 2002, Stanford, CA, USA, March 25-27, 2002. Proceedings (2002), 134. by Franck Cassez, Thomas A. Henzinger, Jean-Franã§ois Raskin posted to mju-ashu timed-automata timed-implementation by lostinmidlands on 2006-12-28 17:26:52 as along with 1 person osankur
	Almost ASAP semantics: from timed models to timed implementations [My Copy] Formal Aspects of Computing, Vol. V17, No. 3. (17 October 2005), pp. 319-341. by Martin De Wulf, Laurent Doyen, Jean-Franã§ois Raskin posted to mju-ashu timed-automata timed-implementation by lostinmidlands on 2006-12-28 17:25:42 as along with 1 person osankur
	XPath with Conditional Axis Relations [My Copy] Lecture Notes in Computer Science : Advances in Database Technology - EDBT 2004 (2004), pp. 477-494. by Maarten Marx posted to mju-ranko xpath by lostinmidlands on 2006-11-20 14:00:04 as
	As Soon as Possible: Time Optimal Control for Timed Automata [My Copy] Lecture Notes in Computer Science : Hybrid Systems: Computation and Control: Second International Workshop, HSCC'99, Berg en Dal, The Netherlands, March 1999. Proceedings (1999), 19. by Eugene Asarin, Oded Maler posted to game-theory mju-ashu timed-automata by lostinmidlands on 2006-11-18 15:14:44 as
	Unique Sink Orientations of Grids [My Copy] Lecture Notes in Computer Science : Integer Programming and Combinatorial Optimization In Lecture Notes in Computer Science : Integer Programming and Combinatorial Optimization, Vol. 3509 (2005), pp. 210-224. by Bernd Gärtner, Walter D. Morris, Leo Rüst posted to lcp mju-lib p-matrix uso by lostinmidlands on 2006-11-14 19:26:56 as
	Completely unimodal numberings of a simple polytope [My Copy] Discrete Applied Mathematics, Vol. 20, No. 1. (May 1988), pp. 69-81. by Williamson posted to completely-unimodal mju-lib uso by lostinmidlands on 2006-11-14 19:21:42 as
	Digraph models of Bard-type algorithms for the linear complementarity problem [My Copy] Mathematics of Operations Research, Vol. 3, No. 4. (November 1978), pp. 322-333. by Alan Stickney, Layne Watson posted to lcp mju-lib p-matrix uso by lostinmidlands on 2006-11-14 19:15:48 as
	An algorithm for the general Petri net reachability problem [My Copy] SIAM J. Comput., Vol. 13, No. 3. (August 1984), pp. 441-460. by Ernst W. Mayr posted to algorithm mju-lib petri-nets reachability by lostinmidlands on 2006-11-14 19:10:46 as
	Deciding the winner in parity games is in UP [intersection] co-UP [My Copy] Information Processing Letters, Vol. 68, No. 3. (15 November 1998), pp. 119-124. by Marcin Jurdzinski posted to parity-games up by lostinmidlands on 2006-11-13 23:45:55 as along with 1 person nobody1234
	Games with secure equilibria [My Copy] Theoretical Computer Science In Formal Methods for Components and Objects, Formal Methods for Components and Objects, Vol. 365, No. 1-2. (10 November 2006), pp. 67-82. by Krishnendu Chatterjee, Thomas A. Henzinger, Marcin Jurdzinski posted to game-theory by lostinmidlands on 2006-11-13 23:22:53 as
	Simple Stochastic Games and P-Matrix Generalized Linear Complementarity Problems [My Copy] Lecture Notes in Computer Science : Fundamentals of Computation Theory In Fundamentals of Computation Theory, 15th International Symposium, FCT 2005, Vol. 3623 (2005), pp. 209-220. by Bernd Gärtner, Leo Rüst posted to lcp p-matrix stochastic-games by lostinmidlands on 2006-11-13 22:26:19 as
	LTL with the Freeze Quantifier and Register Automata [My Copy] (5 Oct 2006) by Stephane Demri, Ranko Lazic posted to freeze-quantifier ltl register-automata by lostinmidlands on 2006-11-13 15:30:23 as
	LTL with the Freeze Quantifier and Register Automata [My Copy] In Proceedings of the 21st Annual IEEE Symposium on Logic in Computer Science, LICS'06 (2006), pp. 17-26. by Stephane Demri, Ranko Lazic posted to freeze-quantifier ltl register-automata by lostinmidlands on 2006-11-13 15:20:11 as
	On the complexity of the parity argument and other inefficient proofs of existence [My Copy] J. Comput. Syst. Sci., Vol. 48, No. 3. (June 1994), pp. 498-532. by Christos H. Papadimitriou posted to fixpoint-computation mju-lib ppad search-complexity by lostinmidlands on 2006-11-13 14:35:28 as along with 1 person and 4 groups euclid Algorithms metric_embeddings TCS Polytopes
	How easy is local search? [My Copy] J. Comput. Syst. Sci., Vol. 37, No. 1. (August 1988), pp. 79-100. by David S. Johnson, Christos H. Papadimtriou, Mihalis Yannakakis posted to local-search mju-lib pls search-complexity by lostinmidlands on 2006-11-13 14:17:22 as along with 1 person and 4 groups euclid Algorithms metric_embeddings TCS Polytopes
	A deterministic subexponential algorithm for solving parity games [My Copy] In Proceedings of the 17th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2006 (2006), pp. 117-123. by Marcin Jurdzinski, Mike Paterson, Uri Zwick posted to algorithm parity-games by lostinmidlands on 2006-11-12 11:57:54 as
	A Discrete Strategy Improvement Algorithm for Solving Parity Games [My Copy] In CAV '00: Proceedings of the 12th International Conference on Computer Aided Verification, Vol. 1855 (2000), pp. 202-215. by Jens Vöge, Marcin Jurdzinski posted to algorithm parity-games strategy-improvement by lostinmidlands on 2006-11-12 11:41:22 as
	Quantitative stochastic parity games [My Copy] In Proceedings of the 15th Annual ACM-SIAM Symposium on Discrete Algorithms (2004), pp. 121-130. by Krishnendu Chatterjee, Marcin Jurdzinski, Thomas A. Henzinger posted to parity-games stochastic-games by lostinmidlands on 2006-11-12 11:34:29 as

Note: You may cite this page as: http://www.citeulike.org/user/lostinmidlands

Sort by:
Order:	Default Ascending Descending
Empty fields:	Default First Last

mju-lib	7
mju-ashu	5
timed-automata	5
parity-games	4
game-theory	4
algorithm	3
uso	3
lcp	3
p-matrix	3
timed-implementation	2
stochastic-games	2
register-automata	2
freeze-quantifier	2
hybrid-automata	2
search-complexity	2
ltl	2
fixpoint-computation	1
strategy-improvement	1
ppad	1
up	1
local-search	1
completely-unimodal	1
mju-ranko	1
xpath	1
reachability	1
pls	1
petri-nets	1

lostinmidlands's library 21 articles Export Sort

lostinmidlands's tags