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

Suche: Series=LNCS AND Volume=2380

• A spatial logic for querying graphs
  Luca Cardelli, Philippa Gardner, Giorgio Ghelli
  Lecture Notes in Computer Science 2380, 2002, pp. 597-610
• Improving time bounds on maximum generalised flow computations by contracting the network
  Tomasz Radzik
  Lecture Notes in Computer Science 2380, 2002, pp. 611-622
• Approximation hardness of bounded degree MIN-CSP and MIN-BISECTION
  Piotr Berman, Marek Karpinski
  Lecture Notes in Computer Science 2380, 2002, pp. 623-632
• Improved bounds and new trade-offs for dynamic all pairs shortest paths
  Camil Demetrescu, Giuseppe F. Italiano
  Lecture Notes in Computer Science 2380, 2002, pp. 633-643
• Synthesis of uninitialized systems
  Thomas A. Henzinger, Sriram C. Krishnan, Orna Kupferman, Freddy Y.C. Mang
  Lecture Notes in Computer Science 2380, 2002, pp. 644-656
• Infinite-state high-level MSCs: Model-checking and realizability
  Blaise Genest, Anca Muscholl, Helmut Seidl, Marc Zeitoun
  Lecture Notes in Computer Science 2380, 2002, pp. 657-668
• Universal inherence of cycle-free context-free ambiguity functions
  Klaus Wich
  Lecture Notes in Computer Science 2380, 2002, pp. 669-680
• Histogramming data streams with fast per-item processing
  Sudipto Guha, Piotr Indyk, S. Muthukrishnan, Martin J. Strauss
  Lecture Notes in Computer Science 2380, 2002, pp. 681-692
• Finding frequent items in data streams
  Moses Charikar, Kevin Chen, Martin Farach-Colton
  Lecture Notes in Computer Science 2380, 2002, pp. 693-703
• Symbolic strategy synthesis for games on pushdown graphs
  Thierry Cachat
  Lecture Notes in Computer Science 2380, 2002, pp. 704-715
• Strong bisimilarity and regularity of basic process algebra is PSPACE-hard
  Jiȓí Srba
  Lecture Notes in Computer Science 2380, 2002, pp. 716-727
• Solving the string statistics problem in time O(n \log n)
  Gerth Stlting Brodal, Rune B. Lyngs, Anna Östlin, Christian N.S. Pedersen
  Lecture Notes in Computer Science 2380, 2002, pp. 728-739
• A PTAS for distinguishing (sub)string selection
  Xiaotie Deng, Guojun Li, Zimao Li, Bin Ma, Lusheng Wang
  Lecture Notes in Computer Science 2380, 2002, pp. 740-751
• On the theory of one-step rewriting in trace monoids
  Dietrich Kuske, Markus Lohrey
  Lecture Notes in Computer Science 2380, 2002, pp. 752-763
• Navigating with a browser
  Michaƚ Bielecki, Jan Hidders, Jan Paredaens, Jerzy Tyszkiewicz, Jan Van den Bussche
  Lecture Notes in Computer Science 2380, 2002, pp. 764-775
• Improved results for Stackelberg scheduling strategies
  V.S. Anil Kumar, Madhav V. Marathe
  Lecture Notes in Computer Science 2380, 2002, pp. 776-787
• Call control in rings
  Udo Adamy, Christoph Ambuehl, R. Sai Anand, Thomas Erlebach
  Lecture Notes in Computer Science 2380, 2002, pp. 788-799
• Preemptive scheduling in overloaded systems
  Marek Chrobak, Leah Epstein, John Noga, Jiȓí Sgall, Rob van Stee, Tomás Tichý, Nodari Vakhania
  Lecture Notes in Computer Science 2380, 2002, pp. 800-811
• The equivalence problem of finite substitutions on ab*c, with applications
  J. Karhumäki, L.P. Lisovik
  Lecture Notes in Computer Science 2380, 2002, pp. 812-820
• Deciding DPDA equivalence is primitive recursive
  Colin Stirling
  Lecture Notes in Computer Science 2380, 2002, pp. 821-832
• Two-way alternating automata and finite models
  Mikoƚaj Bojanćzyk
  Lecture Notes in Computer Science 2380, 2002, pp. 833-844
• Approximating Huffman codes in parallel
  Piotr Berman, Marek Karpinski, Yakov Nekrich
  Lecture Notes in Computer Science 2380, 2002, pp. 845-855
• Seamless integration of parallelism and memory hierarchy
  Carlo Fantozzi, Andrea Pietracaprina, Geppino Pucci
  Lecture Notes in Computer Science 2380, 2002, pp. 856-867
• The communication complexity of approximate set packing and covering
  Noam Nisan
  Lecture Notes in Computer Science 2380, 2002, pp. 868-875
• Antirandomizing the wrong game
  Benjamin Doerr
  Lecture Notes in Computer Science 2380, 2002, pp. 876-887