Die bibliographische Datenbank LEABib

Suchen • Liste der Journale • Liste der Serien • Liste der Konferenzen • Ausgewählte Publikationen	Hilfe

Suche: Series=LNCS AND Volume=3106

Als [bib] [pdf] [ps] [dvi] [xml] herunterladen.

External geometric data structures
Lars Arge
Lecture Notes in Computer Science 3106, 2004, pp. 1-1
The poisson cloning model for random graphs, random directed graphs and random k-SAT problems
Jeong Han Kim
Lecture Notes in Computer Science 3106, 2004, pp. 2-2
Robust geometric computation based on digital topology
Kokichi Sugihara
Lecture Notes in Computer Science 3106, 2004, pp. 3-12
Adjacency of optimal regions for Huffman trees
Kensuke Onishi
Lecture Notes in Computer Science 3106, 2004, pp. 13-22
A construction method for optimally universal hash families and its consequences for the existence of RBIBDs
Philipp Woelfel
Lecture Notes in Computer Science 3106, 2004, pp. 23-32
Towards constructing optimal strip move sequences
Meena Mahajan, Raghavan Rama, S. Vijayakumar
Lecture Notes in Computer Science 3106, 2004, pp. 33-42
Large triangles in the d-dimensional unit-cube
Hanno Lefmann
Lecture Notes in Computer Science 3106, 2004, pp. 43-52
Progress on maximum weight triangulation
Francis Y.L. Chin, Jianbo Qian, Cao An Wang
Lecture Notes in Computer Science 3106, 2004, pp. 53-61
Coloring octrees
Udo Adamy, Michael Hoffmann, József Solymosi, Milos̑ Stojaković
Lecture Notes in Computer Science 3106, 2004, pp. 62-71
Some open problems in decidability of brick (labelled polyomino) codes
Maƚgorzata Moczurad, Wƚodzimierz Moczurad
Lecture Notes in Computer Science 3106, 2004, pp. 72-81
Q-ary Ulam-Rényi game with weighted constrained lies
Ferdinando Cicalese, Christian Deppe, Daniele Mundici
Lecture Notes in Computer Science 3106, 2004, pp. 82-91
Necessary and sufficient numbers of cards for the transformation protocol
Koichi Koizumi, Takaaki Mizuki, Takao Nishizeki
Lecture Notes in Computer Science 3106, 2004, pp. 92-101
On the selection and assignment with minimum quantity commitments
Andrew Lim, Fan Wang, Zhou Xu
Lecture Notes in Computer Science 3106, 2004, pp. 102-111
Approximation algorithms for multicommodity flow and normalized cut problems: Implementations and experimental study
Ying Du, Danny Z. Chen, Xiaodong Wu
Lecture Notes in Computer Science 3106, 2004, pp. 112-121
Transshipment through crossdocks with inventory and time windows
Andrew Lim, Zhaowei Miao, Brian Rodrigues, Zhou Xu
Lecture Notes in Computer Science 3106, 2004, pp. 122-131
Approximated vertex cover for graphs with perfect matchings
Tomokazu Imamura, Kazuo Iwama, Tatsuie Tsukiji
Lecture Notes in Computer Science 3106, 2004, pp. 132-142
An approximation algorithm for weighted weak vertex cover problem in undirected graphs
Yong Zhang, Hong Zhu
Lecture Notes in Computer Science 3106, 2004, pp. 143-150
On the arrangement of cliques in chordal graphs with respect to the cuts
L. Sunil Chandran, N.S. Narayanaswamy
Lecture Notes in Computer Science 3106, 2004, pp. 151-160
The worst-case time complexity for generating all maximal cliques
Etsuji Tomita, Akira Tanaka, Haruhisa Takahashi
Lecture Notes in Computer Science 3106, 2004, pp. 161-170
Regular expressions for languages over infinite alphabets
Michael Kaminski, Tony Tan
Lecture Notes in Computer Science 3106, 2004, pp. 171-178
On the power of one-sided error quantum pushdown automata with classical stack operations
Masaki Nakanishi
Lecture Notes in Computer Science 3106, 2004, pp. 179-187
Learning DNFs and circuits using teaching assistants
N. Variyam Vinodchandran
Lecture Notes in Computer Science 3106, 2004, pp. 188-197
On the complexity of samples for learning
Joel Ratsaby
Lecture Notes in Computer Science 3106, 2004, pp. 198-209
New results on on-demand broadcasting with deadline via job scheduling with cancellation
Wun-Tat Chan, Tak-Wah Lam, Hing-Fung Ting, Prudence W.H. Wong
Lecture Notes in Computer Science 3106, 2004, pp. 210-218
Maximization of the size and the weight of schedules of degradable intervals
Fabien Baille, Evripidis Bampis, Christian Laforest
Lecture Notes in Computer Science 3106, 2004, pp. 219-228

Seiten 1 2 >