Die bibliographische Datenbank LEABib

Suchen • Liste der Journale • Liste der Serien • Liste der Konferenzen • Ausgewählte Publikationen	Hilfe

Suche: Series=LNCS AND Volume=3821

Als [bib] [pdf] [ps] [dvi] [xml] herunterladen.

Semiperfect-information games
Krishnendu Chatterjee, Thomas Henzinger
Lecture Notes in Computer Science 3821, 2005, pp. 1-18
Computational complexity since 1980
Russell Impagliazzo
Lecture Notes in Computer Science 3821, 2005, pp. 19-47
Developments in data structure research during the first 25 years of FSTTCS
Raimund Seidel
Lecture Notes in Computer Science 3821, 2005, pp. 48-59
Inference systems for logical algorithms
Natarajan Shankar
Lecture Notes in Computer Science 3821, 2005, pp. 60-78
From logic to games
Igor Walukiewicz
Lecture Notes in Computer Science 3821, 2005, pp. 79-91
Proving lower bounds via pseudo-random generators
Manindra Agrawal
Lecture Notes in Computer Science 3821, 2005, pp. 92-105
Erdŏs magic
Joel Spencer
Lecture Notes in Computer Science 3821, 2005, pp. 106-106
No coreset, no cry: II
Michael Edwards, Kasturi Varadarajan
Lecture Notes in Computer Science 3821, 2005, pp. 107-115
Improved bounds on the union complexity of fat objects
Mark de Berg
Lecture Notes in Computer Science 3821, 2005, pp. 116-127
On the bisimulation congruence in \chi-calculus
Taolue Chen, Tingting Han, Jian Lu
Lecture Notes in Computer Science 3821, 2005, pp. 128-139
Extending Howe's method to early bisimulations for typed mobile embedded resources with local names
Jens Chr. Godskesen, Thomas Hildebrandt
Lecture Notes in Computer Science 3821, 2005, pp. 140-151
Approximation algorithms for wavelength assignment
Vijay Kumar, Atri Rudra
Lecture Notes in Computer Science 3821, 2005, pp. 152-163
The set cover with pairs problem
Refael Hassin, Danny Segev
Lecture Notes in Computer Science 3821, 2005, pp. 164-176
Non-disclosure for distributed mobile code
Ana Almeida Matos
Lecture Notes in Computer Science 3821, 2005, pp. 177-188
Quantitative models and implicit complexity
Ugo Dal Lago, Martin Hofmann
Lecture Notes in Computer Science 3821, 2005, pp. 189-200
The MSO theory of connectedly communicating processes
P. Madhusudan, P.S. Thiagarajan, Shaofa Yang
Lecture Notes in Computer Science 3821, 2005, pp. 201-212
Reachability of Hennessy-Milner properties for weakly extended PRS
Mojmír Kȓetínský, Vojtȇch Ȓehák, Jan Strejc̑ek
Lecture Notes in Computer Science 3821, 2005, pp. 213-224
Decision procedures for queues with integer constraints
Ting Zhang, Henny B. Sipma, Zohar Manna
Lecture Notes in Computer Science 3821, 2005, pp. 225-237
The directed planar reachability problem
Eric Allender, Samir Datta, Sambuddha Roy
Lecture Notes in Computer Science 3821, 2005, pp. 238-249
Dimensions of Copeland-Erdŏs sequences
Xiaoyang Gu, Jack Lutz, Philippe Moser
Lecture Notes in Computer Science 3821, 2005, pp. 250-260
Refining the undecidability frontier of hybrid automata
Venkatesh Mysore, Amir Pnueli
Lecture Notes in Computer Science 3821, 2005, pp. 261-272
When are timed automata weakly timed bisimilar to time Petri nets?
Beatrice Bérard, Franck Cassez, Serge Haddad, Didier Lime, Olivier Roux
Lecture Notes in Computer Science 3821, 2005, pp. 273-284
Subquadratic algorithms for workload-aware Haar wavelet synopses
S. Muthukrishnan
Lecture Notes in Computer Science 3821, 2005, pp. 285-296
Practical algorithms for tracking database join sizes
Sumit Ganguly, Deepanjan Kesh, Chandan Saha
Lecture Notes in Computer Science 3821, 2005, pp. 297-309
On sampled semantics of timed systems
Pavel Krc̑ál, Radek Pelánek
Lecture Notes in Computer Science 3821, 2005, pp. 310-321

Seiten 1 2 >