Die bibliographische Datenbank LEABib

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

Suche: Series=LNCS AND Volume=4051

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

Additive approximation for edge-deletion problems
Noga Alon, Asaf Shapira, Benny Sudakov
Lecture Notes in Computer Science 4051, 2006, pp. 1-2
Testing graph isomorphism in parallel by playing a game
Martin Grohe, Oleg Verbitsky
Lecture Notes in Computer Science 4051, 2006, pp. 3-14
The spectral gap of random graphs with given expected degrees
Amin Coja-Oghlan, André Lanka
Lecture Notes in Computer Science 4051, 2006, pp. 15-26
Embedding bounded bandwidth graphs into l_1
Douglas E. Carroll, Ashish Goel, Adam Meyerson
Lecture Notes in Computer Science 4051, 2006, pp. 27-37
On counting homomorphisms to directed acyclic graphs
Martin Dyer, Leslie Ann Goldberg, Mike Paterson
Lecture Notes in Computer Science 4051, 2006, pp. 38-49
Fault-tolerance threshold for a distance-three quantum code
Ben W. Reichardt
Lecture Notes in Computer Science 4051, 2006, pp. 50-61
Lower bounds on matrix rigidity via a quantum argument
Ronald de Wolf
Lecture Notes in Computer Science 4051, 2006, pp. 62-71
Self-testing of quantum circuits
Frédéric Magniez, Dominic Mayers, Michele Mosca, Harold Ollivier
Lecture Notes in Computer Science 4051, 2006, pp. 72-83
Deterministic extractors for independent-symbol sources
Chia-Jung Lee, Chi-Jen Lu, Shi-Chun Tsai
Lecture Notes in Computer Science 4051, 2006, pp. 84-95
Gap amplification in PCPs using lazy random walks
Jaikumar Radhakrishnan
Lecture Notes in Computer Science 4051, 2006, pp. 96-107
Stopping times, metrics and approximate counting
Magnus Bordewich, Martin Dyer, Marek Karpinski
Lecture Notes in Computer Science 4051, 2006, pp. 108-119
Algebraic characterization of the finite power property
Michal Kunc
Lecture Notes in Computer Science 4051, 2006, pp. 120-131
P-completeness of cellular automaton rule 110
Turlough Neary, Damien Woods
Lecture Notes in Computer Science 4051, 2006, pp. 132-143
Small sweeping 2NFAs are not closed under complement
Christos A. Kapoutsis
Lecture Notes in Computer Science 4051, 2006, pp. 144-156
Expressive power of pebble automata
Mikoƚaj Bojańczyk, Mathias Samuelides, Thomas Schwentick, Luc Segoufin
Lecture Notes in Computer Science 4051, 2006, pp. 157-168
Delegate and conquer: An LP-based approximation algorithm for minimum degree MSTs
R. Ravi, Mohit Singh
Lecture Notes in Computer Science 4051, 2006, pp. 169-180
Better algorithms for minimizing average flow-time on related machines
Naveen Garg, Amit Kumar
Lecture Notes in Computer Science 4051, 2006, pp. 181-190
A push-relabel algorithm for approximating degree bounded MSTs
Kamalika Chaudhuri, Satish Rao, Samantha Riesenfeld, Kunal Talwar
Lecture Notes in Computer Science 4051, 2006, pp. 191-201
Edge disjoint paths in moderately connected graphs
Satish Rao, Shuheng Zhou
Lecture Notes in Computer Science 4051, 2006, pp. 202-213
A robust APTAS for the classical bin packing problem
Leah Epstein, Asaf Levin
Lecture Notes in Computer Science 4051, 2006, pp. 214-225
Better inapproximability results for MaxClique, chromatic number and Min-3Lin-Deletion
Subhash Khot, Ashok Kumar Ponnuswami
Lecture Notes in Computer Science 4051, 2006, pp. 226-237
Approximating the orthogonal knapsack problem for hypercubes
Rolf Harren
Lecture Notes in Computer Science 4051, 2006, pp. 238-249
A faster deterministic algorithm for minimum cycle bases in directed graphs
Ramesh Hariharan, Telikepalli Kavitha, Kurt Mehlhorn
Lecture Notes in Computer Science 4051, 2006, pp. 250-261
Finding the smallest H-subgraph in real weighted graphs and related problems
Virginia Vassilevska, Ryan Williams, Raphael Yuster
Lecture Notes in Computer Science 4051, 2006, pp. 262-273
Weighted bipartite matching in matrix multiplication time
Piotr Sankowski
Lecture Notes in Computer Science 4051, 2006, pp. 274-285

Seiten 1 2 3 >