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

• Global development via local observational construction steps
  Michel Bidoit, Donald Sannella, Andrzej Tarlecki
  Lecture Notes in Computer Science 2420, 2002, pp. 1-24
• Edge-colouring pairs of binary trees: Towards a concise proof of the four-colour theorem of planar maps
  Alan Gibbons, Paul Sant
  Lecture Notes in Computer Science 2420, 2002, pp. 25-39
• Applications of finite automata
  Juhani Karhumäki
  Lecture Notes in Computer Science 2420, 2002, pp. 40-58
• Approximability of the minimum bisection problem: An algorithmic challenge
  Marek Karpinski
  Lecture Notes in Computer Science 2420, 2002, pp. 59-67
• Low stretch spanning trees
  David Peleg
  Lecture Notes in Computer Science 2420, 2002, pp. 68-80
• On radiocoloring hierarchically specified planar graphs: PSPACE-completeness and approximations
  Maria I. Andreou, Dimitris A. Fotakis, Sotiris E. Nikoletseas, Vicky G. Papadopoulou, Paul G. Spirakis
  Lecture Notes in Computer Science 2420, 2002, pp. 81-92
• Finite domain constraint satisfaction using quantum computation
  Ola Angelsmark, Vilhelm Dahllöf, Peter Jonsson
  Lecture Notes in Computer Science 2420, 2002, pp. 93-103
• Fast algorithms with algebraic Monge properties
  Wolfgang W. Bein, Peter Brucker, Lawrence L. Larmore, James K. Park
  Lecture Notes in Computer Science 2420, 2002, pp. 104-117
• Packing edges in random regular graphs
  Mihalis Beis, William Duckworth, Michele Zito
  Lecture Notes in Computer Science 2420, 2002, pp. 118-130
• A lower bound technique for nondeterministic graph-driven read-once-branching programs and its applications
  Beate Bollig, Philipp Woelfel
  Lecture Notes in Computer Science 2420, 2002, pp. 131-142
• Matroid intersections, polymatroid inequalities, and related problems
  Endre Boros, Khaled Elbassioni, Vladimir Gurvich, Leonid Khachiyan
  Lecture Notes in Computer Science 2420, 2002, pp. 143-154
• Accessibility in automata on scattered linear orderings
  Olivier Carton
  Lecture Notes in Computer Science 2420, 2002, pp. 155-164
• On infinite terms having a decidable monadic theory
  Didier Caucal
  Lecture Notes in Computer Science 2420, 2002, pp. 165-176
• A Chomsky-like hierarchy of infinite graphs
  Didier Caucal, Teodor Knapik
  Lecture Notes in Computer Science 2420, 2002, pp. 177-187
• Competitive analysis of on-line stream merging algorithms
  Wun-Tat Chan, Tak-Wah Lam, Hing-Fung Ting, Prudence W.H. Wong
  Lecture Notes in Computer Science 2420, 2002, pp. 188-200
• Coloring k-colorable semirandom graphs in polynomial expected time via semidefinite programming
  Amin Coja-Oghlan
  Lecture Notes in Computer Science 2420, 2002, pp. 201-211
• On word equations in one variable
  Robert Da̧browski, Wojtek Plandowski
  Lecture Notes in Computer Science 2420, 2002, pp. 212-220
• Autoreducibility of random sets: A sharp bound on the density of guessed bits
  Todd Ebert, Wolfgang Merkle
  Lecture Notes in Computer Science 2420, 2002, pp. 221-233
• Two-way finite state transducers with nested pebbles
  Joost Engelfriet, Sebastian Maneth
  Lecture Notes in Computer Science 2420, 2002, pp. 234-244
• Optimal non-preemptive semi-online scheduling on two related machines
  Leah Epstein, Lene M. Favrholdt
  Lecture Notes in Computer Science 2420, 2002, pp. 245-256
• More on weighted servers or FIFO is better than LRU
  Leah Epstein, Csanád Imreh, Rob van Stee
  Lecture Notes in Computer Science 2420, 2002, pp. 257-268
• On maximizing the throughput of multiprocessor tasks
  Aleksei V. Fishkin, Guochuan Zhang
  Lecture Notes in Computer Science 2420, 2002, pp. 269-279
• Some results on random unsatisfiable k-sat instances and approximation algorithms applied to random structures
  Andreas Goerdt, Tomasz Jurdziński
  Lecture Notes in Computer Science 2420, 2002, pp. 280-291
• Evolutive tandem repeats using Hamming distance
  Richard Groult, Martine Léonard, Laurent Mouchard
  Lecture Notes in Computer Science 2420, 2002, pp. 292-304
• Subgraph isomorphism, \log -bounded fragmentation and graphs of (locally) bounded treewidth
  MohammadTaghi Hajiaghayi, Naomi Nishimura
  Lecture Notes in Computer Science 2420, 2002, pp. 305-318