Conferences in DBLP
Leslie G. Valiant Holographic Circuits. [Citation Graph (0, 0)][DBLP ] Conf ] Anupam Datta , Ante Derek , John C. Mitchell , Vitaly Shmatikov , Mathieu Turuani Probabilistic Polynomial-Time Semantics for a Protocol Security Logic. [Citation Graph (0, 0)][DBLP ] Conf ] Giuseppe Castagna , Alain Frisch A Gentle Introduction to Semantic Subtyping. [Citation Graph (0, 0)][DBLP ] Conf ] Leonid Libkin Logics for Unranked Trees: An Overview. [Citation Graph (0, 0)][DBLP ] Conf ] Martin Gairing , Thomas Lücking , Burkhard Monien , Karsten Tiemann Nash Equilibria, the Price of Anarchy and the Fully Mixed Nash Equilibrium Conjecture. [Citation Graph (0, 0)][DBLP ] Conf ] Philip Bille , Inge Li Gørtz The Tree Inclusion Problem: In Optimal Space and Faster. [Citation Graph (0, 0)][DBLP ] Conf ] Stephen Alstrup , Inge Li Gørtz , Theis Rauhe , Mikkel Thorup , Uri Zwick Union-Find with Constant Time Deletions. [Citation Graph (0, 0)][DBLP ] Conf ] Gianni Franceschini , Roberto Grossi Optimal In-place Sorting of Vectors and Records. [Citation Graph (0, 0)][DBLP ] Conf ] Kanela Kaligosi , Kurt Mehlhorn , J. Ian Munro , Peter Sanders Towards Optimal Multiple Selection. [Citation Graph (0, 0)][DBLP ] Conf ] Marius Zimand Simple Extractors via Constructions of Cryptographic Pseudo-random Generators. [Citation Graph (0, 0)][DBLP ] Conf ] Omer Horvitz , Jonathan Katz Bounds on the Efficiency of "Black-Box" Commitment Schemes. [Citation Graph (0, 0)][DBLP ] Conf ] Hoeteck Wee On Round-Efficient Argument Systems. [Citation Graph (0, 0)][DBLP ] Conf ] Roberto Tamassia , Nikos Triandopoulos Computational Bounds on Hierarchical Data Processing with Applications to Information Security. [Citation Graph (0, 0)][DBLP ] Conf ] Martin Dietzfelbinger , Christoph Weidling Balanced Allocation and Dictionaries with Tightly Packed Constant Size Bins. [Citation Graph (0, 0)][DBLP ] Conf ] Ehsan Chiniforooshan , Arash Farzan , Mehdi Mirzazadeh Worst Case Optimal Union-Intersection Expression Evaluation. [Citation Graph (0, 0)][DBLP ] Conf ] Fedor V. Fomin , Fabrizio Grandoni , Dieter Kratsch Measure and Conquer: Domination - A Case Study. [Citation Graph (0, 0)][DBLP ] Conf ] Klaus Kursawe , Victor Shoup Optimistic Asynchronous Atomic Broadcast. [Citation Graph (0, 0)][DBLP ] Conf ] Giovanni Di Crescenzo , Aggelos Kiayias Asynchronous Perfectly Secure Communication over One-Time Pads. [Citation Graph (0, 0)][DBLP ] Conf ] Giuseppe Persiano , Ivan Visconti Single-Prover Concurrent Zero Knowledge in Almost Constant Rounds. [Citation Graph (0, 0)][DBLP ] Conf ] Miroslaw Kowaluk , Andrzej Lingas LCA Queries in Directed Acyclic Graphs. [Citation Graph (0, 0)][DBLP ] Conf ] Liam Roditty , Uri Zwick Replacement Paths and k Simple Shortest Paths in Unweighted Directed Graphs. [Citation Graph (0, 0)][DBLP ] Conf ] Liam Roditty , Mikkel Thorup , Uri Zwick Deterministic Constructions of Approximate Distance Oracles and Spanners. [Citation Graph (0, 0)][DBLP ] Conf ] Telikepalli Kavitha An Õ(m 2 n ) Randomized Algorithm to Compute a Minimum Cycle Basis of a Directed Graph. [Citation Graph (0, 0)][DBLP ] Conf ] Tal Moran , Moni Naor Basing Cryptographic Protocols on Tamper-Evident Seals. [Citation Graph (0, 0)][DBLP ] Conf ] Dario Catalano , Ivan Visconti Hybrid Trapdoor Commitments and Their Applications. [Citation Graph (0, 0)][DBLP ] Conf ] Nicholas Hopper On Steganographic Chosen Covertext Security. [Citation Graph (0, 0)][DBLP ] Conf ] An Braeken , Yuri Borissov , Svetla Nikova , Bart Preneel Classification of Boolean Functions of 6 Variables or Less with Respect to Some Cryptographic Properties. [Citation Graph (0, 0)][DBLP ] Conf ] Reuven Cohen , Pierre Fraigniaud , David Ilcinkas , Amos Korman , David Peleg Label-Guided Graph Exploration by a Finite Automaton. [Citation Graph (0, 0)][DBLP ] Conf ] Bogdan S. Chlebus , Leszek Gasieniec , Dariusz R. Kowalski , Tomasz Radzik On the Wake-Up Problem in Radio Networks. [Citation Graph (0, 0)][DBLP ] Conf ] Jirí Fiala , Petr A. Golovach , Jan Kratochvíl Distance Constrained Labelings of Graphs of Bounded Treewidth. [Citation Graph (0, 0)][DBLP ] Conf ] Qian-Ping Gu , Hisao Tamaki Optimal Branch-Decomposition of Planar Graphs in O (n 3 ) Time. [Citation Graph (0, 0)][DBLP ] Conf ] Juraj Hromkovic , Georg Schnitger NFAs With and Without epsilon -Transitions. [Citation Graph (0, 0)][DBLP ] Conf ] Marie-Pierre Béal , Sylvain Lombardy , Jacques Sakarovitch On the Equivalence of -Automata. [Citation Graph (0, 0)][DBLP ] Conf ] Eugen Czeizler , Jarkko Kari A Tight Linear Bound on the Neighborhood of Inverse Cellular Automata. [Citation Graph (0, 0)][DBLP ] Conf ] Martin Beaudry , François Lemieux , Denis Thérien Groupoids That Recognize Only Regular Languages. [Citation Graph (0, 0)][DBLP ] Conf ] Eike Kiltz , Anton Mityagin , Saurabh Panjwani , Barath Raghavan Append-Only Signatures. [Citation Graph (0, 0)][DBLP ] Conf ] Mårten Trolin , Douglas Wikström Hierarchical Group Signatures. [Citation Graph (0, 0)][DBLP ] Conf ] Helger Lipmaa , Guilin Wang , Feng Bao Designated Verifier Signature Schemes: Attacks, New Security Notions and a New Construction. [Citation Graph (0, 0)][DBLP ] Conf ] Ueli M. Maurer , Johan Sjödin Single-Key AIL-MACs from Any FIL-MAC. [Citation Graph (0, 0)][DBLP ] Conf ] Li Zhang The Efficiency and Fairness of a Fixed Budget Resource Allocation Game. [Citation Graph (0, 0)][DBLP ] Conf ] Henry Lin , Tim Roughgarden , Éva Tardos , Asher Walkover Braess's Paradox, Fibonacci Numbers, and Exponential Inapproximability. [Citation Graph (0, 0)][DBLP ] Conf ] Manfred Droste , Paul Gastin Weighted Automata and Weighted Logics. [Citation Graph (0, 0)][DBLP ] Conf ] Pascal Tesson , Denis Thérien Restricted Two-Variable Sentences, Circuits and Communication Complexity. [Citation Graph (0, 0)][DBLP ] Conf ] Mitsuhiro Haneda , Mitsuru Kawazoe , Tetsuya Takahashi Suitable Curves for Genus-4 HCC over Prime Fields: Point Counting Formulae for Hyperelliptic Curves of Type y 2 =x 2k +1 +ax . [Citation Graph (0, 0)][DBLP ] Conf ] Neeraj Kayal Solvability of a System of Bivariate Polynomial Equations over a Finite Field. [Citation Graph (0, 0)][DBLP ] Conf ] Hema Jampala , Norbert Zeh Cache-Oblivious Planar Shortest Paths. [Citation Graph (0, 0)][DBLP ] Conf ] Gerth Stølting Brodal , Rolf Fagerberg , Gabriel Moruz Cache-Aware and Cache-Oblivious Adaptive Sorting. [Citation Graph (0, 0)][DBLP ] Conf ] Ingo Wegener Simulated Annealing Beats Metropolis in Combinatorial Optimization. [Citation Graph (0, 0)][DBLP ] Conf ] Leah Epstein , Meital Levy Online Interval Coloring and Variants. [Citation Graph (0, 0)][DBLP ] Conf ] Wun-Tat Chan , Tak Wah Lam , Prudence W. H. Wong Dynamic Bin Packing of Unit Fractions Items. [Citation Graph (0, 0)][DBLP ] Conf ] Matthias Englert , Matthias Westermann Reordering Buffer Management for Non-uniform Cost Models. [Citation Graph (0, 0)][DBLP ] Conf ] Yannick Chevalier , Michaël Rusinowitch Combining Intruder Theories. [Citation Graph (0, 0)][DBLP ] Conf ] Mathieu Baudet , Véronique Cortier , Steve Kremer Computationally Sound Implementations of Equational Theories Against Passive Adversaries. [Citation Graph (0, 0)][DBLP ] Conf ] Martín Abadi , Bogdan Warinschi Password-Based Encryption Analyzed. [Citation Graph (0, 0)][DBLP ] Conf ] Chen Avin , Gunes Ercal On the Cover Time of Random Geometric Graphs. [Citation Graph (0, 0)][DBLP ] Conf ] Charilaos Efthymiou , Paul G. Spirakis On the Existence of Hamiltonian Cycles in Random Intersection Graphs. [Citation Graph (0, 0)][DBLP ] Conf ] Nedialko B. Dimitrov , C. Greg Plaxton Optimal Cover Time for a Graph-Based Coupon Collector Process. [Citation Graph (0, 0)][DBLP ] Conf ] Debora Donato , Stefano Leonardi , Panayiotis Tsaparas Stability and Similarity of Link Analysis Ranking Algorithms. [Citation Graph (0, 0)][DBLP ] Conf ] Damien Pous Up-to Techniques for Weak Bisimulation. [Citation Graph (0, 0)][DBLP ] Conf ] Eric Badouel , Jules Chenou , Goulven Guillou Petri Algebras. [Citation Graph (0, 0)][DBLP ] Conf ] Wan Fokkink , Sumit Nain A Finite Basis for Failure Semantics. [Citation Graph (0, 0)][DBLP ] Conf ] Giovanni Conforti , Damiano Macedonio , Vladimiro Sassone Spatial Logics for Bigraphs. [Citation Graph (0, 0)][DBLP ] Conf ] Marc Fischlin Completely Non-malleable Schemes. [Citation Graph (0, 0)][DBLP ] Conf ] David Galindo Boneh-Franklin Identity Based Encryption Revisited. [Citation Graph (0, 0)][DBLP ] Conf ] Craig Gentry , Zulfikar Ramzan Single-Database Private Information Retrieval with Constant Communication Rate. [Citation Graph (0, 0)][DBLP ] Conf ] Giovanni Di Crescenzo , Ivan Visconti Concurrent Zero Knowledge in the Public-Key Model. [Citation Graph (0, 0)][DBLP ] Conf ] Martin Gairing , Burkhard Monien , Andreas Woclaw A Faster Combinatorial Approximation Algorithm for Scheduling Unrelated Parallel Machines. [Citation Graph (0, 0)][DBLP ] Conf ] Annamária Kovács Polynomial Time Preemptive Sum-Multicoloring on Paths. [Citation Graph (0, 0)][DBLP ] Conf ] Kamal Jain , Mohammad Taghi Hajiaghayi , Kunal Talwar The Generalized Deadlock Resolution Problem. [Citation Graph (0, 0)][DBLP ] Conf ] Mihai Badoiu , Artur Czumaj , Piotr Indyk , Christian Sohler Facility Location in Sublinear Time. [Citation Graph (0, 0)][DBLP ] Conf ] Krishnendu Chatterjee , Luca de Alfaro , Thomas A. Henzinger The Complexity of Stochastic Rabin and Streett Games'. [Citation Graph (0, 0)][DBLP ] Conf ] Kousha Etessami , Mihalis Yannakakis Recursive Markov Decision Processes and Recursive Stochastic Games. [Citation Graph (0, 0)][DBLP ] Conf ] James Laird Decidability in Syntactic Control of Interference. [Citation Graph (0, 0)][DBLP ] Conf ] Andrzej S. Murawski , C.-H. Luke Ong , Igor Walukiewicz Idealized Algol with Ground Recursion, and DPDA Equivalence. [Citation Graph (0, 0)][DBLP ] Conf ] Jochen Könemann , Stefano Leonardi , Guido Schäfer , Stefan van Zwam From Primal-Dual to Cost Shares and Back: A Stronger LP Relaxation for the Steiner Forest Problem. [Citation Graph (0, 0)][DBLP ] Conf ] Allan Borodin , David Cashman , Avner Magen How Well Can Primal-Dual and Local-Ratio Algorithms Perform?. [Citation Graph (0, 0)][DBLP ] Conf ] Gustav Hast Approximating - Outperforming a Random Assignment with Almost a Linear Factor. [Citation Graph (0, 0)][DBLP ] Conf ] Corina E. Patrascu , Mihai Patrascu On Dynamic Bit-Probe Complexity. [Citation Graph (0, 0)][DBLP ] Conf ] Scott Diehl , Dieter van Melkebeek Time-Space Lower Bounds for the Polynomial-Time Hierarchy on Randomized Machines. [Citation Graph (0, 0)][DBLP ] Conf ] Arkadev Chattopadhyay , Kristoffer Arnsfelt Hansen Lower Bounds for Circuits with Few Modular and Symmetric Gates. [Citation Graph (0, 0)][DBLP ] Conf ] Michael W. Mislove Discrete Random Variables over Domains. [Citation Graph (0, 0)][DBLP ] Conf ] Franck van Breugel , Claudio Hermida , Michael Makkai , James Worrell An Accessible Approach to Behavioural Pseudometrics. [Citation Graph (0, 0)][DBLP ] Conf ] Eugene Asarin , Pieter Collins Noisy Turing Machines. [Citation Graph (0, 0)][DBLP ] Conf ] George Karakostas A Better Approximation Ratio for the Vertex Cover Problem. [Citation Graph (0, 0)][DBLP ] Conf ] Anupam Gupta , Martin Pál Stochastic Steiner Trees Without a Root. [Citation Graph (0, 0)][DBLP ] Conf ] Sriram V. Pemmaraju , Rajiv Raman Approximation Algorithms for the Max-coloring Problem. [Citation Graph (0, 0)][DBLP ] Conf ] Martin Grohe , Christoph Koch , Nicole Schweikardt Tight Lower Bounds for Query Processing on Streaming and External Memory Data. [Citation Graph (0, 0)][DBLP ] Conf ] Parosh Aziz Abdulla , Johann Deneux , Joël Ouaknine , James Worrell Decidability and Complexity Results for Timed Automata via Channel Machines. [Citation Graph (0, 0)][DBLP ] Conf ] Rajeev Alur , Viraj Kumar , P. Madhusudan , Mahesh Viswanathan Congruences for Visibly Pushdown Languages. [Citation Graph (0, 0)][DBLP ] Conf ] Khaled M. Elbassioni , Aleksei V. Fishkin , Nabil H. Mustafa , René Sitters Approximation Algorithms for Euclidean Group TSP. [Citation Graph (0, 0)][DBLP ] Conf ] David Kempe , Jon M. Kleinberg , Éva Tardos Influential Nodes in a Diffusion Model for Social Networks. [Citation Graph (0, 0)][DBLP ] Conf ] Christoph Ambühl An Optimal Bound for the MST Algorithm to Compute Energy Efficient Broadcast Trees in Wireless Networks. [Citation Graph (0, 0)][DBLP ] Conf ] Friedrich Eisenbrand , Fabrizio Grandoni , Gianpaolo Oriolo , Martin Skutella New Approaches for Virtual Private Network Design. [Citation Graph (0, 0)][DBLP ] Conf ] Jeff Ford , Anna Gál Hadamard Tensors and Lower Bounds on Multiparty Communication Complexity. [Citation Graph (0, 0)][DBLP ] Conf ] Paul Beame , Toniann Pitassi , Nathan Segerlind Lower Bounds for Lovász-Schrijver Systems and Beyond Follow from Multiparty Communication Complexity. [Citation Graph (0, 0)][DBLP ] Conf ] Douglas Wikström On the l -Ary GCD-Algorithm in Rings of Integers. [Citation Graph (0, 0)][DBLP ] Conf ] Michael Baldamus , Joachim Parrow , Björn Victor A Fully Abstract Encoding of the pi -Calculus with Data Terms. [Citation Graph (0, 0)][DBLP ] Conf ] Mohammad Reza Mousavi , Michel A. Reniers Orthogonal Extensions in Structural Operational Semantics. [Citation Graph (0, 0)][DBLP ] Conf ] Rocco De Nicola , Daniele Gorla , Rosario Pugliese Basic Observables for a Calculus for Global Computing. [Citation Graph (0, 0)][DBLP ] Conf ] Giorgio Delzanno , Maurizio Gabbrielli Compositional Verification of Asynchronous Processes via Constraint Solving. [Citation Graph (0, 0)][DBLP ] Conf ] Martin Farach-Colton , Gad M. Landau , Süleyman Cenk Sahinalp , Dekel Tsur Optimal Spaced Seeds for Faster Approximate String Matching. [Citation Graph (0, 0)][DBLP ] Conf ] Isaac Elias , Jens Lagergren Fast Neighbor Joining. [Citation Graph (0, 0)][DBLP ] Conf ] Ming-Yang Kao , Manan Sanghi , Robert T. Schweller Randomized Fast Design of Short DNA Words. [Citation Graph (0, 0)][DBLP ] Conf ] Pascal Koiran , Vincent Nesme , Natacha Portier A Quantum Lower Bound for the Query Complexity of Simon's Problem. [Citation Graph (0, 0)][DBLP ] Conf ] Robert Spalek , Mario Szegedy All Quantum Adversary Methods Are Equivalent. [Citation Graph (0, 0)][DBLP ] Conf ] Frédéric Magniez , Ashwin Nayak Quantum Complexity of Testing Group Commutativity. [Citation Graph (0, 0)][DBLP ] Conf ] Mila Dalla Preda , Roberto Giacobazzi Semantic-Based Code Obfuscation by Abstract Interpretation. [Citation Graph (0, 0)][DBLP ] Conf ] Bernhard Reus , Thomas Streicher About Hoare Logics for Higher-Order Store. [Citation Graph (0, 0)][DBLP ] Conf ] Aaron R. Bradley , Zohar Manna , Henny B. Sipma The Polyranking Principle. [Citation Graph (0, 0)][DBLP ] Conf ] Bengt J. Nilsson Approximate Guarding of Monotone and Rectilinear Polygons. [Citation Graph (0, 0)][DBLP ] Conf ] Amit Kumar , Yogish Sabharwal , Sandeep Sen Linear Time Algorithms for Clustering Problems in Any Dimensions. [Citation Graph (0, 0)][DBLP ] Conf ] Petra Berenbrink , Tom Friedetzky , Russell A. Martin Dynamic Diffusion Load Balancing. [Citation Graph (0, 0)][DBLP ] Conf ] Jaikumar Radhakrishnan , Martin Rötteler , Pranab Sen On the Power of Random Bases in Fourier Sampling: Hidden Subgroup Problem in the Heisenberg Group. [Citation Graph (0, 0)][DBLP ] Conf ] Matthew Cary , Atri Rudra , Ashish Sabharwal On the Hardness of Embeddings Between Two Finite Metrics. [Citation Graph (0, 0)][DBLP ] Conf ] Stephanie Wehner , Ronald de Wolf Improved Lower Bounds for Locally Decodable Codes and Private Information Retrieval. [Citation Graph (0, 0)][DBLP ] Conf ] Albert Atserias , Anuj Dawar , Martin Grohe Preservation Under Extensions on Well-Behaved Finite Structures. [Citation Graph (0, 0)][DBLP ] Conf ] Teodor Knapik , Damian Niwinski , Pawel Urzyczyn , Igor Walukiewicz Unsafe Grammars and Panic Automata. [Citation Graph (0, 0)][DBLP ] Conf ] Cheng Li , Zhe Dang , Oscar H. Ibarra , Hsu-Chun Yen Signaling P Systems and Verification Problems. [Citation Graph (0, 0)][DBLP ] Conf ] 