Theory of Computing Systems, Volume 50

Volume 50, Number 1, January 2012

• Paolo Boldi, Luisa Gargano:
  Special Issue on Fun with Algorithms. 1-2
  
• Arpita Ghosh, Mohammad Mahdian:
  Christmas Gift Exchange Games. 3-19
  
• Frank Ruskey, Aaron Williams:
  The Feline Josephus Problem. 20-34
  
• Peter Burcsi, Ferdinando Cicalese, Gabriele Fici, Zsuzsanna Lipták:
  On Approximate Jumbled Pattern Matching in Strings. 35-51
  
• Riccardo Focardi, Flaminia L. Luccio:
  Guessing Bank PINs by Winning a Mastermind Game. 52-71
  
• Raphaël Clifford, Markus Jalsenius, Ashley Montanaro, Benjamin Sach:
  The Complexity of Flood Filling Games. 72-92
  
• Irina Kostitsyna, Valentin Polishchuk:
  Simple Wriggling is Hard Unless You Are a Fat Hippo. 93-110
  
• Tetsuo Asano:
  In-place Algorithm for Erasing a Connected Component in a Binary Image. 111-123
  
• Tami Tamir:
  Scheduling with Bully Selfish Jobs. 124-146
  
• Evangelos Kranakis, Danny Krizanc:
  Maintaining Privacy on a Line. 147-157
  
• Paola Flocchini, Matthew Kellett, Peter C. Mason, Nicola Santoro:
  Searching for Black Holes in Subways. 158-184
  
• Amr Elmasry, Claus Jensen, Jyrki Katajainen:
  Two Skew-Binary Numeral Systems and One Application. 185-211
  

Volume 50, Number 2, February 2012

• Michal Bielecki, Jan Hidders, Jan Paredaens, Marc Spielmann, Jerzy Tyszkiewicz, Jan Van den Bussche:
  The Navigational Power of Web Browsers. 213-240
  
• Zoltán Fülöp, Torsten Stüber, Heiko Vogler:
  A Büchi-Like Theorem for Weighted Tree Automata over Multioperator Monoids. 241-278
  
• Matan Mandelbrod:
  Layered Hashing Algorithm for Real-time Systems. 279-295
  
• Vladimir V. V'yugin:
  On Empirical Meaning of Randomness with Respect to Parametric Families of Probability Distributions. 296-312
  
• Jan A. Bergstra, C. A. Middelburg:
  On the Expressiveness of Single-Pass Instruction Sequences. 313-328
  
• Simone Bova, Hubie Chen, Matthew Valeriote:
  On the Expression Complexity of Equivalence and Isomorphism of Primitive Positive Formulas. 329-353
  
• Valentin V. Andreev, Timothy H. McNicholl:
  Computing Conformal Maps of Finitely Connected Domains onto Canonical Slit Domains. 354-369
  
• P. J. Couch, B. D. Daniel, Timothy H. McNicholl:
  Computing Space-Filling Curves. 370-386
  
• 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. 387-399
  

Volume 50, Number 3, April 2012

• Michael Thomas:
  The Complexity of Circumscriptive Inference in Post's Lattice. 401-419
  
• 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. 420-432
  
• 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. 433-445
  
• Arnaud Durand, Miki Hermann, Gustav Nordh:
  Trichotomies in the Complexity of Minimal Inference. 446-491
  
• Philip Bille:
  Faster Approximate String Matching for Short Patterns. 492-515
  
• Anna Gál, Vladimir Trifonov:
  On the Correlation Between Parity and Modular Polynomials. 516-536
  
• Khandoker Mohammed Mominul Haque:
  Irregular Total Labellings of Generalized Petersen Graphs. 537-544
  
• Hossein Ghasemalizadeh, Mohammadreza Razzazi:
  An Improved Approximation Algorithm for the Most Points Covering Problem. 545-558
  
• Dimitris Fotakis, Vasilis Gkatzelis, Alexis C. Kaporis, Paul G. Spirakis:
  The Impact of Social Ignorance on Weighted Congestion Games. 559-578
  

Volume 50, Number 4, May 2012

• Timothy H. McNicholl:
  An Effective Carathéodory Theorem. 579-588
  
• Ioannis Caragiannis, Christos Kaklamanis, Panagiotis Kanellopoulos, Maria Kyropoulou:
  The Efficiency of Fair Division. 589-610
  
• Fedor V. Fomin, Petr A. Golovach, Daniel Lokshtanov:
  Cops and Robber Game Without Recharging. 611-620
  
• Dale Daniel, Timothy H. McNicholl:
  Effective Versions of Local Connectivity Properties. 621-640
  
• Erik Jan van Leeuwen, Jan van Leeuwen:
  Structure of Polynomial-Time Approximation. 641-674
  
• Michael R. Fellows, Serge Gaspers, Frances A. Rosamond:
  Parameterizing by the Number of Numbers. 675-693
  
• Mark Burgin, Bidyut Gupta:
  Second-Level Algorithms, Superrecursivity, and Recovery Problem in Distributed Systems. 694-705
  
• Jan A. Bergstra, Inge Bethke:
  On the Contribution of Backward Jumps to Instruction Sequence Expressiveness. 706-720
  
• Ruo-Wei Hung:
  Linear-Time Algorithm for the Paired-Domination Problem in Convex Bipartite Graphs. 721-738
  

Last update Wed May 22 18:07:12 2013 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page