Conferences in DBLP
Gérard Boudol Shared-Variable Concurrency: A Proposal. [Citation Graph (0, 0)][DBLP ] Conf ] Gordon D. Plotkin Hennessy-Plotkin-Brookes Revisited. [Citation Graph (0, 0)][DBLP ] Conf ] Chaitanya Swamy , David B. Shmoys Approximation Algorithms for 2-Stage Stochastic Optimization Problems. [Citation Graph (0, 0)][DBLP ] Conf ] Emo Welzl The Number of Crossing Free Configurations on Finite Point Sets in the Plane. [Citation Graph (0, 0)][DBLP ] Conf ] Tamal K. Dey , Jian Sun Normal and Feature Approximations from Noisy Point Clouds. [Citation Graph (0, 0)][DBLP ] Conf ] Sariel Har-Peled Coresets for Discrete Integration and Clustering. [Citation Graph (0, 0)][DBLP ] Conf ] Florent Becker , Ivan Rapaport , Eric Rémila Self-assemblying Classes of Shapes with a Minimum Number of Tiles, and in Optimal Time. [Citation Graph (0, 0)][DBLP ] Conf ] Tanmoy Chakraborty , Samir Datta One-Input-Face MPCVP Is Hard for L, But in LogDCFL. [Citation Graph (0, 0)][DBLP ] Conf ] K. Murali Krishnan , L. Sunil Chandran Hardness of Approximation Results for the Problem of Finding the Stopping Distance in Tanner Graphs. [Citation Graph (0, 0)][DBLP ] Conf ] Michael A. Bekos , Michael Kaufmann , Katerina Potika , Antonios Symvonis Multi-stack Boundary Labeling Problems. [Citation Graph (0, 0)][DBLP ] Conf ] Pankaj K. Agarwal , Sergio Cabello , Joan Antoni Sellarès , Micha Sharir Computing a Center-Transversal Line. [Citation Graph (0, 0)][DBLP ] Conf ] Shankar Kalyanaraman , Christopher Umans On Obtaining Pseudorandomness from Error-Correcting Codes. [Citation Graph (0, 0)][DBLP ] Conf ] Gruia Calinescu , Michael J. Pelsmajer Fast Edge Colorings with Fixed Number of Colors to Minimize Imbalance. [Citation Graph (0, 0)][DBLP ] Conf ] Sourav Chakraborty , Jaikumar Radhakrishnan , Nandakumar Raghunathan , Prashant Sasatte Zero Error List-Decoding Capacity of the q /(q -1) Channel. [Citation Graph (0, 0)][DBLP ] Conf ] Sushmita Gupta , Venkatesh Raman , Saket Saurabh Fast Exponential Algorithms for Maximum r -Regular Induced Subgraph Problems. [Citation Graph (0, 0)][DBLP ] Conf ] Fedor V. Fomin , Fabrizio Grandoni , Dieter Kratsch Solving Connected Dominating Set Faster Than 2n [Citation Graph (0, 0)][DBLP ] Conf ] Sun-Yuan Hsieh Linear-Time Algorithms for Two Subtree-Comparison Problems on Phylogenetic Trees with Different Species. [Citation Graph (0, 0)][DBLP ] Conf ] Véronique Cortier , Steve Kremer , Ralf Küsters , Bogdan Warinschi Computationally Sound Symbolic Secrecy in the Presence of Hash Functions. [Citation Graph (0, 0)][DBLP ] Conf ] Aduri Pavan , Rahul Santhanam , N. V. Vinodchandran Some Results on Average-Case Hardness Within the Polynomial Hierarchy. [Citation Graph (0, 0)][DBLP ] Conf ] Benjamin Doerr , Christian Klein Unbiased Rounding of Rational Matrices. [Citation Graph (0, 0)][DBLP ] Conf ] Michael Ummels Rational Behaviour and Strategy Construction in Infinite Multiplayer Games. [Citation Graph (0, 0)][DBLP ] Conf ] Russ Harmer , Olivier Laurent The Anatomy of Innocence Revisited. [Citation Graph (0, 0)][DBLP ] Conf ] Josee Desharnais , François Laviolette , Sami Zhioua Testing Probabilistic Equivalence Through Reinforcement Learning. [Citation Graph (0, 0)][DBLP ] Conf ] Laura Bozzelli , Mojmír Kretínský , Vojtech Rehák , Jan Strejcek On Decidability of LTL Model Checking for Process Rewrite Systems. [Citation Graph (0, 0)][DBLP ] Conf ] Andreas Bauer 0002 , Martin Leucker , Christian Schallhart Monitoring of Real-Time Properties. [Citation Graph (0, 0)][DBLP ] Conf ] Christian Dax , Martin Hofmann , Martin Lange A Proof System for the Linear Time µ-Calculus. [Citation Graph (0, 0)][DBLP ] Conf ] Thierry Cachat Tree Automata Make Ordinal Theory Easy. [Citation Graph (0, 0)][DBLP ] Conf ] Beatriz Alarcón , Raúl Gutiérrez , Salvador Lucas Context-Sensitive Dependency Pairs. [Citation Graph (0, 0)][DBLP ] Conf ] Marcus Größer , Gethin Norman , Christel Baier , Frank Ciesinski , Marta Z. Kwiatkowska , David Parker On Reduction Criteria for Probabilistic Reward Models. [Citation Graph (0, 0)][DBLP ] Conf ] Paul Gastin , Nathalie Sznajder , Marc Zeitoun Distributed Synthesis for Well-Connected Architectures. [Citation Graph (0, 0)][DBLP ] Conf ] Mohammad Reza Mousavi , Iain Phillips , Michel A. Reniers , Irek Ulidowski The Meaning of Ordered SOS. [Citation Graph (0, 0)][DBLP ] Conf ] Patricia Bouyer , Kim Guldstrand Larsen , Nicolas Markey , Jacob Illum Rasmussen Almost Optimal Strategies in One Clock Priced Timed Games. [Citation Graph (0, 0)][DBLP ] Conf ] Didier Galmiche , Dominique Larchey-Wendling Expressivity Properties of Boolean. [Citation Graph (0, 0)][DBLP ] Conf ] Fabrice Chevalier , Deepak D'Souza , Pavithra Prabhakar On Continuous Timed Automata with Input-Determined Guards. [Citation Graph (0, 0)][DBLP ] Conf ] Ranko Lazic Safely Freezing LTL. [Citation Graph (0, 0)][DBLP ] Conf ] Rajeev Alur , Swarat Chaudhuri Branching Pushdown Tree Automata. [Citation Graph (0, 0)][DBLP ] Conf ] Gary Wassermann , Zhendong Su Validity Checking for Finite Automata over Linear Arithmetic Constraints. [Citation Graph (0, 0)][DBLP ] Conf ] James Laird Game Semantics for Higher-Order Concurrency. [Citation Graph (0, 0)][DBLP ] Conf ] 