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

• Weisfeiler-Lehman refinement requires at least a linear number of iterations
  Martin Fürer
  Lecture Notes in Computer Science 2076, 2001, pp. 322-333
• Axiomatizations for probabilistic bisimulation
  Emanuele Bandini, Roberto Segala
  Lecture Notes in Computer Science 2076, 2001, pp. 370-381
• Noninterference for concurrent programs
  Gérard Boudol, Ilaria Castellani
  Lecture Notes in Computer Science 2076, 2001, pp. 382-395
• Permutation editing and matching via embeddings
  Graham Cormode, S. Muthukrishnan, Süleyman Cenk Ṣahinalp
  Lecture Notes in Computer Science 2076, 2001, pp. 481-492
• Testing hypergraph coloring
  Artur Czumaj, Christian Sohler
  Lecture Notes in Computer Science 2076, 2001, pp. 493-505
• Solvability of equations in free partially commutative groups is decidable
  Volker Diekert, Anca Muscholl
  Lecture Notes in Computer Science 2076, 2001, pp. 543-554
• Rational transformations of formal power series
  Manfred Droste, Guo-Qiang Zhang
  Lecture Notes in Computer Science 2076, 2001, pp. 555-566
• Combinatorics of three-interval exchanges
  Sébastien Ferenczi, Charles Holton, Luca Q. Zamboni
  Lecture Notes in Computer Science 2076, 2001, pp. 567-578
• Effective lossy queue languages
  Parosh Aziz Abdulla, Luc Boasson, Ahmed Bouajjani
  Lecture Notes in Computer Science 2076, 2001, pp. 639-651
• Model checking of unrestricted hierarchical state machines
  Michael Benedikt, Patrice Godefroid, Thomas Reps
  Lecture Notes in Computer Science 2076, 2001, pp. 652-666
• Symbolic trace analysis of cryptographic protocols
  Michele Boreale
  Lecture Notes in Computer Science 2076, 2001, pp. 667-681
• Tree automata with one memory, set constraints, and ping-pong protocols
  Hubert Comon, Véronique Cortier, John Mitchell
  Lecture Notes in Computer Science 2076, 2001, pp. 682-693
• Fair simulation relations, parity games, and state space reduction for Büchi automata
  Kousha Etessami, Thomas Wilke, Rebecca A. Schuller
  Lecture Notes in Computer Science 2076, 2001, pp. 694-707
• Fractional path coloring with applications to WDM networks
  Ioannis Caragiannis, Afonso Ferreira, Christos Kaklamanis, St'ephane Pérennes, Hervé Rivano
  Lecture Notes in Computer Science 2076, 2001, pp. 732-743
• Performance aspects of distributed caches using TTL-based consistency
  Edith Cohen, Eran Halperin, Haim Kaplan
  Lecture Notes in Computer Science 2076, 2001, pp. 744-756
• Routing in trees
  Pierre Fraigniaud, Cyril Gavoille
  Lecture Notes in Computer Science 2076, 2001, pp. 757-772
• Realizability and verification of MSC graphs
  Rajeev Alur, Kousha Etessami, Mihalis Yannakakis
  Lecture Notes in Computer Science 2076, 2001, pp. 797-808
• A PTAS for minimizing weighted completion time on uniformly related machines
  Chandra Chekuri, Sanjeev Khanna
  Lecture Notes in Computer Science 2076, 2001, pp. 848-861
• The buffer minimization problem for multiprocessor scheduling with conflicts
  Marek Chrobak, János Csirik, Csanád Imreh, John Noga, Jiȓí Sgall, Gerhard J. Woeginger
  Lecture Notes in Computer Science 2076, 2001, pp. 862-874
• On minimizing average weighted completion time of multiprocessor tasks with release dates
  Aleksei V. Fishkin, Klaus Jansen, Lorant Porkolab
  Lecture Notes in Computer Science 2076, 2001, pp. 875-886
• Optimistic asynchronous multi-party contract signing with reduced number of rounds
  Birgit Baum-Waidner
  Lecture Notes in Computer Science 2076, 2001, pp. 898-911
• Information-theoretic private information retrieval: A unified construction
  Amos Beimel, Yuval Ishai
  Lecture Notes in Computer Science 2076, 2001, pp. 912-926
• Secure multiparty computation of approximations
  Joan Feigenbaum, Yuval Ishai, Tal Malkin, Kobbi Nissim, Martin J. Strauss, Rebecca N. Wright
  Lecture Notes in Computer Science 2076, 2001, pp. 927-938
• On the completeness of arbitrary selection strategies for paramodulation
  Miquel Bofill, Guillem Godoy
  Lecture Notes in Computer Science 2076, 2001, pp. 951-962
• Lower bounds for the weak pigeonhole principle beyond resolution
  Albert Atserias, María Luisa Bonet, Juan Luis Esteban
  Lecture Notes in Computer Science 2076, 2001, pp. 1005-1016