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

• Composition of temporal logic specifications
  Adrianna Alexander
  Lecture Notes in Computer Science 3099, 2004, pp. 98-116
• On the use of coloured Petri nets for object-oriented design
  João Paulo Barros, Luís Gomes
  Lecture Notes in Computer Science 3099, 2004, pp. 117-136
• Qualitative modelling of genetic networks: From logical regulatory graphs to standard Petri nets
  Claudine Chaouiya, Elisabeth Remy, Paul Ruet, Denis Thieffry
  Lecture Notes in Computer Science 3099, 2004, pp. 137-156
• Finite unfoldings of unbounded Petri nets
  Jörg Desel, Gabriel Juhás, Christian Neumair
  Lecture Notes in Computer Science 3099, 2004, pp. 157-176
• Binary GCD like algorithms for some complex quadratic rings
  Saurabh Agarwal, Gudmund Skovberg Frandsen
  Lecture Notes in Computer Science 3076, 2004, pp. 57-71
• On the complexity of computing units in a number field
  V. Arvind, Piyush P. Kurur
  Lecture Notes in Computer Science 3076, 2004, pp. 72-86
• Implementing the arithmetic of C_{3,4} curves
  Abdolali Basiri, Andreas Enge, Jean-Charles Faugère, Nicolas Gürel
  Lecture Notes in Computer Science 3076, 2004, pp. 87-101
• Pseudocubes and primality testing
  P. Berrizbeitia, S. Müller, H.C. Williams
  Lecture Notes in Computer Science 3076, 2004, pp. 102-116
• Elliptic curves with a given number of points
  Reinier Bröker, Peter Stevenhagen
  Lecture Notes in Computer Science 3076, 2004, pp. 117-131
• Rational divisors in rational divisor classes
  N. Bruin, E.V. Flynn
  Lecture Notes in Computer Science 3076, 2004, pp. 132-139
• Conjectures about discriminants of Hecke algebras of prime level
  Frank Calegari, William A. Stein
  Lecture Notes in Computer Science 3076, 2004, pp. 140-152
• Metric inequalities and the network loading problem
  Pasquale Avella, Sara Mattia, Antonio Sassano
  Lecture Notes in Computer Science 3064, 2004, pp. 16-32
• Valid inequalities based on simple mixed-integer sets
  Sanjeeb Dash, Oktay Günlük
  Lecture Notes in Computer Science 3064, 2004, pp. 33-45
• Computational complexity, fairness, and the price of anarchy of the maximum latency problem
  José R. Correa, Andreas S. Schulz, Nicolás E. Stier Moses
  Lecture Notes in Computer Science 3064, 2004, pp. 59-73
• A robust optimization approach to supply chain management
  Dimitris Bertsimas, Aurélie Thiele
  Lecture Notes in Computer Science 3064, 2004, pp. 86-100
• Scheduling an industrial production facility
  Eyjolfur Asgeirsson, Jonathan Berry, Cynthia A. Phillips, David J. Phillips, Cliff Stein, Joel Wein
  Lecture Notes in Computer Science 3064, 2004, pp. 116-131
• Three min-max theorems concerning cyclic orders of strong digraphs
  Stéphane Bessy, Stéphan Thomassé
  Lecture Notes in Computer Science 3064, 2004, pp. 132-138
• Enumerating minimal dicuts and strongly connected subgraphs and related geometric problems
  E. Boros, K. Elbassioni, V. Gurvich, L. Khachiyan
  Lecture Notes in Computer Science 3064, 2004, pp. 152-162
• Combinatorial Benders' cuts
  Gianni Codato, Matteo Fischetti
  Lecture Notes in Computer Science 3064, 2004, pp. 178-195
• Three kinds of integer programming algorithms based on Barvinok's rational functions
  J.A. De Loera, D. Haws, R. Hemmecke, P. Huggins, R. Yoshida
  Lecture Notes in Computer Science 3064, 2004, pp. 244-255
• Single machine scheduling with precedence constraints
  José R. Correa, Andreas S. Schulz
  Lecture Notes in Computer Science 3064, 2004, pp. 283-297
• All rational polytopes are transportation polytopes and all polytopal integer sets are contingency tables
  Jesus De Loera, Shmuel Onn
  Lecture Notes in Computer Science 3064, 2004, pp. 338-351
• Minsquare factors and maxfix covers of graphs
  Nicola Apollonio, András Sebŏ
  Lecture Notes in Computer Science 3064, 2004, pp. 388-400
• Primality Testing in Polynomial Time - From Randomized Algorithms to ``PRIMES is in P''
  Martin Dietzfelbinger
  Lecture Notes in Computer Science 3000, 2004, pp. x, 147
• Individual communication complexity
  Harry Buhrman, Hartmut Klauck, Nikolai Vereshchagin, Paul Vitányi
  Lecture Notes in Computer Science 2996, 2004, pp. 19-30