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: Booktitle=Proceedings of the 13th Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS'93 (Bombay, India, December 15-17, 1993)

• Some observations about the nature of computer science
  Juris Hartmanis
  Lecture Notes in Computer Science 761, 1993, pp. 1-12
• Essential intersection type assignment
  Steffen van Bakel
  Lecture Notes in Computer Science 761, 1993, pp. 13-23
• Label-selective \lambda-calculus syntax and confluence
  Hassan Aït-Kaci, Jacques Garrigue
  Lecture Notes in Computer Science 761, 1993, pp. 24-40
• Conventional and uniqueness typing in graph rewrite systems
  Erik Barendsen, Sjaak Smetsers
  Lecture Notes in Computer Science 761, 1993, pp. 41-51
• 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
• Well-founded ordered search
  Peter J. Stuckey, S. Sudarshan
  Lecture Notes in Computer Science 761, 1993, pp. 161-171
• A real-time interval logic and its decision procedure
  Y.S. Ramakrishna, L.K. Dillon, L.E. Moser, P.M. Melliar-Smith, G. Kutty
  Lecture Notes in Computer Science 761, 1993, pp. 173-192
• On the semantics of optimization predicates in CLP languages
  François Fages
  Lecture Notes in Computer Science 761, 1993, pp. 193-204
• Incremental algorithms for constraint solving and entailment over rational trees
  Viswanath Ramachandran, Pascal Van Hentenryck
  Lecture Notes in Computer Science 761, 1993, pp. 205-217
• 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
• Compact location problems
  Venkatesh Radhakrishnan, Sven O. Krumke, Madhav V. Marathe, Daniel J. Rosenkrantz, S.S. Ravi
  Lecture Notes in Computer Science 761, 1993, pp. 238-247
• 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 lower bound for solvability of polynomial equations
  Ketan Mulmuley
  Lecture Notes in Computer Science 761, 1993, pp. 268-283
• Reuse of proofs in software verification
  Wolfgang Reif, Kurt Stenzel
  Lecture Notes in Computer Science 761, 1993, pp. 284-293
• Induce-statements and induce-expressions: Constructs for inductive programming
  Theodore S. Norvell
  Lecture Notes in Computer Science 761, 1993, pp. 294-305
• 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