| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Anna Gál, Vladimir Trifonov |
On the Correlation Between Parity and Modular Polynomials.  |
Theory Comput. Syst.  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael R. Fellows, Serge Gaspers, Frances A. Rosamond |
Parameterizing by the Number of Numbers.  |
Theory Comput. Syst.  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Arnold Beckmann, Wolfgang Merkle, Benedikt Löwe |
Computability in Europe 2009.  |
Theory Comput. Syst.  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Khandoker Mohammed Mominul Haque |
Irregular Total Labellings of Generalized Petersen Graphs.  |
Theory Comput. Syst.  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Valentin V. Andreev, Timothy H. McNicholl |
Computing Conformal Maps of Finitely Connected Domains onto Canonical Slit Domains.  |
Theory Comput. Syst.  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Tetsuo Asano |
In-place Algorithm for Erasing a Connected Component in a Binary Image.  |
Theory Comput. Syst.  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Paolo Boldi, Luisa Gargano |
Special Issue on Fun with Algorithms.  |
Theory Comput. Syst.  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Jean-Yves Marion, Thomas Schwentick |
Theoretical Aspects of Computer Science.  |
Theory Comput. Syst.  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Ruo-Wei Hung |
Linear-Time Algorithm for the Paired-Domination Problem in Convex Bipartite Graphs.  |
Theory Comput. Syst.  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Edward A. Hirsch, Dmitry Itsykson, Ivan Monakhov, Alexander Smal |
On Optimal Heuristic Randomized Semidecision Procedures, with Applications to Proof Complexity and Cryptography.  |
Theory Comput. Syst.  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Artur Jez, Alexander Okhotin |
Representing Hyper-arithmetical Sets by Equations over Sets of Integers.  |
Theory Comput. Syst.  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Vladimir V. V'yugin |
On Empirical Meaning of Randomness with Respect to Parametric Families of Probability Distributions.  |
Theory Comput. Syst.  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Philip Bille |
Faster Approximate String Matching for Short Patterns.  |
Theory Comput. Syst.  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Matan Mandelbrod |
Layered Hashing Algorithm for Real-time Systems.  |
Theory Comput. Syst.  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Lars Kristiansen, Bedeho Mesghina Wolde Mender |
Non-determinism in Gödel's System T.  |
Theory Comput. Syst.  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Fedor V. Fomin, Petr A. Golovach, Daniel Lokshtanov |
Cops and Robber Game Without Recharging.  |
Theory Comput. Syst.  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Jan A. Bergstra, C. A. Middelburg |
On the Expressiveness of Single-Pass Instruction Sequences.  |
Theory Comput. Syst.  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | John Case, Samuel E. Moelius |
Program Self-Reference in Constructive Scott Subdomains.  |
Theory Comput. Syst.  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Michal Bielecki, Jan Hidders, Jan Paredaens, Marc Spielmann, Jerzy Tyszkiewicz, Jan Van den Bussche |
The Navigational Power of Web Browsers.  |
Theory Comput. Syst.  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Tobias Gärtner, Günter Hotz |
Representation Theorems for Analytic Machines and Computability of Analytic Functions.  |
Theory Comput. Syst.  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Dimitris Fotakis, Vasilis Gkatzelis, Alexis C. Kaporis, Paul G. Spirakis |
The Impact of Social Ignorance on Weighted Congestion Games.  |
Theory Comput. Syst.  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael Thomas |
The Complexity of Circumscriptive Inference in Post's Lattice.  |
Theory Comput. Syst.  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Frank Ruskey, Aaron Williams |
The Feline Josephus Problem.  |
Theory Comput. Syst.  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Zoltán Fülöp, Torsten Stüber, Heiko Vogler |
A Büchi-Like Theorem for Weighted Tree Automata over Multioperator Monoids.  |
Theory Comput. Syst.  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Jean Cardinal, Samuel Fiorini, Gwenaël Joret |
Minimum Entropy Combinatorial Optimization Problems.  |
Theory Comput. Syst.  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Paola Flocchini, Matthew Kellett, Peter C. Mason, Nicola Santoro |
Searching for Black Holes in Subways.  |
Theory Comput. Syst.  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Riccardo Focardi, Flaminia L. Luccio |
Guessing Bank PINs by Winning a Mastermind Game.  |
Theory Comput. Syst.  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Dale Daniel, Timothy H. McNicholl |
Effective Versions of Local Connectivity Properties.  |
Theory Comput. Syst.  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Hans L. Bodlaender, Fedor V. Fomin, Arie M. C. A. Koster, Dieter Kratsch, Dimitrios M. Thilikos |
A Note on Exact Algorithms for Vertex Ordering Problems on Graphs.  |
Theory Comput. Syst.  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Stefan S. Dantchev, Barnaby Martin |
Cutting Planes and the Parameter Cutwidth.  |
Theory Comput. Syst.  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Shukai Cai, Taisuke Izumi, Koichi Wada |
How to Prove Impossibility Under Global Fairness: On Space Complexity of Self-Stabilizing Leader Election on a Population Protocol Model.  |
Theory Comput. Syst.  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Mark Burgin, Bidyut Gupta |
Second-Level Algorithms, Superrecursivity, and Recovery Problem in Distributed Systems.  |
Theory Comput. Syst.  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Jan A. Bergstra, Inge Bethke |
On the Contribution of Backward Jumps to Instruction Sequence Expressiveness.  |
Theory Comput. Syst.  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Arpita Ghosh, Mohammad Mahdian |
Christmas Gift Exchange Games.  |
Theory Comput. Syst.  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Arnaud Durand, Miki Hermann, Gustav Nordh |
Trichotomies in the Complexity of Minimal Inference.  |
Theory Comput. Syst.  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Raphaël Clifford, Markus Jalsenius, Ashley Montanaro, Benjamin Sach |
The Complexity of Flood Filling Games.  |
Theory Comput. Syst.  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | P. J. Couch, B. D. Daniel, Timothy H. McNicholl |
Computing Space-Filling Curves.  |
Theory Comput. Syst.  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Amr Elmasry, Claus Jensen, Jyrki Katajainen |
Two Skew-Binary Numeral Systems and One Application.  |
Theory Comput. Syst.  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Lance Fortnow, Jack H. Lutz, Elvira Mayordomo |
Inseparability and Strong Hypotheses for Disjoint NP Pairs.  |
Theory Comput. Syst.  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Irina Kostitsyna, Valentin Polishchuk |
Simple Wriggling is Hard Unless You Are a Fat Hippo.  |
Theory Comput. Syst.  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Erik Jan van Leeuwen, Jan van Leeuwen |
Structure of Polynomial-Time Approximation.  |
Theory Comput. Syst.  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Evangelos Kranakis, Danny Krizanc |
Maintaining Privacy on a Line.  |
Theory Comput. Syst.  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | M. A. Cerdà-Uguet, Michel P. Schellekens, Oscar Valero |
The Baire Partial Quasi-Metric Space: A Mathematical Tool for Asymptotic Complexity Analysis in Computer Science.  |
Theory Comput. Syst.  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Adrian Dumitrescu, Minghui Jiang |
Dispersion in Disks.  |
Theory Comput. Syst.  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | László Egri, Andrei A. Krokhin, Benoit Larose, Pascal Tesson |
The Complexity of the List Homomorphism Problem for Graphs.  |
Theory Comput. Syst.  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Ioannis Caragiannis, Christos Kaklamanis, Panagiotis Kanellopoulos, Maria Kyropoulou |
The Efficiency of Fair Division.  |
Theory Comput. Syst.  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Klaus Ambos-Spies, Timur Bakibayev |
Comparing Nontriviality for E and EXP.  |
Theory Comput. Syst.  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Hossein Ghasemalizadeh, Mohammadreza Razzazi |
An Improved Approximation Algorithm for the Most Points Covering Problem.  |
Theory Comput. Syst.  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Xiaoyang Gu, John M. Hitchcock, Aduri Pavan |
Collapsing and Separating Completeness Notions Under Average-Case and Worst-Case Hypotheses.  |
Theory Comput. Syst.  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Peter Burcsi, Ferdinando Cicalese, Gabriele Fici, Zsuzsanna Lipták |
On Approximate Jumbled Pattern Matching in Strings.  |
Theory Comput. Syst.  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Tami Tamir |
Scheduling with Bully Selfish Jobs.  |
Theory Comput. Syst.  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Simone Bova, Hubie Chen, Matthew Valeriote |
On the Expression Complexity of Equivalence and Isomorphism of Primitive Positive Formulas.  |
Theory Comput. Syst.  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Timothy H. McNicholl |
An Effective Carathéodory Theorem.  |
Theory Comput. Syst.  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Todd J. Green, Zachary G. Ives, Val Tannen |
Reconcilable Differences.  |
Theory Comput. Syst.  |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Khanh Do Ba, Huy L. Nguyen, Huy N. Nguyen, Ronitt Rubinfeld |
Sublinear Time Algorithms for Earth Mover's Distance.  |
Theory Comput. Syst.  |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Jan A. Bergstra, Inge Bethke |
Straight-line Instruction Sequence Completeness for Total Calculation on Cancellation Meadows.  |
Theory Comput. Syst.  |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Chien-Hung Lin, Jia Jie Liu, Yue-Li Wang, William Chung-Kung Yen |
The Hub Number of Sierpiński-Like Graphs.  |
Theory Comput. Syst.  |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Hagit Attiya, Eshcar Hillel, Alessia Milani |
Inherent Limitations on Disjoint-Access Parallel Implementations of Transactional Memory.  |
Theory Comput. Syst.  |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Ryan C. Harkins, John M. Hitchcock |
Dimension, Halfspaces, and the Density of Hard Sets.  |
Theory Comput. Syst.  |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Marios Mavronicolas |
Preface: Algorithmic Game Theory.  |
Theory Comput. Syst.  |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | B. V. Raghavendra Rao, Jayalal M. N. Sarma |
On the Complexity of Matroid Isomorphism Problem.  |
Theory Comput. Syst.  |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Magnus Wahlström |
New Plain-Exponential Time Classes for Graph Homomorphism.  |
Theory Comput. Syst.  |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Stefan Göller, Markus Lohrey |
Fixpoint Logics over Hierarchical Structures.  |
Theory Comput. Syst.  |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael Soltys, Craig Wilson |
On the Complexity of Computing Winning Strategies for Finite Poset Games.  |
Theory Comput. Syst.  |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Akitoshi Kawamura |
Generalized Semimagic Squares for Digital Halftoning.  |
Theory Comput. Syst.  |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Tobias Harks |
Stackelberg Strategies and Collusion in Network Games with Splittable Flow.  |
Theory Comput. Syst.  |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Tobias Harks, Max Klimm, Rolf H. Möhring |
Characterizing the Existence of Potential Functions in Weighted Congestion Games.  |
Theory Comput. Syst.  |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Péter Gács, Mathieu Hoyrup, Cristobal Rojas |
Randomness on Computable Probability Spaces - A Dynamical Point of View.  |
Theory Comput. Syst.  |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Volker Diekert, Manfred Kufleitner |
Fragments of First-Order Logic over Infinite Words.  |
Theory Comput. Syst.  |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Felix Brandt, Markus Brill, Felix A. Fischer, Jan Hoffmann 0002 |
The Computational Complexity of Weak Saddles.  |
Theory Comput. Syst.  |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Tomás Ebenlendr, Jiri Sgall |
Semi-Online Preemptive Scheduling: One Algorithm for All Variants.  |
Theory Comput. Syst.  |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | MohammadHossein Bateni, Lukasz Golab, MohammadTaghi Hajiaghayi, Howard J. Karloff |
Scheduling to Minimize Staleness and Stretch in Real-Time Data Warehouses.  |
Theory Comput. Syst.  |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Hyunwoo Jung, Kyung-Yong Chwa |
The Balloon Popping Problem Revisited: Lower and Upper Bounds.  |
Theory Comput. Syst.  |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Marcelo Arenas, Pablo Barceló, Leonid Libkin |
Regular Languages of Nested Words: Fixed Points, Automata, and Synchronization.  |
Theory Comput. Syst.  |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Dániel Marx |
Tractable Structures for Constraint Satisfaction with Truth Tables.  |
Theory Comput. Syst.  |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael A. Bender, Bradley C. Kuszmaul, Shang-Hua Teng, Kebin Wang |
Optimal Cache-Oblivious Mesh Layouts.  |
Theory Comput. Syst.  |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Niko Haubold, Markus Lohrey |
Compressed Word Problems in HNN-extensions and Amalgamated Products.  |
Theory Comput. Syst.  |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Galina Jirásková |
Concatenation of Regular Languages and Descriptional Complexity.  |
Theory Comput. Syst.  |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Fabian Kuhn, Thomas Locher, Rotem Oshman |
Gradient Clock Synchronization in Dynamic Networks.  |
Theory Comput. Syst.  |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Johanne Cohen, Christoph Dürr, Nguyen Kim Thang |
Non-clairvoyant Scheduling Games.  |
Theory Comput. Syst.  |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Bruno Bauwens, Sebastiaan A. Terwijn |
Notes on Sum-Tests and Independence Tests.  |
Theory Comput. Syst.  |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Aviv Nisgav, Boaz Patt-Shamir |
Finding Similar Users in Social Networks.  |
Theory Comput. Syst.  |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Todd J. Green |
Containment of Conjunctive Queries on Annotated Relations.  |
Theory Comput. Syst.  |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Beate Bollig, Jochen Klump |
New Results on the Most Significant Bit of Integer Multiplication.  |
Theory Comput. Syst.  |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Marcelo Arenas, Pablo Barceló, Juan L. Reutter |
Query Languages for Data Exchange: Beyond Unions of Conjunctive Queries.  |
Theory Comput. Syst.  |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Gabriel Ciobanu, Shankara Narayanan Krishna |
Enhanced Mobile Membranes: Computability Results.  |
Theory Comput. Syst.  |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Daniil Musatov, Andrei E. Romashchenko, Alexander Shen |
Variations on Muchnik's Conditional Complexity Theorem.  |
Theory Comput. Syst.  |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Felix Brandt, Markus Brill, Felix A. Fischer, Paul Harrenstein |
On the Complexity of Iterated Weak Dominance in Constant-Sum Games.  |
Theory Comput. Syst.  |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Hartmut Messerschmidt, Friedrich Otto |
A Hierarchy of Monotone Deterministic Non-Forgetting Restarting Automata.  |
Theory Comput. Syst.  |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Jesper Jansson, Zeshan Peng |
Algorithms for Finding a Most Similar Subforest.  |
Theory Comput. Syst.  |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Leah Epstein, Rob van Stee |
Improved Results for a Memory Allocation Problem.  |
Theory Comput. Syst.  |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Joël Alwen, Chris Peikert |
Generating Shorter Bases for Hard Random Lattices.  |
Theory Comput. Syst.  |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | James I. Lathrop, Jack H. Lutz, Matthew J. Patitz, Scott M. Summers |
Computability and Complexity in Self-assembly.  |
Theory Comput. Syst.  |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Emilio Di Giacomo, Walter Didimo, Giuseppe Liotta, Henk Meijer |
Area, Curve Complexity, and Crossing Resolution of Non-Planar Graph Drawings.  |
Theory Comput. Syst.  |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Clemens Thielen, Sven Oliver Krumke |
Truthful Mechanisms for Selfish Routing and Two-Parameter Agents.  |
Theory Comput. Syst.  |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Markus Lohrey, Benjamin Steinberg |
Tilings and Submonoids of Metabelian Groups.  |
Theory Comput. Syst.  |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Artur Jez, Alexander Okhotin |
One-Nonterminal Conjunctive Grammars over a Unary Alphabet.  |
Theory Comput. Syst.  |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Ronald Koch, Martin Skutella |
Nash Equilibria and the Price of Anarchy for Flows over Time.  |
Theory Comput. Syst.  |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Susanne Albers, Jean-Yves Marion |
Preface: Special Issue on Theoretical Aspects of Computer Science (STACS).  |
Theory Comput. Syst.  |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Elvira Mayordomo, Philippe Moser, Sylvain Perifel |
Polylog Space Compression, Pushdown Compression, and Lempel-Ziv Are Incomparable.  |
Theory Comput. Syst.  |
2011 |
DBLP DOI BibTeX RDF |
|