Conferences in DBLP
Ricardo A. Baeza-Yates Algorithmic Challenges in Web Search Engines. [Citation Graph (0, 0)][DBLP ] Conf ] Anne Condon RNA Molecules: Glimpses Through an Algorithmic Lens. [Citation Graph (0, 0)][DBLP ] Conf ] Ferran Hurtado Squares. [Citation Graph (0, 0)][DBLP ] Conf ] R. Ravi Matching Based Augmentations for Approximating Connectivity Problems. [Citation Graph (0, 0)][DBLP ] Conf ] Madhu Sudan Modelling Errors and Recovery for Communication. [Citation Graph (0, 0)][DBLP ] Conf ] Sergio Verdú Lossless Data Compression Via Error Correction. [Citation Graph (0, 0)][DBLP ] Conf ] Avi Wigderson The Power and Weakness of Randomness in Computation. [Citation Graph (0, 0)][DBLP ] Conf ] Saurabh Agarwal , Gudmund Skovbjerg Frandsen A New GCD Algorithm for Quadratic Number Rings with Unique Factorization. [Citation Graph (0, 0)][DBLP ] Conf ] Nir Ailon , Steve Chien , Cynthia Dwork On Clusters in Markov Chains. [Citation Graph (0, 0)][DBLP ] Conf ] Miklós Ajtai , Cynthia Dwork , Larry J. Stockmeyer An Architecture for Provably Secure Computation. [Citation Graph (0, 0)][DBLP ] Conf ] Elói Araújo , José Soares Scoring Matrices That Induce Metrics on Sequences. [Citation Graph (0, 0)][DBLP ] Conf ] Boris Aronov , Prosenjit Bose , Erik D. Demaine , Joachim Gudmundsson , John Iacono , Stefan Langerman , Michiel H. M. Smid Data Structures for Halfplane Proximity Queries and Incremental Voronoi Diagrams. [Citation Graph (0, 0)][DBLP ] Conf ] Boris Aronov , Alan R. Davis , John Iacono , Albert Siu Cheong Yu The Complexity of Diffuse Reflections in a Simple Polygon. [Citation Graph (0, 0)][DBLP ] Conf ] Argimiro Arratia , Carlos E. Ortiz Counting Proportions of Sets: Expressive Power with Almost Order. [Citation Graph (0, 0)][DBLP ] Conf ] Abdullah N. Arslan Efficient Approximate Dictionary Look-Up for Long Words over Small Alphabets. [Citation Graph (0, 0)][DBLP ] Conf ] Nuttapong Attrapadung , Yang Cui , David Galindo , Goichiro Hanaoka , Ichiro Hasuo , Hideki Imai , Kanta Matsuura , Peng Yang 0002 , Rui Zhang 0002 Relations Among Notions of Security for Identity Based Encryption Schemes. [Citation Graph (0, 0)][DBLP ] Conf ] Ilya Baran , Erik D. Demaine , Dmitriy A. Katz Optimally Adaptive Integration of Univariate Lipschitz Functions. [Citation Graph (0, 0)][DBLP ] Conf ] Benjamín René Callejas Bedregal , Santiago Figueira Classical Computability and Fuzzy Turing Machines. [Citation Graph (0, 0)][DBLP ] Conf ] Boaz Ben-Moshe , Binay K. Bhattacharya , Qiaosheng Shi An Optimal Algorithm for the Continuous/Discrete Weighted 2-Center Problem in Trees. [Citation Graph (0, 0)][DBLP ] Conf ] Thorsten Bernholt , Thomas Hofmeister An Algorithm for a Generalized Maximum Subsequence Problem. [Citation Graph (0, 0)][DBLP ] Conf ] Nayantara Bhatnagar , Dana Randall , Vijay V. Vazirani , Eric Vigoda Random Bichromatic Matchings. [Citation Graph (0, 0)][DBLP ] Conf ] Béla Bollobás , Guy Kindler , Imre Leader , Ryan O'Donnell Eliminating Cycles in the Discrete Torus. [Citation Graph (0, 0)][DBLP ] Conf ] Claudson F. Bornstein , Eduardo Sany Laber , Marcelo Mas On Behalf of the Seller and Society: Bicriteria Mechanisms for Unit-Demand Auctions. [Citation Graph (0, 0)][DBLP ] Conf ] Jérémie Bourdon , Brigitte Vallée Pattern Matching Statistics on Correlated Sources. [Citation Graph (0, 0)][DBLP ] Conf ] Patricia Bouyer , Nicolas Markey , Pierre-Alain Reynier Robust Model-Checking of Linear-Time Properties in Timed Automata. [Citation Graph (0, 0)][DBLP ] Conf ] Hajo Broersma , Matthew Johnson 0002 , Daniël Paulusma , Iain A. Stewart The Computational Complexity of the Parallel Knock-Out Problem. [Citation Graph (0, 0)][DBLP ] Conf ] Gruia Calinescu , Adrian Dumitrescu , János Pach Reconfigurations in Graphs and Grids. [Citation Graph (0, 0)][DBLP ] Conf ] Laura Chaubard C-Varieties, Actions and Wreath Product. [Citation Graph (0, 0)][DBLP ] Conf ] Edgar Chávez , Stefan Dobrev , Evangelos Kranakis , Jaroslav Opatrny , Ladislav Stacho , Jorge Urrutia Local Construction of Planar Spanners in Unit Disk Graphs with Irregular Transmission Ranges. [Citation Graph (0, 0)][DBLP ] Conf ] Vicky Choi , Navin Goyal An Efficient Approximation Algorithm for Point Pattern Matching Under Noise. [Citation Graph (0, 0)][DBLP ] Conf ] Marek Chrobak , Claire Kenyon , John Noga , Neal E. Young Oblivious Medians Via Online Bidding. [Citation Graph (0, 0)][DBLP ] Conf ] Corinna Cortes , Mehryar Mohri , Ashish Rastogi , Michael Riley Efficient Computation of the Relative Entropy of Probabilistic Automata. [Citation Graph (0, 0)][DBLP ] Conf ] Ho-Kwok Dai , Hung-Chi Su A Parallel Algorithm for Finding All Successive Minimal Maximum Subsequences. [Citation Graph (0, 0)][DBLP ] Conf ] Erik D. Demaine , Friedhelm Meyer auf der Heide , Rasmus Pagh , Mihai Patrascu De Dictionariis Dynamicis Pauco Spatio Utentibus (lat. On Dynamic Dictionaries Using Little Space). [Citation Graph (0, 0)][DBLP ] Conf ] Sandeep Dey , Nicolas Schabanel Customized Newspaper Broadcast: Data Broadcast with Dependencies. [Citation Graph (0, 0)][DBLP ] Conf ] Gabriele Di Stefano , Stefan Krause , Marco E. Lübbecke , Uwe T. Zimmermann On Minimum k -Modal Partitions of Permutations. [Citation Graph (0, 0)][DBLP ] Conf ] Frederic Dorn , Jan Arne Telle Two Birds with One Stone: The Best of Branchwidth and Treewidth with One Algorithm. [Citation Graph (0, 0)][DBLP ] Conf ] Douglas G. Down , George Karakostas Maximizing Throughput in Queueing Networks with Limited Flexibility. [Citation Graph (0, 0)][DBLP ] Conf ] Feodor F. Dragan , Chenyu Yan Network Flow Spanners. [Citation Graph (0, 0)][DBLP ] Conf ] Khaled M. Elbassioni Finding All Minimal Infrequent Multi-dimensional Intervals. [Citation Graph (0, 0)][DBLP ] Conf ] Roee Engelberg , Jochen Könemann , Stefano Leonardi , Joseph Naor Cut Problems in Graphs with a Budget Constraint. [Citation Graph (0, 0)][DBLP ] Conf ] Martin Farach-Colton , Rohan J. Fernandes , Miguel A. Mosteiro Lower Bounds for Clear Transmissions in Radio Networks. [Citation Graph (0, 0)][DBLP ] Conf ] Nazim Fatès , Damien Regnault , Nicolas Schabanel , Eric Thierry Asynchronous Behavior of Double-Quiescent Elementary Cellular Automata. [Citation Graph (0, 0)][DBLP ] Conf ] Hervé Fournier , Antoine Vigneron Lower Bounds for Geometric Diameter Problems. [Citation Graph (0, 0)][DBLP ] Conf ] Pierre Fraigniaud , Nicolas Nisse Connected Treewidth and Connected Graph Searching. [Citation Graph (0, 0)][DBLP ] Conf ] Martin Fürer A Faster Algorithm for Finding Maximum Independent Sets in Sparse Graphs. [Citation Graph (0, 0)][DBLP ] Conf ] Eli Gafni , Sergio Rajsbaum , Michel Raynal , Corentin Travers The Committee Decision Problem. [Citation Graph (0, 0)][DBLP ] Conf ] Ling Gai , Guochuan Zhang Common Deadline Lazy Bureaucrat Scheduling Revisited. [Citation Graph (0, 0)][DBLP ] Conf ] Joachim Giesen , Eva Schuberth , Milos Stojakovic Approximate Sorting. [Citation Graph (0, 0)][DBLP ] Conf ] Michel X. Goemans , Jan Vondrák Stochastic Covering and Adaptivity. [Citation Graph (0, 0)][DBLP ] Conf ] Parikshit Gopalan , Venkatesan Guruswami , Richard J. Lipton Algorithms for Modular Counting of Roots of Multivariate Polynomials. [Citation Graph (0, 0)][DBLP ] Conf ] Venkatesan Guruswami , Valentine Kabanets Hardness Amplification Via Space-Efficient Direct Products. [Citation Graph (0, 0)][DBLP ] Conf ] Mikael Hammar , Bengt J. Nilsson , Mia Persson The Online Freeze-Tag Problem. [Citation Graph (0, 0)][DBLP ] Conf ] Herman J. Haverkort , Laura Toma I/O-Efficient Algorithms on Near-Planar Graphs. [Citation Graph (0, 0)][DBLP ] Conf ] Pinar Heggernes , Federico Mancini Minimal Split Completions of Graphs. [Citation Graph (0, 0)][DBLP ] Conf ] Regant Y. S. Hung , Hing-Fung Ting Design and Analysis of Online Batching Systems. [Citation Graph (0, 0)][DBLP ] Conf ] Wojciech Jawor , Marek Chrobak , Christoph Dürr Competitive Analysis of Scheduling Algorithms for Aggregated Links. [Citation Graph (0, 0)][DBLP ] Conf ] James King A 4-Approximation Algorithm for Guarding 1.5-Dimensional Terrains. [Citation Graph (0, 0)][DBLP ] Conf ] Goran Konjevod , Andréa W. Richa , Donglin Xia On Sampling in Higher-Dimensional Peer-to-Peer Systems. [Citation Graph (0, 0)][DBLP ] Conf ] Evangelos Kranakis , Danny Krizanc , Euripides Markou Mobile Agent Rendezvous in a Synchronous Torus. [Citation Graph (0, 0)][DBLP ] Conf ] Lap Chi Lau , Michael Molloy Randomly Colouring Graphs with Girth Five and Large Maximum Degree. [Citation Graph (0, 0)][DBLP ] Conf ] Orlando Lee , Aaron Williams Packing Dicycle Covers in Planar Graphs with No K 5 -e Minor. [Citation Graph (0, 0)][DBLP ] Conf ] Loïck Lhote , Brigitte Vallée Sharp Estimates for the Main Parameters of the Euclid Algorithm. [Citation Graph (0, 0)][DBLP ] Conf ] Veli Mäkinen , Gonzalo Navarro Position-Restricted Substring Searching. [Citation Graph (0, 0)][DBLP ] Conf ] Yan Mayster , Mario A. Lopez Rectilinear Approximation of a Set of Points in the Plane. [Citation Graph (0, 0)][DBLP ] Conf ] Frédéric Mazoit The Branch-Width of Circular-Arc Graphs. [Citation Graph (0, 0)][DBLP ] Conf ] Eduardo Moreno , Martín Matamala Minimal Eulerian Circuit in a Labeled Digraph. [Citation Graph (0, 0)][DBLP ] Conf ] Frank Neumann , Marco Laumanns Speeding up Approximation Algorithms for NP-Hard Spanning Forest Problems by Multi-objective Optimization. [Citation Graph (0, 0)][DBLP ] Conf ] Nadia Pisanti , Alexandra M. Carvalho , Laurent Marsan , Marie-France Sagot RISOTTO: Fast Extraction of Motifs with Mismatches. [Citation Graph (0, 0)][DBLP ] Conf ] Mariko Sakashita , Kazuhisa Makino , Satoru Fujishige Minimum Cost Source Location Problems with Flow Requirements. [Citation Graph (0, 0)][DBLP ] Conf ] Daniel Sawitzki Exponential Lower Bounds on the Space Complexity of OBDD-Based Graph Algorithms. [Citation Graph (0, 0)][DBLP ] Conf ] Igor Shparlinski , Arne Winterhof Constructions of Approximately Mutually Unbiased Bases. [Citation Graph (0, 0)][DBLP ] Conf ] Yngve Villanger Improved Exponential-Time Algorithms for Treewidth and Minimum Fill-In. [Citation Graph (0, 0)][DBLP ] Conf ] 