External Links

    Journal: Inf. Comput.

    Volume 205, Issue 9

    1295 -- 1306Jason P. Bell, Teow Lim Goh. Exponential lower bounds for the number of words of uniform length avoiding a pattern
    1307 -- 1316Stavros Konstantinidis. Computing the edit distance of a regular language
    1317 -- 1333Xiaoyang Gu, Jack H. Lutz, Philippe Moser. Dimensions of Copeland-Erdös sequences
    1334 -- 1370Nicoletta De Francesco, Luca Martini. Instruction-level security analysis for information flow in stack-based assembly languages
    1371 -- 1386Luigi Liquori, Simona Ronchi Della Rocca. Intersection-types à la Church
    1387 -- 1412Tomasz Jurdzinski, Krzysztof Lorys. Lower bound technique for length-reducing automata
    1413 -- 1425Guo-Qiang Zhang. Mediating secure information flow policies
    1426 -- 1458Rance Cleaveland, Gerald Lüttgen, V. Natarajan. Priority and abstraction in process algebra
    1459 -- 1469Wojciech Rytter. The number of runs in a string
    1470 -- 1490Roberto M. Amadio. A synchronous pi-calculus

    Volume 205, Issue 8

    1117 -- 1129Nir Ailon, Noga Alon. Hardness of fully dense problems
    1130 -- 1148Orna Grumberg, Martin Lange, Martin Leucker, Sharon Shoham. When not losing is better than winning: Abstraction and refinement for the full mu-calculus
    1149 -- 1172Elena Fersman, Pavel Krcál, Paul Pettersson, Wang Yi. Task automata: Schedulability, decidability and undecidability
    1173 -- 1187Viliam Geffert, Carlo Mereghetti, Giovanni Pighizzini. Complementing two-way finite automata
    1188 -- 1211Bahareh Badban, Jaco van de Pol, Olga Tveretina, Hans Zantema. Generalizing DPLL and satisfiability for equalities
    1212 -- 1234Markus Lohrey, Nicole Ondrusch. Inverse monoids: Decidability and complexity of algebraic questions
    1235 -- 1273Silvia Crafa, Sabina Rossi. Controlling information release in the pi-calculus
    1274 -- 1293Lane A. Hemaspaandra, Christopher M. Homan, Sven Kosub. Cluster computing and the power of edge recognition

    Volume 205, Issue 7

    967 -- 981John H. Reif, Sukhendu Chakraborty. Efficient and exact quantum compression
    982 -- 1011Murdoch Gabbay. A general mathematics of names
    1012 -- 1026Alberto Apostolico. Fast gapped variants for Lempel-Ziv-Welch compression
    1027 -- 1077Marta Z. Kwiatkowska, Gethin J. Norman, Jeremy Sproston, Fuzhi Wang. Symbolic model checking for probabilistic timed automata
    1078 -- 1095Iiro S. Honkala, Tero Laihonen. On identifying codes that are robust against edge changes
    1096 -- 1113Kimmo Fredriksson, Veli Mäkinen, Gonzalo Navarro. Rotation and lighting invariant template matching
    1114 -- 1116Noga Alon, Haim Kaplan, Michael Krivelevich, Dahlia Malkhi, Julien P. Stern. Addendum to Scalable secure storage when half the system is faulty [Inform. Comput 174 (2)(2002) 203-213]

    Volume 205, Issue 6

    817 -- 869Kumar Neeraj Verma, Jean Goubault-Larrecq. Alternating two-way AC-tree automata
    870 -- 889Alexander Rabinovich. On decidability of monadic logic of order over the naturals extended by monadic predicates
    890 -- 916Pekka Kilpeläinen, Rauno Tuhkanen. One-unambiguity of regular expressions with numeric occurrence indicators
    917 -- 965Maribel Fernández, Murdoch Gabbay. Nominal rewriting

    Volume 205, Issue 5

    651 -- 678Andrei A. Bulatov, Víctor Dalmau. Towards a dichotomy theorem for the counting constraint satisfaction problem
    679 -- 693Christian Lavault, Jean-François Marckert, Vlady Ravelomanana. Quasi-optimal energy-efficient leader election algorithms in radio networks
    694 -- 706John M. Hitchcock, Aduri Pavan. Comparing reductions to NP-complete sets
    707 -- 715Alexander Rabinovich. Temporal logics with incommensurable distances are undecidable
    716 -- 732Andreas Klein, Markus Wessler. Extended visual cryptography schemes
    733 -- 782Paolo Baldan, Andrea Corradini, Ugo Montanari, Leila Ribeiro. Unfolding semantics of graph transformation
    783 -- 815Carole Delporte-Gallet, Hugues Fauconnier, Rachid Guerraoui, Bastian Pochon. The perfectly synchronized round-based model of distributed computing

    Volume 205, Issue 4

    417 -- 418Jürgen Giesl. RTA 2005
    419 -- 473Delia Kesner, Stéphane Lengrand. Resource operators for lambda-calculus
    474 -- 511Nao Hirokawa, Aart Middeldorp. Tyrolean termination tool: Techniques and features
    512 -- 534Alfons Geser, Dieter Hofbauer, Johannes Waldmann, Hans Zantema. On tree automata that certify termination of left-linear term rewriting systems
    535 -- 556Nachum Dershowitz, E. Castedo Ellerman. Leanest quasi-orderings
    557 -- 580Robert Nieuwenhuis, Albert Oliveras. Fast congruence closure and extensions
    581 -- 623Pascal Lafourcade, Denis Lugiez, Ralf Treinen. Intruder deduction for the equational theory of Abelian groups with distributive encryption
    624 -- 650Thierry Boy de la Tour, Mnacho Echenim. Permutative rewriting and unification

    Volume 205, Issue 3

    263 -- 310Anuj Dawar, Philippa Gardner, Giorgio Ghelli. Expressiveness and complexity of graph logic
    311 -- 379Nicole Schweikardt. An Ehrenfeucht-Fraïssé game approach to collapse results in database theory
    380 -- 415Stéphane Demri, Deepak D Souza. An automata-theoretic approach to constraint LTL

    Volume 205, Issue 2

    125 -- 198Arend Rensink, Walter Vogler. Fair testing
    199 -- 224Ahmed Bouajjani, Anca Muscholl, Tayssir Touili. Permutation rewriting and algorithmic verification
    225 -- 241Hui Gao, Wim H. Hesselink. A general lock-free algorithm using compare-and-swap
    242 -- 261Alexey V. Chernov, Marcus Hutter, Jürgen Schmidhuber. Algorithmic complexity bounds on future prediction errors

    Volume 205, Issue 12

    1685 -- 1720Michael Backes, Birgit Pfitzmann, Michael Waidner. The reactive simulatability (RSIM) framework for asynchronous systems
    1721 -- 1740Amos Korman, David Peleg. Labeling schemes for weighted dynamic trees
    1741 -- 1776Ralf Küsters, Thomas Wilke. Transducer-based analysis of cryptographic protocols
    1777 -- 1805Sanjay Jain, Efim B. Kinber. Iterative learning from positive data and negative counterexamples

    Volume 205, Issue 11

    1575 -- 1607Ruggero Lanotte, Simone Tini. Taylor approximation for hybrid systems
    1608 -- 1639Yuan Feng, Runyao Duan, Zheng-Feng Ji, Mingsheng Ying. Probabilistic bisimulations for quantum processes
    1640 -- 1651David Doty, Jack H. Lutz, Satyadev Nandakumar. Finite-state dimension and real arithmetic
    1652 -- 1670Viliam Geffert. Magic numbers in the state hierarchy of finite automata
    1671 -- 1684Sanjay Jain, Steffen Lange, Sandra Zilles. Some natural conditions on incremental learning

    Volume 205, Issue 10

    1491 -- 1525Rocco De Nicola, Daniele Gorla, Rosario Pugliese. Basic observables for a calculus for global computing
    1526 -- 1550Philippa Gardner, Cosimo Laneve, Lucian Wischik. Linear forwarders
    1551 -- 1573Lorenzo Carlucci, John Case, Sanjay Jain, Frank Stephan. Results on memory-limited U-shaped learning

    Volume 205, Issue 1

    1 -- 0Jan Chomicki, David Toman. Special Issue: TIME 2005
    2 -- 24Stéphane Demri, Ranko Lazic, David Nowak. On the freeze quantifier in Constraint LTL: Decidability and complexity
    25 -- 64Andreas Schäfer. Axiomatisation and decidability of multi-dimensional Duration Calculus
    65 -- 98Kiyoung Yang, Cyrus Shahabi. An efficient k nearest neighbor search for multivariate time series
    99 -- 123Carsten Lutz, Dirk Walther, Frank Wolter. Quantitative temporal logics over the reals: PSpace and below
    runs on