Die bibliographische Datenbank LEABib

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

Suche: Series=LNCS AND Volume=1004

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

Algorithmic problems arising from genome informatics
Satoru Miyano
Lecture Notes in Computer Science 1004, 1995, pp. 1-1
An approximation algorithm for alphabet indexing problem
Shinichi Shimozono
Lecture Notes in Computer Science 1004, 1995, pp. 2-11
A fast and space-economical algorithm for length-limited coding
Jyrki Katajainen, Alistair Moffat, Andrew Turpin
Lecture Notes in Computer Science 1004, 1995, pp. 12-21
Computing in linear time a chord from which a simple polygon is weakly internally visible
Binay K. Bhattacharya, Asish Mukhopadhyay
Lecture Notes in Computer Science 1004, 1995, pp. 22-31
Competitive searching in polygons - Beyond generalised streets
Amitava Datta, Christoph A. Hipke, Sven Schuierer
Lecture Notes in Computer Science 1004, 1995, pp. 32-41
Finding a shortest pair of paths on the plane with obstacles and crossing areas
Yoshiyuki Kusakari, Hitoshi Suzuki, Takao Nishizeki
Lecture Notes in Computer Science 1004, 1995, pp. 42-51
Logspace verifiers, NC, and NP
Satyanarayana V. Lokam, Meena Mahajan, V. Vinay
Lecture Notes in Computer Science 1004, 1995, pp. 52-61
Structure in average case complexity
Christoph Karg, Rainer Schuler
Lecture Notes in Computer Science 1004, 1995, pp. 62-71
Some geometric lower bounds
Hank Chien, William Steiger
Lecture Notes in Computer Science 1004, 1995, pp. 72-81
The I/O-complexity of ordered binary-decision diagram manipulation
Lars Arge
Lecture Notes in Computer Science 1004, 1995, pp. 82-91
Two arc disjoint paths in Eulerian digraphs
András Frank, Toshihide Ibaraki, Hiroshi Nagamochi
Lecture Notes in Computer Science 1004, 1995, pp. 92-101
Finding dense subgraphs
Yuichi Asahiro, Kazuo Iwama
Lecture Notes in Computer Science 1004, 1995, pp. 102-111
Finding smallest supertrees
Arvind Gupta, Naomi Nishimura
Lecture Notes in Computer Science 1004, 1995, pp. 112-121
Weighted domination on cocomparability graphs
Maw-Shang Chang
Lecture Notes in Computer Science 1004, 1995, pp. 122-131
The parallel complexity of approximatiing the high degree subgraph problem
A.E. Andreev, A. Clementi, P. Crescenzi, E. Dahlhaus, S. de Agostino, J.D.P. Rolim
Lecture Notes in Computer Science 1004, 1995, pp. 132-141
Constant ratio approximations of the weighted feedback vertex set problem for undirected graphs
Vineet Bafna, Piotr Berman, Toshihiro Fujito
Lecture Notes in Computer Science 1004, 1995, pp. 142-151
Greedy approximations of independent sets in low degree graphs
Magnús M. Halldórsson, Kiyohito Yoshihara
Lecture Notes in Computer Science 1004, 1995, pp. 152-161
Practical logic
John N. Crossley
Lecture Notes in Computer Science 1004, 1995, pp. 162-162
An approximation algorithm for MAX 3-SAT
Takao Ono, Tomio Hirata, Takao Asano
Lecture Notes in Computer Science 1004, 1995, pp. 163-170
Learning of restricted RNLC graph languages
Sei'ichi Tani, Koichi Yamazaki
Lecture Notes in Computer Science 1004, 1995, pp. 171-180
Optimal information delivery
Christos H. Papadimitriou, Srinivas Ramanathan, P. Venkat Rangan
Lecture Notes in Computer Science 1004, 1995, pp. 181-187
On the complexity of testing for catastrophic faults
N. Santoro, J. Ren, A. Nayak
Lecture Notes in Computer Science 1004, 1995, pp. 188-197
Scheduling parallel tasks with individual deadlines
Oh-Heum Kwon, Kyung-Yong Chwa
Lecture Notes in Computer Science 1004, 1995, pp. 198-207
Orders of Gauss periods in finite fields
Joachim von zur Gathen, Igor Shparlinski
Lecture Notes in Computer Science 1004, 1995, pp. 208-215
A hard problem that is almost always easy
George Havas, B.S. Majewski
Lecture Notes in Computer Science 1004, 1995, pp. 216-223

Seiten 1 2 >