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

• On-line addition in real base
  Christiane Frougny
  Lecture Notes in Computer Science 1672, 1999, pp. 1-11
• Query languages for real number databases based on descriptive complexity over R
  Klaus Meer
  Lecture Notes in Computer Science 1672, 1999, pp. 12-22
• The arithmetical hierarchy of real numbers
  Xizhong Zheng, Klaus Weihrauch
  Lecture Notes in Computer Science 1672, 1999, pp. 23-33
• The Burrows-Wheeler transform: Theory and practice
  Giovanni Manzini
  Lecture Notes in Computer Science 1672, 1999, pp. 34-47
• Efficiency of fast parallel pattern searching in highly compressed texts
  Leszek Gaşieniec, Alan Gibbons, Wojciech Rytter
  Lecture Notes in Computer Science 1672, 1999, pp. 48-58
• Computing and comparing semantics of programs in four-valued logics
  Yann Loyer, Nicolas Spyratos, Daniel Stamate
  Lecture Notes in Computer Science 1672, 1999, pp. 59-69
• Foundations of modular SOS
  Peter D. Mosses
  Lecture Notes in Computer Science 1672, 1999, pp. 70-80
• Message sequence graphs and decision problems on Mazurkiewicz traces
  Anca Muscholl, Doron Peled
  Lecture Notes in Computer Science 1672, 1999, pp. 81-91
• On the complexity of recognizing the Hilbert basis of a linear diophantine system
  Arnaud Durand, Miki Hermann, Laurent Juban
  Lecture Notes in Computer Science 1672, 1999, pp. 92-102
• The complexity of the extended GCD problem
  George Havas, Jean-Pierre Seifert
  Lecture Notes in Computer Science 1672, 1999, pp. 103-113
• Complexity results for confluence problems
  Markus Lohrey
  Lecture Notes in Computer Science 1672, 1999, pp. 114-124
• Is your model checker on time? On the complexity of model checking for timed modal logics
  Luca Aceto, François Laroussinie
  Lecture Notes in Computer Science 1672, 1999, pp. 125-136
• Clausal resolution for CTL\star
  Alexander Bolotov, Clare Dixon, Michael Fisher
  Lecture Notes in Computer Science 1672, 1999, pp. 137-148
• Model checking and higher-order recursion
  Hardi Hungar
  Lecture Notes in Computer Science 1672, 1999, pp. 149-159
• Multiparty communication complexity: Very hard functions
  Ján Man̑uch
  Lecture Notes in Computer Science 1672, 1999, pp. 160-169
• New perspectives in distributed computing
  Maurice Herlihy, Sergio Rajsbaum
  Lecture Notes in Computer Science 1672, 1999, pp. 170-186
• An improved disjunctive strictness analysis
  Grzegorz Crudziński
  Lecture Notes in Computer Science 1672, 1999, pp. 187-197
• Unique fixed point induction for McCarthys Amb
  Sren B. Lassen, Andrew Moran
  Lecture Notes in Computer Science 1672, 1999, pp. 198-208
• On some topological properties of linear cellular automata
  Luciano Margara
  Lecture Notes in Computer Science 1672, 1999, pp. 209-219
• Real-time language recognition by one-way and two-way cellular automata
  Katsuhiko Nakamura
  Lecture Notes in Computer Science 1672, 1999, pp. 220-230
• Average state complexity of operations on unary automata
  Cyril Nicaud
  Lecture Notes in Computer Science 1672, 1999, pp. 231-240
• Fooling rebound automata
  Holger Petersen
  Lecture Notes in Computer Science 1672, 1999, pp. 241-250
• The complexity of minimizing FBDDs
  Detlef Sieling
  Lecture Notes in Computer Science 1672, 1999, pp. 251-261
• Efficient strongly universal and optimally universal hashing
  Philipp Woelfel
  Lecture Notes in Computer Science 1672, 1999, pp. 262-272
• Lower and upper bounds for the problem of page replication in ring networks
  Wƚodzimierz Gƚazek
  Lecture Notes in Computer Science 1672, 1999, pp. 273-283