The FacetedDBLP logo    Search for: in:

Disable automatic phrases ?     Syntactic query expansion: ?

Publications at "Theory Comput. Syst."( http://dblp.L3S.de/Venues/Theory_Comput._Syst. )

URL (DBLP): http://dblp.uni-trier.de/db/journals/mst

Publication years (Num. hits)
1997 (33) 1998 (35) 1999 (26) 2000 (22) 2001 (18) 2002 (35) 2003 (35) 2004 (30) 2005 (37) 2006 (50) 2007 (65) 2008 (61) 2009 (85) 2010 (83) 2011 (80) 2012 (53)
Publication types (Num. hits)
article(748)
Venues (Conferences, Journals, ...)
GrowBag graphs for keyword ? (Num. hits/coverage)

Group by:
The graphs summarize 350 occurrences of 286 keywords

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