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

• A meta-language for typed object-oriented languages
  Giuseppe Castagna
  Lecture Notes in Computer Science 761, 1993, pp. 52-71
• Preemption in concurrent systems
  Gérard Berry
  Lecture Notes in Computer Science 761, 1993, pp. 72-93
• Local versus non-local computation of length of digitized curves
  S.R. Kulkarni, S.K. Mitter, T.J. Richardson, J.N. Tsitsiklis
  Lecture Notes in Computer Science 761, 1993, pp. 94-103
• Data-independences of parallel random access machines
  Klaus-Jörn Lange, Rolf Niedermeier
  Lecture Notes in Computer Science 761, 1993, pp. 104-113
• Proving termination of logic programs by transforming them into equivalent term rewriting systems
  G. Aguzzi, U. Modigliani
  Lecture Notes in Computer Science 761, 1993, pp. 114-124
• Completeness of hierarchical combinations of term rewriting systems
  M.R.K. Krishna Rao
  Lecture Notes in Computer Science 761, 1993, pp. 125-138
• Higher-order and semantic unification
  Nachum Dershowitz, Subrata Mitra
  Lecture Notes in Computer Science 761, 1993, pp. 139-150
• A conservative extension of first-order logic and its applications to theorem proving
  David Basin, Seán Matthews
  Lecture Notes in Computer Science 761, 1993, pp. 151-160
• On the semantics of optimization predicates in CLP languages
  François Fages
  Lecture Notes in Computer Science 761, 1993, pp. 193-204
• Proximity problems and the Voronoi diagram on a rectilinear plane with rectangular obstacles
  Sumanta Guha, Ichiro Suzuki
  Lecture Notes in Computer Science 761, 1993, pp. 218-227
• Feasibility of design in stereolithography
  B. Asberg, G. Blanco, P. Bose, J. Garcia-Lopez, M. Overmars, G. Toussaint, G. Wilfong, B. Zhu
  Lecture Notes in Computer Science 761, 1993, pp. 228-237
• On some communication complexity problems related to threshold functions
  Magnús M. Halldórsson, Jaikumar Radhakrishnan, K.V. Subrahmanyam
  Lecture Notes in Computer Science 761, 1993, pp. 248-259
• Recursiveness over the complex numbers is time-bounded
  Felipe Cucker, Francesc Rosselló
  Lecture Notes in Computer Science 761, 1993, pp. 260-267
• A graphic language based on timing diagrams
  Christian Antoine, Bernard Le Goff, Jean-Eric Pin
  Lecture Notes in Computer Science 761, 1993, pp. 306-316
• Generating degrees of belief from statistical information: An overview
  Fahiem Bacchus, Adam J. Grove, Joseph Y. Halpern, Daphne Koller
  Lecture Notes in Computer Science 761, 1993, pp. 318-325
• Complexity results for 1-safe nets
  Allan Cheng, Javier Esparza, Jens Palsberg
  Lecture Notes in Computer Science 761, 1993, pp. 326-337
• Some results about logical descriptions of non deterministic behaviours
  David Janin
  Lecture Notes in Computer Science 761, 1993, pp. 338-347
• Order structures and generalisations of Szpilrajn's theorem
  Ryszard Janicki, Maciej Koutny
  Lecture Notes in Computer Science 761, 1993, pp. 348-357
• ICSP and its relationship with ACSP and CSP
  K. Narayan Kumar, Paritosh K. Pandya
  Lecture Notes in Computer Science 761, 1993, pp. 358-372
• On reduction-based process semantics
  Kohei Honda, Nobuko Yoshida
  Lecture Notes in Computer Science 761, 1993, pp. 373-387
• Time optimal self-stabilizing spanning tree algorithms
  Sudhanshu Aggarwal, Shay Kutten
  Lecture Notes in Computer Science 761, 1993, pp. 400-410
• Searching, sorting and randomised algorithms for central elements and ideal counting in posets
  Devdatt P. Dubhashi, Kurt Mehlhorn, Desh Ranjan, Christian Thiel
  Lecture Notes in Computer Science 761, 1993, pp. 436-443
• Learning classes of regular and linear languages in Valiant's learnability framework
  P. Bhattacharyya, G. Nagaraja
  Lecture Notes in Computer Science 761, 1993, pp. 444-453
• Prototyping parallel algorithms with ProSet-Linda
  Wilhelm Hasselbring
  Lecture Notes in Computer Science 734, 1993, pp. 135-150
• The influence of lookahead in competitive paging algorithms (extended abstract)
  Susanne Albers
  Lecture Notes in Computer Science 726, 1993, pp. 1-12