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

• Looking for MUM and DAD: Text-text comparisons do help
  Mike Paterson, Shlomit Tassa, Uri Zwick
  Lecture Notes in Computer Science 1026, 1995, pp. 1-10
• Branch and bound on the network model
  Sanjay Jain
  Lecture Notes in Computer Science 1026, 1995, pp. 11-21
• A near optimal algorithm for the extended cow-path problem in the presence of relative errors
  Pallub Dasgupta, P.P. Chakrabarti, S.C. DeSarkar
  Lecture Notes in Computer Science 1026, 1995, pp. 22-36
• Efficient algorithms for vertex arboricity of planar graphs
  Abhik Roychoudhury, Susmita Sur-Kolay
  Lecture Notes in Computer Science 1026, 1995, pp. 37-51
• A condition for the three colourability of planar locally path graphs
  Ajit A. Diwan, N. Usharani
  Lecture Notes in Computer Science 1026, 1995, pp. 52-61
• A framework for the specification of reactive and concurrent systems in Z
  Peter Baumann, Karl Lermer
  Lecture Notes in Computer Science 1026, 1995, pp. 62-79
• Synthesizing different development paradigms: Combining top-down with bottom-up reasoning about distributed systems
  J. Zwiers, U. Hannemann Y. Lakhneche, W.-P. de Roever
  Lecture Notes in Computer Science 1026, 1995, pp. 80-95
• Verifying part of the ACCESS.bus protocol using PVS
  Jozef Hooman
  Lecture Notes in Computer Science 1026, 1995, pp. 96-110
• Reusing batch parsers as incremental parsers
  Luigi Petrone
  Lecture Notes in Computer Science 1026, 1995, pp. 111-123
• The expressive power of indeterminate primitives in asynchronous computation
  Prakash Panangaden
  Lecture Notes in Computer Science 1026, 1995, pp. 124-150
• The transformation calculus
  Jacques Garrigue
  Lecture Notes in Computer Science 1026, 1995, pp. 151-165
• Equational axiomatization of bicoercibility for polymorphic types
  Jerzy Tiuryn
  Lecture Notes in Computer Science 1026, 1995, pp. 166-179
• From causal consistency to sequential consistency in shared memory systems
  Michel Raynal, André Schiper
  Lecture Notes in Computer Science 1026, 1995, pp. 180-194
• Observation of software for distributed systems with RCL
  Alexander I. Tomlinson, Vijay K. Garg
  Lecture Notes in Computer Science 1026, 1995, pp. 195-209
• Partiality and approximation schemes for local consistency in networks of constraints
  Nick D. Dendris, Lefteris M. Kirousis, Yannis C. Stamatiou, Dimitris M. Thilikos
  Lecture Notes in Computer Science 1026, 1995, pp. 210-224
• Maximal extensions of simplification orderings
  Deepak Kapur, G. Sivakumar
  Lecture Notes in Computer Science 1026, 1995, pp. 225-239
• Average polynomial time is hard for exponential time under sn-reductions
  Rainer Schuler
  Lecture Notes in Computer Science 1026, 1995, pp. 240-247
• On self-testing without the generator bottleneck
  S. Ravikumar, D. Sivakumar
  Lecture Notes in Computer Science 1026, 1995, pp. 248-262
• Observing behaviour categorically
  Mogens Nielsen, Allan Cheng
  Lecture Notes in Computer Science 1026, 1995, pp. 263-278
• An algorithm for reducing binary branchings
  Paul Caspi, Jean-Claude Fernandez, Alain Girault
  Lecture Notes in Computer Science 1026, 1995, pp. 279-293
• On the complexity of bisimilarity for value-passing processes
  Michele Boreale, Luca Trevisan
  Lecture Notes in Computer Science 1026, 1995, pp. 294-308
• On the expressive power of CCS
  Ashvin Dsouza, Bard Bloom
  Lecture Notes in Computer Science 1026, 1995, pp. 309-323
• Polarized name passing
  Martin Odersky
  Lecture Notes in Computer Science 1026, 1995, pp. 324-337
• Path balance heuristic for self-adjusting binary search trees
  R. Balasubramanian, Venkatesh Raman
  Lecture Notes in Computer Science 1026, 1995, pp. 338-348
• Pattern matching in compressed texts
  S. Rao Kosaraju
  Lecture Notes in Computer Science 1026, 1995, pp. 349-362