The SCEAS System
Navigation Menu
Introduction
Collection Based
Clustering
Ranking
Paper Based
Journals
Conferences
DB Status
Statistics
Search

Conferences in DBLP

International Colloquium on Automata, Languages and Programming (ICALP) (icalp)
2007 (conf/icalp/2007)

  1. Bernard Chazelle
    Ushering in a New Era of Algorithm Design. [Citation Graph (0, 0)][DBLP]
    ICALP, 2007, pp:1- [Conf]
  2. Ivan Damgård
    A "proof-reading" of Some Issues in Cryptography. [Citation Graph (0, 0)][DBLP]
    ICALP, 2007, pp:2-11 [Conf]
  3. Fred B. Schneider
    Credentials-Based Authorization: Evaluation and Implementation. [Citation Graph (0, 0)][DBLP]
    ICALP, 2007, pp:12-14 [Conf]
  4. Frederic Dorn, Fedor V. Fomin, Dimitrios M. Thilikos
    Subexponential Parameterized Algorithms. [Citation Graph (0, 0)][DBLP]
    ICALP, 2007, pp:15-27 [Conf]
  5. Nikhil Bansal, Ho-Leung Chan, Kirk Pruhs
    Competitive Algorithms for Due Date Scheduling. [Citation Graph (0, 0)][DBLP]
    ICALP, 2007, pp:28-39 [Conf]
  6. George Christodoulou, Elias Koutsoupias, Annamária Kovács
    Mechanism Design for Fractional Scheduling on Unrelated Machines. [Citation Graph (0, 0)][DBLP]
    ICALP, 2007, pp:40-52 [Conf]
  7. Rajeev Motwani, Rina Panigrahy, Ying Xu 0002
    Estimating Sum by Weighted Sampling. [Citation Graph (0, 0)][DBLP]
    ICALP, 2007, pp:53-64 [Conf]
  8. Johannes Blömer, Stefanie Naewe
    Sampling Methods for Shortest Vectors, Closest Vectors and Successive Minima. [Citation Graph (0, 0)][DBLP]
    ICALP, 2007, pp:65-77 [Conf]
  9. Seth Pettie
    Low Distortion Spanners. [Citation Graph (0, 0)][DBLP]
    ICALP, 2007, pp:78-89 [Conf]
  10. André Berger, Michelangelo Grigni
    Minimum Weight 2-Edge-Connected Spanning Subgraphs in Planar Graphs. [Citation Graph (0, 0)][DBLP]
    ICALP, 2007, pp:90-101 [Conf]
  11. Amos Korman
    Labeling Schemes for Vertex Connectivity. [Citation Graph (0, 0)][DBLP]
    ICALP, 2007, pp:102-109 [Conf]
  12. Kazuo Iwama, Harumichi Nishimura, Rudy Raymond, Shigeru Yamashita
    Unbounded-Error One-Way Classical and Quantum Communication Complexity. [Citation Graph (0, 0)][DBLP]
    ICALP, 2007, pp:110-121 [Conf]
  13. Ashley Montanaro, Andreas Winter
    A Lower Bound on Entanglement-Assisted Quantum Communication Complexity. [Citation Graph (0, 0)][DBLP]
    ICALP, 2007, pp:122-133 [Conf]
  14. Paul Beame, Matei David, Toniann Pitassi, Philipp Woelfel
    Separating Deterministic from Nondeterministic NOF Multiparty Communication Complexity. [Citation Graph (0, 0)][DBLP]
    ICALP, 2007, pp:134-145 [Conf]
  15. Erik D. Demaine, Shay Mozes, Benjamin Rossman, Oren Weimann
    An Optimal Decomposition Algorithm for Tree Edit Distance. [Citation Graph (0, 0)][DBLP]
    ICALP, 2007, pp:146-157 [Conf]
  16. Dragan Bosnacki, Edith Elkind, Blaise Genest, Doron Peled
    On Commutativity Based Edge Lean Search. [Citation Graph (0, 0)][DBLP]
    ICALP, 2007, pp:158-170 [Conf]
  17. Irit Katriel, Claire Kenyon-Mathieu, Eli Upfal
    Commitment Under Uncertainty: Two-Stage Stochastic Matching Problems. [Citation Graph (0, 0)][DBLP]
    ICALP, 2007, pp:171-182 [Conf]
  18. Chi-Jen Lu, Shi-Chun Tsai, Hsin-Lung Wu
    On the Complexity of Hard-Core Set Constructions. [Citation Graph (0, 0)][DBLP]
    ICALP, 2007, pp:183-194 [Conf]
  19. Ryan O'Donnell, Karl Wimmer
    Approximation by DNF: Examples and Counterexamples. [Citation Graph (0, 0)][DBLP]
    ICALP, 2007, pp:195-206 [Conf]
  20. Peter Bürgisser, Felipe Cucker
    Exotic Quantifiers, Complexity Classes, and Complete Problems. [Citation Graph (0, 0)][DBLP]
    ICALP, 2007, pp:207-218 [Conf]
  21. Amotz Bar-Noy, Panagiotis Cheilaris, Svetlana Olonetsky, Shakhar Smorodinsky
    Online Conflict-Free Colorings for Hypergraphs. [Citation Graph (0, 0)][DBLP]
    ICALP, 2007, pp:219-230 [Conf]
  22. Pierre Fraigniaud, Cyril Gavoille, David Ilcinkas, Andrzej Pelc
    Distributed Computing with Advice: Information Sensitivity of Graph Coloring. [Citation Graph (0, 0)][DBLP]
    ICALP, 2007, pp:231-242 [Conf]
  23. Yuval Ishai, Tal Malkin, Martin J. Strauss, Rebecca N. Wright
    Private Multiparty Sampling and Approximation of Vector Combinations. [Citation Graph (0, 0)][DBLP]
    ICALP, 2007, pp:243-254 [Conf]
  24. Nenad Dedic, Payman Mohassel
    Constant-Round Private Database Queries. [Citation Graph (0, 0)][DBLP]
    ICALP, 2007, pp:255-266 [Conf]
  25. Benoit Larose, Pascal Tesson
    Universal Algebra and Hardness Results for Constraint Satisfaction Problems. [Citation Graph (0, 0)][DBLP]
    ICALP, 2007, pp:267-278 [Conf]
  26. Albert Atserias, Andrei A. Bulatov, Víctor Dalmau
    On the Power of k -Consistency. [Citation Graph (0, 0)][DBLP]
    ICALP, 2007, pp:279-290 [Conf]
  27. Nachum Dershowitz, Iddo Tzameret
    Complexity of Propositional Proofs Under a Promise. [Citation Graph (0, 0)][DBLP]
    ICALP, 2007, pp:291-302 [Conf]
  28. Tal Moran, Moni Naor, Gil Segev
    Deterministic History-Independent Strategies for Storing Information on Write-Once Memories. [Citation Graph (0, 0)][DBLP]
    ICALP, 2007, pp:303-315 [Conf]
  29. Aggelos Kiayias, Hong-Sheng Zhou
    Trading Static for Adaptive Security in Universally Composable Zero-Knowledge. [Citation Graph (0, 0)][DBLP]
    ICALP, 2007, pp:316-327 [Conf]
  30. Bruce M. Kapron, Lior Malka, Venkatesh Srinivasan
    A Characterization of Non-interactive Instance-Dependent Commitment-Schemes (NIC). [Citation Graph (0, 0)][DBLP]
    ICALP, 2007, pp:328-339 [Conf]
  31. Michael R. Fellows, Guillaume Fertin, Danny Hermelin, Stéphane Vialette
    Sharp Tractability Borderlines for Finding Connected Motifs in Vertex-Colored Graphs. [Citation Graph (0, 0)][DBLP]
    ICALP, 2007, pp:340-351 [Conf]
  32. Noga Alon, Fedor V. Fomin, Gregory Gutin, Michael Krivelevich, Saket Saurabh
    Parameterized Algorithms for Directed Maximum Leaf Problems. [Citation Graph (0, 0)][DBLP]
    ICALP, 2007, pp:352-362 [Conf]
  33. Martin Grohe, Magdalena Grüber
    Parameterized Approximability of the Disjoint Cycle Problem. [Citation Graph (0, 0)][DBLP]
    ICALP, 2007, pp:363-374 [Conf]
  34. Jiong Guo, Rolf Niedermeier
    Linear Problem Kernels for NP-Hard Problems on Planar Graphs. [Citation Graph (0, 0)][DBLP]
    ICALP, 2007, pp:375-386 [Conf]
  35. Rafail Ostrovsky, Omkant Pandey, Amit Sahai
    Private Locally Decodable Codes. [Citation Graph (0, 0)][DBLP]
    ICALP, 2007, pp:387-398 [Conf]
  36. Mihir Bellare, Thomas Ristenpart
    Hash Functions in the Dedicated-Key Setting: Design Choices and MPP Transforms. [Citation Graph (0, 0)][DBLP]
    ICALP, 2007, pp:399-410 [Conf]
  37. Mihir Bellare, Chanathip Namprempre, Gregory Neven
    Unrestricted Aggregate Signatures. [Citation Graph (0, 0)][DBLP]
    ICALP, 2007, pp:411-422 [Conf]
  38. Nishanth Chandran, Jens Groth, Amit Sahai
    Ring Signatures of Sub-linear Size Without Random Oracles. [Citation Graph (0, 0)][DBLP]
    ICALP, 2007, pp:423-434 [Conf]
  39. Noga Alon, Shai Gutner
    Balanced Families of Perfect Hash Functions and Their Applications. [Citation Graph (0, 0)][DBLP]
    ICALP, 2007, pp:435-446 [Conf]
  40. Ioannis Caragiannis, Michele Flammini, Luca Moscardelli
    An Exponential Improvement on the MST Heuristic for Minimum Energy Broadcasting in Ad Hoc Wireless Networks. [Citation Graph (0, 0)][DBLP]
    ICALP, 2007, pp:447-458 [Conf]
  41. Lutz Schröder, Dirk Pattinson
    Modular Algorithms for Heterogeneous Modal Logics. [Citation Graph (0, 0)][DBLP]
    ICALP, 2007, pp:459-471 [Conf]
  42. Luke Simon, Ajay Bansal, Ajay Mallya, Gopal Gupta
    Co-Logic Programming: Extending Logic Programming with Coinduction. [Citation Graph (0, 0)][DBLP]
    ICALP, 2007, pp:472-483 [Conf]
  43. Ben Adida, Douglas Wikström
    Offline/Online Mixing. [Citation Graph (0, 0)][DBLP]
    ICALP, 2007, pp:484-495 [Conf]
  44. Jun Furukawa, Nuttapong Attrapadung
    Fully Collusion Resistant Black-Box Traitor Revocable Broadcast Encryption with Short Private Keys. [Citation Graph (0, 0)][DBLP]
    ICALP, 2007, pp:496-508 [Conf]
  45. Meng He, J. Ian Munro, S. Srinivasa Rao
    Succinct Ordinal Trees Based on Tree Covering. [Citation Graph (0, 0)][DBLP]
    ICALP, 2007, pp:509-520 [Conf]
  46. Ankur Gupta, Wing-Kai Hon, Rahul Shah, Jeffrey Scott Vitter
    A Framework for Dynamizing Succinct Data Structures. [Citation Graph (0, 0)][DBLP]
    ICALP, 2007, pp:521-532 [Conf]
  47. Gianni Franceschini, S. Muthukrishnan
    In-Place Suffix Sorting. [Citation Graph (0, 0)][DBLP]
    ICALP, 2007, pp:533-545 [Conf]
  48. Manuel Bodirsky, Hubie Chen, Jan Kára, Timo von Oertzen
    Maximal Infinite-Valued Constraint Languages. [Citation Graph (0, 0)][DBLP]
    ICALP, 2007, pp:546-557 [Conf]
  49. Albert Atserias, Andrei A. Bulatov, Anuj Dawar
    Affine Systems of Equations and Counting Infinitary Logic. [Citation Graph (0, 0)][DBLP]
    ICALP, 2007, pp:558-570 [Conf]
  50. Stephan Kreutzer, Martin Otto, Nicole Schweikardt
    Boundedness of Monadic FO over Acyclic Structures. [Citation Graph (0, 0)][DBLP]
    ICALP, 2007, pp:571-582 [Conf]
  51. Amos Fiat, Haim Kaplan, Meital Levy, Svetlana Olonetsky
    Strong Price of Anarchy for Machine Load Balancing. [Citation Graph (0, 0)][DBLP]
    ICALP, 2007, pp:583-594 [Conf]
  52. Spyros C. Kontogiannis, Paul G. Spirakis
    Efficient Algorithms for Constant Well Supported Approximate Equilibria in Bimatrix Games. [Citation Graph (0, 0)][DBLP]
    ICALP, 2007, pp:595-606 [Conf]
  53. Marcelo P. Fiore, Chung-Kil Hur
    Equational Systems and Free Constructions (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    ICALP, 2007, pp:607-618 [Conf]
  54. Ichiro Hasuo, Bart Jacobs, Tarmo Uustalu
    Categorical Views on Computations on Trees (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    ICALP, 2007, pp:619-630 [Conf]
  55. Jin-yi Cai, Pinyan Lu
    Holographic Algorithms: The Power of Dimensionality Resolved. [Citation Graph (0, 0)][DBLP]
    ICALP, 2007, pp:631-642 [Conf]
  56. Laurent Bienvenu, Wolfgang Merkle
    Reconciling Data Compression and Kolmogorov Complexity. [Citation Graph (0, 0)][DBLP]
    ICALP, 2007, pp:643-654 [Conf]
  57. Gary L. Miller, Todd Phillips, Donald Sheehy
    Size Competitive Meshing Without Large Angles. [Citation Graph (0, 0)][DBLP]
    ICALP, 2007, pp:655-666 [Conf]
  58. James Laird
    A Fully Abstract Trace Semantics for General References. [Citation Graph (0, 0)][DBLP]
    ICALP, 2007, pp:667-679 [Conf]
  59. Jonathan K. Lee, Jens Palsberg, Fernando Magno Quintão Pereira
    Aliased Register Allocation for Straight-Line Programs Is NP-Complete. [Citation Graph (0, 0)][DBLP]
    ICALP, 2007, pp:680-691 [Conf]
  60. Sylvain Schmitz
    Conservative Ambiguity Detection in Context-Free Grammars. [Citation Graph (0, 0)][DBLP]
    ICALP, 2007, pp:692-703 [Conf]
  61. Sudipto Guha, Andrew McGregor
    Lower Bounds for Quantile Estimation in Random-Order and Multi-pass Streaming. [Citation Graph (0, 0)][DBLP]
    ICALP, 2007, pp:704-715 [Conf]
  62. Michael Elkin
    Streaming and Fully Dynamic Centralized Algorithms for Constructing and Maintaining Sparse Spanners. [Citation Graph (0, 0)][DBLP]
    ICALP, 2007, pp:716-727 [Conf]
  63. Matthew Chu, Sampath Kannan, Andrew McGregor
    Checking and Spot-Checking the Correctness of Priority Queues. [Citation Graph (0, 0)][DBLP]
    ICALP, 2007, pp:728-739 [Conf]
  64. Naoki Kobayashi, Takashi Suto
    Undecidability of 2-Label BPP Equivalences and Behavioral Type Systems for the pi -Calculus. [Citation Graph (0, 0)][DBLP]
    ICALP, 2007, pp:740-751 [Conf]
  65. Gerald Lüttgen, Walter Vogler
    Ready Simulation for Concurrency: It's Logical! [Citation Graph (0, 0)][DBLP]
    ICALP, 2007, pp:752-763 [Conf]
  66. Jean Goubault-Larrecq
    Continuous Capacities on Continuous State Spaces. [Citation Graph (0, 0)][DBLP]
    ICALP, 2007, pp:764-776 [Conf]
  67. Amin Coja-Oghlan, Konstantinos Panagiotou, Angelika Steger
    On the Chromatic Number of Random Graphs. [Citation Graph (0, 0)][DBLP]
    ICALP, 2007, pp:777-788 [Conf]
  68. Noga Alon, Amin Coja-Oghlan, Hiêp Hàn, Mihyun Kang, Vojtech Rödl, Mathias Schacht
    Quasi-randomness and Algorithmic Regularity for Graphs with General Degree Distributions. [Citation Graph (0, 0)][DBLP]
    ICALP, 2007, pp:789-800 [Conf]
  69. Markus Bläser, Holger Dell
    Complexity of the Cover Polynomial. [Citation Graph (0, 0)][DBLP]
    ICALP, 2007, pp:801-812 [Conf]
  70. Bernard Boigelot, Julien Brusten
    A Generalization of Cobham's Theorem to Automata over Real Numbers. [Citation Graph (0, 0)][DBLP]
    ICALP, 2007, pp:813-824 [Conf]
  71. Thomas Brihaye, Thomas A. Henzinger, Vinayak S. Prabhu, Jean-François Raskin
    Minimum-Time Reachability in Timed Games. [Citation Graph (0, 0)][DBLP]
    ICALP, 2007, pp:825-837 [Conf]
  72. Marcin Jurdzinski, Ashutosh Trivedi
    Reachability-Time Games on Timed Automata. [Citation Graph (0, 0)][DBLP]
    ICALP, 2007, pp:838-849 [Conf]
  73. Hugo Gimbert, Wieslaw Zielonka
    Perfect Information Stochastic Priority Games. [Citation Graph (0, 0)][DBLP]
    ICALP, 2007, pp:850-861 [Conf]
  74. Henrik Björklund, Mikolaj Bojanczyk
    Bounded Depth Data Trees. [Citation Graph (0, 0)][DBLP]
    ICALP, 2007, pp:862-874 [Conf]
  75. Wong Karianto, Christof Löding
    Unranked Tree Automata with Sibling Equalities and Disequalities. [Citation Graph (0, 0)][DBLP]
    ICALP, 2007, pp:875-887 [Conf]
  76. Marcelo Arenas, Pablo Barceló, Leonid Libkin
    Regular Languages of Nested Words: Fixed Points, Automata, and Synchronization. [Citation Graph (0, 0)][DBLP]
    ICALP, 2007, pp:888-900 [Conf]
  77. Thomas Colcombet
    A Combinatorial Theorem for Trees. [Citation Graph (0, 0)][DBLP]
    ICALP, 2007, pp:901-912 [Conf]
  78. Anuj Dawar, Martin Grohe, Stephan Kreutzer, Nicole Schweikardt
    Model Theory Makes Formulas Large. [Citation Graph (0, 0)][DBLP]
    ICALP, 2007, pp:913-924 [Conf]
  79. Laura Bozzelli, Salvatore La Torre
    Decision Problems for Lower/Upper Bound Parametric Timed Automata. [Citation Graph (0, 0)][DBLP]
    ICALP, 2007, pp:925-936 [Conf]
  80. Salvatore La Torre, Gennaro Parlato
    On the Complexity of LtlModel-Checking of Recursive State Machines. [Citation Graph (0, 0)][DBLP]
    ICALP, 2007, pp:937-948 [Conf]
  81. Matthew Cary, Atri Rudra, Ashish Sabharwal
    Paper Retraction: On the Hardness of Embeddings Between Two Finite Metrics. [Citation Graph (0, 0)][DBLP]
    ICALP, 2007, pp:949- [Conf]
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
Introduction Collection Based Clustering Ranking Paper Based Journals Conferences DB Status Statistics Search
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002