The SCEAS System
Navigation Menu

Conferences in DBLP

International Colloquium on Automata, Languages and Programming (ICALP) (icalp)
2010 (conf/icalp/2010-1)

  1. Local Search: Simple, Successful, But Sometimes Sluggish. [Citation Graph (, )][DBLP]

  2. When Conflicting Constraints Can Be Resolved - The Lovász Local Lemma and Satisfiability. [Citation Graph (, )][DBLP]

  3. Plane Spanners of Maximum Degree Six. [Citation Graph (, )][DBLP]

  4. The Positive Semidefinite Grothendieck Problem with Rank Constraint. [Citation Graph (, )][DBLP]

  5. Cycle Detection and Correction. [Citation Graph (, )][DBLP]

  6. Decomposition Width of Matroids. [Citation Graph (, )][DBLP]

  7. The Cooperative Game Theory Foundations of Network Bargaining Games. [Citation Graph (, )][DBLP]

  8. On the Existence of Pure Nash Equilibria in Weighted Congestion Games. [Citation Graph (, )][DBLP]

  9. On the Limitations of Greedy Mechanism Design for Truthful Combinatorial Auctions. [Citation Graph (, )][DBLP]

  10. Mean-Payoff Games and Propositional Proofs. [Citation Graph (, )][DBLP]

  11. Online Network Design with Outliers. [Citation Graph (, )][DBLP]

  12. Efficient Completely Non-malleable Public Key Encryption. [Citation Graph (, )][DBLP]

  13. Polynomial-Space Approximation of No-Signaling Provers. [Citation Graph (, )][DBLP]

  14. From Secrecy to Soundness: Efficient Verification via Secure Computation. [Citation Graph (, )][DBLP]

  15. Mergeable Dictionaries. [Citation Graph (, )][DBLP]

  16. Faster Algorithms for Semi-matching Problems (Extended Abstract). [Citation Graph (, )][DBLP]

  17. Clustering with Diversity. [Citation Graph (, )][DBLP]

  18. New Data Structures for Subgraph Connectivity. [Citation Graph (, )][DBLP]

  19. Tight Thresholds for Cuckoo Hashing via XORSAT. [Citation Graph (, )][DBLP]

  20. Resource Oblivious Sorting on Multicores. [Citation Graph (, )][DBLP]

  21. Interval Sorting. [Citation Graph (, )][DBLP]

  22. Inapproximability of Hypergraph Vertex Cover and Applications to Scheduling Problems. [Citation Graph (, )][DBLP]

  23. Thresholded Covering Algorithms for Robust and Max-min Optimization. [Citation Graph (, )][DBLP]

  24. Graph Homomorphisms with Complex Values: A Dichotomy Theorem. [Citation Graph (, )][DBLP]

  25. Metrical Task Systems and the k-Server Problem on HSTs. [Citation Graph (, )][DBLP]

  26. Scheduling Periodic Tasks in a Hard Real-Time Environment. [Citation Graph (, )][DBLP]

  27. Scalably Scheduling Power-Heterogeneous Processors. [Citation Graph (, )][DBLP]

  28. Better Scalable Algorithms for Broadcast Scheduling. [Citation Graph (, )][DBLP]

  29. Max-min Online Allocations with a Reordering Buffer. [Citation Graph (, )][DBLP]

  30. Orientability of Random Hypergraphs and the Power of Multiple Choices. [Citation Graph (, )][DBLP]

  31. On the Inapproximability of Vertex Cover on k-Partite k-Uniform Hypergraphs. [Citation Graph (, )][DBLP]

  32. Dynamic Programming for Graphs on Surfaces. [Citation Graph (, )][DBLP]

  33. Interval Graphs: Canonical Representation in Logspace. [Citation Graph (, )][DBLP]

  34. Approximating the Partition Function of the Ferromagnetic Potts Model. [Citation Graph (, )][DBLP]

  35. On the Relation between Polynomial Identity Testing and Finding Variable Disjoint Factors. [Citation Graph (, )][DBLP]

  36. On Sums of Roots of Unity. [Citation Graph (, )][DBLP]

  37. Exponential Time Complexity of the Permanent and the Tutte Polynomial. [Citation Graph (, )][DBLP]

  38. On Approximate Horn Formula Minimization. [Citation Graph (, )][DBLP]

  39. Choosing, Agreeing, and Eliminating in Communication Complexity. [Citation Graph (, )][DBLP]

  40. Additive Spanners in Nearly Quadratic Time. [Citation Graph (, )][DBLP]

  41. Composition Theorems in Communication Complexity. [Citation Graph (, )][DBLP]

  42. Network Design via Core Detouring for Problems without a Core. [Citation Graph (, )][DBLP]

  43. Weak Completeness Notions for Exponential Time. [Citation Graph (, )][DBLP]

  44. Efficient Evaluation of Nondeterministic Automata Using Factorization Forests. [Citation Graph (, )][DBLP]

  45. On the Complexity of Searching in Trees: Average-Case Minimization. [Citation Graph (, )][DBLP]

  46. Finding Is as Easy as Detecting for Quantum Walks. [Citation Graph (, )][DBLP]

  47. Improved Constructions for Non-adaptive Threshold Group Testing. [Citation Graph (, )][DBLP]

  48. Testing Non-uniform k-Wise Independent Distributions over Product Spaces. [Citation Graph (, )][DBLP]

  49. A Sublogarithmic Approximation for Highway and Tollbooth Pricing. [Citation Graph (, )][DBLP]

  50. Maximum Quadratic Assignment Problem: Reduction from Maximum Label Cover and LP-Based Approximation Algorithm. [Citation Graph (, )][DBLP]

  51. Cell Probe Lower Bounds and Approximations for Range Mode. [Citation Graph (, )][DBLP]

  52. SDP Gaps for 2-to-1 and Other Label-Cover Variants. [Citation Graph (, )][DBLP]

  53. Data Stream Algorithms for Codeword Testing. [Citation Graph (, )][DBLP]

  54. Streaming Algorithms for Independent Sets. [Citation Graph (, )][DBLP]

  55. Preprocessing of Min Ones Problems: A Dichotomy. [Citation Graph (, )][DBLP]

  56. Holographic Reduction: A Domain Changed Application and Its Partial Converse Theorems. [Citation Graph (, )][DBLP]

  57. Optimal Trade-Offs for Succinct String Indexes. [Citation Graph (, )][DBLP]

  58. Approximation Algorithms for Optimal Decision Trees and Adaptive TSP Problems. [Citation Graph (, )][DBLP]

  59. Concurrent Knowledge Extraction in the Public-Key Model. [Citation Graph (, )][DBLP]

  60. On the k-Independence Required by Linear Probing and Minwise Independence. [Citation Graph (, )][DBLP]

  61. Covering and Packing in Linear Space. [Citation Graph (, )][DBLP]

  62. Testing 2-Vertex Connectivity and Computing Pairs of Vertex-Disjoint s-t Paths in Digraphs. [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