The SCEAS System
Navigation Menu

Conferences in DBLP

Annual Symposium on Foundations of Computer Science (FOCS) (focs)
2007 (conf/focs/2007)

  1. Structure and Randomness in Combinatorics. [Citation Graph (, )][DBLP]

  2. A Brief Look at Pairings Based Cryptography. [Citation Graph (, )][DBLP]

  3. Spectral Graph Theory and its Applications. [Citation Graph (, )][DBLP]

  4. Pseudorandom Bits for Polynomials. [Citation Graph (, )][DBLP]

  5. Extractors and Rank Extractors for Polynomial Sources. [Citation Graph (, )][DBLP]

  6. Polylogarithmic Independence Can Fool DNF Formulas. [Citation Graph (, )][DBLP]

  7. Derandomization of Sparse Cyclotomic Integer Zero Testing. [Citation Graph (, )][DBLP]

  8. Computing Equilibria in Anonymous Games. [Citation Graph (, )][DBLP]

  9. Mechanism Design via Differential Privacy. [Citation Graph (, )][DBLP]

  10. Balloon Popping With Applications to Ascending Auctions. [Citation Graph (, )][DBLP]

  11. On the Complexity of Nash Equilibria and Other Fixed Points (Extended Abstract). [Citation Graph (, )][DBLP]

  12. Paths Beyond Local Search: A Tight Bound for Randomized Fixed-Point Computation. [Citation Graph (, )][DBLP]

  13. Exponential Time/Space Speedups for Resolution and the PSPACE-completeness of Black-White Pebbling. [Citation Graph (, )][DBLP]

  14. Parameterized Proof Complexity. [Citation Graph (, )][DBLP]

  15. Non-Linear Index Coding Outperforming the Linear Optimum. [Citation Graph (, )][DBLP]

  16. Can you beat treewidth? [Citation Graph (, )][DBLP]

  17. Adaptive Simulated Annealing: A Near-optimal Connection between Sampling and Counting. [Citation Graph (, )][DBLP]

  18. Reconstruction for Models on Random Graphs. [Citation Graph (, )][DBLP]

  19. Mixing Time Power Laws at Criticality. [Citation Graph (, )][DBLP]

  20. Near Optimal Bounds for Collision in Pollard Rho for Discrete Log. [Citation Graph (, )][DBLP]

  21. Intrusion-Resilient Secret Sharing. [Citation Graph (, )][DBLP]

  22. Covert Multi-Party Computation. [Citation Graph (, )][DBLP]

  23. Cryptography from Sunspots: How to Use an Imperfect Reference String. [Citation Graph (, )][DBLP]

  24. Planning for Fast Connectivity Updates. [Citation Graph (, )][DBLP]

  25. Strongly History-Independent Hashing with Applications. [Citation Graph (, )][DBLP]

  26. Smooth Histograms for Sliding Windows. [Citation Graph (, )][DBLP]

  27. Lower Bounds on Streaming Algorithms for Approximating the Length of the Longest Increasing Subsequence. [Citation Graph (, )][DBLP]

  28. Towards Sharp Inapproximability For Any 2-CSP. [Citation Graph (, )][DBLP]

  29. Linear Equations Modulo 2 and the L1 Diameter of Convex Bodies. [Citation Graph (, )][DBLP]

  30. Inapproximability Results for Sparsest Cut, Optimal Linear Arrangement, and Precedence Constrained Scheduling. [Citation Graph (, )][DBLP]

  31. On the Optimality of Planar and Geometric Approximation Schemes. [Citation Graph (, )][DBLP]

  32. Hardness of Reconstructing Multivariate Polynomials over Finite Fields. [Citation Graph (, )][DBLP]

  33. Any AND-OR Formula of Size N can be Evaluated in time N1/2+o(1) on a Quantum Computer. [Citation Graph (, )][DBLP]

  34. The Power of Quantum Systems on a Line. [Citation Graph (, )][DBLP]

  35. Simulating Quantum Correlations with Finite Communication. [Citation Graph (, )][DBLP]

  36. Quantum Algorithms for Hidden Nonlinear Structures. [Citation Graph (, )][DBLP]

  37. Refuting Smoothed 3CNF Formulas. [Citation Graph (, )][DBLP]

  38. Hardness Amplification for Errorless Heuristics. [Citation Graph (, )][DBLP]

  39. One-Way Multi-Party Communication Lower Bound for Pointer Jumping with Applications. [Citation Graph (, )][DBLP]

  40. A Lower Bound for the Size of Syntactically Multilinear Arithmetic Circuits. [Citation Graph (, )][DBLP]

  41. Discrepancy and the Power of Bottom Fan-in in Depth-three Circuits. [Citation Graph (, )][DBLP]

  42. Maximizing Non-Monotone Submodular Functions. [Citation Graph (, )][DBLP]

  43. On the Hardness and Smoothed Complexity of Quasi-Concave Minimization. [Citation Graph (, )][DBLP]

  44. Approximation Algorithms for Partial-Information Based Stochastic Control with Markovian Rewards. [Citation Graph (, )][DBLP]

  45. Beating Simplex for Fractional Packing and Covering Linear Programs. [Citation Graph (, )][DBLP]

  46. A Primal-Dual Randomized Algorithm for Weighted Paging. [Citation Graph (, )][DBLP]

  47. Finding Disjoint Paths in Expanders Deterministically and Online. [Citation Graph (, )][DBLP]

  48. Almost Tight Bound for the Union of Fat Tetrahedra in Three Dimensions. [Citation Graph (, )][DBLP]

  49. Inferring Local Homology from Sampled Stratified Spaces. [Citation Graph (, )][DBLP]

  50. Testing for Concise Representations. [Citation Graph (, )][DBLP]

  51. Strong Lower Bounds for Approximating Distribution Support Size and the Distinct Elements Problem. [Citation Graph (, )][DBLP]

  52. Testing Expansion in Bounded-Degree Graphs. [Citation Graph (, )][DBLP]

  53. Approximate Hypergraph Partitioning and Applications. [Citation Graph (, )][DBLP]

  54. Sparse Random Linear Codes are Locally Decodable and Testable. [Citation Graph (, )][DBLP]

  55. Minimizing Average Flow-time : Upper and Lower Bounds. [Citation Graph (, )][DBLP]

  56. Non-Preemptive Min-Sum Scheduling with Resource Augmentation. [Citation Graph (, )][DBLP]

  57. On the Advantage over Random for Maximum Acyclic Subgraph. [Citation Graph (, )][DBLP]

  58. Buy-at-Bulk Network Design with Protection. [Citation Graph (, )][DBLP]

  59. Space-Efficient Identity Based Encryption Without Pairings. [Citation Graph (, )][DBLP]

  60. Round Complexity of Authenticated Broadcast with a Dishonest Majority. [Citation Graph (, )][DBLP]

  61. Finding Collisions in Interactive Protocols - A Tight Lower Bound on the Round Complexity of Statistically-Hiding Commitments. [Citation Graph (, )][DBLP]

  62. Lower Bounds on Signatures From Symmetric Primitives. [Citation Graph (, )][DBLP]

  63. Approximation Algorithms Using Hierarchies of Semidefinite Programming Relaxations. [Citation Graph (, )][DBLP]

  64. Integrality gaps of 2 - o(1) for Vertex Cover SDPs in the Lovész-Schrijver Hierarchy. [Citation Graph (, )][DBLP]

  65. Local Global Tradeoffs in Metric Embeddings. [Citation Graph (, )][DBLP]

  66. The Computational Hardness of Estimating Edit Distance [Extended Abstract]. [Citation Graph (, )][DBLP]

System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
System created by [] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002