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 [2]	Hilfe

Suche: Series=LNCS AND YEAR=1996

• Derandomization via small sample spaces
  Noga Alon
  Lecture Notes in Computer Science 1097, 1996, pp. 1-3
• The randomized complexity of maintaining the minimum
  Gerth Stlting Brodal, Shiva Chaudhuri, Jaikumar Radhakrishnan
  Lecture Notes in Computer Science 1097, 1996, pp. 4-15
• Facility dispersion and remote subgraphs
  Barun Chandra, Magnús M. Halldórsson
  Lecture Notes in Computer Science 1097, 1996, pp. 53-65
• Approximation algorithms for the maximum satisfiability problem
  Takao Asano, Takao Ono, Tomio Hirata
  Lecture Notes in Computer Science 1097, 1996, pp. 100-111
• Greedily finding a dense subgraph
  Yuichi Asahiro, Kazuo Iwama, Hisao Tamaki, Takeshi Tokuyama
  Lecture Notes in Computer Science 1097, 1996, pp. 136-148
• Making an arbitrary filled graph minimal by removing fill edges
  Jean R.S. Blair, Pinar Heggernes, Jan Arne Telle
  Lecture Notes in Computer Science 1097, 1996, pp. 173-184
• Sorting and searching revisited
  Arne Andersson
  Lecture Notes in Computer Science 1097, 1996, pp. 185-197
• Optimal pointer algorithms for finding nearest common ancestors in dynamic trees
  Stephen Alstrup, Mikkel Thorup
  Lecture Notes in Computer Science 1097, 1996, pp. 212-222
• A linear time algorithm for the feasibility of pebble motion on trees
  Vincenzo Auletta, Angelo Monti, Mimmo Parente, Pino Persiano
  Lecture Notes in Computer Science 1097, 1996, pp. 259-270
• Visibility with multiple reflections
  Boris Aronov, Alan R. Davis, Tamal K. Dey, Sudebkumar P. Pal, D. Chithra Prasad
  Lecture Notes in Computer Science 1097, 1996, pp. 284-295
• Neighbours on a grid
  Andrej Brodnik, J. Ian Munro
  Lecture Notes in Computer Science 1097, 1996, pp. 309-320
• On two dimensional packing
  Yossi Azar, Leah Epstein
  Lecture Notes in Computer Science 1097, 1996, pp. 321-332
• Optimal orthogonal drawings of triconnected plane graphs
  Therese C. Biedl
  Lecture Notes in Computer Science 1097, 1996, pp. 333-344
• The deterministic complexity of parallel multisearch
  Armin Bäumker, Wolfgang Dittrich, Andrea Pietracaprina
  Lecture Notes in Computer Science 1097, 1996, pp. 404-415
• Priority queues on parallel machines
  Gerth Stlting Brodal
  Lecture Notes in Computer Science 1097, 1996, pp. 416-427
• Boolean analysis of incomplete examples
  Endre Boros, Toshihide Ibaraki, Kazuhisa Makino
  Lecture Notes in Computer Science 1097, 1996, pp. 440-451
• Modeling concurrent systems: Actors, nets, and the problem of abstraction and composition
  Gul A. Agha
  Lecture Notes in Computer Science 1091, 1996, pp. 1-10
• On liveness and controlled siphons in Petri nets
  Kamel Barkaoui, Jean-François Pradat-Peyre
  Lecture Notes in Computer Science 1091, 1996, pp. 57-72
• Behavioural and structural composition rules preserving liveness by synchronization for colored FIFO nets
  Mohamed-Lyes Benalycherif, Claude Girault
  Lecture Notes in Computer Science 1091, 1996, pp. 73-92
• High level synthesis of synchronous parallel controllers
  Krzysztof Biliński, Erik L. Dagless
  Lecture Notes in Computer Science 1091, 1996, pp. 93-112
• Non sequential semantics for contextual P/T nets
  Nadia Busi, G. Michele Pinna
  Lecture Notes in Computer Science 1091, 1996, pp. 113-132
• Improved bounds for on-line load balancing
  Matthew Andrews, Michel X. Goemans, Lisa Zhang
  Lecture Notes in Computer Science 1090, 1996, pp. 1-10
• Finding a hidden code by asking questions
  Zhixiang Chen, Carlos Cunha, Steven Homer
  Lecture Notes in Computer Science 1090, 1996, pp. 50-55
• Improved length lower bounds for reflecting sequences
  H.K. Dai, K E. Flannery
  Lecture Notes in Computer Science 1090, 1996, pp. 56-67
• Straight skeletons for general polygonal figures in the plane
  Oswin Aichholzer, Franz Aurenhammer
  Lecture Notes in Computer Science 1090, 1996, pp. 117-126