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 Volume=880

• A limited-backtrack greedy schema for approximation algorithms
  Vivek Arora, Vempala Santosh, Huzur Saran, Vijay V. Vazirani
  Lecture Notes in Computer Science 880, 1994, pp. 318-329
• On approximation scheme preserving reducibility and its applications
  Pierluigi Crescenzi, Luca Trevisan
  Lecture Notes in Computer Science 880, 1994, pp. 330-341
• Approximation schemes using L-reductions^{1,2,3}
  H.B. Hunt III, M.V. Marathe, V. Radhakrishnan, S.S. Ravi, D.J. Rosenkrantz, R.E. Stearns
  Lecture Notes in Computer Science 880, 1994, pp. 342-353
• An explanation of splaying
  Ashok Subramanian
  Lecture Notes in Computer Science 880, 1994, pp. 354-365
• Proving non-reachability by modulo-place-invariants
  Jörg Desel, Micaela-Daphne Radola
  Lecture Notes in Computer Science 880, 1994, pp. 366-377
• Soundness and completeness of UNITY logic
  Edgar Knapp
  Lecture Notes in Computer Science 880, 1994, pp. 378-389
• Efficient algorithms for the transformation between different types of binary decision diagrams
  Petr Savický, Ingo Wegener
  Lecture Notes in Computer Science 880, 1994, pp. 390-401
• Extending the limits of sequentially phased reasoning
  M. Siegel, F.A. Stomp
  Lecture Notes in Computer Science 880, 1994, pp. 402-413
• Foundations for faster external sorting
  Vladimir Estivill-Castro, Derick Wood
  Lecture Notes in Computer Science 880, 1994, pp. 414-425
• Branching rules for satisfiability
  J.N. Hooker, V. Vinay
  Lecture Notes in Computer Science 880, 1994, pp. 426-437
• Using linear arithmetic procedure for generating induction schemes
  Deepak Kapur, M. Subramaniam
  Lecture Notes in Computer Science 880, 1994, pp. 438-449