Die bibliographische Datenbank LEABib

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

Suche: Series=LNCS AND Volume=2556

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

Primality testing with Gaussian periods
H.W., Jr. Lenstra
Lecture Notes in Computer Science 2556, 2002, pp. 1-1
From Hilbert spaces to Dilbert spaces: Context semantics made simple
Harry G. Mairson
Lecture Notes in Computer Science 2556, 2002, pp. 2-17
Encoding generic judgments
Dale Miller, Alwen Tiu
Lecture Notes in Computer Science 2556, 2002, pp. 18-32
Model checking Algol-like languages using game semantics
C.-H.L. Ong
Lecture Notes in Computer Science 2556, 2002, pp. 33-36
Modeling software: From theory to practice
Margus Veanes
Lecture Notes in Computer Science 2556, 2002, pp. 37-46
Local normal forms for logics over traces
Bharat Adsul, Milind Sohoni
Lecture Notes in Computer Science 2556, 2002, pp. 47-58
On the hardness of constructing minimal 2-connected spanning subgraphs in complete graphs with sharpened triangle inequality
Hans-Joachim Böckenhauer, Dirk Bongartz, Juraj Hromkovic̑, Ralf Klasing, Guido Proietti, Sebastian Seibert, Walter Unger
Lecture Notes in Computer Science 2556, 2002, pp. 59-70
Communication interference in mobile boxed ambients
Michele Bugliesi, Silvia Crafa, Massimo Merro, Vladimiro Sassone
Lecture Notes in Computer Science 2556, 2002, pp. 71-84
The seal calculus revisited: Contextual equivalence and bisimilarity
Giuseppe Castagna, Francesco Zappa Nardelli
Lecture Notes in Computer Science 2556, 2002, pp. 85-96
Composing strand spaces
Federico Crazzolara, Glynn Winskel
Lecture Notes in Computer Science 2556, 2002, pp. 97-108
Generalising automaticity to modal properties of finite structures
A. Dawar, S. Kreutzer
Lecture Notes in Computer Science 2556, 2002, pp. 109-120
An automata-theoretic approach to constraint LTL
Stéphane Demri, Deepak D'Souza
Lecture Notes in Computer Science 2556, 2002, pp. 121-132
Hardness results for multicast cost sharing
Joan Feigenbaum, Arvind Krishnamurthy, Rahul Sami, Scott Shenker
Lecture Notes in Computer Science 2556, 2002, pp. 133-144
How to compose Presburger-accelerations: Applications to broadcast protocols
Alain Finkel, Jérôme Leroux
Lecture Notes in Computer Science 2556, 2002, pp. 145-156
State space reductions for alternating Büchi automata - Quotienting by simulation equivalences
Carsten Fritz, Thomas Wilke
Lecture Notes in Computer Science 2556, 2002, pp. 157-168
Algorithmic combinatorics based on slicing posets
Vijay K. Garg
Lecture Notes in Computer Science 2556, 2002, pp. 169-181
Pattern matching for arc-annotated sequences
Jens Gramm, Jiong Guo, Rolf Niedermeier
Lecture Notes in Computer Science 2556, 2002, pp. 182-193
Knowledge over dense flows of time (from a hybrid point of view)
Bernhard Heinemann
Lecture Notes in Computer Science 2556, 2002, pp. 194-205
The complexity of the inertia
Thanh Minh Hoang, Thomas Thierauf
Lecture Notes in Computer Science 2556, 2002, pp. 206-217
The quantum communication complexity of the pointer chasing problem: The bit version
Rahul Jain, Jaikumar Radhakrishnan, Pranab Sen
Lecture Notes in Computer Science 2556, 2002, pp. 218-229
The decidability of the first-order theory of the Knuth-Bendix order in the case of unary signatures
Konstantin Korovin, Andrei Voronkov
Lecture Notes in Computer Science 2556, 2002, pp. 230-240
Deciding the first level of the \mu-calculus alternation hierarchy
Ralf Küsters, Thomas Wilke
Lecture Notes in Computer Science 2556, 2002, pp. 241-252
Dynamic message sequence charts
Martin Leucker, P. Madhusudan, Supratik Mukhopadhyay
Lecture Notes in Computer Science 2556, 2002, pp. 253-264
The complexity of compositions of deterministic tree transducers
Sebastian Maneth
Lecture Notes in Computer Science 2556, 2002, pp. 265-276
On the hardness of approximating minimum monopoly problems
S. Mishra, J. Radhakrishnan, S. Sivasubramanian
Lecture Notes in Computer Science 2556, 2002, pp. 277-288

Seiten 1 2 >