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 YEAR=1999

• Verifying intuition - ILF checks DAWN proofs
  Thomas Baar, Ekkart Kindler, Hagen Völzer
  Lecture Notes in Computer Science 1639, 1999, pp. 404-423
• Layout problems on lattice graphs
  Josep Díaz, Mathew D. Penrose, Jordi Petit, María Serna
  Lecture Notes in Computer Science 1627, 1999, pp. 103-112
• A new transference theorem in the geometry of numbers
  Jin-Yi Cai
  Lecture Notes in Computer Science 1627, 1999, pp. 113-122
• On covering and rank problems for Boolean matrices and their applications
  Carsten Damm, Ki Hang Kim, Fred Roush
  Lecture Notes in Computer Science 1627, 1999, pp. 123-133
• On bounds for the k-partitioning of graphs
  S.L. Bezrukov, R. Elsässer, U.-P. Schroeder
  Lecture Notes in Computer Science 1627, 1999, pp. 154-163
• Probabilities to accept languages by quantum finite automata
  Andris Ambainis, Richard Bonner, Rūsiņs̑ Freivalds, Arnolds Ķikusts
  Lecture Notes in Computer Science 1627, 1999, pp. 174-183
• On the negation-limited circuit complexity of merging
  Kazuyuki Amano, Akira Maruoka, Jun Tarui
  Lecture Notes in Computer Science 1627, 1999, pp. 204-209
• Minimizing mean response time in batch processing system
  Xiaotie Deng, Yuzhong Zhang
  Lecture Notes in Computer Science 1627, 1999, pp. 231-240
• On the complexity of approximating colored-graph problems
  Andrea E.F. Clementi, Pierluigi Crescenzi, Gianluca Rossi
  Lecture Notes in Computer Science 1627, 1999, pp. 281-290
• On the average sensitivity of testing square-free numbers
  Anna Bernasconi, Carsten Damm, Igor E. Shparlinski
  Lecture Notes in Computer Science 1627, 1999, pp. 291-299
• GCD of many integers
  Gene Cooperman, Sandra Feisel, Joachim von zur Gathen, George Havas
  Lecture Notes in Computer Science 1627, 1999, pp. 310-317
• On routing in circulant graphs
  Jin-Yi Cai, George Havas, Bernard Mans, Ajay Nerurkar, Jean-Pierre Seifert, Igor Shparlinski
  Lecture Notes in Computer Science 1627, 1999, pp. 360-369
• Maximum stabbing line in 2D plane
  Francis Y.L. Chin, Cao An Wang, Fu Lee Wang
  Lecture Notes in Computer Science 1627, 1999, pp. 379-388
• Generalized shooter location problem
  Jeet Chaudhuri, Subhas C. Nandy
  Lecture Notes in Computer Science 1627, 1999, pp. 389-399
• Improving parallel computation with fast integer sorting
  Ka Wong Chong, Yijie Han, Yoshihide Igarashi, Tak Wah Lam
  Lecture Notes in Computer Science 1627, 1999, pp. 452-461
• A combinatorial approach to performance analysis of a shared-memory multiprocessor
  Sajal K. Das, Bhabani P. Sinha, Rajarshi Chaudhuri
  Lecture Notes in Computer Science 1627, 1999, pp. 462-472
• Market split and basis reduction: Towards a solution of the Cornuéjols-Dawande instances
  Karen Aardal, Robert E. Bixby, Cor A.J. Hurkens, Arjen K. Lenstra, Job W. Smeltink
  Lecture Notes in Computer Science 1610, 1999, pp. 1-16
• Approximation algorithms for maximum coverage and max cut with given sizes of parts
  Alexander A. Ageev, Maxim I. Sviridenko
  Lecture Notes in Computer Science 1610, 1999, pp. 17-30
• Solving the convex cost integer dual network flow problem
  Ravindra K. Ahuja, Dorit S. Hochbaum, James B. Orlin
  Lecture Notes in Computer Science 1610, 1999, pp. 31-44
• Some structural and algorithmic properties of the maximum feasible subsystem problem
  Edoardo Amaldi, Marc E. Pfetsch, Leslie E., Jr. Trotter
  Lecture Notes in Computer Science 1610, 1999, pp. 45-59
• Valid inequalities for problems with additive variable upper bounds
  Alper Atamtürk, George L. Nemhauser, Martin W.P. Savelsbergh
  Lecture Notes in Computer Science 1610, 1999, pp. 60-72
• A min-max theorem on feedback vertex sets
  Mao-cheng Cai, Xiaotie Deng, Wenan Zang
  Lecture Notes in Computer Science 1610, 1999, pp. 73-86
• On the separation of maximally violated mod-k cuts
  Alberto Caprara, Matteo Fischetti, Adam N. Letchford
  Lecture Notes in Computer Science 1610, 1999, pp. 87-98
• Improved approximation algorithms for capacitated facility location problems
  Fabián A. Chudak, David P. Williamson
  Lecture Notes in Computer Science 1610, 1999, pp. 99-113
• Optimal 3-terminal cuts and linear programming
  William H. Cunningham, Lawrence Tang
  Lecture Notes in Computer Science 1610, 1999, pp. 114-125