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: Booktitle=Proceedings of the 39th Annual ACM Symposium on Theory of Computing, STOC'2007 (San Diego, CA, USA, June 11-13, 2007)

• Statistically-hiding commitment from any one-way function
  Iftach Haitner, Omer Reingold
  Proceedings of the 39th Annual ACM Symposium on Theory of Computing, STOC'2007 (San Diego, CA, USA, June 11-13, 2007), 2007, pp. 1-10
• On achieving the ``best of both worlds'' in secure multiparty computation
  Jonathan Katz
  Proceedings of the 39th Annual ACM Symposium on Theory of Computing, STOC'2007 (San Diego, CA, USA, June 11-13, 2007), 2007, pp. 11-20
• Zero-knowledge from secure multiparty computation
  Yuval Ishai, Eyal Kushilevitz, Rafail Ostrovsky, Amit Sahai
  Proceedings of the 39th Annual ACM Symposium on Theory of Computing, STOC'2007 (San Diego, CA, USA, June 11-13, 2007), 2007, pp. 21-30
• Voronoi diagrams in n \cdot 2^{O(\sqrt {lg ~lg ~n} )} time
  Timothy M. Chan, Mihai Pȃtraşcu
  Proceedings of the 39th Annual ACM Symposium on Theory of Computing, STOC'2007 (San Diego, CA, USA, June 11-13, 2007), 2007, pp. 31-39
• Lower bounds for 2-dimensional range counting
  Mihai Pȃtraşcu
  Proceedings of the 39th Annual ACM Symposium on Theory of Computing, STOC'2007 (San Diego, CA, USA, June 11-13, 2007), 2007, pp. 40-46
• Combinatorial complexity in O-minimal geometry
  Saugata Basu
  Proceedings of the 39th Annual ACM Symposium on Theory of Computing, STOC'2007 (San Diego, CA, USA, June 11-13, 2007), 2007, pp. 47-56
• Faster integer multiplication
  Martin Fürer
  Proceedings of the 39th Annual ACM Symposium on Theory of Computing, STOC'2007 (San Diego, CA, USA, June 11-13, 2007), 2007, pp. 57-66
• Fourier meets Möbius: Fast subset convolution
  Andreas Björklund, Thore Husfeldt, Petteri Kaski, Mikko Koivisto
  Proceedings of the 39th Annual ACM Symposium on Theory of Computing, STOC'2007 (San Diego, CA, USA, June 11-13, 2007), 2007, pp. 67-74
• Smooth sensitivity and sampling in private data analysis
  Kobbi Nissim, Sofya Raskhodnikova, Adam Smith
  Proceedings of the 39th Annual ACM Symposium on Theory of Computing, STOC'2007 (San Diego, CA, USA, June 11-13, 2007), 2007, pp. 75-84
• The price of privacy and the limits of LP decoding
  Cynthia Dwork, Frank McSherry, Kunal Talwar
  Proceedings of the 39th Annual ACM Symposium on Theory of Computing, STOC'2007 (San Diego, CA, USA, June 11-13, 2007), 2007, pp. 85-94
• How to rank with few errors - A PTAS for weighted feedback arc set on tournaments
  Claire Kenyon-Mathieu, Warren Schudy
  Proceedings of the 39th Annual ACM Symposium on Theory of Computing, STOC'2007 (San Diego, CA, USA, June 11-13, 2007), 2007, pp. 95-103
• Approximation algorithms for budgeted learning problems
  Sudipto Guha, Kamesh Munagala
  Proceedings of the 39th Annual ACM Symposium on Theory of Computing, STOC'2007 (San Diego, CA, USA, June 11-13, 2007), 2007, pp. 104-113
• An approximation algorithm for max-min fair allocation of indivisible goods
  Arash Asadpour, Amin Saberi
  Proceedings of the 39th Annual ACM Symposium on Theory of Computing, STOC'2007 (San Diego, CA, USA, June 11-13, 2007), 2007, pp. 114-121
• Simple deterministic approximation algorithms for counting matchings
  Mohsen Bayati, David Gamarnik, Dimitriy Katz, Chandra Nair, Prasad Tetali
  Proceedings of the 39th Annual ACM Symposium on Theory of Computing, STOC'2007 (San Diego, CA, USA, June 11-13, 2007), 2007, pp. 122-127
• On the submodularity of influence in social networks
  Elchanan Mossel, Sebastien Roch
  Proceedings of the 39th Annual ACM Symposium on Theory of Computing, STOC'2007 (San Diego, CA, USA, June 11-13, 2007), 2007, pp. 128-134
• First to market is not everything: An analysis of preferential attachment with fitness
  Christian Borgs, Jennifer Chayes, Constantinos Daskalakis, Sebastien Roch
  Proceedings of the 39th Annual ACM Symposium on Theory of Computing, STOC'2007 (San Diego, CA, USA, June 11-13, 2007), 2007, pp. 135-144
• Stability of the max-weight routing and scheduling protocol in dynamic networks and at critical loads
  Matthew Andrews, Kyomin Jung, Alexander Stolyar
  Proceedings of the 39th Annual ACM Symposium on Theory of Computing, STOC'2007 (San Diego, CA, USA, June 11-13, 2007), 2007, pp. 145-154
• Tight bounds for asynchronous randomized consensus
  Hagit Attiya, Keren Censor
  Proceedings of the 39th Annual ACM Symposium on Theory of Computing, STOC'2007 (San Diego, CA, USA, June 11-13, 2007), 2007, pp. 155-164
• Hardness of routing with congestion in directed graphs
  Julia Chuzhoy, Venkatesan Guruswami, Sanjeev Khanna, Kunal Talwar
  Proceedings of the 39th Annual ACM Symposium on Theory of Computing, STOC'2007 (San Diego, CA, USA, June 11-13, 2007), 2007, pp. 165-178
• Polynomial flow-cut gaps and hardness of directed cut problems
  Julia Chuzhoy, Sanjeev Khanna
  Proceedings of the 39th Annual ACM Symposium on Theory of Computing, STOC'2007 (San Diego, CA, USA, June 11-13, 2007), 2007, pp. 179-188
• Balanced Max 2-Sat might not be the hardest
  Per Austrin
  Proceedings of the 39th Annual ACM Symposium on Theory of Computing, STOC'2007 (San Diego, CA, USA, June 11-13, 2007), 2007, pp. 189-197
• A 3-query PCP over integers
  Venkatesan Guruswami, Prasad Raghavendra
  Proceedings of the 39th Annual ACM Symposium on Theory of Computing, STOC'2007 (San Diego, CA, USA, June 11-13, 2007), 2007, pp. 198-206
• Iteratively constructing preconditioners via the conjugate gradient method
  John Dunagan, Nicholas J.A. Harvey
  Proceedings of the 39th Annual ACM Symposium on Theory of Computing, STOC'2007 (San Diego, CA, USA, June 11-13, 2007), 2007, pp. 207-216
• On the convergence of Newton's method for monotone systems of polynomial equations
  Stefan Kiefer, Michael Luttenberger, Javier Esparza
  Proceedings of the 39th Annual ACM Symposium on Theory of Computing, STOC'2007 (San Diego, CA, USA, June 11-13, 2007), 2007, pp. 217-226
• A combinatorial, primal-dual approach to semidefinite programs
  Sanjeev Arora, Satyen Kale
  Proceedings of the 39th Annual ACM Symposium on Theory of Computing, STOC'2007 (San Diego, CA, USA, June 11-13, 2007), 2007, pp. 227-236