Die bibliographische Datenbank LEABib

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

Suche: Series=LNCS AND Volume=8572

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

The Bose-Hubbard model is QMA-complete
Andrew M. Childs, David Gosset, Zak Webb
Lecture Notes in Computer Science 8572, 2014, pp. 308-319
Characterization of binary constraint system games
Richard Cleve, Rajat Mittal
Lecture Notes in Computer Science 8572, 2014, pp. 320-331
Fast algorithms for constructing maximum entropy summary trees
Richard Cole, Howard Karloff
Lecture Notes in Computer Science 8572, 2014, pp. 332-343
Thorp shuffling, butterflies, and non-Markovian couplings
Artur Czumaj, Berthold Vöcking
Lecture Notes in Computer Science 8572, 2014, pp. 344-355
Dynamic complexity of directed reachability and other problems
Samir Datta, William Hesse, Raghav Kulkarni
Lecture Notes in Computer Science 8572, 2014, pp. 356-367
One tile to rule them all: Simulating any tile assembly system with a single universal tile
Erik D. Demaine, Martin L. Demaine, Sándor P. Fekete, Matthew J. Patitz, Robert T. Schweller, Andrew Winslow, Damien Woods
Lecture Notes in Computer Science 8572, 2014, pp. 368-379
Canadians should travel randomly
Erik D. Demaine, Yamming Huang, Chung-Shou Liao, Kunihiko Sadakane
Lecture Notes in Computer Science 8572, 2014, pp. 380-391
Efficiency guarantees in auctions with budgets
Shahar Dobzinski, Renato Paes Leme
Lecture Notes in Computer Science 8572, 2014, pp. 392-404
Parameterized complexity of bandwidth on trees
Markus Sortland Dregi, Daniel Lokshtanov
Lecture Notes in Computer Science 8572, 2014, pp. 405-416
Testing equivalence of polynomials under shifts
Zeev Dvir, Rafael Mendes de Oliveira, Amir Shpilka
Lecture Notes in Computer Science 8572, 2014, pp. 417-428
Optimal analysis of best fit bin packing
György Dósa, Jiȓí Sgall
Lecture Notes in Computer Science 8572, 2014, pp. 429-441
Light spanners
Michael Elkin, Ofer Neiman, Shay Solomon
Lecture Notes in Computer Science 8572, 2014, pp. 442-452
Semi-streaming set cover
Yuval Emek, Adi Rosén
Lecture Notes in Computer Science 8572, 2014, pp. 453-464
Online stochastic reordering buffer scheduling
Hossein Esfandiari, MohammadTaghi Hajiaghayi, Mohammad Reza Khani, Vahid Liaghat, Hamid Mahini, Harald Räcke
Lecture Notes in Computer Science 8572, 2014, pp. 465-476
Demand queries with preprocessing
Uriel Feige, Shlomo Jozeph
Lecture Notes in Computer Science 8572, 2014, pp. 477-488
Algorithmic aspects of regular graph covers with applications to planar graphs
Jiȓí Fiala, Pavel Klavík, Jan Kratochvíl, Roman Nedela
Lecture Notes in Computer Science 8572, 2014, pp. 489-501
Public vs private coin in bounded-round information
Mark Braverman, Ankit Garg
Lecture Notes in Computer Science 8572, 2014, pp. 502-513
En route to the log-rank conjecture: New reductions and equivalent formulations
Dmitry Gavinsky, Shachar Lovett
Lecture Notes in Computer Science 8572, 2014, pp. 514-524
Improved submatrix maximum queries in Monge matrices
Paweƚ Gawrychowski, Shay Mozes, Oren Weimann
Lecture Notes in Computer Science 8572, 2014, pp. 525-537
For-all sparse recovery in near-optimal time
Anna C. Gilbert, Yi Li, Ely Porat, Martin J. Strauss
Lecture Notes in Computer Science 8572, 2014, pp. 538-550
Families with infants: A general approach to solve hard partition problems
Alexander Golovnev, Alexander S. Kulikov, Ivan Mihajlin
Lecture Notes in Computer Science 8572, 2014, pp. 551-562
Changing bases: Multistage optimization for matroids and matchings
Anupam Gupta, Kunal Talwar, Udi Wieder
Lecture Notes in Computer Science 8572, 2014, pp. 563-575
Near-optimal online algorithms for prize-collecting Steiner problems
MohammadTaghi Hajiaghayi, Vahid Liaghat, Debmalya Panigrahi
Lecture Notes in Computer Science 8572, 2014, pp. 576-587
Nearly linear-time model-based compressive sensing
Chinmay Hegde, Piotr Indyk, Ludwig Schmidt
Lecture Notes in Computer Science 8572, 2014, pp. 588-599
Breaking the PPSZ barrier for unique 3-SAT
Timon Hertli
Lecture Notes in Computer Science 8572, 2014, pp. 600-611

Seiten < 1 2 3 4 >