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=1770

• Codes and graphs
  M. Amin Shokrollahi
  Lecture Notes in Computer Science 1770, 2000, pp. 1-12
• A classification of symbolic transition systems
  Thomas A. Henzinger, Rupak Majumdar
  Lecture Notes in Computer Science 1770, 2000, pp. 13-34
• Circuits versus trees in algebraic complexity
  Pascal Koiran
  Lecture Notes in Computer Science 1770, 2000, pp. 35-52
• On the many faces of block codes
  Kaustubh Deshmukh, Priti Shankar, Amitava Dasgupta, B. Sundar Rajan
  Lecture Notes in Computer Science 1770, 2000, pp. 53-64
• A new algorithm for MAX-2-SAT
  Edward A. Hirsch
  Lecture Notes in Computer Science 1770, 2000, pp. 65-73
• Bias invariance of small upper spans
  Jack H. Lutz, Martin J. Strauss
  Lecture Notes in Computer Science 1770, 2000, pp. 74-86
• The complexity of planarity testing
  Eric Allender, Meena Mahajan
  Lecture Notes in Computer Science 1770, 2000, pp. 87-98
• About cube-free morphisms
  Gwénaël Richomme, Francis Wlazinski
  Lecture Notes in Computer Science 1770, 2000, pp. 99-109
• Linear cellular automata with multiple state variables
  Jarkko Kari
  Lecture Notes in Computer Science 1770, 2000, pp. 110-121
• Two-variable word equations
  Lucian Ilie, Wojciech Plandowski
  Lecture Notes in Computer Science 1770, 2000, pp. 122-132
• Average-case quantum query complexity
  Andris Ambainis, Ronald de Wolf
  Lecture Notes in Computer Science 1770, 2000, pp. 133-144
• Tradeoffs between nondeterminism and complexity for communication protocols and branching programs
  Juraj Hromkovic̑, Martin Sauerhoff
  Lecture Notes in Computer Science 1770, 2000, pp. 145-156
• The Boolean hierarchy of NP-partitions
  Sven Kosub, Klaus W. Wagner
  Lecture Notes in Computer Science 1770, 2000, pp. 157-168
• Binary exponential backoff is stable for high arrival rates
  Hesham Al-Ammal, Leslie Ann Goldberg, Phil Mackenzie
  Lecture Notes in Computer Science 1770, 2000, pp. 169-180
• The data broadcast problem with preemption
  Nicolas Schabanel
  Lecture Notes in Computer Science 1770, 2000, pp. 181-192
• An approximate \L^p-difference algorithm for massive data streams
  Jessica H. Fong, Martin J. Strauss
  Lecture Notes in Computer Science 1770, 2000, pp. 193-204
• Succinct representations of model based belief revision
  Paolo Penna
  Lecture Notes in Computer Science 1770, 2000, pp. 205-216
• Logics capturing local properties
  Leonid Libkin
  Lecture Notes in Computer Science 1770, 2000, pp. 217-229
• The complexity of poor man's logic
  Edith Hemaspaandra
  Lecture Notes in Computer Science 1770, 2000, pp. 230-241
• Fast integer sorting in linear space
  Yijie Han
  Lecture Notes in Computer Science 1770, 2000, pp. 242-253
• On the performance of WEAK-HEAPSORT
  Stefan Edelkamp, Ingo Wegener
  Lecture Notes in Computer Science 1770, 2000, pp. 254-266
• On the two-variable fragment of the equational theory of the Max-Sum algebra of the natural numbers
  Luca Aceto, Zoltán Ésik, Anna Ingólfsdóttir
  Lecture Notes in Computer Science 1770, 2000, pp. 267-278
• Real-time automata and the Kleene algebra of sets of real numbers
  Cătalin Dima
  Lecture Notes in Computer Science 1770, 2000, pp. 279-289
• Small progress measures for solving parity games
  Marcin Jurdziński
  Lecture Notes in Computer Science 1770, 2000, pp. 290-301
• Multi-linearity self-testing with relative error
  Frédéric Magniez
  Lecture Notes in Computer Science 1770, 2000, pp. 302-313