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

• Saturation-based theorem proving
  Harald Ganzinger
  Lecture Notes in Computer Science 1099, 1996, pp. 1-3
• Bandwidth efficient parallel computation
  Abhiram Ranade
  Lecture Notes in Computer Science 1099, 1996, pp. 4-23
• Variable-length maximal codes
  Véronique Bruyère, Michel Latteux
  Lecture Notes in Computer Science 1099, 1996, pp. 24-47
• Lower bounds for propositional proofs and independence results in bounded arithmetic
  Alexander A. Razborov
  Lecture Notes in Computer Science 1099, 1996, pp. 48-62
• 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
• Fast asynchronous systems in dense time
  Lars Jenner, Walter Vogler
  Lecture Notes in Computer Science 1099, 1996, pp. 75-86
• A hierarchy theorem for the \mu-calculus
  Giacomo Lenzi
  Lecture Notes in Computer Science 1099, 1996, pp. 87-97
• 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
• Characterizing fairness implementability for multiparty interaction
  Yuh-Jzer Joung
  Lecture Notes in Computer Science 1099, 1996, pp. 110-121
• Termination of context-sensitive rewriting by rewriting
  Salvador Lucas
  Lecture Notes in Computer Science 1099, 1996, pp. 122-133
• 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
• Different types of arrow between logical frameworks
  Till Mossakowski
  Lecture Notes in Computer Science 1099, 1996, pp. 158-169
• Effective models of polymorphism, subtyping and recursion
  John Mitchell, Ramesh Viswanathan
  Lecture Notes in Computer Science 1099, 1996, pp. 170-181
• 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
• Semi-groups acting on context-free graphs
  Géraud Sénizergues
  Lecture Notes in Computer Science 1099, 1996, pp. 206-218
• Hard sets method and semilinear reservoir method with applications
  Leonid P. Lisovik
  Lecture Notes in Computer Science 1099, 1996, pp. 219-231
• Random polynomials and polynomial factorization
  Philippe Flajolet, Xavier Gourdon, Daniel Panario
  Lecture Notes in Computer Science 1099, 1996, pp. 232-243
• Optimal Groebner base algorithms for binomial ideals
  Ulla Koppenhagen, Ernst W. Mayr
  Lecture Notes in Computer Science 1099, 1996, pp. 244-255
• Minimum fill-in on circle and circular-arc graphs
  T. Kloks, D. Kratsch, C.K. Wong
  Lecture Notes in Computer Science 1099, 1996, pp. 256-267
• 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
• Searching a fixed graph
  Elias Koutsoupias, Christos Papadimitriou, Mihalis Yannakakis
  Lecture Notes in Computer Science 1099, 1996, pp. 280-289
• Improved sampling with applications to dynamic graph algorithms
  Monika Rauch Henzinger, Mikkel Thorup
  Lecture Notes in Computer Science 1099, 1996, pp. 290-299
• The expressive power of existential first order sentences of Büchi's sequential calculus
  Jean-Eric Pin
  Lecture Notes in Computer Science 1099, 1996, pp. 300-311