Conferences in DBLP
Manindra Agrawal , Nitin Saxena Automorphisms of Finite Rings and Applications to Complexity of Problems. [Citation Graph (0, 0)][DBLP ] Conf ] Mireille Bousquet-Mélou Algebraic Generating Functions in Enumerative Combinatorics and Context-Free Languages. [Citation Graph (0, 0)][DBLP ] Conf ] Uwe Schöning Algorithmics in Exponential Time. [Citation Graph (0, 0)][DBLP ] Conf ] Carsten Witt Worst-Case and Average-Case Approximations by Simple Randomized Search Heuristics. [Citation Graph (0, 0)][DBLP ] Conf ] Petros Drineas , Ravi Kannan , Michael W. Mahoney Sampling Sub-problems of Heterogeneous Max-cut Problems and Approximation Algorithms. [Citation Graph (0, 0)][DBLP ] Conf ] Nir Andelman , Yossi Azar , Motti Sorani Truthful Approximation Mechanisms for Scheduling Selfish Related Machines. [Citation Graph (0, 0)][DBLP ] Conf ] Lidia Tendera Counting in the Two Variable Guarded Logic with Transitivity. [Citation Graph (0, 0)][DBLP ] Conf ] Dietmar Berwanger , Giacomo Lenzi The Variable Hierarchy of the µ-Calculus Is Strict. [Citation Graph (0, 0)][DBLP ] Conf ] Manuel Bodirsky The Core of a Countably Categorical Structure. [Citation Graph (0, 0)][DBLP ] Conf ] Guillaume Theyssier How Common Can Be Universality for Cellular Automata?. [Citation Graph (0, 0)][DBLP ] Conf ] Victor Poupet Cellular Automata: Real-Time Equivalence Between One-Dimensional Neighborhoods. [Citation Graph (0, 0)][DBLP ] Conf ] Tomás Brázdil , Antonín Kucera , Oldrich Strazovský On the Decidability of Temporal Properties of Probabilistic Pushdown Automata. [Citation Graph (0, 0)][DBLP ] Conf ] Detlef Kähler , Ralf Küsters , Thomas Wilke Deciding Properties of Contract-Signing Protocols. [Citation Graph (0, 0)][DBLP ] Conf ] Christian Glaßer Polylog-Time Reductions Decrease Dot-Depth. [Citation Graph (0, 0)][DBLP ] Conf ] Frank Harary , Wolfgang Slany , Oleg Verbitsky On the Computational Complexity of the Forcing Chromatic Number. [Citation Graph (0, 0)][DBLP ] Conf ] Lars Engebretsen , Jonas Holmerin More Efficient Queries in PCPs for NP and Improved Approximation Hardness of Maximum CSP. [Citation Graph (0, 0)][DBLP ] Conf ] Zdenek Dvorak , Vít Jelínek , Daniel Král , Jan Kyncl , Michael E. Saks Three Optimal Algorithms for Balls of Three Colors. [Citation Graph (0, 0)][DBLP ] Conf ] Xiang-Yang Li , Zheng Sun , Weizhao Wang Cost Sharing and Strategyproof Mechanisms for Set Cover Games. [Citation Graph (0, 0)][DBLP ] Conf ] Petra Berenbrink , Tom Friedetzky , Zengjian Hu , Russell A. Martin On Weighted Balls-into-Bins Games. [Citation Graph (0, 0)][DBLP ] Conf ] Gregorio Malajovich , Klaus Meer Computing Minimal Multi-homogeneous Bézout Numbers Is Hard. [Citation Graph (0, 0)][DBLP ] Conf ] Volker Weber , Thomas Schwentick Dynamic Complexity Theory Revisited. [Citation Graph (0, 0)][DBLP ] Conf ] Jianer Chen , Henning Fernau , Iyad A. Kanj , Ge Xia Parametric Duality and Kernelization: Lower Bounds and Upper Bounds on Kernel Size. [Citation Graph (0, 0)][DBLP ] Conf ] Sasanka Roy , Sandip Das , Subhas C. Nandy Shortest Monotone Descent Path Problem in Polyhedral Terrain. [Citation Graph (0, 0)][DBLP ] Conf ] Markus Schmidt Packet Buffering: Randomization Beats Deterministic Algorithms. [Citation Graph (0, 0)][DBLP ] Conf ] Abraham Flaxman , Bartosz Przydatek Solving Medium-Density Subset Sum Problems in Expected Polynomial Time. [Citation Graph (0, 0)][DBLP ] Conf ] Hubie Chen Quantified Constraint Satisfaction, Maximal Constraint Languages, and Symmetric Polymorphisms. [Citation Graph (0, 0)][DBLP ] Conf ] Michael Benedikt , Luc Segoufin Regular Tree Languages Definable in FO. [Citation Graph (0, 0)][DBLP ] Conf ] Kousha Etessami , Mihalis Yannakakis Recursive Markov Chains, Stochastic Grammars, and Monotone Systems of Nonlinear Equations. [Citation Graph (0, 0)][DBLP ] Conf ] Josep Díaz , Xavier Pérez , Maria J. Serna , Nicholas C. Wormald Connectivity for Wireless Agents Moving on a Cycle or Grid. [Citation Graph (0, 0)][DBLP ] Conf ] Marcin Bienkowski , Miroslaw Dynia , Miroslaw Korzeniowski Improved Algorithms for Dynamic Page Migration. [Citation Graph (0, 0)][DBLP ] Conf ] Prosenjit Bose , Evangelos Kranakis , Pat Morin , Yihui Tang Approximate Range Mode and Range Median Queries. [Citation Graph (0, 0)][DBLP ] Conf ] Emmanuel Jeandel Topological Automata. [Citation Graph (0, 0)][DBLP ] Conf ] Gregor Gramlich , Georg Schnitger Minimizing NFA's and Regular Expressions. [Citation Graph (0, 0)][DBLP ] Conf ] Harry Buhrman , Lance Fortnow , Ilan Newman , Nikolai K. Vereshchagin Increasing Kolmogorov Complexity. [Citation Graph (0, 0)][DBLP ] Conf ] Wolfgang Merkle , Joseph S. Miller , André Nies , Jan Reimann , Frank Stephan Kolmogorov-Loveland Randomness and Stochasticity. [Citation Graph (0, 0)][DBLP ] Conf ] Nir Ailon , Bernard Chazelle Information Theory in Property Testing and Monotonicity Testing in Higher Dimension. [Citation Graph (0, 0)][DBLP ] Conf ] Vittorio Bilò , Michele Flammini , Luca Moscardelli On Nash Equilibria in Non-cooperative All-Optical Networks. [Citation Graph (0, 0)][DBLP ] Conf ] Nikhil Bansal , Kirk Pruhs Speed Scaling to Manage Temperature. [Citation Graph (0, 0)][DBLP ] Conf ] Vikraman Arvind , T. C. Vijayaraghavan The Complexity of Solving Linear Equations over a Finite Ring. [Citation Graph (0, 0)][DBLP ] Conf ] Michael Kaminski A Lower Bound on the Complexity of Polynomial Multiplication Over Finite Fields. [Citation Graph (0, 0)][DBLP ] Conf ] Andreas Krebs , Klaus-Jörn Lange , Stephanie Reifferscheid Characterizing TC0 in Terms of Infinite Groups. [Citation Graph (0, 0)][DBLP ] Conf ] Joachim Gudmundsson , Giri Narasimhan , Michiel H. M. Smid Fast Pruning of Geometric Spanners. [Citation Graph (0, 0)][DBLP ] Conf ] Gerard Jennhwa Chang , Ton Kloks , Jiping Liu , Sheng-Lung Peng The PIGs Full Monty - A Floor Show of Minimal Separators. [Citation Graph (0, 0)][DBLP ] Conf ] Ulrik Brandes , Daniel Fleischer Centrality Measures Based on Current Flow. [Citation Graph (0, 0)][DBLP ] Conf ] Fabio Burderi , Antonio Restivo Varieties of Codes and Kraft Inequality. [Citation Graph (0, 0)][DBLP ] Conf ] Eran Rom , Amnon Ta-Shma Improving the Alphabet-Size in High Noise, Almost Optimal Rate List Decodable Codes. [Citation Graph (0, 0)][DBLP ] Conf ] Michal Kunc The Power of Commuting with Finite Sets of Words. [Citation Graph (0, 0)][DBLP ] Conf ] Seiichiro Tani , Hirotada Kobayashi , Keiji Matsumoto Exact Quantum Algorithms for the Leader Election Problem. [Citation Graph (0, 0)][DBLP ] Conf ] Harry Buhrman , Ilan Newman , Hein Röhrig , Ronald de Wolf Robust Polynomials and Quantum Algorithms. [Citation Graph (0, 0)][DBLP ] Conf ] Gus Gutoski , John Watrous Quantum Interactive Proofs with Competing Provers. [Citation Graph (0, 0)][DBLP ] Conf ] Benjamin Doerr Roundings Respecting Hard Constraints. [Citation Graph (0, 0)][DBLP ] Conf ] Gianni Franceschini Sorting Stably, In-Place, with O(n log n) Comparisons and O(n) Moves. [Citation Graph (0, 0)][DBLP ] Conf ] Nicole Immorlica , Mohammad Mahdian , Vahab S. Mirrokni Cycle Cover with Short Cycles. [Citation Graph (0, 0)][DBLP ] Conf ] Telikepalli Kavitha , Kurt Mehlhorn A Polynomial Time Algorithm for Minimum Cycle Basis in Directed Graphs. [Citation Graph (0, 0)][DBLP ] Conf ] Surender Baswana , Vishrut Goyal , Sandeep Sen All-Pairs Nearly 2-Approximate Shortest-Paths in O(n2 polylog n) Time. [Citation Graph (0, 0)][DBLP ] Conf ] Massimiliano Goldwurm , Violetta Lonati Pattern Occurrences in Multicomponent Models. [Citation Graph (0, 0)][DBLP ] Conf ] Graham P. Oliver , Richard M. Thomas Automatic Presentations for Finitely Generated Groups. [Citation Graph (0, 0)][DBLP ] Conf ] 