Conferences in DBLP
Robert Harper Self-Adjusting Computation. [Citation Graph (0, 0)][DBLP ] ICALP, 2004, pp:1-2 [Conf ] Monika Rauch Henzinger The Past, Present, and Future of Web Search Engines p. [Citation Graph (0, 0)][DBLP ] ICALP, 2004, pp:3- [Conf ] Martin Hofmann What Do Program Logics and Type Systems Have in Common? [Citation Graph (0, 0)][DBLP ] ICALP, 2004, pp:4-7 [Conf ] Alexander A. Razborov Feasible Proofs and Computations: Partnership and Fusion. [Citation Graph (0, 0)][DBLP ] ICALP, 2004, pp:8-14 [Conf ] Wojciech Rytter Grammar Compression, LZ-Encodings, and String Algorithms with Implicit Input. [Citation Graph (0, 0)][DBLP ] ICALP, 2004, pp:15-27 [Conf ] Mihalis Yannakakis Testing, Optimizaton, and Games. [Citation Graph (0, 0)][DBLP ] ICALP, 2004, pp:28-45 [Conf ] Martín Abadi , Véronique Cortier Deciding Knowledge in Security Protocols Under Equational Theories. [Citation Graph (0, 0)][DBLP ] ICALP, 2004, pp:46-58 [Conf ] Michael Abbott , Thorsten Altenkirch , Neil Ghani Representing Nested Inductive Types Using W-Types. [Citation Graph (0, 0)][DBLP ] ICALP, 2004, pp:59-71 [Conf ] Gagan Aggarwal , Tomás Feder , Rajeev Motwani , An Zhu Algorithms for Multi-product Pricing. [Citation Graph (0, 0)][DBLP ] ICALP, 2004, pp:72-83 [Conf ] Michael Alekhnovich , Edward A. Hirsch , Dmitry Itsykson Exponential Lower Bounds for the Running Time of DPLL Algorithms on Satisfiable Formulas. [Citation Graph (0, 0)][DBLP ] ICALP, 2004, pp:84-96 [Conf ] Luca de Alfaro , Marco Faella , Mariëlle Stoelinga Linear and Branching Metrics for Quantitative Transition Systems. [Citation Graph (0, 0)][DBLP ] ICALP, 2004, pp:97-109 [Conf ] Noga Alon , Vera Asodi Learning a Hidden Subgraph. [Citation Graph (0, 0)][DBLP ] ICALP, 2004, pp:110-121 [Conf ] Rajeev Alur , Mikhail Bernadsky , P. Madhusudan Optimal Reachability for Weighted Timed Games. [Citation Graph (0, 0)][DBLP ] ICALP, 2004, pp:122-133 [Conf ] Matthew Andrews , Lisa Zhang Wavelength Assignment in Optical Networks with Fixed Fiber Capacity. [Citation Graph (0, 0)][DBLP ] ICALP, 2004, pp:134-145 [Conf ] Lars Arge , Ulrich Meyer , Laura Toma External Memory Algorithms for Diameter and All-Pairs Shortest-Paths on Sparse Graphs. [Citation Graph (0, 0)][DBLP ] ICALP, 2004, pp:146-157 [Conf ] Robert Atkey A lambda-Calculus for Resource Separation. [Citation Graph (0, 0)][DBLP ] ICALP, 2004, pp:158-170 [Conf ] Vincenzo Auletta , Roberto De Prisco , Paolo Penna , Giuseppe Persiano The Power of Verification for One-Parameter Agents. [Citation Graph (0, 0)][DBLP ] ICALP, 2004, pp:171-182 [Conf ] Baruch Awerbuch , Christian Scheideler Group Spreading: A Protocol for Provably Secure Distributed Name Service. [Citation Graph (0, 0)][DBLP ] ICALP, 2004, pp:183-195 [Conf ] Nikhil Bansal , Lisa Fleischer , Tracy Kimbrel , Mohammad Mahdian , Baruch Schieber , Maxim Sviridenko Further Improvements in Competitive Guarantees for QoS Buffering. [Citation Graph (0, 0)][DBLP ] ICALP, 2004, pp:196-207 [Conf ] Noam Berger , Christian Borgs , Jennifer T. Chayes , R. M. D'Souza , Robert D. Kleinberg Competition-Induced Preferential Attachment. [Citation Graph (0, 0)][DBLP ] ICALP, 2004, pp:208-221 [Conf ] Andreas Björklund , Thore Husfeldt , Sanjeev Khanna Approximating Longest Directed Paths and Cycles. [Citation Graph (0, 0)][DBLP ] ICALP, 2004, pp:222-233 [Conf ] Carlo Blundo , Paolo D'Arco , Alfredo De Santis Definitions and Bounds for Self-Healing Key Distribution Schemes. [Citation Graph (0, 0)][DBLP ] ICALP, 2004, pp:234-245 [Conf ] Mikolaj Bojanczyk , Thomas Colcombet Tree-Walking Automata Cannot Be Determinized. [Citation Graph (0, 0)][DBLP ] ICALP, 2004, pp:246-256 [Conf ] Pierre Boudes Projecting Games on Hypercoherences. [Citation Graph (0, 0)][DBLP ] ICALP, 2004, pp:257-268 [Conf ] Olivier Bournez , Emmanuel Hainry An Analog Characterization of Elementarily Computable Functions over the Real Numbers. [Citation Graph (0, 0)][DBLP ] ICALP, 2004, pp:269-280 [Conf ] Glenn Bruns , Patrice Godefroid Model Checking with Multi-valued Logics. [Citation Graph (0, 0)][DBLP ] ICALP, 2004, pp:281-293 [Conf ] Andrei A. Bulatov , Martin Grohe The Complexity of Partition Functions. [Citation Graph (0, 0)][DBLP ] ICALP, 2004, pp:294-306 [Conf ] Nadia Busi , Maurizio Gabbrielli , Gianluigi Zavattaro Comparing Recursion, Replication, and Iteration in Process Calculi. [Citation Graph (0, 0)][DBLP ] ICALP, 2004, pp:307-319 [Conf ] Ning Chen , Xiaotie Deng , Xiaoming Sun , Andrew Chi-Chih Yao Dynamic Price Sequence and Incentive Compatibility (Extended Abstract). [Citation Graph (0, 0)][DBLP ] ICALP, 2004, pp:320-331 [Conf ] James Cheney The Complexity of Equivariant Unification. [Citation Graph (0, 0)][DBLP ] ICALP, 2004, pp:332-344 [Conf ] George Christodoulou , Elias Koutsoupias , Akash Nanavati Coordination Mechanisms. [Citation Graph (0, 0)][DBLP ] ICALP, 2004, pp:345-357 [Conf ] Marek Chrobak , Wojciech Jawor , Jiri Sgall , Tomás Tichý Online Scheduling of Equal-Length Jobs: Randomization and Restarts Help. [Citation Graph (0, 0)][DBLP ] ICALP, 2004, pp:358-370 [Conf ] Bruno Codenotti , Kasturi R. Varadarajan Efficient Computation of Equilibrium Prices for Markets with Leontief Utilities. [Citation Graph (0, 0)][DBLP ] ICALP, 2004, pp:371-382 [Conf ] Amin Coja-Oghlan Coloring Semirandom Graphs Optimally. [Citation Graph (0, 0)][DBLP ] ICALP, 2004, pp:383-395 [Conf ] Artur Czumaj , Christian Sohler Sublinear-Time Approximation for Clustering Via Random Sampling. [Citation Graph (0, 0)][DBLP ] ICALP, 2004, pp:396-407 [Conf ] Robert Dabrowski , Wojciech Plandowski Solving Two-Variable Word Equations (Extended Abstract). [Citation Graph (0, 0)][DBLP ] ICALP, 2004, pp:408-419 [Conf ] Anuj Dawar , Erich Grädel , Stephan Kreutzer Backtracking Games and Inflationary Fixed Points. [Citation Graph (0, 0)][DBLP ] ICALP, 2004, pp:420-432 [Conf ] Xiaotie Deng , Guojun Li A PTAS for Embedding Hypergraph in a Cycle (Extended Abstract). [Citation Graph (0, 0)][DBLP ] ICALP, 2004, pp:433-444 [Conf ] Yuxin Deng , Davide Sangiorgi Towards an Algebraic Theory of Typed Mobile Processes. [Citation Graph (0, 0)][DBLP ] ICALP, 2004, pp:445-456 [Conf ] Bruno Durand , Andrei A. Muchnik , Maxim Ushakov , Nikolai K. Vereshchagin Ecological Turing Machines. [Citation Graph (0, 0)][DBLP ] ICALP, 2004, pp:457-468 [Conf ] Zdenek Dvorak , Daniel Král , Ondrej Pangrác Locally Consistent Constraint Satisfaction Problems: (Extended Abstract). [Citation Graph (0, 0)][DBLP ] ICALP, 2004, pp:469-480 [Conf ] Christoph Dürr , Mark Heiligman , Peter Høyer , Mehdi Mhalla Quantum Query Complexity of Some Graph Problems. [Citation Graph (0, 0)][DBLP ] ICALP, 2004, pp:481-493 [Conf ] Abbas Edalat , Dirk Pattinson A Domain Theoretic Account of Picard's Theorem. [Citation Graph (0, 0)][DBLP ] ICALP, 2004, pp:494-505 [Conf ] Claudia Faggian Interactive Observability in Ludics. [Citation Graph (0, 0)][DBLP ] ICALP, 2004, pp:506-518 [Conf ] Uriel Feige , Eran Ofek Easily Refutable Subformulas of Large Random 3CNF Formulas. [Citation Graph (0, 0)][DBLP ] ICALP, 2004, pp:519-530 [Conf ] Joan Feigenbaum , Sampath Kannan , Andrew McGregor , Siddharth Suri , Jian Zhang On Graph Problems in a Semi-streaming Model. [Citation Graph (0, 0)][DBLP ] ICALP, 2004, pp:531-543 [Conf ] Lisa Fleischer Linear Tolls Suffice: New Bounds and Algorithms for Tolls in Single Source Networks. [Citation Graph (0, 0)][DBLP ] ICALP, 2004, pp:544-554 [Conf ] Jörg Flum , Martin Grohe , Mark Weyer Bounded Fixed-Parameter Tractability and log2 n Nondeterministic Bits. [Citation Graph (0, 0)][DBLP ] ICALP, 2004, pp:555-567 [Conf ] Fedor V. Fomin , Dieter Kratsch , Ioan Todinca Exact (Exponential) Algorithms for Treewidth and Minimum Fill-In. [Citation Graph (0, 0)][DBLP ] ICALP, 2004, pp:568-580 [Conf ] Fedor V. Fomin , Dimitrios M. Thilikos Fast Parameterized Algorithms for Graphs on Surfaces: Linear Kernel and Exponential Speed-Up. [Citation Graph (0, 0)][DBLP ] ICALP, 2004, pp:581-592 [Conf ] Dimitris Fotakis , Spyros C. Kontogiannis , Paul G. Spirakis Selfish Unsplittable Flows. [Citation Graph (0, 0)][DBLP ] ICALP, 2004, pp:593-605 [Conf ] Gianni Franceschini , Roberto Grossi A General Technique for Managing Strings in Comparison-Driven Data Structures. [Citation Graph (0, 0)][DBLP ] ICALP, 2004, pp:606-617 [Conf ] Alain Frisch , Luca Cardelli Greedy Regular Expression Matching. [Citation Graph (0, 0)][DBLP ] ICALP, 2004, pp:618-629 [Conf ] Bin Fu , Wei Wang A 2O(n1-(1/d) log n) Time Algorithm for d-Dimensional Protein Folding in the HP-Model. [Citation Graph (0, 0)][DBLP ] ICALP, 2004, pp:630-644 [Conf ] Martin Gairing , Thomas Lücking , Marios Mavronicolas , Burkhard Monien , Manuel Rode Nash Equilibria in Discrete Routing Games with Convex Latency Functions. [Citation Graph (0, 0)][DBLP ] ICALP, 2004, pp:645-657 [Conf ] Rajiv Gandhi , Magnús M. Halldórsson , Guy Kortsarz , Hadas Shachnai Improved Results for Data Migration and Open Shop Scheduling. [Citation Graph (0, 0)][DBLP ] ICALP, 2004, pp:658-669 [Conf ] Leszek Gasieniec , Evangelos Kranakis , Andrzej Pelc , Qin Xin Deterministic M2M Multicast in Radio Networks: (Extended Abstract). [Citation Graph (0, 0)][DBLP ] ICALP, 2004, pp:670-682 [Conf ] Dan R. Ghica , Andrzej S. Murawski , C.-H. Luke Ong Syntactic Control of Concurrency. [Citation Graph (0, 0)][DBLP ] ICALP, 2004, pp:683-694 [Conf ] Venkatesan Guruswami , Piotr Indyk Linear-Time List Decoding in Error-Free Settings: (Extended Abstract). [Citation Graph (0, 0)][DBLP ] ICALP, 2004, pp:695-707 [Conf ] Esfandiar Haghverdi , Philip J. Scott A Categorical Model for the Geometry of Interaction. [Citation Graph (0, 0)][DBLP ] ICALP, 2004, pp:708-720 [Conf ] Shirley Halevy , Eyal Kushilevitz Testing Monotonicity over Graph Products. [Citation Graph (0, 0)][DBLP ] ICALP, 2004, pp:721-732 [Conf ] Eran Halperin , Richard M. Karp The Minimum-Entropy Set Cover Problem. [Citation Graph (0, 0)][DBLP ] ICALP, 2004, pp:733-744 [Conf ] Prahladh Harsha , Yuval Ishai , Joe Kilian , Kobbi Nissim , Srinivasan Venkatesh Communication Versus Computation. [Citation Graph (0, 0)][DBLP ] ICALP, 2004, pp:745-756 [Conf ] Brent Heeringa , Micah Adler Optimal Website Design with the Constrained Subtree Selection Problem. [Citation Graph (0, 0)][DBLP ] ICALP, 2004, pp:757-769 [Conf ] Shlomo Hoory , Avner Magen , Steven Myers , Charles Rackoff Simple Permutations Mix Well. [Citation Graph (0, 0)][DBLP ] ICALP, 2004, pp:770-781 [Conf ] Piotr Indyk , Moshe Lewenstein , Ohad Lipsky , Ely Porat Closest Pair Problems in Very High Dimensions. [Citation Graph (0, 0)][DBLP ] ICALP, 2004, pp:782-792 [Conf ] Emmanuel Jeandel Universality in Quantum Computation. [Citation Graph (0, 0)][DBLP ] ICALP, 2004, pp:793-804 [Conf ] Raja Jothi , Balaji Raghavachari Approximation Algorithms for the Capacitated Minimum Spanning Tree Problem and Its Variants in Network Design. [Citation Graph (0, 0)][DBLP ] ICALP, 2004, pp:805-818 [Conf ] Bala Kalyanasundaram , Mahendran Velauthapillai Fairness to All While Downsizing. [Citation Graph (0, 0)][DBLP ] ICALP, 2004, pp:819-830 [Conf ] Shin-ya Katsumata A Generalisation of Pre-logical Predicates to Simply Typed Formal Systems. [Citation Graph (0, 0)][DBLP ] ICALP, 2004, pp:831-845 [Conf ] Telikepalli Kavitha , Kurt Mehlhorn , Dimitrios Michail , Katarzyna E. Paluch A Faster Algorithm for Minimum Cycle Basis of Graphs. [Citation Graph (0, 0)][DBLP ] ICALP, 2004, pp:846-857 [Conf ] Robert Krauthgamer , James R. Lee The Black-Box Complexity of Nearest Neighbor Search. [Citation Graph (0, 0)][DBLP ] ICALP, 2004, pp:858-869 [Conf ] Michal Kunc Regular Solutions of Language Inequalities and Well Quasi-orders. [Citation Graph (0, 0)][DBLP ] ICALP, 2004, pp:870-881 [Conf ] James Laird A Calculus of Coroutines. [Citation Graph (0, 0)][DBLP ] ICALP, 2004, pp:882-893 [Conf ] Emmanuelle Lebhar , Nicolas Schabanel Almost Optimal Decentralized Routing in Long-Range Contact Networks. [Citation Graph (0, 0)][DBLP ] ICALP, 2004, pp:894-905 [Conf ] Markus Lohrey Word Problems on Compressed Words. [Citation Graph (0, 0)][DBLP ] ICALP, 2004, pp:906-918 [Conf ] Rune B. Lyngsø Complexity of Pseudoknot Prediction in Simple Models. [Citation Graph (0, 0)][DBLP ] ICALP, 2004, pp:919-931 [Conf ] Frédéric Magniez , Michel de Rougemont Property Testing of Regular Tree Languages. [Citation Graph (0, 0)][DBLP ] ICALP, 2004, pp:932-944 [Conf ] Keye Martin Entropy as a Fixed Point. [Citation Graph (0, 0)][DBLP ] ICALP, 2004, pp:945-958 [Conf ] Klaus Meer Transparent Long Proofs: A First PCP Theorem for NPR . [Citation Graph (0, 0)][DBLP ] ICALP, 2004, pp:959-970 [Conf ] Dieter van Melkebeek , Ran Raz A Time Lower Bound for Satisfiability. [Citation Graph (0, 0)][DBLP ] ICALP, 2004, pp:971-982 [Conf ] Wolfgang Merkle , Nenad Mihailovic , Theodore A. Slaman Some Results on Effective Randomness. [Citation Graph (0, 0)][DBLP ] ICALP, 2004, pp:983-995 [Conf ] Gatis Midrijanis A Polynomial Quantum Query Lower Bound for the Set Equality Problem. [Citation Graph (0, 0)][DBLP ] ICALP, 2004, pp:996-1005 [Conf ] J. Ian Munro , S. Srinivasa Rao Succinct Representations of Functions. [Citation Graph (0, 0)][DBLP ] ICALP, 2004, pp:1006-1015 [Conf ] Markus Müller-Olm , Helmut Seidl A Note on Karr's Algorithm. [Citation Graph (0, 0)][DBLP ] ICALP, 2004, pp:1016-1028 [Conf ] Sotiris E. Nikoletseas , Christoforos Raptopoulos , Paul G. Spirakis The Existence and Efficient Construction of Large Independent Sets in General Random Intersection Graphs. [Citation Graph (0, 0)][DBLP ] ICALP, 2004, pp:1029-1040 [Conf ] Rafail Ostrovsky , Charles Rackoff , Adam Smith Efficient Consistency Proofs for Generalized Queries on a Committed Database. [Citation Graph (0, 0)][DBLP ] ICALP, 2004, pp:1041-1053 [Conf ] Katarzyna E. Paluch A 2(1/8)-Approximation Algorithm for Rectangle Tiling. [Citation Graph (0, 0)][DBLP ] ICALP, 2004, pp:1054-1065 [Conf ] Grigore Rosu Extensional Theories and Rewriting. [Citation Graph (0, 0)][DBLP ] ICALP, 2004, pp:1066-1079 [Conf ] Süleyman Cenk Sahinalp , Andrey Utis Hardness of String Similarity Search and Other Indexing Problems. [Citation Graph (0, 0)][DBLP ] ICALP, 2004, pp:1080-1098 [Conf ] Marko Samer , Helmut Veith A Syntactic Characterization of Distributive LTL Queries. [Citation Graph (0, 0)][DBLP ] ICALP, 2004, pp:1099-1110 [Conf ] Peter Sanders , Naveen Sivadasan , Martin Skutella Online Scheduling with Bounded Migration. [Citation Graph (0, 0)][DBLP ] ICALP, 2004, pp:1111-1122 [Conf ] Nicole Schweikardt On the Expressive Power of Monadic Least Fixed Point Logic. [Citation Graph (0, 0)][DBLP ] ICALP, 2004, pp:1123-1135 [Conf ] Helmut Seidl , Thomas Schwentick , Anca Muscholl , Peter Habermehl Counting in Trees for Free. [Citation Graph (0, 0)][DBLP ] ICALP, 2004, pp:1136-1149 [Conf ] Olivier Serre Games with Winning Conditions of High Borel Complexity. [Citation Graph (0, 0)][DBLP ] ICALP, 2004, pp:1150-1162 [Conf ] Alan Skelley Propositional PSPACE Reasoning with Boolean Programs Versus Quantified Boolean Formulas. [Citation Graph (0, 0)][DBLP ] ICALP, 2004, pp:1163-1175 [Conf ] Michael Soltys LA, Permutations, and the Hajós Calculus. [Citation Graph (0, 0)][DBLP ] ICALP, 2004, pp:1176-1187 [Conf ] Michael Toftdal A Calibration of Ineffective Theorems of Analysis in a Hierarchy of Semi-classical Logical Principles: (Extended Abstract). [Citation Graph (0, 0)][DBLP ] ICALP, 2004, pp:1188-1200 [Conf ] Sergei Vassilvitskii , Mihalis Yannakakis Efficiently Computing Succinct Trade-Off Curves. [Citation Graph (0, 0)][DBLP ] ICALP, 2004, pp:1201-1213 [Conf ] Hagen Völzer On Randomization Versus Synchronization in Distributed Systems. [Citation Graph (0, 0)][DBLP ] ICALP, 2004, pp:1214-1226 [Conf ] Ryan Williams A New Algorithm for Optimal Constraint Satisfaction and Its Implications. [Citation Graph (0, 0)][DBLP ] ICALP, 2004, pp:1227-1237 [Conf ] Shengyu Zhang On the Power of Ambainis's Lower Bounds. [Citation Graph (0, 0)][DBLP ] ICALP, 2004, pp:1238-1250 [Conf ]