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

• On the competitive ratio for online facility location
  Dimitris Fotakis
  Lecture Notes in Computer Science 2719, 2003, pp. 637-652
• A study of integrated document and connection caching
  Susanne Albers, Rob van Stee
  Lecture Notes in Computer Science 2719, 2003, pp. 653-667
• A solvable class of quadratic diophantine equations with applications to verification of infinite-state systems
  Gaoyan Xie, Zhe Dang, Oscar H. Ibarra
  Lecture Notes in Computer Science 2719, 2003, pp. 668-680
• Monadic second-order logics with cardinalities
  Felix Klaedtke, Harald Rueß
  Lecture Notes in Computer Science 2719, 2003, pp. 681-696
• \Pi_2 \cap \Sigma_2 \equiv AFMC
  Orna Kupferman, Moshe Y. Vardi
  Lecture Notes in Computer Science 2719, 2003, pp. 697-713
• Upper bounds for a theory of queues
  Tatiana Rybina, Andrei Voronkov
  Lecture Notes in Computer Science 2719, 2003, pp. 714-724
• Degree distribution of the FKP network model
  Noam Berger, Béla Bollobás, Christian Borgs, Jennifer Chayes, Oliver Riordan
  Lecture Notes in Computer Science 2719, 2003, pp. 725-738
• Similarity matrices for pairs of graphs
  Vincent D. Blondel, Paul Van Dooren
  Lecture Notes in Computer Science 2719, 2003, pp. 739-750
• Algorithmic aspects of bandwidth trading
  Randeep Bhatia, Julia Chuzhoy, Ari Freund, Joseph (Seffi) Naor
  Lecture Notes in Computer Science 2719, 2003, pp. 751-766
• CTL^+ is complete for double exponential time
  Jan Johannsen, Martin Lange
  Lecture Notes in Computer Science 2719, 2003, pp. 767-775
• Hierarchical and recursive state machines with context-dependent properties
  Salvatore La Torre, Margherita Napoli, Mimmo Parente, Gennaro Parlato
  Lecture Notes in Computer Science 2719, 2003, pp. 776-789
• Oracle circuits for branching-time model checking
  Philippe Schnoebelen
  Lecture Notes in Computer Science 2719, 2003, pp. 790-801
• There are spanning spiders in dense graphs (and we know how to find them)
  Luisa Gargano, Mikael Hammar
  Lecture Notes in Computer Science 2719, 2003, pp. 802-816
• The computational complexity of the role assignment problem
  Jiȓí Fiala, Daniël Paulusma
  Lecture Notes in Computer Science 2719, 2003, pp. 817-828
• Fixed-parameter algorithms for the (k,r)-center in planar graphs and map graphs
  Erik D. Demaine, Fedor V. Fomin, Mohammad Taghi Hajiaghayi, Dimitrios M. Thilikos
  Lecture Notes in Computer Science 2719, 2003, pp. 829-844
• Genus characterizes the complexity of graph problems: Some tight results
  Jianer Chen, Iyad A. Kanj, Ljubomir Perkovic, Eric Sedgwick, Ge Xia
  Lecture Notes in Computer Science 2719, 2003, pp. 845-856
• The definition of a temporal clock operator
  Cindy Eisner, Dana Fisman, John Havlicek, Anthony McIsaac, David Van Campenhout
  Lecture Notes in Computer Science 2719, 2003, pp. 857-870
• Minimal classical logic and control operators
  Zena M. Ariola, Hugo Herbelin
  Lecture Notes in Computer Science 2719, 2003, pp. 871-885
• Counterexample-guided control
  Thomas A. Henzinger, Ranjit Jhala, Rupak Majumdar
  Lecture Notes in Computer Science 2719, 2003, pp. 886-902
• Axiomatic criteria for quotients and subobjects for higher-order data types
  Jo Hannay
  Lecture Notes in Computer Science 2719, 2003, pp. 903-917
• Efficient pebbling for list traversal synopses
  Yossi Matias, Ely Porat
  Lecture Notes in Computer Science 2719, 2003, pp. 918-928
• Function matching: Algorithms, applications, and a lower bound
  Amihood Amir, Yonatan Aumann, Richard Cole, Moshe Lewenstein, Ely Porat
  Lecture Notes in Computer Science 2719, 2003, pp. 929-942
• Simple linear work suffix array construction
  Juha Kärkkäinen, Peter Sanders
  Lecture Notes in Computer Science 2719, 2003, pp. 943-955
• Expansion postponement via cut elimination in sequent calculi for pure type systems
  Francisco Gutiérrez, Blas Ruiz
  Lecture Notes in Computer Science 2719, 2003, pp. 956-968
• Secrecy in untrusted networks
  Michele Bugliesi, Silvia Crafa, Amela Prelic, Vladimiro Sassone
  Lecture Notes in Computer Science 2719, 2003, pp. 969-983