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 [1]	Hilfe

Suche: Series=LNCS AND Volume=1373

• Random graphs, random walks, differential equations and the probabilistic analysis of algorithms
  Richard M. Karp
  Lecture Notes in Computer Science 1373, 1998, pp. 1-2
• Distributed online frequency assignment in cellular networks
  Jeanette Janssen, Danny Krizanc, Lata Narayanan, Sunil Shende
  Lecture Notes in Computer Science 1373, 1998, pp. 3-13
• Floats, integers, and single source shortest paths
  Mikkel Thorup
  Lecture Notes in Computer Science 1373, 1998, pp. 14-24
• A synthesis on partition refinement: A useful routine for strings, graphs, Boolean matrices and automata
  Michel Habib, Christophe Paul, Laurent Viennot
  Lecture Notes in Computer Science 1373, 1998, pp. 25-38
• Simplifying the modal Mu-calculus alternation hierarchy
  J.C. Bradfield
  Lecture Notes in Computer Science 1373, 1998, pp. 39-49
• On disguised double Horn functions and extensions
  Thomas Eiter, Toshihide Ibaraki, Kazuhisa Makino
  Lecture Notes in Computer Science 1373, 1998, pp. 50-60
• The complexity of propositional linear temporal logics in simple cases
  S. Demri, Ph. Schnoebelen
  Lecture Notes in Computer Science 1373, 1998, pp. 61-72
• Searching constant width mazes captures the AC^0 hierarchy
  David A. Mix Barrington, Chi-Jen Lu, Peter Bro Miltersen, Sven Skyum
  Lecture Notes in Computer Science 1373, 1998, pp. 73-83
• Nearly optimal language compression using extractors
  Lance Fortnow, Sophie Laplante
  Lecture Notes in Computer Science 1373, 1998, pp. 84-93
• Random sparse bit strings at the threshold of adjacency
  Joel H. Spencer, Katherine St. John
  Lecture Notes in Computer Science 1373, 1998, pp. 94-104
• Lower bounds for randomized read-k-times branching programs
  Martin Sauerhoff
  Lecture Notes in Computer Science 1373, 1998, pp. 105-115
• Inducing an order on cellular automata by a grouping operation
  Jacques Mazoyer, Ivan Rapaport
  Lecture Notes in Computer Science 1373, 1998, pp. 116-127
• Attractors of D-dimensional linear cellular automata
  Giovanni Manzini, Luciano Margara
  Lecture Notes in Computer Science 1373, 1998, pp. 128-138
• Optimal simulations between unary automata
  Carlo Mereghetti, Giovanni Pighizzini
  Lecture Notes in Computer Science 1373, 1998, pp. 139-149
• Shuffle of \omega-words: Algebraic aspects
  Alexandru Mateescu
  Lecture Notes in Computer Science 1373, 1998, pp. 150-160
• A generalization of resource-bounded measure, with an application
  Harry Buhrman, Dieter van Melkebeek, Kenneth W. Regan, D. Sivakumar, Martin Strauss
  Lecture Notes in Computer Science 1373, 1998, pp. 161-171
• The complexity of modular graph automorphism
  V. Arvind, R. Beigel, A. Lozano
  Lecture Notes in Computer Science 1373, 1998, pp. 172-182
• Unary quantifiers, transitive closure, and relations of large degree
  Leonid Libkin, Limsoon Wong
  Lecture Notes in Computer Science 1373, 1998, pp. 183-193
• On the structure of Valiant's complexity classes
  Peter Bürgisser
  Lecture Notes in Computer Science 1373, 1998, pp. 194-204
• On the existence of polynomial time approximation schemes for OBDD minimization
  Detlef Sieling
  Lecture Notes in Computer Science 1373, 1998, pp. 205-215
• Complexity of problems on graphs represented as OBDDs
  J. Feigenbaum, S. Kannan, M.Y. Vardi, M. Viswanathan
  Lecture Notes in Computer Science 1373, 1998, pp. 216-226
• Equivalence test and ordering transformation for parity-OBDDs of different variable ordering
  Jan Behrens, Stephan Waack
  Lecture Notes in Computer Science 1373, 1998, pp. 227-237
• Size and structure of random ordered binary decision diagrams
  Clemens Gröpl, Hans Jürgen Prömel, Anand Srivastav
  Lecture Notes in Computer Science 1373, 1998, pp. 238-248
• Provable security for block ciphers by decorrelation
  Serge Vaudenay
  Lecture Notes in Computer Science 1373, 1998, pp. 249-275
• On the approximation of finding a(nother) Hamiltonian cycle in cubic Hamiltonian graphs
  Cristina Bazgan, Miklos Santha, Zsolt Tuza
  Lecture Notes in Computer Science 1373, 1998, pp. 276-286