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

• The nature and meaning of perturbations in geometric computing
  Raimund Seidel
  Lecture Notes in Computer Science 775, 1994, pp. 3-17
• One binary Horn clause is enough
  Philippe Devienne, Patrick Lebègue, Jean-Christophe Routier, Jörg Würtz
  Lecture Notes in Computer Science 775, 1994, pp. 21-32
• Transforming constraint logic programs
  N. Bensaou, I. Guessarian
  Lecture Notes in Computer Science 775, 1994, pp. 33-46
• A hierarchy of temporal logics with past
  F. Laroussinie, Ph. Schnoebelen
  Lecture Notes in Computer Science 775, 1994, pp. 47-58
• The complexity of resource-bounded first-order classical logic
  Jean Goubault
  Lecture Notes in Computer Science 775, 1994, pp. 59-70
• Two proof procedures for a cardinality based language in propositional calculus
  Belaid Benhamou, Lakhdar Sais, Pierre Siegel
  Lecture Notes in Computer Science 775, 1994, pp. 71-82
• The alternation hierarchy for machines with sublogarithmic space is infinite
  Burchard von Braunmühl, Romain Gengler, Robert Rettinger
  Lecture Notes in Computer Science 775, 1994, pp. 85-96
• Quasilinear time complexity theory
  Ashish V. Naik, Kenneth W. Regan, D. Sivakumar
  Lecture Notes in Computer Science 775, 1994, pp. 97-108
• Space-efficient deterministic simulation of probabilistic automata
  Ioan I. Macarie
  Lecture Notes in Computer Science 775, 1994, pp. 109-122
• Reachability and the power of local ordering
  Kousha Etessami, Neil Immerman
  Lecture Notes in Computer Science 775, 1994, pp. 123-135
• Ground reducibility and automata with disequality constraints
  Hubert Comon, Florent Jacquemard
  Lecture Notes in Computer Science 775, 1994, pp. 151-162
• Perpetuality and strong normalization in orthogonal term rewriting systems
  Zurab Khasidashvili
  Lecture Notes in Computer Science 775, 1994, pp. 163-174
• About changing the ordering during Knuth-Bendix completion
  Andrea Sattler-Klein
  Lecture Notes in Computer Science 775, 1994, pp. 175-186
• Combination of matching algorithms
  Christophe Ringeissen
  Lecture Notes in Computer Science 775, 1994, pp. 187-198
• Periodic constant depth sorting networks
  Marcin Kik, Mirosƚaw Kutyƚowski, Grzegorz Stachowiak
  Lecture Notes in Computer Science 775, 1994, pp. 201-212
• Optimal pattern matching on meshes
  Bogdan S. Chlebus, Leszek Ga̧sieniec
  Lecture Notes in Computer Science 775, 1994, pp. 213-224
• Faster sorting and routing on grids with diagonals
  Manfred Kunde, Rolf Niedermeier, Peter Rossmanith
  Lecture Notes in Computer Science 775, 1994, pp. 225-236
• Deterministic 1-k routing on meshes
  Jop F. Sibeyn, Michael Kaufmann
  Lecture Notes in Computer Science 775, 1994, pp. 237-248
• A unifying type-theoretic framework for objects
  Martin Hofmann, Benjamin Pierce
  Lecture Notes in Computer Science 775, 1994, pp. 251-262
• Operational specifications with built-ins
  Jürgen Avenhaus, Klaus Becker
  Lecture Notes in Computer Science 775, 1994, pp. 263-274
• Reactive variables for system specification and design
  E. Pascal Gribomont, Jacques Hagelstein
  Lecture Notes in Computer Science 775, 1994, pp. 275-286
• A new parallel vector model, with exact characterization of NC^k
  Kenneth W. Regan
  Lecture Notes in Computer Science 775, 1994, pp. 289-300
• On adaptive dlogtime and polylogtime reductions
  Carme Álvarez, Birgit Jenner
  Lecture Notes in Computer Science 775, 1994, pp. 301-312
• NC^k(NP) = AC^{k-1}(NP)
  Mitsunori Ogiwara
  Lecture Notes in Computer Science 775, 1994, pp. 313-324
• Hypertransition systems
  André Arnold
  Lecture Notes in Computer Science 775, 1994, pp. 327-338