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

• Benchmarks and standards for the evaluation of parallel job schedulers
  Steve J. Chapin, Walfredo Cirne, Dror G. Feitelson, James Patton Jones, Scott T. Leutenegger, Uwe Schwiegelshohn, Warren Smith, David Talby
  Lecture Notes in Computer Science 1659, 1999, pp. 67-90
• The effect of correlating quantum allocation and job size for gang scheduling
  Gaurav Chare, Scott T. Leutenegger
  Lecture Notes in Computer Science 1659, 1999, pp. 91-110
• The legion resource management system
  Steve J. Chapin, Dimitrios Katramatos, John Karpovich, Andrew S. Grimshaw
  Lecture Notes in Computer Science 1659, 1999, pp. 162-178
• Physical mapping with repeated probes: The hypergraph superstring problem
  Serafim Batzoglou, Sorin Istrail
  Lecture Notes in Computer Science 1645, 1999, pp. 66-77
• On the complexity of positional sequencing by hybridization
  Amir Ben-Dor, Itsik Pe'er, Ron Shamir, Roded Sharan
  Lecture Notes in Computer Science 1645, 1999, pp. 88-100
• Finding maximal pairs with bounded gap
  Gerth Stlting Brodal, Rune B. Lyngs, Christian N.S. Pedersen, Jens Stoye
  Lecture Notes in Computer Science 1645, 1999, pp. 134-149
• Matching of spots in 2D electrophoresis images - Point matching under non-uniform distortions
  Tatsuya Akutsu, Kyotetsu Kanaya, Akira Ohyama, Asao Fujiyama
  Lecture Notes in Computer Science 1645, 1999, pp. 212-222
• Generating hard instances of the short basis problem
  Miklós Ajtai
  Lecture Notes in Computer Science 1644, 1999, pp. 1-9
• Wide area computation
  Luca Cardelli
  Lecture Notes in Computer Science 1644, 1999, pp. 10-24
• Proof techniques for cryptographic protocols
  Kevin J. Compton, Scott Dexter
  Lecture Notes in Computer Science 1644, 1999, pp. 25-39
• Type structure for low-level programming languages
  Karl Crary, Greg Morrisett
  Lecture Notes in Computer Science 1644, 1999, pp. 40-54
• Real computations with fake numbers
  Felipe Cucker
  Lecture Notes in Computer Science 1644, 1999, pp. 55-73
• Bounded depth arithmetic circuits: Counting and closure
  Eric Allender, Andris Ambainis, David A. Mix Barrington, Samir Datta, Huong LêThanh
  Lecture Notes in Computer Science 1644, 1999, pp. 149-158
• Parametric temporal logic for ``model measuring''
  Rajeev Alur, Kousha Etessami, Salvatore La Torre, Doron Peled
  Lecture Notes in Computer Science 1644, 1999, pp. 159-168
• Communicating hierarchical state machines
  Rajeev Alur, Sampath Kannan, Mihalis Yannakakis
  Lecture Notes in Computer Science 1644, 1999, pp. 169-178
• Small pseudo-random sets yield hard functions: New tight explicit lower bounds for branching programs
  Alexander E. Andreev, Juri L. Baskakov, Andrea E.F. Clementi, José D.P. Rolim
  Lecture Notes in Computer Science 1644, 1999, pp. 179-189
• General morphisms of Petri nets
  Marek A. Bednarczyk, Andrzej M. Borzyszkowski
  Lecture Notes in Computer Science 1644, 1999, pp. 190-199
• On some tighter inapproximability results
  Piotr Berman, Marek Karpinski
  Lecture Notes in Computer Science 1644, 1999, pp. 200-209
• Decomposition and composition of timed automata
  Patricia Bouyer, Antoine Petit
  Lecture Notes in Computer Science 1644, 1999, pp. 210-219
• New applications of the incompressibility method
  Harry Buhrman, Tao Jiang, Ming Li, Paul Vitányi
  Lecture Notes in Computer Science 1644, 1999, pp. 220-229
• Mobility types for mobile ambients
  Luca Cardelli, Giorgio Ghelli, Andrew D. Gordon
  Lecture Notes in Computer Science 1644, 1999, pp. 230-239
• Protein folding, the Levinthal paradox and rapidly mixing Markov chains
  Peter Clote
  Lecture Notes in Computer Science 1644, 1999, pp. 240-249
• Decidable fragments of simultaneous rigid reachability
  Veronique Cortier, Harald Ganzinger, Florent Jacquemard, Margus Veanes
  Lecture Notes in Computer Science 1644, 1999, pp. 250-260
• Text compression using antidictionaries
  M. Crochmore, F. Mignosi, A. Restivo, S. Salemi
  Lecture Notes in Computer Science 1644, 1999, pp. 261-270
• Timed alternating tree automata: The automata-theoretic solution to the TCTL model checking problem
  Martin Dickhöfer, Thomas Wilke
  Lecture Notes in Computer Science 1644, 1999, pp. 281-290