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

• Analysing deletions in competitive self-adjusting linear list algorithms
  Lucas Chi Kwong Hui, Charles U. Martel
  Lecture Notes in Computer Science 834, 1994, pp. 433-441
• Are Fibonacci heaps optimal?
  Diab Abuaiadh, Jeffrey H. Kingston
  Lecture Notes in Computer Science 834, 1994, pp. 442-450
• Simple and efficient graph compression schemes for dense and complement graphs
  Ming-Yang Kao, Shang-Hua Teng
  Lecture Notes in Computer Science 834, 1994, pp. 451-459
• Improved algorithms for coloring random graphs
  C.R. Subramanian
  Lecture Notes in Computer Science 834, 1994, pp. 460-468
• On the parallel complexity of solving recurrence equations
  Oscar H. Ibarra, Nicholas Q. Trân
  Lecture Notes in Computer Science 834, 1994, pp. 469-477
• Extended graph connectivity and its gradually increasing parallel complexity
  Chuzo Iwamoto, Kazuo Iwama
  Lecture Notes in Computer Science 834, 1994, pp. 478-486
• Parallel h-v drawings of binary trees
  Panagiotis T. Metaxas, Grammati E. Pantziou, Antonis Symvonis
  Lecture Notes in Computer Science 834, 1994, pp. 487-495
• An efficient parallel strategy for recognizing series-parallel graphs
  Sun-Yuan Hsieh, Chin-Wen Ho
  Lecture Notes in Computer Science 834, 1994, pp. 496-504
• Orthogonal queries in segments and triangles
  Takeshi Tokuyama
  Lecture Notes in Computer Science 834, 1994, pp. 505-513
• Further computational geometry in secondary memory
  Binhai Zhu
  Lecture Notes in Computer Science 834, 1994, pp. 514-522
• Shortest safari routes in simple polygon
  Xuehou Tan, Tomio Hirata
  Lecture Notes in Computer Science 834, 1994, pp. 523-531
• On greedy tetrahedralization of points in 3d
  Francis Y. Chin, Cao An Wang
  Lecture Notes in Computer Science 834, 1994, pp. 532-540
• The totally-perfect bipartite graph and its construction
  Kunihiro Fujiyoshi, Yoji Kajitani, Hiroshi Niitsu
  Lecture Notes in Computer Science 834, 1994, pp. 541-549
• k-best cuts for circular-arc graphs
  K.-H. Tsai, D.T. Lee
  Lecture Notes in Computer Science 834, 1994, pp. 550-558
• Revisiting circular arc graphs
  Lin Chen
  Lecture Notes in Computer Science 834, 1994, pp. 559-566
• Weighted irredundance of interval graphs
  C. Pandu Rangan, Maw-Shang Chang
  Lecture Notes in Computer Science 834, 1994, pp. 567-574
• A reordering operation for an ordered binary decision diagram and an extended framework for combinatorics of graphs
  Seiichiro Tani, Hiroshi Imai
  Lecture Notes in Computer Science 834, 1994, pp. 575-583
• On the size of ordered binary decision diagrams representing threshold functions
  Kazuhisa Hosaka, Yasuhiko Takenaga, Shuzo Yajima
  Lecture Notes in Computer Science 834, 1994, pp. 584-592
• Nonuniform lowness and strong nonuniform lowness
  Hong-Zhou Li, Guan-Ying Li
  Lecture Notes in Computer Science 834, 1994, pp. 593-599
• Definition and existence of super complexity cores
  Ingrid Biehl
  Lecture Notes in Computer Science 834, 1994, pp. 600-606
• Efficient algorithms for assigning chain-like tasks on a chain-like network computer
  Gilbert H. Young, Chi-Lok Chan
  Lecture Notes in Computer Science 834, 1994, pp. 607-615
• Manpower scheduling with shift change constraints
  Hoong Chuin Lau
  Lecture Notes in Computer Science 834, 1994, pp. 616-624
• Fast algorithms for transversal matroid intersection problems
  Ying Xu, Harold N. Gabow
  Lecture Notes in Computer Science 834, 1994, pp. 625-633
• A convex hull algorithm on coarse-grained multiprocessors
  Xiaotie Deng
  Lecture Notes in Computer Science 834, 1994, pp. 634-642
• A multiway merging network
  De-Lei Lee, Kenneth E. Batcher
  Lecture Notes in Computer Science 834, 1994, pp. 643-651