Die bibliographische Datenbank LEABib

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

Suche: Booktitle=Proceedings of the 2nd International Symposium on Algorithms, ISA'91 (Taipei, Republic of China, December 16-18, 1991)

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

Decision-making with incomplete information
Christos H. Papadimitriou
Lecture Notes in Computer Science 557, 1991, pp. 1-1
Maximum independet set of a permutation graph in k tracks
D.T. Lee, Majid Sarrafzadeh
Lecture Notes in Computer Science 557, 1991, pp. 2-11
Algorithms for square roots of graphs
Yaw-Ling Lin, Steven S. Skiena
Lecture Notes in Computer Science 557, 1991, pp. 12-21
Distributed k-mutual exclusion problem and k-coteries
Satoshi Fujita, Masafumi Yamashita, Tadashi Ae
Lecture Notes in Computer Science 557, 1991, pp. 22-31
Is the shuffle-exchange better than the butterfly?
Arvind Raghunathan, Huzur Saran
Lecture Notes in Computer Science 557, 1991, pp. 32-41
Weighted random assignments with application to hashing
Andrew Chi-Chi Yao
Lecture Notes in Computer Science 557, 1991, pp. 42-42
Scheduling file transfers under port and channel constraints
Shin-ichi Nakano, Takao Nishizeki
Lecture Notes in Computer Science 557, 1991, pp. 43-51
Substitution decomposition on chordal graphs and applications
Wen-Lian Hsu, Tze-Heng Ma
Lecture Notes in Computer Science 557, 1991, pp. 52-60
Mixed-searching and proper-path-width
Atsushi Takahashi, Shuichi Ueno, Yoji Kajitani
Lecture Notes in Computer Science 557, 1991, pp. 61-71
Short wire routing in convex grids
Frank Wagner, Barbara Wolfers
Lecture Notes in Computer Science 557, 1991, pp. 72-82
A new approach to knock-knee channel routing
Dorothea Wagner
Lecture Notes in Computer Science 557, 1991, pp. 83-93
Circuit partitioning algorithms: Graph model versus geometry model
Tetsuo Asano, Takeshi Tokuyama
Lecture Notes in Computer Science 557, 1991, pp. 94-103
Identifying 2-monotonic positive Boolean functions in polynomial time
E. Boros, P.L. Hammer, T. Ibaraki, K. Kawakami
Lecture Notes in Computer Science 557, 1991, pp. 104-115
An average case analysis of Monien and Speckenmeyer's mechanical theorem proving algorithm
T.H. Hu, C.Y. Tang, R.C.T. Lee
Lecture Notes in Computer Science 557, 1991, pp. 116-126
An on-line algorithm for navigating in unknown terrain
Kwong-fai Chan, Tak Wah Lam
Lecture Notes in Computer Science 557, 1991, pp. 127-136
On maintaining the width and diameter of a planar point-set online
Ravi Janardan
Lecture Notes in Computer Science 557, 1991, pp. 137-149
Optimal triangulations by retriangulating
Herbert Edelsbrunner
Lecture Notes in Computer Science 557, 1991, pp. 150-150
Approximating polygons and subdivisions with minimum link paths
Leonidas J. Guibas, John E. Hershberger, Joseph S.B. Mitchell, Jack Scott Snoeyink
Lecture Notes in Computer Science 557, 1991, pp. 151-162
An incremental algorithm for constructing shortest watchman routes
Xue-Hou Tan, Tomio Hirata, Yasuyoshi Inagaki
Lecture Notes in Computer Science 557, 1991, pp. 163-175
On hitting grid points in a convex polygon with straight lines
H.S. Lee, R.C. Chang
Lecture Notes in Computer Science 557, 1991, pp. 176-189
On the complexity of some Hamiltonian and Eulerian problems in edge-colored complete graphs
A. Benkouar, Y.G. Manoussakis, V.Th. Paschos, R. Saad
Lecture Notes in Computer Science 557, 1991, pp. 190-198
Dynamic programming on intervals
Takao Asano
Lecture Notes in Computer Science 557, 1991, pp. 199-207
Combinatorial optimization through order statistics
Wojciech Szpankowski
Lecture Notes in Computer Science 557, 1991, pp. 208-217
Combinatorics and algorithms of geometric arrangements
Leonidas J. Guibas
Lecture Notes in Computer Science 557, 1991, pp. 218-218
An analysis of randomized shear sort on the mesh computer
Susumu Hasegawa, Hiroshi Imai, Koji Hakata
Lecture Notes in Computer Science 557, 1991, pp. 219-228

Seiten 1 2 >