Die bibliographische Datenbank LEABib

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

Suche: Series=LNCS AND Volume=959

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

The complexity of mean payoff games
Uri Zwick, Michael S. Paterson
Lecture Notes in Computer Science 959, 1995, pp. 1-10
Approximation of coNP sets by NP-complete sets
Kazuo Iwama, Shuichi Miyazaki
Lecture Notes in Computer Science 959, 1995, pp. 11-20
How to draw a planar clustered graph
Qing-Wen Feng, Robert F. Cohen, Peter Eade
Lecture Notes in Computer Science 959, 1995, pp. 21-30
An efficient orthogonal grid drawing algorithm for cubic graphs
Tiziana Calamoneri, Rossella Petreschi
Lecture Notes in Computer Science 959, 1995, pp. 31-40
Constrained independence system and triangulations of planar point sets
Siu-Wing Cheng, Yin-Feng Xu
Lecture Notes in Computer Science 959, 1995, pp. 41-50
Three dimensional weak visibility: Complexity and applications
Caoan Wang, Binhai Zhu
Lecture Notes in Computer Science 959, 1995, pp. 51-60
Rectangulating rectilinear polygons in parallel
Sung Kwon Kim
Lecture Notes in Computer Science 959, 1995, pp. 61-70
Efficient randomized incremental algorithm for the closest pair problem using Leafary trees
V. Kamakoti, Kamala Krithivasan, C. Pandu Rangan
Lecture Notes in Computer Science 959, 1995, pp. 71-80
Testing containment of object-oriented conjunctive queries is \Pi_2^p-hard
Edward P.F. Chan, Ron van der Meyden
Lecture Notes in Computer Science 959, 1995, pp. 81-90
Computing infinite relations using finite expressions: A new approach to the safety issue in relational databases
Ruogu Zhan
Lecture Notes in Computer Science 959, 1995, pp. 91-100
Set-term unification in a logic database language
Seung Jin Lim, Yiu-Kai Ng
Lecture Notes in Computer Science 959, 1995, pp. 101-110
Computations with finite closure systems and implications
Marcel Wild
Lecture Notes in Computer Science 959, 1995, pp. 111-120
Maximum tree-packing in time O(n^{5/2})
Andrzej Lingas
Lecture Notes in Computer Science 959, 1995, pp. 121-130
Optimal algorithms for feinding connected components of an unknown graph
Weiping Shi, Douglas B. West
Lecture Notes in Computer Science 959, 1995, pp. 131-140
The multi-weighted spanning tree problem
Joseph L. Ganley, Mordecai J. Golin, Jeffrey S. Salowe
Lecture Notes in Computer Science 959, 1995, pp. 141-150
Algorithmic graph embeddings
Jianer Chen
Lecture Notes in Computer Science 959, 1995, pp. 151-160
Analysis of quorum-based protocols for distributed (k+1)-exclusion
Divyakant Agrawal, Ömer Eğecioğlu, Amr El-Abbadi
Lecture Notes in Computer Science 959, 1995, pp. 161-170
A highly fault-tolerant quorum consensus method for managing replicated data
Xuemin Lin, Maria E. Orlowska
Lecture Notes in Computer Science 959, 1995, pp. 171-180
Constructing craig interpolation formulas
Guoxiang Huang
Lecture Notes in Computer Science 959, 1995, pp. 181-190
Currying of order-sorted term rewriting systems
Yoshinobu Kawabe, Naohiro Ishii
Lecture Notes in Computer Science 959, 1995, pp. 191-202
Stack and queue number of 2-trees
S. Rengarajan, C.E. Veni Madhavan
Lecture Notes in Computer Science 959, 1995, pp. 203-212
Shortest paths in random weighted graphs
Scott K. Walley, Harry H. Tan
Lecture Notes in Computer Science 959, 1995, pp. 213-222
Simple reduction of f-colorings to edge-colorings
Xiao Zhou, Takao Nishizeki
Lecture Notes in Computer Science 959, 1995, pp. 223-228
Output-size sensitiveness of OBDD construction through maximal independent set problem
Kezuyoshi Hayase, Kunihiko Sadakane, Seiichiro Tani
Lecture Notes in Computer Science 959, 1995, pp. 229-234
Small weight bases for Hamming codes
John Tromp, Louxin Zhang, Ying Zhao
Lecture Notes in Computer Science 959, 1995, pp. 235-243

Seiten 1 2 3 4 >