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 YEAR=2003

• Adversarial models for priority-based networks
  C. Àlvarez, M. Blesa, J. Díaz, A. Fernández, M. Serna
  Lecture Notes in Computer Science 2747, 2003, pp. 142-151
• On optimal merging networks
  Kazuyuki Amano, Akira Maruoka
  Lecture Notes in Computer Science 2747, 2003, pp. 152-161
• Problems which cannot be reduced to any proper subproblems
  Klaus Ambos-Spies
  Lecture Notes in Computer Science 2747, 2003, pp. 162-168
• ACID-unification is NEXPTIME-decidable
  Siva Anantharaman, Paliath Narendran, Michael Rusinowitch
  Lecture Notes in Computer Science 2747, 2003, pp. 169-178
• Completeness in differential approximation classes
  G. Ausiello, C. Bazgan, M. Demange, V.Th. Paschos
  Lecture Notes in Computer Science 2747, 2003, pp. 179-188
• On the length of the minimum solution of word equations in one variable
  Kensuke Baba, Satoshi Tsuruta, Ayumi Shinohara, Masayuki Takeda
  Lecture Notes in Computer Science 2747, 2003, pp. 189-197
• Smoothed analysis of three combinatorial problems
  Cyril Banderier, René Beier, Kurt Mehlhorn
  Lecture Notes in Computer Science 2747, 2003, pp. 198-207
• Inferring strings from graphs and arrays
  Hideo Bannai, Shunsuke Inenaga, Ayumi Shinohara, Masayuki Takeda
  Lecture Notes in Computer Science 2747, 2003, pp. 208-217
• Faster algorithms for k-medians in trees
  Robert Benkoczi, Binay Bhattacharya, Marek Chrobak, Lawrence L. Larmore, Wojciech Rytter
  Lecture Notes in Computer Science 2747, 2003, pp. 218-227
• Periodicity and transitivity for cellular automata in Besicovitch topologies
  F. Blanchard, J. Cervelle, E. Formenti
  Lecture Notes in Computer Science 2747, 2003, pp. 228-238
• Starting with nondeterminism: The systematic derivation of linear-time graph layout algorithms
  Hans L. Bodlaender, Michael R. Fellows, Dimitrios M. Thilikos
  Lecture Notes in Computer Science 2747, 2003, pp. 239-248
• Error-bounded probabilistic computations between MA and AM
  Elmar Böhler, Christian Glaßer, Daniel Meister
  Lecture Notes in Computer Science 2747, 2003, pp. 249-258
• A faster FPT algorithm for finding spanning trees with many leaves
  Paul S. Bonsma, Tobias Brueggemann, Gerhard J. Woeginger
  Lecture Notes in Computer Science 2747, 2003, pp. 259-268
• Symbolic analysis of crypto-protocols based on modular exponentiation
  Michele Boreale, Maria Grazia Buscemi
  Lecture Notes in Computer Science 2747, 2003, pp. 269-278
• Denotational testing semantics in coinductive form
  Michele Boreale, Fabio Gadducci
  Lecture Notes in Computer Science 2747, 2003, pp. 279-289
• Lower bounds for general graph-driven read-once parity branching programs
  Henrik Brosenne, Matthias Homeister, Stephan Waack
  Lecture Notes in Computer Science 2747, 2003, pp. 290-299
• The minimal graph model of lambda calculus
  Antonio Bucciarelli, Antonino Salibra
  Lecture Notes in Computer Science 2747, 2003, pp. 300-307
• Unambiguous automata on bi-infinite words
  Olivier Carton
  Lecture Notes in Computer Science 2747, 2003, pp. 308-317
• Relating hierarchy of temporal properties to model checking
  Ivana C̑erná, Radek Pelánek
  Lecture Notes in Computer Science 2747, 2003, pp. 318-327
• Arithmetic constant-depth circuit complexity classes
  Hubie Chen
  Lecture Notes in Computer Science 2747, 2003, pp. 328-337
• Inverse NP problems
  Hubie Chen
  Lecture Notes in Computer Science 2747, 2003, pp. 338-347
• A linear-time algorithm for 7-coloring 1-planar graphs
  Zhi-Zhong Chen, Mitsuharu Kouno
  Lecture Notes in Computer Science 2747, 2003, pp. 348-357
• Generalized satisfiability with limited occurrences per variable: A study through delta-matroid parity
  Victor Dalmau, Daniel K. Ford
  Lecture Notes in Computer Science 2747, 2003, pp. 358-367
• Randomized algorithms for determining the majority on graphs
  Gianluca De Marco, Andrzej Pelc
  Lecture Notes in Computer Science 2747, 2003, pp. 368-377
• Using transitive-closure logic for deciding linear properties of monoids
  Christian Delhommé, Teodor Knapik, D. Gnanaraj Thomas
  Lecture Notes in Computer Science 2747, 2003, pp. 378-387