Die bibliographische Datenbank LEABib

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

Suche: Series=LNCS AND Volume=8572

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

Sporadic solutions to zero-one exclusion tasks
Eli Gafni, Maurice Herlihy
Lecture Notes in Computer Science 8572, 2014, pp. 1-10
Verifying and synthesizing software with recursive functions
Viktor Kuncak
Lecture Notes in Computer Science 8572, 2014, pp. 11-25
Weak parity
Scott Aaronson, Andris Ambainis, Kaspars Balodis, Mohammad Bavarian
Lecture Notes in Computer Science 8572, 2014, pp. 26-38
Consequences of faster alignment of sequences
Amir Abboud, Virginia Vassilevska Williams, Oren Weimann
Lecture Notes in Computer Science 8572, 2014, pp. 39-51
Distance labels with optimal local stretch
Ittai Abraham, Shiri Chechik
Lecture Notes in Computer Science 8572, 2014, pp. 52-63
Time-expanded packings
David Adjiashvili, Sandro Bosio, Robert Weismantel, Rico Zenklusen
Lecture Notes in Computer Science 8572, 2014, pp. 64-76
Deterministic rectangle enclosure and offline dominance reporting on the RAM
Peyman Afshani, Timothy M. Chan, Konstantinos Tsakalidis
Lecture Notes in Computer Science 8572, 2014, pp. 77-88
The tropical shadow-vertex algorithm solves mean payoff games in polynomial time on average
Xavier Allamigeon, Pascal Benchimol, Stéphane Gaubert
Lecture Notes in Computer Science 8572, 2014, pp. 89-100
Tighter relations between sensitivity and other complexity measures
Andris Ambainis, Mohammad Bavarian, Yihan Gao, Jieming Mao, Xiaoming Sun, Song Zuo
Lecture Notes in Computer Science 8572, 2014, pp. 101-113
On hardness of jumbled indexing
Amihood Amir, Timothy M. Chan, Moshe Lewenstein, Noa Lewenstein
Lecture Notes in Computer Science 8572, 2014, pp. 114-125
Morphing planar graph drawings optimally
Patrizio Angelini, Giordano Da Lozzo, Giuseppe Di Battista, Fabrizio Frati, Maurizio Patrignani, Vincenzo Roselli
Lecture Notes in Computer Science 8572, 2014, pp. 126-137
Incremental algorithm for maintaining DFS tree for undirected graphs
Surender Baswana, Shahbaz Khan
Lecture Notes in Computer Science 8572, 2014, pp. 138-149
On the role of shared randomness in simultaneous communication
Mohammad Bavarian, Dmitry Gavinsky, Tsuyoshi Ito
Lecture Notes in Computer Science 8572, 2014, pp. 150-162
Short PCPs with projection queries
Eli Ben-Sasson, Emanuele Viola
Lecture Notes in Computer Science 8572, 2014, pp. 163-173
Star partitions of perfect graphs
René van Bevern, Robert Bredereck, Laurent Bulteau, Jiehua Chen, Vincent Froese, Rolf Niedermeier, Gerhard J. Woeginger
Lecture Notes in Computer Science 8572, 2014, pp. 174-185
Coordination mechanisms for selfish routing over time on a tree
Sayan Bhattacharya, Janardhan Kulkarni, Vahab Mirrokni
Lecture Notes in Computer Science 8572, 2014, pp. 186-197
On area-optimal planar graph drawings
Therese Biedl
Lecture Notes in Computer Science 8572, 2014, pp. 198-210
Shortest two disjoint paths in polynomial time
Andreas Björklund, Thore Husfeldt
Lecture Notes in Computer Science 8572, 2014, pp. 211-222
Listing triangles
Andreas Björklund, Rasmus Pagh, Virginia Vassilevska Williams, Uri Zwick
Lecture Notes in Computer Science 8572, 2014, pp. 223-234
On DNF approximators for monotone Boolean functions
Eric Blais, Johan Håstad, Rocco A. Servedio, Li-Yang Tan
Lecture Notes in Computer Science 8572, 2014, pp. 235-246
Internal DLA: Efficient simulation of a physical growth model
Karl Bringmann, Fabian Kuhn, Konstantinos Panagiotou, Ueli Peter, Henning Thomas
Lecture Notes in Computer Science 8572, 2014, pp. 247-258
Lower bounds for approximate LDCs
Jop Briët, Zeev Dvir, Guangda Hu, Shubhangi Saraf
Lecture Notes in Computer Science 8572, 2014, pp. 259-270
Holographic algorithms beyond matchgates
Jin-Yi Cai, Heng Guo, Tyson Williams
Lecture Notes in Computer Science 8572, 2014, pp. 271-282
Testing probability distributions underlying aggregated data
Clément Canonne, Ronitt Rubinfeld
Lecture Notes in Computer Science 8572, 2014, pp. 283-295
Parallel repetition of entangled games with exponential decay via the superposed information cost
André Chailloux, Giannicola Scarpa
Lecture Notes in Computer Science 8572, 2014, pp. 296-307

Seiten 1 2 3 4 >