Conferences in DBLP
Janis Barzdins , Rusins Freivalds , Carl H. Smith Towards Axiomatic Basis of Inductive Inference. [Citation Graph (0, 0)][DBLP ] Conf ] Klaus Jansen Approximation Algorithms for Fractional Covering and Packing Problems, and Applications. [Citation Graph (0, 0)][DBLP ] Conf ] Juhani Karhumäki Challenges of Commutation. [Citation Graph (0, 0)][DBLP ] Conf ] Marek Karpinski Approximating Bounded Degree Instances of NP-Hard Problems. [Citation Graph (0, 0)][DBLP ] Conf ] Boris I. Plotkin , Tanya Plotkin Universal Algebra and Computer Science. [Citation Graph (0, 0)][DBLP ] Conf ] Umesh V. Vazirani Quantum Algorithms. [Citation Graph (0, 0)][DBLP ] Conf ] Farid M. Ablayev , Svetlana Ablayeva A Discrete Approximation and Communication Complexity Approach to the Superposition Problem. [Citation Graph (0, 0)][DBLP ] Conf ] Farid M. Ablayev , Aida Gainutdinova , Marek Karpinski On Computational Power of Quantum Branching Programs. [Citation Graph (0, 0)][DBLP ] Conf ] Harald Baier Efficient Computation of Singular Moduli with Application in Cryptography. [Citation Graph (0, 0)][DBLP ] Conf ] Aija Berzina , Richard F. Bonner Ambainis-Freivalds' Algorithm for Measure-Once Automata. [Citation Graph (0, 0)][DBLP ] Conf ] Janis Cirulis Are There Essentially Incomplete Knowledge Representation Systems? [Citation Graph (0, 0)][DBLP ] Conf ] Marcin Ciura Best Increments for the Average Case of Shellsort. [Citation Graph (0, 0)][DBLP ] Conf ] Fedor V. Fomin , Dieter Kratsch , Jean-Christophe Novelli Approximating Minimum Cocolourings. [Citation Graph (0, 0)][DBLP ] Conf ] Karlis Freivalds Curved Edge Routing. [Citation Graph (0, 0)][DBLP ] Conf ] Leszek Gasieniec , Igor Potapov Time/Space Efficient Compressed Pattern Matching. [Citation Graph (0, 0)][DBLP ] Conf ] Bernhard Heinemann Modelling Change with the Aid of Knowledge and Time. [Citation Graph (0, 0)][DBLP ] Conf ] Lane A. Hemaspaandra , Kari Pasanen , Jörg Rothe If P != NP Then Some Strongly Noninvertible Functions Are Invertible. [Citation Graph (0, 0)][DBLP ] Conf ] Kouichi Hirata , Hiroshi Sakamoto Prediction-Preserving Reducibility with Membership Queries on Formal Languages. [Citation Graph (0, 0)][DBLP ] Conf ] Jouni Järvinen Dense Families and Key Functions of Database Relation Instances. [Citation Graph (0, 0)][DBLP ] Conf ] Juhani Karhumäki , Wojciech Plandowski , Wojciech Rytter On the Complexity of Decidable Cases of Commutation Problem for Languages. [Citation Graph (0, 0)][DBLP ] Conf ] Werner Kuich Cones, Semi-AFPs, and AFPs of Algebraic Power Series. [Citation Graph (0, 0)][DBLP ] Conf ] Manfred Kudlek , Yurii Rogozhin New Small Universal Circular Post Machines. [Citation Graph (0, 0)][DBLP ] Conf ] Dietrich Kuske Divisibility Monoids: Presentation, Word Problem, and Rational Languages. [Citation Graph (0, 0)][DBLP ] Conf ] Ruggero Lanotte , Andrea Maggiolo-Schettini , Simone Tini Concurrency in Timed Automata. [Citation Graph (0, 0)][DBLP ] Conf ] Grégory Lafitte How Powerful Are Infinite Time Machines? [Citation Graph (0, 0)][DBLP ] Conf ] Girts Linde Equivalence Problem of Composite Class Diagrams. [Citation Graph (0, 0)][DBLP ] Conf ] Jérôme Monnot , Vangelis Th. Paschos , Sophie Toulouse Differential Approximation Results for the Traveling Salesman Problem with Distances 1 and 2. [Citation Graph (0, 0)][DBLP ] Conf ] Nataly S. Moskaljova , Irina Virbitskaite On the Category of Event Structures with Dense Time. [Citation Graph (0, 0)][DBLP ] Conf ] Arfst Nickelsen , Till Tantau Closure of Polynomial Time Partial Information Classes under Polynomial Time Reductions. [Citation Graph (0, 0)][DBLP ] Conf ] Robert Rettinger , Rutger Verbeek Monte-Carlo Polynomial Versus Linear Time - The Truth-Table Case. [Citation Graph (0, 0)][DBLP ] Conf ] Victor L. Selivanov Relating Automata-Theoretic Hierarchies to Complexity-Theoretic Hierarchies. [Citation Graph (0, 0)][DBLP ] Conf ] Takayoshi Shoudai , Tomoyuki Uchida , Tetsuhiro Miyahara Polynomial Time Algorithms for Finding Unordered Tree Patterns with Internal Variables. [Citation Graph (0, 0)][DBLP ] Conf ] A. N. Trahtman Piecewise and Local Threshold Testability of DFA. [Citation Graph (0, 0)][DBLP ] Conf ] Michal Walicki , Adis Hodzic , Sigurd Meldal Compositional Homomorphisms of Relational Structures. [Citation Graph (0, 0)][DBLP ] Conf ] Janis Buls , Vaira Buza , Roberts Glaudins Representation of Autonomous Automata. [Citation Graph (0, 0)][DBLP ] Conf ] Massimo Pica Ciamarra Quantum Reversibility and a New Model of Quantum Automaton. [Citation Graph (0, 0)][DBLP ] Conf ] Andrej Dubrovsky Space-Efficient 1.5-Way Quantum Turing Machine. [Citation Graph (0, 0)][DBLP ] Conf ] Anna Gambin , Piotr Pokarowski A Combinatorial Aggregation Algorithm for Stationary Distribution of a Large Markov Chain. [Citation Graph (0, 0)][DBLP ] Conf ] Eike Kiltz A Primitive for Proving the Security of Every Bit and About Universal Hash Functions & Hard Core Bits. [Citation Graph (0, 0)][DBLP ] Conf ] Ruvim Lipyanski Pythagorean Triples in Unification Theory of Nilpotent Rings. [Citation Graph (0, 0)][DBLP ] Conf ] Nicolas Ollinger Two-States Bilinear Intrinsically Universal Cellular Automata. [Citation Graph (0, 0)][DBLP ] Conf ] Christophe Papazian , Eric Rémila Linear Time Recognizer for Subsets of Z2 . [Citation Graph (0, 0)][DBLP ] Conf ] Tanya Plotkin Fuzzy Sets and Algorithms of Distributed Task Allocation for Cooperative Agents. [Citation Graph (0, 0)][DBLP ] Conf ] Bella V. Rozenblat On Recursively Enumerable Subsets of N and Rees Matrix Semigroups over (Z3 ; + ). [Citation Graph (0, 0)][DBLP ] Conf ] Oksana Scegulnaja Quantum Real-Time Turing Machine. [Citation Graph (0, 0)][DBLP ] Conf ] Andrew V. Sokolov Mathematical Models and Optimal Algorithms of Dynamic Data Structure Control. [Citation Graph (0, 0)][DBLP ] Conf ] Olga Sokratova Linear Automata and Recognizable Subsets in Free Semirings. [Citation Graph (0, 0)][DBLP ] Conf ] Mati Tombak , Ain Isotamm , Tõnu Tamme On Logical Method for Counting Dedekind Numbers. [Citation Graph (0, 0)][DBLP ] Conf ] Gabriel Valiente A General Method for Graph Isomorphism. [Citation Graph (0, 0)][DBLP ] Conf ] Foto N. Afrati , Ioannis Milis Designing PTASs for MIN-SUM Scheduling Problems. [Citation Graph (0, 0)][DBLP ] Conf ] Andreas Brandstädt On Robust Algorithms for the Maximum Weight Stable Set Problem. [Citation Graph (0, 0)][DBLP ] Conf ] Luisa Gargano Multicasting in Optical Networks. [Citation Graph (0, 0)][DBLP ] Conf ] Benjamin Doerr Structured Randomized Rounding and Coloring. [Citation Graph (0, 0)][DBLP ] Conf ] Leah Epstein , Rob van Stee Optimal Online Flow Time with Resource Augmentation. [Citation Graph (0, 0)][DBLP ] Conf ] Thomas Erlebach , Danica Vukadinovic New Results for Path Problems in Generalized Stars, Complete Graphs, and Brick Wall Graphs. [Citation Graph (0, 0)][DBLP ] Conf ] Aleksei V. Fishkin , Klaus Jansen , Lorant Porkolab On Minimizing Average Weighted Completion Time: A PTAS for Scheduling General Multiprocessor Tasks. [Citation Graph (0, 0)][DBLP ] Conf ] Fedor V. Fomin , Andrzej Lingas Approximation Algorithms for Time-Dependent Orienteering. [Citation Graph (0, 0)][DBLP ] Conf ] Daniel Král On Complexity of Colouring Mixed Hypertrees. [Citation Graph (0, 0)][DBLP ] Conf ] Monaldo Mastrolilli Combining Arithmetic and Geometric Rounding Techniques for Knapsack Problems. [Citation Graph (0, 0)][DBLP ] Conf ] Taneli Mielikäinen , Esko Ukkonen The Complexity of Maximum Matroid-Greedoid Intersection. [Citation Graph (0, 0)][DBLP ] Conf ] 