Die bibliographische Datenbank LEABib

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

Suche: Series=LNCS AND Volume=1097

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

Derandomization via small sample spaces
Noga Alon
Lecture Notes in Computer Science 1097, 1996, pp. 1-3
The randomized complexity of maintaining the minimum
Gerth Stlting Brodal, Shiva Chaudhuri, Jaikumar Radhakrishnan
Lecture Notes in Computer Science 1097, 1996, pp. 4-15
Faster algorithms for the nonemptiness of Streett automata and for communication protocol pruning
Monika Rauch Henzinger, Jan Arne Telle
Lecture Notes in Computer Science 1097, 1996, pp. 16-27
Service-constrained network design problems
Madhav V. Marathe, R. Ravi, R. Sundaram
Lecture Notes in Computer Science 1097, 1996, pp. 28-40
Approximate hypergraph coloring
Pierre Kelsen, Sanjeev Mahajan, Hariharan Ramesh
Lecture Notes in Computer Science 1097, 1996, pp. 41-52
Facility dispersion and remote subgraphs
Barun Chandra, Magnús M. Halldórsson
Lecture Notes in Computer Science 1097, 1996, pp. 53-65
The constrained minimum spanning tree problem
R. Ravi, M.X. Goemans
Lecture Notes in Computer Science 1097, 1996, pp. 66-75
Randomized approximation of the constraint satisfaction problem
Hoong Chuin Lau, Osamu Watanabe
Lecture Notes in Computer Science 1097, 1996, pp. 76-87
On the hardness of global and local approximation
Hartmut Klauck
Lecture Notes in Computer Science 1097, 1996, pp. 88-99
Approximation algorithms for the maximum satisfiability problem
Takao Asano, Takao Ono, Tomio Hirata
Lecture Notes in Computer Science 1097, 1996, pp. 100-111
On the hardness of approximating the minimum consistent OBDD problem
Kouichi Hirata, Shinichi Shimozono, Ayumi Shinohara
Lecture Notes in Computer Science 1097, 1996, pp. 112-123
Computing the unrooted maximum agreement subtree in sub-quadratic time
T.W. Lam, W.K. Sung, H.F. Ting
Lecture Notes in Computer Science 1097, 1996, pp. 124-135
Greedily finding a dense subgraph
Yuichi Asahiro, Kazuo Iwama, Hisao Tamaki, Takeshi Tokuyama
Lecture Notes in Computer Science 1097, 1996, pp. 136-148
Using sparsification for parametric minimum spanning tree problems
David Fernández-Baca, Giora Slutzki, David Eppstein
Lecture Notes in Computer Science 1097, 1996, pp. 149-160
Vertex partitioning problems on partial k-trees
Arvind Gupta, Damon Kaller, Sanjeev Mahajan, Tom Shermer
Lecture Notes in Computer Science 1097, 1996, pp. 161-172
Making an arbitrary filled graph minimal by removing fill edges
Jean R.S. Blair, Pinar Heggernes, Jan Arne Telle
Lecture Notes in Computer Science 1097, 1996, pp. 173-184
Sorting and searching revisited
Arne Andersson
Lecture Notes in Computer Science 1097, 1996, pp. 185-197
Lower bounds for dynamic transitive closure, planar point location, and parantheses matching
Thore Husfeldt, Theis Rauhe, Sren Skyum
Lecture Notes in Computer Science 1097, 1996, pp. 198-211
Optimal pointer algorithms for finding nearest common ancestors in dynamic trees
Stephen Alstrup, Mikkel Thorup
Lecture Notes in Computer Science 1097, 1996, pp. 212-222
Neighborhood graphs and distributed \delta+1-coloring
Pierre Kelsen
Lecture Notes in Computer Science 1097, 1996, pp. 223-233
Communication complexity of gossiping by packets
Luisa Gargano, Adele A. Rescigno, Ugo Vaccaro
Lecture Notes in Computer Science 1097, 1996, pp. 234-245
Optimal cost-sensitive distributed minimum spanning tree algorithm
Teresa Przytycka, Lisa Higham
Lecture Notes in Computer Science 1097, 1996, pp. 246-258
A linear time algorithm for the feasibility of pebble motion on trees
Vincenzo Auletta, Angelo Monti, Mimmo Parente, Pino Persiano
Lecture Notes in Computer Science 1097, 1996, pp. 259-270
Linear-time heuristics for minimum weight rectangulation
Christos Levcopoulos, Anna Östlin
Lecture Notes in Computer Science 1097, 1996, pp. 271-283
Visibility with multiple reflections
Boris Aronov, Alan R. Davis, Tamal K. Dey, Sudebkumar P. Pal, D. Chithra Prasad
Lecture Notes in Computer Science 1097, 1996, pp. 284-295

Seiten 1 2 >