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

• Linear broadcast routing
  Ching-Tsun Chou, Inder S. Gopal
  Lecture Notes in Computer Science 338, 1988, pp. 122
• Planar point location revisited (A guided tour of a decade of research)
  Franco P. Preparata
  Lecture Notes in Computer Science 338, 1988, pp. 1-17
• Computing a viewpoint of a set of points inside a polygon
  Subir Kumar Ghosh
  Lecture Notes in Computer Science 338, 1988, pp. 18-29
• Analysis of preflow push algorithms for maximum network flow
  Joseph Cheriyan, S.N. Maheshwari
  Lecture Notes in Computer Science 338, 1988, pp. 30-48
• A new linear algorithm for the two path problem on chordal graphs
  S.V. Krishnan, C. Pandu Rangan, S. Seshadri
  Lecture Notes in Computer Science 338, 1988, pp. 49-66
• Extending planar graph algorithms to K_{3,3}-free graphs
  Samir Khuller
  Lecture Notes in Computer Science 338, 1988, pp. 67-79
• Constant-space string-matching
  Maxime Crochemore
  Lecture Notes in Computer Science 338, 1988, pp. 80-87
• Inherent nonelicibility of rectangular duals in VLSI floorplanning
  Susmita Sur-Kolay, Bhargab B. Bhattacharya
  Lecture Notes in Computer Science 338, 1988, pp. 88-107
• Path planning with local information
  Amitava Datta, Kamala Krithivasan
  Lecture Notes in Computer Science 338, 1988, pp. 108-121
• Predicting deadlock in store-and-forward networks
  Claudio Arbib, Giuseppe F. Italiano, Alessandro Panconesi
  Lecture Notes in Computer Science 338, 1988, pp. 123-142
• On parallel sorting and addition with concurrent writes
  Sanjeev Saxena, P.C.P. Bhatt, V.C. Prasad
  Lecture Notes in Computer Science 338, 1988, pp. 143-153
• An optimal parallel algorithm for sorting presorted files
  Christos Levcopoulos, Ola Petersson
  Lecture Notes in Computer Science 338, 1988, pp. 154-160
• Superlinear speedup in parallel state-space search
  Rao V. Nageshwara, Vipin Kumar
  Lecture Notes in Computer Science 338, 1988, pp. 161-174
• Circuit definitions of nonderterministic complexity classes
  H. Venkateswaran
  Lecture Notes in Computer Science 338, 1988, pp. 175-192
• Non-uniform proof-systems
  Jürgen Kämper
  Lecture Notes in Computer Science 338, 1988, pp. 193-210
• Padding, commitment and self-reducibility
  Sanjeev N. Khadilkar, Somenath Biswas
  Lecture Notes in Computer Science 338, 1988, pp. 211-224
• The complexity of a counting finite-state automaton
  Craig A. Rich, Giora Slutzki
  Lecture Notes in Computer Science 338, 1988, pp. 225-239
• A hierarchy theorem for PRAM-based complexity classes
  Walter W. Kirchherr
  Lecture Notes in Computer Science 338, 1988, pp. 240-249
• A natural deduction treatment of operational semantics
  R. Burstall, F. Honsell
  Lecture Notes in Computer Science 338, 1988, pp. 250-269
• Uniformly applicative structures, a theory of computability and polyadic functions
  Patrick Bellot, V. Jay
  Lecture Notes in Computer Science 338, 1988, pp. 270-285
• A proof technique for register atomicity
  Baruch Awerbuch, Lefteris M. Kirousis, Evangelos Kranakis, Paul M.B. Vitányi
  Lecture Notes in Computer Science 338, 1988, pp. 286-303
• Relation level semantics
  Jules Desharnais, Nazim H. Madhavji
  Lecture Notes in Computer Science 338, 1988, pp. 304-328
• A constructive set theory for program development
  Martin C. Henson, Raymond Turner
  Lecture Notes in Computer Science 338, 1988, pp. 329-347
• McCarthy's amb cannot implement fair merge
  Prakash Panangaden, Vasant Shanbhogue
  Lecture Notes in Computer Science 338, 1988, pp. 348-363
• GHC - A language for a new age of parallel programming
  Koichi Furukawa, Kazunori Ueda
  Lecture Notes in Computer Science 338, 1988, pp. 364-376