Journals in DBLP
Oliver Matz Dot-depth, monadic quantifier alternation, and first-order closure over grids and pictures. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 2002, v:270, n:1-2, pp:1-70 [Journal ] Andrzej Pelc Searching games with errors - fifty years of coping with liars. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 2002, v:270, n:1-2, pp:71-109 [Journal ] Frank K. Hwang , Y. C. Yao , B. DasGupta Some permutation routing algorithms for low-dimensional hypercubes. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 2002, v:270, n:1-2, pp:111-124 [Journal ] Wil M. P. van der Aalst , Twan Basten Inheritance of workflows: an approach to tackling problems related to change. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 2002, v:270, n:1-2, pp:125-203 [Journal ] Ménard Bourgade Calculs sur les structures de langage dénombrable. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 2002, v:270, n:1-2, pp:205-222 [Journal ] J. Robin B. Cockett , Stephen Lack Restriction categories I: categories of partial maps. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 2002, v:270, n:1-2, pp:223-259 [Journal ] William Lenhart , Giuseppe Liotta The drawability problem for minimum weight triangulations. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 2002, v:270, n:1-2, pp:261-286 [Journal ] John Case , Sanjay Jain , Mandayam Suraj Control structures in hypothesis spaces: the influence on learning. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 2002, v:270, n:1-2, pp:287-308 [Journal ] Kieran T. Herley , Andrea Pietracaprina , Geppino Pucci Deterministic parallel backtrack search. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 2002, v:270, n:1-2, pp:309-324 [Journal ] Tak Wah Lam , Hing-Fung Ting , Kar-Keung To , Prudence W. H. Wong On-line load balancing of temporary tasks revisited. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 2002, v:270, n:1-2, pp:325-340 [Journal ] Luca Becchetti , Paola Bertolazzi , Carlo Gaibisso , Giorgio Gambosi On the design of efficient ATM routing schemes. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 2002, v:270, n:1-2, pp:341-359 [Journal ] Ioannis Caragiannis , Christos Kaklamanis , Pino Persiano Edge coloring of bipartite graphs with constraints. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 2002, v:270, n:1-2, pp:361-399 [Journal ] Francine Blanchet-Sadri , Robert A. Hegstrom Partial words and a theorem of Fine and Wilf revisited. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 2002, v:270, n:1-2, pp:401-419 [Journal ] Kikuo Fujimura Time-minimal paths amidst moving obstacles in three dimensions. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 2002, v:270, n:1-2, pp:421-440 [Journal ] Markus E. Nebel The stack-size of tries: a combinatorial study. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 2002, v:270, n:1-2, pp:441-461 [Journal ] Alessandra Cherubini , Stefano Crespi-Reghizzi , Pierluigi San Pietro Associative language descriptions. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 2002, v:270, n:1-2, pp:463-491 [Journal ] Thomas Eiter , Toshihide Ibaraki , Kazuhisa Makino Decision lists and related Boolean functions. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 2002, v:270, n:1-2, pp:493-524 [Journal ] Jean Mairesse , Laurent Vuillon Asymptotic behavior in a heap model with two pieces. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 2002, v:270, n:1-2, pp:525-560 [Journal ] Cécile Murat , Vangelis Th. Paschos A priori optimization for the probabilistic maximum independent set problem. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 2002, v:270, n:1-2, pp:561-590 [Journal ] Clifford Bergman , Giora Slutzki Computational complexity of some problems involving congruences on algebras. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 2002, v:270, n:1-2, pp:591-608 [Journal ] Dinesh P. Mehta , Vijay Raghavan Decision tree approximations of Boolean functions. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 2002, v:270, n:1-2, pp:609-623 [Journal ] Arnaud Durand , Miki Hermann , Laurent Juban On the complexity of recognizing the Hilbert basis of a linear diophantine system. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 2002, v:270, n:1-2, pp:625-642 [Journal ] Elisa Pergola , Renzo Pinzani , Simone Rinaldi Approximating algebraic functions by means of rational ones. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 2002, v:270, n:1-2, pp:643-657 [Journal ] Jeffrey Shallit , Ming-wei Wang On two-sided infinite fixed points of morphisms. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 2002, v:270, n:1-2, pp:659-675 [Journal ] Antonín Kucera , Richard Mayr Weak bisimilarity between finite-state systems and BPA or normed BPP is decidable in polynomial time. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 2002, v:270, n:1-2, pp:677-700 [Journal ] Jürgen Dassow , Victor Mitrana , Arto Salomaa Operations and language generating devices suggested by the genome evolution. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 2002, v:270, n:1-2, pp:701-738 [Journal ] Lan Zhang , Katsushi Inoue , Akira Ito , Yue Wang Probabilistic rebound Turing machines. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 2002, v:270, n:1-2, pp:739-760 [Journal ] Georg Gottlob , Nicola Leone , Francesco Scarcello Computing LOGCFL certificates. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 2002, v:270, n:1-2, pp:761-777 [Journal ] Carlos Martín-Vide , Gheorghe Paun , Grzegorz Rozenberg Membrane systems with carriers. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 2002, v:270, n:1-2, pp:779-796 [Journal ] Chuzo Iwamoto , Tomonobu Hatsuyama , Kenichi Morita , Katsunobu Imai Constructible functions in cellular automata and their applications to hierarchy results. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 2002, v:270, n:1-2, pp:797-809 [Journal ] Costas Busch , Neophytos Demetriou , Maurice Herlihy , Marios Mavronicolas Threshold counters with increments and decrements. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 2002, v:270, n:1-2, pp:811-826 [Journal ] Eric Goles Ch. , Michel Morvan , Ha Duong Phan The structure of a linear chip firing game and related models. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 2002, v:270, n:1-2, pp:827-841 [Journal ] Jens Stoye , Dan Gusfield Simple and flexible detection of contiguous repeats using a suffix tree. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 2002, v:270, n:1-2, pp:843-856 [Journal ] J. W. Sander , Robert Tijdeman The rectangle complexity of functions on two-dimensional lattices. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 2002, v:270, n:1-2, pp:857-863 [Journal ] András Pluhár The accelerated k-in-a-row game. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 2002, v:270, n:1-2, pp:865-875 [Journal ] Ferdinando Cicalese , Daniele Mundici , Ugo Vaccaro Least adaptive optimal search with unreliable tests. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 2002, v:270, n:1-2, pp:877-893 [Journal ] Gary William Flake , Eric B. Baum Rush Hour is PSPACE-complete, or "Why you should generously tip parking lot attendants". [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 2002, v:270, n:1-2, pp:895-911 [Journal ] Michael Drmota The Variance of the height of binary search trees. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 2002, v:270, n:1-2, pp:913-919 [Journal ] Shigeki Akiyama , Attila Pethö On canonical number systems. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 2002, v:270, n:1-2, pp:921-933 [Journal ] Doris Fiebig , Ulf-Rainer Fiebig Compact factors of countable state Markov shifts. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 2002, v:270, n:1-2, pp:935-946 [Journal ] Verónica Becher , Santiago Figueira An example of a computable absolutely normal number. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 2002, v:270, n:1-2, pp:947-958 [Journal ] Sigrid Ewert , Andries P. J. van der Walt A pumping lemma for random permitting context languages. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 2002, v:270, n:1-2, pp:959-967 [Journal ] Changwook Kim Two undecidability results for chain code picture languages. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 2002, v:270, n:1-2, pp:969-976 [Journal ]