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

Suche: Series=LNCS AND YEAR=1996

• Parallel alternating-direction access machine
  Bogdan S. Chlebus, Artur Czumaj, Leszek Ga̧sieniec, Miroslaw Kowaluk, Wojciech Plandowski
  Lecture Notes in Computer Science 1113, 1996, pp. 267-278
• Specification and verification of timed lazy systems
  Flavio Corradini, Marco Pistore
  Lecture Notes in Computer Science 1113, 1996, pp. 279-290
• Variable-length maximal codes
  Véronique Bruyère, Michel Latteux
  Lecture Notes in Computer Science 1099, 1996, pp. 24-47
• Algebraic characterizations of decorated trace equivalences over tree-like structures
  Xiao Jun Chen, Rocco de Nicola
  Lecture Notes in Computer Science 1099, 1996, pp. 63-74
• An effective tableau system for the linear time \mu-calculus
  Julian Bradfield, Javier Esparza, Angelika Mader
  Lecture Notes in Computer Science 1099, 1996, pp. 98-109
• A complete Gentzen-style axiomatization for set constraints
  Allan Cheng, Dexter Kozen
  Lecture Notes in Computer Science 1099, 1996, pp. 134-145
• Fatal errors in conditional expressions
  Michel Billaud
  Lecture Notes in Computer Science 1099, 1996, pp. 146-157
• Regularity for a large class of context-free processes is decidable
  D.J.B. Bosscher, W.O.D. Griffioen
  Lecture Notes in Computer Science 1099, 1996, pp. 182-193
• On infinite transition graphs having a decidable monadic theory
  Didier Caucal
  Lecture Notes in Computer Science 1099, 1996, pp. 194-205
• Practical approximation schemes for maximum induced-subgraph problems on K_{3,3}-free or K_5-free graphs
  Zhi-Zhong Chen
  Lecture Notes in Computer Science 1099, 1996, pp. 268-279
• On the power of randomized branching programs
  Farid Ablayev, Marek Karpinski
  Lecture Notes in Computer Science 1099, 1996, pp. 348-356
• Hitting sets derandomize BPP
  Alexander E. Andreev, Andrea E.F. Clementi, José D.P. Rolim
  Lecture Notes in Computer Science 1099, 1996, pp. 357-368
• On type-2 probabilistic quantifiers
  Ronald V. Book, Heribert Vollmer, Klaus W. Wagner
  Lecture Notes in Computer Science 1099, 1996, pp. 369-380
• Constructions and bounds for visual cryptography
  Giuseppe Ateniese, Carlo Blundo, Alfredo de Santis, Douglas R. Stinson
  Lecture Notes in Computer Science 1099, 1996, pp. 416-428
• On capital investment
  Yossi Azar, Yair Bartal, Esteban Feuerstein, Amos Fiat, Stefano Leonardi, Adi Rosén
  Lecture Notes in Computer Science 1099, 1996, pp. 429-441
• Lower bounds for row minima searching
  Phillip G. Bradford, Knut Reinert
  Lecture Notes in Computer Science 1099, 1996, pp. 454-465
• Mobile processes with a distributed environment
  Chiara Bodei, Pierpaolo Degano, Corrado Priami
  Lecture Notes in Computer Science 1099, 1996, pp. 490-501
• Average case analyses of list update algorithms, with applications to data compression
  Susanne Albers, Michael Mitzenmacher
  Lecture Notes in Computer Science 1099, 1996, pp. 514-525
• Lopsided trees: Analyses, algorithms, and applications
  Vicky Siu-Ngan Choi, Mordecai Golin, M. Golin
  Lecture Notes in Computer Science 1099, 1996, pp. 538-549
• Improved parallel approximation of a class of integer programming problems
  Noga Alon, Aravind Srinivasan
  Lecture Notes in Computer Science 1099, 1996, pp. 562-573
• Efficient collective communication in optical networks
  J.-C. Bermond, L. Gargano, S. Perennes, A.A. Rescigno, U. Vaccaro
  Lecture Notes in Computer Science 1099, 1996, pp. 574-585
• Shared-memory simulations on a faulty-memory DMM
  Bogdan S. Chlebus, Anna Gambin, Piotr Indyk
  Lecture Notes in Computer Science 1099, 1996, pp. 586-597
• Efficient asynchronous consensus with the value-oblivious adversary scheduler
  Yonatan Aumann, Michael A. Bender
  Lecture Notes in Computer Science 1099, 1996, pp. 622-633
• A formal framework for evaluating heuristic programs
  Lenor Cowen, Joan Feigenbaum, Sampath Kannan
  Lecture Notes in Computer Science 1099, 1996, pp. 634-645
• Improved scheduling algorithms for minsum criteria
  Soumen Chakrabarti, Cynthia A. Phillips, Andreas S. Schulz, David B. Shmoys, Cliff Stein, Joel Wein
  Lecture Notes in Computer Science 1099, 1996, pp. 646-657