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

Suche: Series=LNCS AND YEAR=1998

• Parallel geometric algorithms in coarse-grain network models
  Mikhail J. Atallah, Danny Z. Chen
  Lecture Notes in Computer Science 1449, 1998, pp. 55-64
• Robust reductions
  Jin-Yi Cai, Lane A. Hemaspaandra, Gerd Wechsung
  Lecture Notes in Computer Science 1449, 1998, pp. 174-183
• Approaches to effective semi-continuity of real functions
  Vasco Brattka, Klaus Weihrauch, Xizhong Zheng
  Lecture Notes in Computer Science 1449, 1998, pp. 184-193
• An optimal algorithm for finding the minimum cardinality dominating set on permutation graphs
  H.S. Chao, F.R. Hsu, R.C.T. Lee
  Lecture Notes in Computer Science 1449, 1998, pp. 309-318
• Similarity in two-dimensional strings
  Ricardo A. Baeza-Yates
  Lecture Notes in Computer Science 1449, 1998, pp. 319-328
• On multi-dimensional Hilbert indexings
  Jochen Alber, Rolf Niedermeier
  Lecture Notes in Computer Science 1449, 1998, pp. 329-338
• Combinatorial properties of classes of functions hard to compute in constant depth
  Anna Bernasconi
  Lecture Notes in Computer Science 1449, 1998, pp. 339-348
• One-time tables for two-party computation
  Donald Beaver
  Lecture Notes in Computer Science 1449, 1998, pp. 361-370
• A very fast string matching algorithm for small alphabets and long patterns
  Christian Charras, Thierry Lecrog, Joseph Daniel Pehoushek
  Lecture Notes in Computer Science 1448, 1998, pp. 55-64
• Efficient special cases of pattern matching with swaps
  Amihood Amir, Gad M. Landau, Moshe Lewenstein, Noa Lewenstein
  Lecture Notes in Computer Science 1448, 1998, pp. 209-220
• Approximation schemes for covering and scheduling in related machines
  Yossi Azar, Leah Epstein
  Lecture Notes in Computer Science 1444, 1998, pp. 39-47
• One for the price of two: A unified approach for approximating covering problems
  Reuven Bar-Yehuda
  Lecture Notes in Computer Science 1444, 1998, pp. 49-62
• Approximation of geometric dispersion problems
  Christoph Baur, Sándor P. Fekete
  Lecture Notes in Computer Science 1444, 1998, pp. 63-75
• Approximating k-outconnected subgraph problems
  Joseph Cheriyan, Tibor Jordán, Zeev Nutov
  Lecture Notes in Computer Science 1444, 1998, pp. 77-88
• On existentially first-order definable languages and their relation to NP
  Bernd Borchert, Dietrich Kuske, Frank Stephan
  Lecture Notes in Computer Science 1443, 1998, pp. 17-28
• Deciding global partial-order properties
  Rajeev Alur, Ken McMillan, Doron Peled
  Lecture Notes in Computer Science 1443, 1998, pp. 41-52
• Compact encodings of planar graphs via canonical orderings and multiple parentheses
  Richie Chih-Nan Chuang, Ashim Garg, Xin He, Ming-Yang Kao, Hsueh-I Lu
  Lecture Notes in Computer Science 1443, 1998, pp. 118-129
• On the expressiveness of real and integer arithmetic automata
  Bernard Boigelot, Stéphane Rassart, Pierre Wolper
  Lecture Notes in Computer Science 1443, 1998, pp. 152-163
• CONS-free programs with tree input
  Amir M. Ben-Amram, Holger Petersen
  Lecture Notes in Computer Science 1443, 1998, pp. 271-282
• Concatenable graph processes: Relating processes and derivation traces
  Paolo Baldan, Andrea Corradini, Ugo Montanari
  Lecture Notes in Computer Science 1443, 1998, pp. 283-295
• Efficient approximation algorithms for the Subset-Sums Equality problem
  Cristina Bazgan, Miklos Santha, Zsolt Tuza
  Lecture Notes in Computer Science 1443, 1998, pp. 387-396
• On computing the entropy of cellular automata
  Michele D'amico, Giovanni Manzini, Luciano Margara
  Lecture Notes in Computer Science 1443, 1998, pp. 470-481
• On the determinization of weighted finite automata
  Adam L. Buchsbaum, Raffaele Giancarlo, Jeffery R. Westbrook
  Lecture Notes in Computer Science 1443, 1998, pp. 482-493
• Computing mimicking networks
  Shiva Chaudhuri, K.V. Subrahmanyam, Frank Wagner, Christos D. Zaroliagis
  Lecture Notes in Computer Science 1443, 1998, pp. 556-567
• Metric semantics for true concurrent real time
  Christel Baier, Joost-Pieter Katoen, Diego Latella
  Lecture Notes in Computer Science 1443, 1998, pp. 568-579