Conferences in DBLP
Ahmed Bouajjani , Peter Habermehl , Yan Jurski , Mihaela Sighireanu Rewriting Systems with Data. [Citation Graph (0, 0)][DBLP ] Conf ] Oscar H. Ibarra , Sara Woodworth Spiking Neural P Systems: Some Characterizations. [Citation Graph (0, 0)][DBLP ] Conf ] László Lovász Approximating Graphs by Graphs and Functions (Abstract). [Citation Graph (0, 0)][DBLP ] Conf ] Philip J. Scott Traces, Feedback, and the Geometry of Computation (Abstract). [Citation Graph (0, 0)][DBLP ] Conf ] Abdullah N. Arslan A Largest Common d-Dimensional Subsequence of Two d-Dimensional Strings. [Citation Graph (0, 0)][DBLP ] Conf ] Stavros Athanassopoulos , Ioannis Caragiannis , Christos Kaklamanis Analysis of Approximation Algorithms for k-Set Cover Using Factor-Revealing Linear Programs. [Citation Graph (0, 0)][DBLP ] Conf ] Eric Bach , Jin-yi Cai A Novel Information Transmission Problem and Its Optimal Solution. [Citation Graph (0, 0)][DBLP ] Conf ] Puneet Bhateja , Paul Gastin , Madhavan Mukund , K. Narayan Kumar Local Testing of Message Sequence Charts Is Difficult. [Citation Graph (0, 0)][DBLP ] Conf ] Henrik Björklund , Thomas Schwentick On Notions of Regularity for Data Languages. [Citation Graph (0, 0)][DBLP ] Conf ] Viviana Bono , Jaroslaw D. M. Kusmierek FJMIP: A Calculus for a Modular Object Initialization. [Citation Graph (0, 0)][DBLP ] Conf ] Henning Bordihn , György Vaszil Top-Down Deterministic Parsing of Languages Generated by CD Grammar Systems. [Citation Graph (0, 0)][DBLP ] Conf ] Hans-Georg Breunig The Complexity of Membership Problems for Circuits over Sets of Positive Numbers. [Citation Graph (0, 0)][DBLP ] Conf ] Gaëlle Brevier , Romeo Rizzi , Stéphane Vialette Pattern Matching in Protein-Protein Interaction Graphs. [Citation Graph (0, 0)][DBLP ] Conf ] Robert Brijder , Hendrik Jan Hoogeboom , Grzegorz Rozenberg From Micro to Macro: How the Overlap Graph Determines the Reduction Graph in Ciliates. [Citation Graph (0, 0)][DBLP ] Conf ] Robert Brijder , Miika Langille , Ion Petre A String-Based Model for Simple Gene Assembly. [Citation Graph (0, 0)][DBLP ] Conf ] Nadia Busi , Claudio Zandron On the Computational Power of Genetic Gates with Interleaving Semantics: The Power of Inhibition and Degradation. [Citation Graph (0, 0)][DBLP ] Conf ] Jin-yi Cai , Pinyan Lu On Block-Wise Symmetric Signatures for Matchgates. [Citation Graph (0, 0)][DBLP ] Conf ] Didier Caucal , Dinh Trong Hieu Path Algorithms on Regular Graphs. [Citation Graph (0, 0)][DBLP ] Conf ] Miroslav Ciric , Aleksandar Stamenkovic , Jelena Ignjatovic , Tatjana Petkovic Factorization of Fuzzy Automata. [Citation Graph (0, 0)][DBLP ] Conf ] Thomas Colcombet Factorisation Forests for Infinite Words. [Citation Graph (0, 0)][DBLP ] Conf ] Clelia de Felice , Gabriele Fici , Rosalba Zizza Marked Systems and Circular Splicing. [Citation Graph (0, 0)][DBLP ] Conf ] Sebastian Dörn , Thomas Thierauf The Quantum Query Complexity of Algebraic Properties. [Citation Graph (0, 0)][DBLP ] Conf ] Jacques Duparc , Filip Murlak On the Topological Complexity of Weakly Recognizable Tree Languages. [Citation Graph (0, 0)][DBLP ] Conf ] Jörg Endrullis , Clemens Grabmayer , Dimitri Hendriks , Ariya Isihara , Jan Willem Klop Productivity of Stream Definitions. [Citation Graph (0, 0)][DBLP ] Conf ] Leah Epstein , Asaf Levin , Rob van Stee Multi-dimensional Packing with Conflicts. [Citation Graph (0, 0)][DBLP ] Conf ] Gábor Erdélyi , Lane A. Hemaspaandra , Jörg Rothe , Holger Spakowski On Approximating Optimal Weighted Lobbying, and Frequency of Correctness Versus Average-Case Polynomial Time. [Citation Graph (0, 0)][DBLP ] Conf ] Michael R. Fellows , Michael A. Langston , Frances A. Rosamond , Peter Shaw Efficient Parameterized Preprocessing for Cluster Editing. [Citation Graph (0, 0)][DBLP ] Conf ] Gyula Györ Representing the Boolean OR Function by Quadratic Polynomials Modulo 6. [Citation Graph (0, 0)][DBLP ] Conf ] Edith Hemaspaandra , Lane A. Hemaspaandra , Till Tantau , Osamu Watanabe On the Complexity of Kings. [Citation Graph (0, 0)][DBLP ] Conf ] Michael Hoffmann 0002 , Richard M. Thomas Notions of Hyperbolicity in Monoids. [Citation Graph (0, 0)][DBLP ] Conf ] Mihai Ionescu , Dragos Sburlan P Systems with Adjoining Controlled Communication Rules. [Citation Graph (0, 0)][DBLP ] Conf ] Michal Kunc The Simplest Language Where Equivalence of Finite Substitutions Is Undecidable. [Citation Graph (0, 0)][DBLP ] Conf ] Martin Kutrib , Andreas Malcher Real-Time Reversible Iterative Arrays. [Citation Graph (0, 0)][DBLP ] Conf ] Johan Kwisthout The Computational Complexity of Monotonicity in Probabilistic Networks. [Citation Graph (0, 0)][DBLP ] Conf ] Chi-Jen Lu , Shi-Chun Tsai , Hsin-Lung Wu Impossibility Results on Weakly Black-Box Hardness Amplification. [Citation Graph (0, 0)][DBLP ] Conf ] Alexander Meduna , Jirí Techet Maximal and Minimal Scattered Context Rewriting. [Citation Graph (0, 0)][DBLP ] Conf ] Hartmut Messerschmidt , Friedrich Otto Strictly Deterministic CD-Systems of Restarting Automata. [Citation Graph (0, 0)][DBLP ] Conf ] Rajat Mittal , Mario Szegedy Product Rules in Semidefinite Programming. [Citation Graph (0, 0)][DBLP ] Conf ] Alexander Okhotin Expressive Power of LL(k) Boolean Grammars. [Citation Graph (0, 0)][DBLP ] Conf ] Mathias Samuelides , Luc Segoufin Complexity of Pebble Tree-Walking Automata. [Citation Graph (0, 0)][DBLP ] Conf ] Andrea Sattler-Klein Some Complexity Results for Prefix Gröbner Bases in Free Monoid Rings. [Citation Graph (0, 0)][DBLP ] Conf ] Hadas Shachnai , Omer Yehezkely Fast Asymptotic FPTAS for Packing Fragmentable Items with Costs. [Citation Graph (0, 0)][DBLP ] Conf ] Takeyuki Tamura , Tatsuya Akutsu An O(1.787n )-Time Algorithm for Detecting a Singleton Attractor in a Boolean Network Consisting of AND/OR Nodes. [Citation Graph (0, 0)][DBLP ] Conf ] 