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

Suche: Series=LNCS AND Volume=1974

• Formal verification of the Ricart-Agrawala algorithm
  Ekaterina Sedletsky, Amir Pnueli, Mordechai Ben-Ari
  Lecture Notes in Computer Science 1974, 2000, pp. 325-335
• On distribution-specific learning with membership queries versus pseudorandom generation
  Johannes Köbler, Wolfgang Lindner
  Lecture Notes in Computer Science 1974, 2000, pp. 336-347
• \Theta_2^p-completeness: A classical approach for new results
  Holger Spakowski, Jörg Vogel
  Lecture Notes in Computer Science 1974, 2000, pp. 348-360
• Is the standard proof system for SAT P-optimal?
  Johannes Köbler, Jochen Messner
  Lecture Notes in Computer Science 1974, 2000, pp. 361-372
• A general framework for types in graph rewriting
  Barbara König
  Lecture Notes in Computer Science 1974, 2000, pp. 373-384
• The ground congruence for Chi calculus
  Yuxi Fu, Zhenrong Yang
  Lecture Notes in Computer Science 1974, 2000, pp. 385-396
• Inheritance in the join calculus
  Cédric Fournet, Cosimo Laneve, Luc Maranget, Didier Rémy
  Lecture Notes in Computer Science 1974, 2000, pp. 397-408
• Approximation algorithms for bandwidth and storage allocation problems under real time constraints
  Stefano Leonardi, Alberto Marchetti-Spaccamela, Andrea Vitaletti
  Lecture Notes in Computer Science 1974, 2000, pp. 409-420
• Dynamic spectrum allocation: The impotency of duration notification
  Bala Kalyanasundaram, Kirk Pruhs
  Lecture Notes in Computer Science 1974, 2000, pp. 421-428
• The fine structure of game lambda models
  Pietro Di Gianantonio, Gianluca Franco
  Lecture Notes in Computer Science 1974, 2000, pp. 429-441
• Strong normalization of second order symmetric \lambda-calculus
  Michel Parigot
  Lecture Notes in Computer Science 1974, 2000, pp. 442-453
• Scheduling to minimize the average completion time of dedicated tasks
  Foto Afrati, Evripidis Bampis, Aleksei V. Fishkin, Klaus Jansen, Claire Kenyon
  Lecture Notes in Computer Science 1974, 2000, pp. 454-464
• Hunting for functionally analogous genes
  Michael T. Hallett, Jens Lagergren
  Lecture Notes in Computer Science 1974, 2000, pp. 465-476
• Keeping track of the latest gossip in shared memory systems
  Bharat Adsul, Aranyak Mehta, Milind Sohoni
  Lecture Notes in Computer Science 1974, 2000, pp. 477-488
• Concurrent knowledge and logical clock abstractions
  Ajay D. Kshemkalyani
  Lecture Notes in Computer Science 1974, 2000, pp. 489-502
• Decidable hierarchies of starfree languages
  Christian Glaßer, Heinz Schmitz
  Lecture Notes in Computer Science 1974, 2000, pp. 503-515
• Prefix languages of Church-Rosser languages
  Jens R. Woinowski
  Lecture Notes in Computer Science 1974, 2000, pp. 516-529