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

• QSM: A general purpose shared-memory model for parallel computation
  Vijaya Ramachandran
  Lecture Notes in Computer Science 1346, 1997, pp. 1-5
• Approximating geometric domains through topological triangulations
  Tamal K. Dey, Arunabha Roy, Nimish R. Shah
  Lecture Notes in Computer Science 1346, 1997, pp. 6-21
• Solving some discrepancy problems in NC
  Sanjeev Mahajan, Edgar A. Ramos, K.V. Subrahmanyam
  Lecture Notes in Computer Science 1346, 1997, pp. 22-36
• Graph editing to bipartite interval graphs: Exact and asymptotic bounds
  K. Cirino, S. Muthukrishnan, N.S. Narayanaswamy, H. Ramesh
  Lecture Notes in Computer Science 1346, 1997, pp. 37-53
• Model checking
  Edmund M. Clarke
  Lecture Notes in Computer Science 1346, 1997, pp. 54-56
• Recursion versus iteration at higher-orders
  A.J. Kfoury
  Lecture Notes in Computer Science 1346, 1997, pp. 57-73
• Compilation and equivalence of imperative objects
  A.D. Gordon, P.D. Hankin, S.B. Lassen
  Lecture Notes in Computer Science 1346, 1997, pp. 74-87
• On the expressive power of rewriting
  Massimo Marchiori
  Lecture Notes in Computer Science 1346, 1997, pp. 88-102
• Mechanizing verification of arithmetic circuits: SRT division
  Deepak Kapur, M. Subramaniam
  Lecture Notes in Computer Science 1346, 1997, pp. 103-122
• On the complexity of parallel implementation of logic programs
  E. Pontelli, D. Ranjan, G. Gupta
  Lecture Notes in Computer Science 1346, 1997, pp. 123-137
• An abductive semantics for disjunctive logic programs and its proof procedure
  Jia-Huai You, Li Yan Yuan, Randy Goebel
  Lecture Notes in Computer Science 1346, 1997, pp. 138-152
• Assumption-commitment in automata
  Swarup Mohalik, R. Ramanujam
  Lecture Notes in Computer Science 1346, 1997, pp. 153-168
• Compositional design of multitolerant repetitive Byzantine agreement
  Sandeep S. Kulkarni, Anish Arora
  Lecture Notes in Computer Science 1346, 1997, pp. 169-183
• Algorithmic issues in coding theory
  Madhu Sudan
  Lecture Notes in Computer Science 1346, 1997, pp. 184-199
• Sharper results on the expressive power of generalized quantifiers
  Anil Seth
  Lecture Notes in Computer Science 1346, 1997, pp. 200-219
• Improved lowness results for solvable black-box group problems
  N.V. Vinodchandran
  Lecture Notes in Computer Science 1346, 1997, pp. 220-234
• On resource-bounded measure and pseudorandomness
  V. Arvind, J. Köbler
  Lecture Notes in Computer Science 1346, 1997, pp. 235-249
• Verification of open systems
  Moshe Y. Vardi
  Lecture Notes in Computer Science 1346, 1997, pp. 250-266
• Hoare-style compositional proof systems for reactive shared variable concurrency
  F.S. de Boer, U. Hannemann, W.-P. de Roever
  Lecture Notes in Computer Science 1346, 1997, pp. 267-283
• A simple characterization of stuttering bisimulation
  Kedar S. Namjoshi
  Lecture Notes in Computer Science 1346, 1997, pp. 284-296
• General refinement for high level Petri nets
  Raymond Devillers, Hanna Klaudel, Robert-C. Riemann
  Lecture Notes in Computer Science 1346, 1997, pp. 297-311
• Polynomial-time many-one reductions for Petri nets
  Catherine Dufourd, Alain Finkel
  Lecture Notes in Computer Science 1346, 1997, pp. 312-326
• Computing reachability properties hidden in finite net unfoldings
  Burkhard Graves
  Lecture Notes in Computer Science 1346, 1997, pp. 327-341