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

• Improved bounds for on-line load balancing
  Matthew Andrews, Michel X. Goemans, Lisa Zhang
  Lecture Notes in Computer Science 1090, 1996, pp. 1-10
• An O(n\log n)-average-time algorithm for shortest network under a given topology
  Guoliang Xue, D.-Z. Du
  Lecture Notes in Computer Science 1090, 1996, pp. 11-20
• Steiner problems on directed acyclic graphs
  Tsan-sheng Hsu, Kuo-Hui Tsai, Da-Wei Wang, D.T. Lee
  Lecture Notes in Computer Science 1090, 1996, pp. 21-30
• Wormhole versus deflection routing: A case study on the mesh
  Efstratios Karaivazoglou, Paul Spirakis, Vasilis Triantafilou
  Lecture Notes in Computer Science 1090, 1996, pp. 31-40
• On sparse parity check matrices
  Hanno Lefmann, Pavel Pudlák, Petr Savický
  Lecture Notes in Computer Science 1090, 1996, pp. 41-49
• 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
• Combinatorial and geometric approaches to counting problems on linear matroids, graphic arrangements, and partial orders
  Hiroshi Imai, Satoru Iwata, Kyoko Sekine, Kensyu Yoshida
  Lecture Notes in Computer Science 1090, 1996, pp. 68-80
• Output-sensitive reporting of disjoint paths
  Giuseppe di Battista, Roberto Tamassia, Luca Vismara
  Lecture Notes in Computer Science 1090, 1996, pp. 81-91
• Rectangular grid drawings of plane graphs
  Md. Saidur Rahman, Shin-ichi Nakano, Takao Nishizeki
  Lecture Notes in Computer Science 1090, 1996, pp. 92-105
• Area-efficient algorithms for upward straight-line tree drawings
  Chan-Su Shin, Sung Kwon Kim, Kyung-Yong Chwa
  Lecture Notes in Computer Science 1090, 1996, pp. 106-116
• Straight skeletons for general polygonal figures in the plane
  Oswin Aichholzer, Franz Aurenhammer
  Lecture Notes in Computer Science 1090, 1996, pp. 117-126
• A note on uniform circuit lower bounds for the counting hierarchy
  Eric Allender
  Lecture Notes in Computer Science 1090, 1996, pp. 127-135
• A note on the simulation of exponential threshold weights
  Thomas Hofmeister
  Lecture Notes in Computer Science 1090, 1996, pp. 136-141
• Harmonic analysis, real approximation, and the communication complexity of Boolean functions
  Vince Grolmusz
  Lecture Notes in Computer Science 1090, 1996, pp. 142-151
• Finding large planar subgraphs and large subgraphs of a given genus
  Gruia Călinescu, Cristina G. Fernandes
  Lecture Notes in Computer Science 1090, 1996, pp. 152-161
• Efficient deterministic algorithms for embedding graphs on books
  Farhad Shahrokhi, Weiping Shi
  Lecture Notes in Computer Science 1090, 1996, pp. 162-168
• Optimal bi-level augmentation for selectively enhancing graph connectivity with applications
  Tsan-sheng Hsu, Ming-Yang Kao
  Lecture Notes in Computer Science 1090, 1996, pp. 169-178
• Exact learning of subclasses of CDNF formulas with membership queries
  Carlos Domingo
  Lecture Notes in Computer Science 1090, 1996, pp. 179-188
• Fast separator decomposition for finite-element meshes
  Shang-Hua Teng
  Lecture Notes in Computer Science 1090, 1996, pp. 189-198
• Reduction algorithms for constructing solutions in graphs with small treewidth
  Hans L. Bodlaender, Babette de Fluiter
  Lecture Notes in Computer Science 1090, 1996, pp. 199-208
• Fast RNC and NC algorithms for finding a maximal set of paths with an application
  Ryuhei Uehara, Zhi-Zhong Chen, Xin He
  Lecture Notes in Computer Science 1090, 1996, pp. 209-218
• Sparse suffix trees
  Juha Kärkkäinen, Esko Ukkonen
  Lecture Notes in Computer Science 1090, 1996, pp. 219-230
• Depth-efficient threshold circuits for multiplication and symmetric function computation
  Chi-Hsiang Yeh, Emmanouel A. Varvarigos
  Lecture Notes in Computer Science 1090, 1996, pp. 231-240
• A note on the self-witnessing property of computational problems
  V. Arvind
  Lecture Notes in Computer Science 1090, 1996, pp. 241-249