Fakultät für Informatik - Technische Universität München Lehrstuhl für Effiziente Algorithmen

Die bibliographische Datenbank LEABib

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

Suche: Series=LNCS AND Volume=8572

• Privately solving linear programs
  Justin Hsu, Aaron Roth, Tim Roughgarden, Jonathan Ullman
  Lecture Notes in Computer Science 8572, 2014, pp. 612-624
• How unsplittable-flow-covering helps scheduling with job-dependent cost functions
  Wiebke Höhn, Julián Mestre, Andreas Wiese
  Lecture Notes in Computer Science 8572, 2014, pp. 625-636
• Why some heaps support constant-amortized-time decrease-key operations, and others do not
  John Iacono, Özgür Özkan
  Lecture Notes in Computer Science 8572, 2014, pp. 637-649
• Partial garbling schemes and their applications
  Yuval Ishai, Hoeteck Wee
  Lecture Notes in Computer Science 8572, 2014, pp. 650-662
• On the complexity of trial and error for constraint satisfaction problems
  Gábor Ivanyos, Raghav Kulkarni, Youming Qiao, Miklos Santha, Aarthi Sundaram
  Lecture Notes in Computer Science 8572, 2014, pp. 663-675
• Information theoretical cryptogenography
  Sune K. Jakobsen
  Lecture Notes in Computer Science 8572, 2014, pp. 676-688
• The complexity of somewhat approximation resistant predicates
  Subhash Khot, Madhur Tulsiani, Pratik Worah
  Lecture Notes in Computer Science 8572, 2014, pp. 689-700
• Approximate nonnegative rank is equivalent to the smooth rectangle bound
  Gillat Kol, Shay Moran, Amir Shpilka, Amir Yehudayoff
  Lecture Notes in Computer Science 8572, 2014, pp. 701-712
• Distance oracles for time-dependent networks
  Spyros Kontogiannis, Christos Zaroliagis
  Lecture Notes in Computer Science 8572, 2014, pp. 713-725
• Efficient indexing of necklaces and irreducible polynomials over finite fields
  Swastik Kopparty, Mrinal Kumar, Michael Saks
  Lecture Notes in Computer Science 8572, 2014, pp. 726-737
• Coloring relatives of interval overlap graphs via on-line games
  Tomasz Krawczyk, Bartosz Walczak
  Lecture Notes in Computer Science 8572, 2014, pp. 738-750
• Superpolynomial lower bounds for general homogeneous depth 4 arithmetic circuits
  Mrinal Kumar, Shubhangi Saraf
  Lecture Notes in Computer Science 8572, 2014, pp. 751-762
• Testing forest-isomorphism in the adjacency list model
  Mitsuru Kusumoto, Yuichi Yoshida
  Lecture Notes in Computer Science 8572, 2014, pp. 763-774
• Parameterized approximation schemes using graph widths
  Michael Lampis
  Lecture Notes in Computer Science 8572, 2014, pp. 775-786
• FPTAS for weighted Fibonacci gates and its applications
  Pinyan Lu, Menghui Wang, Chihao Zhang
  Lecture Notes in Computer Science 8572, 2014, pp. 787-799
• Parameterized algorithms to preserve connectivity
  Manu Basavaraju, Fedor V. Fomin, Petr Golovach, Pranabendu Misra, M.S. Ramanujan, Saket Saurabh
  Lecture Notes in Computer Science 8572, 2014, pp. 800-811
• Nonuniform graph partitioning with unrelated weights
  Konstantin Makarychev, Yury Makarychev
  Lecture Notes in Computer Science 8572, 2014, pp. 812-822
• Precedence-constrained scheduling of malleable jobs with preemption
  Konstantin Makarychev, Debmalya Panigrahi
  Lecture Notes in Computer Science 8572, 2014, pp. 823-834
• Unbounded entanglement can be needed to achieve the optimal success probability
  Laura Manc̑inska, Thomas Vidick
  Lecture Notes in Computer Science 8572, 2014, pp. 835-846
• QCSP on semicomplete digraphs
  Petar Dapić, Petar Marković, Barnaby Martin
  Lecture Notes in Computer Science 8572, 2014, pp. 847-858
• Fast pseudorandomness for independence and load balancing
  Raghu Meka, Omer Reingold, Guy N. Rothblum, Ron D. Rothblum
  Lecture Notes in Computer Science 8572, 2014, pp. 859-870
• Determining majority in networks with local interactions and very small local memory
  George B. Mertzios, Sotiris E. Nikoletseas, Christoforos L. Raptopoulos
  Lecture Notes in Computer Science 8572, 2014, pp. 871-882
• Lower bounds for oblivious subspace embeddings
  Jelani Nelson, Huy L. Nguy\skew1\tilde{\mbox{\^e}}n
  Lecture Notes in Computer Science 8572, 2014, pp. 883-894
• On input indistinguishable proof systems
  Rafail Ostrovsky, Giuseppe Persiano, Ivan Visconti
  Lecture Notes in Computer Science 8572, 2014, pp. 895-906
• Secure computation using leaky tokens
  Manoj Prabhakaran, Amit Sahai, Akshay Wadia
  Lecture Notes in Computer Science 8572, 2014, pp. 907-918