Fakultät für Informatik - Technische Universität München Lehrstuhl für Effiziente Algorithmen

Die bibliographische Datenbank LEABib

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

Suche: Series=LNCS AND Volume=2076

• Recognizing more unsatisfiable random 3-SAT instances efficiently
  Joel Friedman, Andreas Goerdt
  Lecture Notes in Computer Science 2076, 2001, pp. 310-321
• Weisfeiler-Lehman refinement requires at least a linear number of iterations
  Martin Fürer
  Lecture Notes in Computer Science 2076, 2001, pp. 322-333
• On interactive proofs with a laconic prover
  Oded Goldreich, Salil Vadhan, Avi Wigderson
  Lecture Notes in Computer Science 2076, 2001, pp. 334-345
• Quantum complexities of ordered searching, sorting, and element distinctness
  Peter Hyer, Jan Neerbek, Yaoyun Shi
  Lecture Notes in Computer Science 2076, 2001, pp. 346-357
• Lower bounds in the quantum cell probe model
  Pranab Sen, S. Venkatesh
  Lecture Notes in Computer Science 2076, 2001, pp. 358-369
• Axiomatizations for probabilistic bisimulation
  Emanuele Bandini, Roberto Segala
  Lecture Notes in Computer Science 2076, 2001, pp. 370-381
• Noninterference for concurrent programs
  Gérard Boudol, Ilaria Castellani
  Lecture Notes in Computer Science 2076, 2001, pp. 382-395
• Distributed controller synthesis for local specifications
  P. Madhusudan, P.S. Thiagarajan
  Lecture Notes in Computer Science 2076, 2001, pp. 396-407
• A distributed abstract machine for safe ambients
  Davide Sangiorgi, Andrea Valente
  Lecture Notes in Computer Science 2076, 2001, pp. 408-420
• Towards quantitative verification of probabilistic transition systems
  Franck van Breugel, James Worrell
  Lecture Notes in Computer Science 2076, 2001, pp. 421-432
• Efficient generation of plane triangulations without repetitions
  Zhangjian Li, Shin-ichi Nakano
  Lecture Notes in Computer Science 2076, 2001, pp. 433-443
• The longest common subsequence problem for sequences with nested arc annotations
  Guo-Hui Lin, Zhi-Zhong Chen, Tao Jiang, Jianjun Wen
  Lecture Notes in Computer Science 2076, 2001, pp. 444-455
• Visibility-based pursuit-evasion in a polygonal region by a searcher
  Sang-Min Park, Jae-Ha Lee, Kyung-Yong Chwa
  Lecture Notes in Computer Science 2076, 2001, pp. 456-468
• A new method for balancing binary search trees
  Salvador Roura
  Lecture Notes in Computer Science 2076, 2001, pp. 469-480
• Permutation editing and matching via embeddings
  Graham Cormode, S. Muthukrishnan, Süleyman Cenk Ṣahinalp
  Lecture Notes in Computer Science 2076, 2001, pp. 481-492
• Testing hypergraph coloring
  Artur Czumaj, Christian Sohler
  Lecture Notes in Computer Science 2076, 2001, pp. 493-505
• Total colorings of degenerated graphs
  Shuji Isobe, Xiao Zhou, Takao Nishizeki
  Lecture Notes in Computer Science 2076, 2001, pp. 506-517
• Decidable properties of graphs of all-optical networks
  Luciano Margara, Janos Simon
  Lecture Notes in Computer Science 2076, 2001, pp. 518-529
• Majority consensus and the local majority rule
  Nabil H. Mustafa, Aleksandar Pekec̑
  Lecture Notes in Computer Science 2076, 2001, pp. 530-542
• Solvability of equations in free partially commutative groups is decidable
  Volker Diekert, Anca Muscholl
  Lecture Notes in Computer Science 2076, 2001, pp. 543-554
• Rational transformations of formal power series
  Manfred Droste, Guo-Qiang Zhang
  Lecture Notes in Computer Science 2076, 2001, pp. 555-566
• Combinatorics of three-interval exchanges
  Sébastien Ferenczi, Charles Holton, Luca Q. Zamboni
  Lecture Notes in Computer Science 2076, 2001, pp. 567-578
• Decision questions concerning semilinearity, morphisms, and commutation of languages
  Tero Harju, Oscar Ibarra, Juhani Karhumäki, Arto Salomaa
  Lecture Notes in Computer Science 2076, 2001, pp. 579-590
• The star problem in trace monoids: Reductions beyond C4
  Daniel Kirsten
  Lecture Notes in Computer Science 2076, 2001, pp. 591-602
• The trace coding problem is undecidable
  Michal Kunc
  Lecture Notes in Computer Science 2076, 2001, pp. 603-614