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 YEAR=1994

• May and must convergency in concurrent \lambda-calculus
  F. Alessi, M. Dezani-Ciancaglini, U. de'Liguoro
  Lecture Notes in Computer Science 841, 1994, pp. 211-220
• Genericity and measure for exponential time
  Klaus Ambos-Spies, Hans-Christian Neis, Sebastiaan A. Terwijn
  Lecture Notes in Computer Science 841, 1994, pp. 221-232
• Analysis of bounded disorder
  Ricardo A. Baeza-Yates
  Lecture Notes in Computer Science 841, 1994, pp. 233-244
• On languages accepted with simultaneous complexity bounds and their ranking problem
  Alberto Bertoni, Carlo Mereghetti, Giovanni Pighizzini
  Lecture Notes in Computer Science 841, 1994, pp. 245-255
• Embedding complete binary trees into star networks
  A. Bouabdallah, M.C. Heydemann, J. Opatrny, D. Sotteau
  Lecture Notes in Computer Science 841, 1994, pp. 266-275
• Inductive counting below Logspace
  Carsten Damm, Markus Holzer
  Lecture Notes in Computer Science 841, 1994, pp. 276-285
• Decision problems for edge grammars
  Jürgen Dassow
  Lecture Notes in Computer Science 841, 1994, pp. 286-295
• "The Big Sweep": On the power of the wavefront approach to Voronoi diagrams
  Frank Dehne, Rolf Klein
  Lecture Notes in Computer Science 841, 1994, pp. 296-305
• Reliable minimum finding comparator networks
  Piotr Denejko, Krzysztof Diks, Andrzej Pelc, Marek Piotrów
  Lecture Notes in Computer Science 841, 1994, pp. 306-315
• On parallel complexity of maximum f-matching and the degree sequence problem
  Anders Dessmark, Andrzej Lingas, Oscar Garrido
  Lecture Notes in Computer Science 841, 1994, pp. 316-325
• A comparison of two lower bound methods for communication complexity
  Martin Dietzfelbinger, Juraj Hromkovic̑, Georg Schnitger
  Lecture Notes in Computer Science 841, 1994, pp. 326-335
• A \pi-calculus with explicit substitutions: The late semantics
  GianLuigi Ferrari, Ugo Montanari, Paola Quaglia
  Lecture Notes in Computer Science 841, 1994, pp. 342-351
• Processes and hyperuniverses
  Marco Forti, Furio Honsell, Marina Lenisa
  Lecture Notes in Computer Science 841, 1994, pp. 352-363
• The combinatorial complexity of a finite string
  Felix Frayman, Valery Kanevsky, Walter Kirchherr
  Lecture Notes in Computer Science 841, 1994, pp. 364-372
• A fully abstract semantics for termination in petri nets
  R. Gold
  Lecture Notes in Computer Science 841, 1994, pp. 373-382
• Passive and active rules in deductive databases
  M. Halfeld Ferrari Alves, D. Laurent, N. Spyratos
  Lecture Notes in Computer Science 841, 1994, pp. 383-392
• Combinatorial results on the complexity of teaching and learning
  T. Hegedues
  Lecture Notes in Computer Science 841, 1994, pp. 393-402
• Degrees and reducibilities of easy tally sets
  M. Hermo
  Lecture Notes in Computer Science 841, 1994, pp. 403-412
• Mso definable text languages
  H.J. Hoogeboom, P. ten Pas
  Lecture Notes in Computer Science 841, 1994, pp. 413-422
• Two lower bounds on distributive generation of languages
  J. Hromkovic, J. Kari, L. Kari, D. Pardubska
  Lecture Notes in Computer Science 841, 1994, pp. 423-432
• Design of elliptic curves with controllable lower boundary of extension degree for reduction attacks
  Jinhui Chao, Kazuo Tanada, Shigeo Tsujii
  Lecture Notes in Computer Science 839, 1994, pp. 50-55
• Cryptographic protocols based on discrete logarithms in real-quadratic orders
  Ingrid Biehl, Johannes Buchmann, Christoph Thiel
  Lecture Notes in Computer Science 839, 1994, pp. 56-60
• Directed acyclic graphs, one-way functions and digital signatures
  Daniel Bleichenbacher, Ueli M. Maurer
  Lecture Notes in Computer Science 839, 1994, pp. 75-82
• An identity-based signature scheme with bounded life-span
  Olivier Delos, Jean-Jacques Quisquater
  Lecture Notes in Computer Science 839, 1994, pp. 83-94
• A parallel permutation multiplier for a PGM crypto-chip
  Tamás Horváth, Spyros S. Magliveras, Tran van Trung
  Lecture Notes in Computer Science 839, 1994, pp. 108-113