Die bibliographische Datenbank LEABib

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

Suche: Series=LNCS AND Volume=2996

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

Periodicity and unbordered words: A proof of Duval's conjecture
Tero Harju, Dirk Nowotka
Lecture Notes in Computer Science 2996, 2004, pp. 294-304
Desert automata and the finite substitution problem
Daniel Kirsten
Lecture Notes in Computer Science 2996, 2004, pp. 305-316
Satisfiability problems complete for deterministic logarithmic space
Jan Johannsen
Lecture Notes in Computer Science 2996, 2004, pp. 317-325
A logspace approximation scheme for the shortest path problem for graphs with bounded independence number
Till Tantau
Lecture Notes in Computer Science 2996, 2004, pp. 326-337
The minimal logically-defined NP-complete problem
Régis Barbanchon, Etienne Grandjean
Lecture Notes in Computer Science 2996, 2004, pp. 338-349
Solving the 2-disjoint paths problem in nearly linear time
Torsten Tholey
Lecture Notes in Computer Science 2996, 2004, pp. 350-361
Simpler computation of single-source shortest paths in linear average time
Torben Hagerup
Lecture Notes in Computer Science 2996, 2004, pp. 362-369
Lattices with many cycles are dense
Mårten Trolin
Lecture Notes in Computer Science 2996, 2004, pp. 370-381
Automata-based analysis of recursive cryptographic protocols
Ralf Küsters, Thomas Wilke
Lecture Notes in Computer Science 2996, 2004, pp. 382-393
On minimum circular arrangement
Murali K. Ganapathy, Sachin P. Lodha
Lecture Notes in Computer Science 2996, 2004, pp. 394-405
Integral symmetric 2-commodity flows
Aubin Jarry
Lecture Notes in Computer Science 2996, 2004, pp. 406-417
Efficient algorithms for low-energy bounded-hop broadcast in ad-hoc wireless networks
Christoph Ambühl, Andrea E.F. Clementi, Miriam di Ianni, Nissan Lev-Tov, Angelo Monti, David Peleg, Gianluca Rossi, Riccardo Silvestri
Lecture Notes in Computer Science 2996, 2004, pp. 418-427
On the expressiveness of deterministic transducers over infinite trees
Thomas Colcombet, Christof Löding
Lecture Notes in Computer Science 2996, 2004, pp. 428-439
Definability and regularity in automatic structures
Bakhadyr Khoussainov, Sasha Rubin, Frank Stephan
Lecture Notes in Computer Science 2996, 2004, pp. 440-451
Active context-free games
Anca Muscholl, Thomas Schwentick, Luc Segoufin
Lecture Notes in Computer Science 2996, 2004, pp. 452-464
Worst case performance of an approximation algorithm for asymmetric TSP
Anna Palbom
Lecture Notes in Computer Science 2996, 2004, pp. 465-476
On visibility representation of plane graphs
Huaming Zhang, Xin He
Lecture Notes in Computer Science 2996, 2004, pp. 477-488
Topology matters: Smoothed competitiveness of metrical task systems
Guido Schäfer, Naveen Sivadasan
Lecture Notes in Computer Science 2996, 2004, pp. 489-500
A randomized competitive algorithm for evaluating priced AND/OR trees
Eduardo Sany Laber
Lecture Notes in Computer Science 2996, 2004, pp. 501-512
The plurality problem with three colors
Martin Aigner, Gianluca de Marco, Manuela Montangero
Lecture Notes in Computer Science 2996, 2004, pp. 513-521
A measured collapse of the modal mu-calculus alternation hierarchy
Doron Bustan, Orna Kupferman, Moshe Y. Vardi
Lecture Notes in Computer Science 2996, 2004, pp. 522-533
An information theoretic lower bound for broadcasting in radio networks
Carlos Brito, Eli Gafni, Shailesh Vaya
Lecture Notes in Computer Science 2996, 2004, pp. 534-546
A new model for selfish routing
Thomas Lücking, Marios Mavronicolas, Burkhard Monien, Manuel Rode
Lecture Notes in Computer Science 2996, 2004, pp. 547-558
Broadcast in the rendezvous model
Philippe Duchon, Nicolas Hanusse, Nasser Saheb, Akka Zemmari
Lecture Notes in Computer Science 2996, 2004, pp. 559-570
Time-space tradeoff in derandomizing probabilistic logspace
Jin-Yi Cai, Venkatesan T. Chakaravarthy, Dieter van Melkebeek
Lecture Notes in Computer Science 2996, 2004, pp. 571-583

Seiten < 1 2 3 >