Last update:
Fri Jan 17 12:20:02 MST 2025
Seymour Ginsburg and
Michael A. Harrison Bracketed context-free languages . . . . 1--23
R. S. Bucy Linear positive machines . . . . . . . . 24--28
J. B. Rosen Chebyshev solution of large linear
systems . . . . . . . . . . . . . . . . 29--43
K. Ritter A parametric method for solving certain
nonconcave maximization problems . . . . 44--54
Kenneth Krohn and
Richard Mateosian and
John Rhodes Methods of the algebraic theory of
machines: I. Decomposition theorem for
generalized machines; Properties
preserved under series and parallel
compositions of machines . . . . . . . . 55--85
E. K. Blum Stationary points of functionals in
pre-Hilbert spaces . . . . . . . . . . . 86--90
A. V. Balakrishnan Foundations of the state-space theory of
continuous systems. I . . . . . . . . . 91--116
Anonymous Editorial Board . . . . . . . . . . . . CO2
Kenneth Krohn and
Rudolph Langer and
John Rhodes Algebraic principles for the analysis of
a biochemical system . . . . . . . . . . 119--136
Yehoshafat Give'on On some properties of the free monoids
with applications to automata theory . . 137--154
Juris Hartmanis and
Wayne A. Davis Homomorphic images of linear sequential
machines . . . . . . . . . . . . . . . . 155--165
J. E. Hopcroft and
J. D. Ullman Nonerasing stack automata . . . . . . . 166--186
Dana Scott Some definitional suggestions for
automata theory . . . . . . . . . . . . 187--212
G. B. Dantzig and
R. M. Van Slyke Generalized upper bounding techniques 213--226
T. Guinn Solutions of generalized optimization
problems . . . . . . . . . . . . . . . . 227--234
T. Guinn First-order necessary conditions for
generalized optimization problems . . . 235--240
K. Ritter A decomposition method for structured
quadratic programming problems . . . . . 241--260
E. I. Axelband A solution to the optimal pursuit
problem for distributed parameter
systems . . . . . . . . . . . . . . . . 261--286
Leonard Kleinrock and
Edward G. Coffman Distribution of attained service in
time-shared systems . . . . . . . . . . 287--298
Arnold L. Rosenberg Multitape finite automata with rewind
instructions . . . . . . . . . . . . . . 299--315
J. W. Thatcher Characterizing derivation trees of
context-free grammars through a
generalization of finite automata theory 317--322
E. J. Beltrami On infinite-dimensional convex programs 323--329
D. Eggert and
P. Varaiya Affine dynamical systems . . . . . . . . 330--348
R. S. Bucy Global theory of the Riccati equation 349--361
E. K. Blum The computation of eigenvalues and
eigenvector of a completely continuous
self-adjoint operator . . . . . . . . . 362--370
A. Paz Fuzzy star functions, probabilistic
automata, and their approximation by
nonprobabilistic automata . . . . . . . 371--390
A. V. Balakrishnan and
J. L. Lions State estimation for
infinite-dimensional systems . . . . . . 391--403
Anonymous Author index . . . . . . . . . . . . . . 404--404
Anonymous Editorial Board . . . . . . . . . . . . i--i
J. E. Hopcroft and
J. D. Ullman Deterministic stack automata and the
quotient operator . . . . . . . . . . . 1--12
Eric G. Wagner Bounded action machines: Toward an
abstract theory of computer structure 13--75
Alan Schumitzky On the equivalence between matrix
Riccati equations and Fredholm
resolvents . . . . . . . . . . . . . . . 76--87
Patrick C. Fischer and
Arnold L. Rosenberg Multitape one-way nonwriting automata 88--101
A. V. Balakrishnan A new computing technique in system
identification . . . . . . . . . . . . . 102--116
J. Hartmanis Tape-reversal bounded Turing machine
computations . . . . . . . . . . . . . . 117--135
Patrick C. Fischer The reduction of tape reversals for
off-line one-tape Turing machines . . . 136--147
Gene F. Rose Closures which preserve finiteness in
families of languages . . . . . . . . . 148--168
Ronald Alter On the nonexistence of close-packed
double Hamming-error-correcting codes on
$ q = 7 $ symbols . . . . . . . . . . . 169--176
H. A. Antosiewicz Newton's method and boundary value
problems . . . . . . . . . . . . . . . . 177--202
Roy Danchick Further results on generalized
predictor-corrector methods . . . . . . 203--218
David E. Muller and
Gianfranco R. Putzolu Frequency of decomposability among
machines with a large number of states 219--227
Seymour Ginsburg and
Edwin H. Spanier Derivation-bounded languages . . . . . . 228--250
Izumi Kimura Extensions of asynchronous circuits and
the delay problem I. Good extensions and
the delay problem of the first kind . . 251--287
Austin Blaqui\`ere and
Françoise Gérard On the geometry of optimal strategies in
two-person games of kind . . . . . . . . 288--304
David W. Walkup and
Roger J.-B. Wets A note on decision rules for stochastic
programs . . . . . . . . . . . . . . . . 305--311
Gianfranco R. Putzolu Probabilistic aspects of machine
decomposition theory . . . . . . . . . . 312--331
L. Collatz Multiparametric eigenvalue problems in
inner-product spaces . . . . . . . . . . 333--341
Vladimir F. Demjanov Algorithms for some minimax problems . . 342--380
H. Gallaire and
J. N. Gray and
M. A. Harrison and
G. T. Herman Infinite linear sequential machines . . 381--419
J. R. H. Dempster On the multiplying ability of two-way
automata . . . . . . . . . . . . . . . . 420--426
Marvin C. Paull and
Stephen H. Unger Structural equivalence of context-free
grammars . . . . . . . . . . . . . . . . 427--463
Dennis Allen On a characterization of the nonregular
set of primes . . . . . . . . . . . . . 464--467
Anonymous Author Index . . . . . . . . . . . . . . 468--468
Anonymous Editorial Board . . . . . . . . . . . . i--i
A. Pasquali On the convergence of nonlinear
simultaneous displacements . . . . . . . 1--7
Melvin A. Breuer Combinatorial equivalence of (0, 1)
circulant matrices . . . . . . . . . . . 8--23
Y. Yavin Optimal control for a class of
distributed parameter systems where the
cost functions are norms . . . . . . . . 24--36
A. V. Aho and
J. D. Ullman Syntax directed translations and the
pushdown assembler . . . . . . . . . . . 37--56
Lucien W. Neustadt A general theory of extremals . . . . . 57--92
D. R. Deuel Time-varying linear sequential machines.
I . . . . . . . . . . . . . . . . . . . 93--118
Zohar Manna The correctness of programs . . . . . . 119--127
Arthur R. Butz Convergence with Hilbert's space filling
curve . . . . . . . . . . . . . . . . . 128--146
Richard M. Karp and
Raymond E. Miller Parallel program schemata . . . . . . . 147--195
Sheila Greibach Checking automata and one-way stack
languages . . . . . . . . . . . . . . . 196--217
J. E. Dennis and
A. A. Goldstein Cubature and the Tchakaloff cone . . . . 218--220
Ryuichi Ito Every semilinear set is a finite union
of disjoint linear sets . . . . . . . . 221--231
Sheila Greibach and
John Hopcroft Scattered context grammars . . . . . . . 233--247
E. K. Blum Towards a theory of semantics and
compilers for programming languages . . 248--275
George Mager Writing pushdown acceptors . . . . . . . 276--318
A. V. Aho and
J. D. Ullman Properties of syntax directed
translations . . . . . . . . . . . . . . 319--334
M. D. Grigoriadis and
K. Ritter A decomposition method for structured
linear and nonlinear programs . . . . . 335--360
Donald M. Kaplan Regular expressions and the equivalence
of programs . . . . . . . . . . . . . . 361--386
Alfred H. Morris Elementary indefinite integration theory
for the computer . . . . . . . . . . . . 387--408
Masaharu Mizumoto and
Junichi Toyoda and
Kohkichi Tanaka Some considerations on fuzzy automata 409--422
R. M. Baer and
E. H. Spanier Referenced automata and metaregular
families . . . . . . . . . . . . . . . . 423--446
John Cleave The primitive recursive analysis of
ordinary differential equations and the
complexity of their solutions . . . . . 447--455
Ben Wegbreit A generator of context-sensitive
languages . . . . . . . . . . . . . . . 456--461
Anonymous Author index . . . . . . . . . . . . . . 462--462
H. R. Strong Depth-bounded computation . . . . . . . 1--14
Herbert B. Keller Newton's method under mild
differentiability conditions . . . . . . 15--28
A. A. Goldstein and
J. S. Meditch Nonlinear optimal controls . . . . . . . 29--37
R. Conti A convex programming problem in Banach
spaces and applications to optimum
control theory . . . . . . . . . . . . . 38--49
Patrick C. Fischer and
Albert R. Meyer and
Arnold L. Rosenberg Time-restricted sequence generation . . 50--73
R. J. Orgass Some results concerning proofs of
statements about programs . . . . . . . 74--88
Anonymous International Federation for Information
Processing: IFIP Congress 71 Ljubljana,
Yugoslavia, 23--28 August 1971:
Announcement . . . . . . . . . . . . . . 89--92
Anonymous Editorial Board . . . . . . . . . . . . CO2
Franco P. Preparata and
David E. Muller Generation of near-optimal universal
Boolean functions . . . . . . . . . . . 93--102
Alex McNabb and
Alan Schumitzky Factorization of operators II: a
nonlinear Volterra method for numerical
solution of linear Fredholm equations 103--128
A. V. Aho and
J. D. Ullman and
J. E. Hopcroft On the computational power of pushdown
automata . . . . . . . . . . . . . . . . 129--136
H. Yamada and
S. Amoroso A completeness problem for pattern
generation in tessellation automata . . 137--176
Walter J. Savitch Relationships between nondeterministic
and deterministic tape complexities . . 177--192
Gene F. Rose Abstract families of processors . . . . 193--204
R. Milner Equivalences on program schemes . . . . 205--219
D. C. Luckham and
D. M. R. Park and
M. S. Paterson On formalised computer programs . . . . 220--249
R. Temam Remarks on the approximation of some
nonlinear elliptic equations . . . . . . 250--259
Rina S. Cohen and
J. A. Brzozowski General properties of star height of
regular events . . . . . . . . . . . . . 260--280
Rina S. Cohen Star height of certain families of
regular events . . . . . . . . . . . . . 281--297
L. Y. Liu and
P. Weiner A characterization of semilinear sets 299--307
Seymour Ginsburg and
Sheila Greibach Principal AFL . . . . . . . . . . . . . 308--338
James W. Thatcher Generalized 2 sequential machine maps 339--367
J. Hartmanis and
J. E. Hopcroft What makes some language theory problems
undecidable . . . . . . . . . . . . . . 368--376
Ramon E. Moore On the stability of linear recurrence
equations with arbitrary time lags . . . 377--383
William Bridges Smith Error detection in formal languages . . 385--405
John Doner Tree acceptors and some of their
applications . . . . . . . . . . . . . . 406--451
Sanat K. Basu On the structure of subrecursive degrees 452--464
Webb Miller Recursive function theory and numerical
analysis . . . . . . . . . . . . . . . . 465--472
Edward Angel Invariant imbedding, difference
equations, and elliptic boundary value
problems . . . . . . . . . . . . . . . . 473--491
Takumi Kasai An hierarchy between context-free and
context-sensitive languages . . . . . . 492--508
A. L. Perrie Uniform rational approximation with
osculatory interpolation . . . . . . . . 509--522
A. V. Aho and
J. D. Ullman A characterization of two-way
deterministic classes of languages . . . 523--538
Y. Give'on and
Y. Zalcstein Algebraic structures in linear systems
theory . . . . . . . . . . . . . . . . . 539--556
Yoshiyuki Sakawa An application of the epsilon technique
to the solution of pursuit and evasion
problems . . . . . . . . . . . . . . . . 557--569
Kailash C. Kapur and
Richard M. Van Slyke Cutting plane algorithms and state space
constrained linear optimal control
problems . . . . . . . . . . . . . . . . 570--605
Ronald V. Book and
Sheila A. Greibach and
Ben Wegbreit Time- and tape-bounded Turing acceptors
and AFLs . . . . . . . . . . . . . . . . 606--621
Ronald V. Book and
Sheila A. Greibach and
Oscar H. Ibarra and
Ben Wegbreit Tape-bounded Turing acceptors and
principal AFLs . . . . . . . . . . . . . 622--625
Anonymous Author index . . . . . . . . . . . . . . 626--626
Rina S. Cohen and
J. A. Brzozowski Dot-depth of star-free events . . . . . 1--16
Oliver Aberth The concept of effective method applied
to computational problems of linear
algebra . . . . . . . . . . . . . . . . 17--25
J. W. Carlyle and
A. Paz Realizations by stochastic finite
automata . . . . . . . . . . . . . . . . 26--40
J. A. Brzozowski and
K. Culík and
A. Gabrielian Classification of noncounting events . . 41--53
J. Hartmanis and
F. D. Lewis The use of lists in the study of
undecidable problems in automata theory 54--66
Erwin Engeler Algorithmic approximations . . . . . . . 67--82
Anonymous Editorial Board . . . . . . . . . . . . CO2
A. A. Goldstein and
F. C. Johnson and
Jurgen Spiess On the isolation of the roots of a
non-linear operator . . . . . . . . . . 83--87
Oscar H. Ibarra Characterizations of some tape and time
complexity classes of Turing machines in
terms of multihead and auxiliary stack
automata . . . . . . . . . . . . . . . . 88--117
Giorgio Ausiello Abstract computational complexity and
cycling computations . . . . . . . . . . 118--128
Izumi Kimura Extensions of asynchronous circuits and
the delay problem. Part II: Spike-free
extensions and the delay problem of the
second kind . . . . . . . . . . . . . . 129--162
A. V. Balakrishnan A computational approach to the maximum
principle . . . . . . . . . . . . . . . 163--191
Arnold L. Rosenberg Data graphs and addressing schemes . . . 193--238
Zohar Manna Mathematical theory of partial
correctness . . . . . . . . . . . . . . 239--253
H. R. Strong Translating recursion equations into
flow charts . . . . . . . . . . . . . . 254--285
F. D. Lewis The enumerability and invariance of
complexity classes . . . . . . . . . . . 286--303
J. S. Ullian Three theorems concerning principal AFLs 304--314
Robert L. Constable Subrecursive programming languages II on
program size . . . . . . . . . . . . . . 315--334
Anonymous Announcement . . . . . . . . . . . . . . 335--335
Richard M. Karp Special SIGACT issue . . . . . . . . . . i+(1*)
György Révész Unilateral context sensitive grammars
and left-to-right parsing . . . . . . . 337--352
Jozef Gruska A characterization of context-free
languages . . . . . . . . . . . . . . . 353--364
Seymour Ginsburg and
Edwin H. Spanier AFL with the semilinear property . . . . 365--396
Ronald V. Book Time-bounded grammars and their
languages . . . . . . . . . . . . . . . 397--429
J. B. Rosen Minimum error bounds for
multidimensional spline approximation 430--452
Anonymous Erratum . . . . . . . . . . . . . . . . 453--453
Serafino Amoroso and
Gerald Cooper Tessellation structures for reproduction
of arbitrary patterns . . . . . . . . . 455--464
Jerzy W. Grzymala-Busse Operation-preserving functions and
autonomous factors of finite automata 465--474
A. C. Fleck Towards a theory of data structures . . 475--488
G. T. Herman Every finite sequential machine is
linearly realizable . . . . . . . . . . 489--510
F. Commoner and
A. W. Holt and
S. Even and
A. Pnueli Marked directed graphs . . . . . . . . . 511--523
Peter J. Nicholson Algebraic theory of finite Fourier
transforms . . . . . . . . . . . . . . . 524--547
Rani Siromoney Finite-turn checking automata . . . . . 549--559
Terrence W. Pratt Pair grammars, graph languages and
string-to-graph translations . . . . . . 560--595
Karel Culík Abstract families of relations . . . . . 596--606
Trevor I. Fenner and
Georghios Loizou On fully indecomposable matrices . . . . 607--622
Thomas J. Ostrand Pattern reproduction in tessellation
automata of arbitrary dimension . . . . 623--628
I. P. McWhirter Substitution expressions . . . . . . . . 629--637
Anonymous Author index . . . . . . . . . . . . . . 638--638
Lee E. Heindel Computation of powers of multivariate
polynomials over the integers . . . . . 1--8
Jonathan Goldstine Substitution and bounded languages . . . 9--29
Sheila A. Greibach Syntactic operators on full semiAFLs . . 30--76
Andy N. C. Kang Effective operators with no strong gaps
* . . . . . . . . . . . . . . . . . . . 77--87
V. E. Itkin and
V. E. Itkin and
Z. Zwinogrodzki On program schemata equivalence . . . . 88--101
Anonymous Editorial Board . . . . . . . . . . . . CO2
Jack W. Carlyle and
Sheila Greibach and
Juris Hartmanis and
E. K. Blum Eleventh Annual Switching and Automata
Theory Symposium . . . . . . . . . . . . i--i
David Gale and
Richard M. Karp A phenomenon in the theory of sorting 103--115
Michael S. Paterson Tape bounds for time-bounded Turing
machines . . . . . . . . . . . . . . . . 116--124
A. V. Aho and
J. D. Ullman Equivalence of programs with structured
variables . . . . . . . . . . . . . . . 125--137
T. Kameda Pushdown automata with counters . . . . 138--150
Yechezkel Zalcstein Locally testable languages . . . . . . . 151--167
Joseph Alphonso Giuliano Writing stack acceptors . . . . . . . . 168--204
P. M. Spira Complete linear proofs of systems of
linear inequalities . . . . . . . . . . 205--216
Donald F. Stanat A homomorphism theorem for weighted
context-free grammars . . . . . . . . . 217--232
Alvy Ray Smith Real-time language recognition by
one-dimensional cellular automata . . . 233--253
J. P. Cleave Combinatorial systems I. Cylindrical
problems . . . . . . . . . . . . . . . . 254--266
Jürgen Eickel and
Jacques Loeckx The relation between derivations and
syntactical structures in
phrase-structure grammars . . . . . . . 267--282
Philippe Butzbach Les 1-convexes du mono\"\ide commutatif
$ \mathbb {N}^n $. (French) [The
1-convexes of the commutative monoid $
\mathbb {N}^n $] . . . . . . . . . . . . 283--289
Anonymous Notice . . . . . . . . . . . . . . . . . 290--290
Michael A. Golberg The equivalence of several initial value
methods for solving integral equations 291--297
Martin H. Schultz Discrete Tchebycheff approximation for
multivariate splines . . . . . . . . . . 298--304
James C. King and
Robert W. Floyd An interpretation-oriented theorem
prover over integers . . . . . . . . . . 305--323
Vaclav Rajlich Absolutely parallel grammars and two-way
finite-state transducers . . . . . . . . 324--342
R. S. Bucy The Riccati equation and its bounds . . 343--353
Steve F. McCormick A general approach to one-step iterative
methods with application to eigenvalue
problems . . . . . . . . . . . . . . . . 354--372
D. Richardson Tessellations with local transformations 373--388
H. B. Enderton Degrees of computational complexity . . 389--396
F. P. Preparata and
R. T. Yeh Continuously valued logic . . . . . . . 397--418
D. E. Muller and
R. E. Miller A generalization of the theory of
incompletely specified machines . . . . 419--447
S. Amoroso and
Y. N. Patt Decision procedures for surjectivity and
injectivity of parallel maps for
tessellation structures . . . . . . . . 448--464
Jacob Katzenelson The Markov algorithm as a language
parser-Linear bounds . . . . . . . . . . 465--478
Michael J. Fischer Special SIGACT issue . . . . . . . . . . 479--479
R. L. Constable and
S. S. Muchnick Subrecursive program schemata I and II:
I. Undecidable equivalence problems; II.
Decidable equivalence problems . . . . . 480--537
David S. Wise Generalized overlap resolvable grammars
and their parsers . . . . . . . . . . . 538--572
A. V. Aho and
J. D. Ullman Optimization of LR($k$) parsers . . . . 573--602
Michael Machtey Augmented loop languages and classes of
computable functions . . . . . . . . . . 603--624
Ian Munro and
Allan Borodin Efficient evaluation of polynomial forms 625--638
Michael O. Rabin Proving simultaneous positivity of
linear forms . . . . . . . . . . . . . . 639--650
Anonymous Author index . . . . . . . . . . . . . . 651--651
Seymour Ginsburg and
Sheila Greibach On AFL generators for finitely encoded
AFA . . . . . . . . . . . . . . . . . . 1--27
Oscar H. Ibarra On two-way multihead automata . . . . . 28--36
Norihiro Abe and
Masaharu Mizumoto and
Jun-ichi Toyoda and
Kohkichi Tanaka Web grammars and several graphs . . . . 37--65
Karel Culik and
Rina Cohen LR-regular grammars --- an extension of
LR($k$) grammars . . . . . . . . . . . . 66--96
Horacio Feliciangeli and
Gabor T. Herman Algorithms for producing grammars from
sample derivations: a common problem of
formal language theory and developmental
biology . . . . . . . . . . . . . . . . 97--118
Anonymous Editorial Board . . . . . . . . . . . . CO2
Stephen J. Garland and
David C. Luckham Program schemes, recursion schemes, and
formal languages . . . . . . . . . . . . 119--160
Bernard P. Zeigler Every discrete input machine is linearly
simulatable . . . . . . . . . . . . . . 161--167
J. Hartmanis and
H. Walter Group theoretic characterization of
linear permutation automata . . . . . . 168--188
Ian Munro and
Michael Paterson Optimal algorithms for parallel
polynomial evaluation . . . . . . . . . 189--198
Yoshihide Igarashi and
Namio Honda On the extension of Gladkij's Theorem
and the hierarchies of languages . . . . 199--217
Malcolm Bird The equivalence problem for
deterministic two-tape automata . . . . 218--236
Michael A. Harrison and
Ivan M. Havel Strict deterministic grammars . . . . . 237--277
Michael A. Arbib Coproducts and decomposable machines . . 278--287
Zvi Kohavi and
Joseph Winograd Establishing certain bounds concerning
finite automata . . . . . . . . . . . . 288--299
Yoshifumi Masunaga and
Shoichi Noguchi and
Juro Oizumi A structure theory of automata
characterized by groups . . . . . . . . 300--305
To-yat Cheung Approximate solutions and error bounds
for quasilinear elliptic boundary value
problems . . . . . . . . . . . . . . . . 306--322
J. E. Hopcroft and
R. E. Tarjan A $ V \log V $ algorithm for isomorphism
of triconnected planar graphs . . . . . 323--331
Arnold L. Rosenberg and
Edward K. Blum and
Patrick C. Fischer Special SIGACT issue: Fourth Annual ACM
Symposium on Theory of Computing . . . . 333--333
H. T. Kung A bound on the multiplicative efficiency
of iteration . . . . . . . . . . . . . . 334--342
Stephen A. Cook A hierarchy for nondeterministic time
complexity . . . . . . . . . . . . . . . 343--353
Stephen A. Cook and
Robert A. Reckhow Time bounded random access machines . . 354--375
C. P. Schnorr Process complexity and effective random
tests . . . . . . . . . . . . . . . . . 376--388
Walter J. Savitch Maze recognizing automata and
nondeterministic tape complexity . . . . 389--403
S. A. Walker and
H. R. Strong Characterizations of flowchartable
recursions . . . . . . . . . . . . . . . 404--447
Manuel Blum and
Robert W. Floyd and
Vaughan Pratt and
Ronald L. Rivest and
Robert E. Tarjan Time bounds for selection . . . . . . . 448--461
Meera Blattner The unsolvability of the equality
problem for sentential forms of
context-free grammars . . . . . . . . . 463--468
Ellis Horowitz The efficient calculation of powers of
polynomials . . . . . . . . . . . . . . 469--480
Takeo Yaku The constructibility of a configuration
in a cellular automaton . . . . . . . . 481--496
C. E. Hughes Many-one degrees associated with
semi-Thue systems . . . . . . . . . . . 497--505
Alan G. Konheim and
Bernd Meister Distributions of queue lengths and
waiting times in a loop with two-way
traffic . . . . . . . . . . . . . . . . 506--521
Svetlana P. Kartashev State assignment for realizing modular
input-free sequential logical networks
without invertors . . . . . . . . . . . 522--542
J. D. Rutledge Program schemata as automata. I . . . . 543--578
Robert D. Rosebrugh and
Derick Wood A characterization theorem for
$n$-parallel right linear languages . . 579--582
L. Boasson Two iteration theorems for some families
of languages . . . . . . . . . . . . . . 583--596
D. Nudds Conversion of programs between
computers: Interpreters, simulators and
compilers . . . . . . . . . . . . . . . 597--614
Akihiro Nozaki Two entropies of a generalized sorting
problem . . . . . . . . . . . . . . . . 615--621
Anonymous Author index . . . . . . . . . . . . . . 622--622
S. J. Walljasper Left-derivation bounded languages . . . 1--7
Johnson Murdoch Hart Ambiguity and decision problems for
local adjunct languages . . . . . . . . 8--21
Richard Bird On transformations of programs . . . . . 22--35
J. P. Crestin Structure des grammaires d'ambigu\"\ité
bornée. (French) [Structure of bounded
ambiguous grammars] . . . . . . . . . . 36--40
Ratan K. Guha and
Raymond T. Yeh On periodicity of sequential machines 41--70
Harry R. Lewis Program schemata and the first-order
decision problem . . . . . . . . . . . . 71--83
Toshihide Ibaraki Classes of discrete optimization
problems and their decision problems . . 84--116
Anonymous Editorial Board . . . . . . . . . . . . CO2
Yaacov Choueka Theories of automata on $ \omega
$-tapes: a simplified approach . . . . . 117--141
Nabil A. Khabbaz A geometric hierarchy of languages . . . 142--157
A. B. Cremers and
O. Mayer On vector languages . . . . . . . . . . 158--166
Yoshihide Igarashi and
Namio Honda Deterministic multitape automata
computations . . . . . . . . . . . . . . 167--189
Patrick C. Fischer and
John C. Warkentin Predecessor machines . . . . . . . . . . 190--219
E. K. Blum and
G. H. Rodrigue Solution of eigenvalue problems in
Hilbert spaces by a gradient method . . 220--237
György Révész Comment on the paper ``Error detection
in formal languages'' . . . . . . . . . 238--242
Seymour Ginsburg and
Gene F. Rose The equivalence of stack-counter
acceptors and quasi-realtime
stack-counter acceptors . . . . . . . . 243--269
H. Raymond Strong and
Edward K. Blum and
Richard M. Karp and
Arnold L. Rosenberg Thirteenth annual IEEE Symposium on
Switching and Automata Theory . . . . . 271--271
David S. Johnson Fast algorithms for bin packing . . . . 272--314
Brenda S. Baker and
Ronald V. Book Reversal-bounded multipushdown machines 315--332
J. A. Goguen On homomorphisms, correctness,
termination, unfoldments, equivalence of
flow diagram programs . . . . . . . . . 333--365
A. Borodin and
R. Moenck Fast modular transforms . . . . . . . . 366--386
A. J. Kfoury Translatability of schemas over
restricted interpretations . . . . . . . 387--408
T. S. E. Maibaum A generalized approach to formal
languages . . . . . . . . . . . . . . . 409--439
Anonymous Author index . . . . . . . . . . . . . . 440--440
Arthur Gill and
Lawrence T. Kou Multiple-entry finite automata . . . . . 1--19
Gerad G. L. Meyer Algorithm model for penalty
functions-type iterative procedures . . 20--30
Akira Maruoka and
Masayuki Kimura Completeness problem of one-dimensional
binary scope-3 tessellation automata . . 31--47
Eugene M. Norris Difunctionally induced state machines 48--55
Kai Hwang Cyclic decomposition of finite
stochastic systems . . . . . . . . . . . 56--68
Edward L. Robertson Complexity classes of partial recursive
functions . . . . . . . . . . . . . . . 69--87
Seymour Ginsburg and
Edwin H. Spanier On incomparable abstract family of
languages (AFL) . . . . . . . . . . . . 88--108
Lee E. Heindel Congruence arithmetic algorithms for
polynomial real zero determination . . . 109--128
Anonymous Editorial Board . . . . . . . . . . . . CO2
Yves Rouchaleau and
Bostwick F. Wyman Linear dynamical systems over integral
domains . . . . . . . . . . . . . . . . 129--142
Nancy Lynch Approximations to the halting problem 143--150
R. P. Daley The extent and density of sequences
within the minimal-program complexity
hierarchies . . . . . . . . . . . . . . 151--163
S. Rao Kosaraju $1$-Way stack automaton with jumps . . . 164--176
Takumi Kasai Translatability of flowcharts into while
programs . . . . . . . . . . . . . . . . 177--195
Peter Elias Minimum times and memories needed to
compute the values of a function . . . . 196--212
Ronald V. Book Comparing complexity classes . . . . . . 213--229
Alfred V. Aho and
Edward K. Blum and
P. C. Fischer Special SIGACT issue: Fifth Annual ACM
Symposium on Theory of Computing . . . . 231--231
S. Rao Kosaraju Analysis of structured programs . . . . 232--255
David S. Johnson Approximation algorithms for
combinatorial problems . . . . . . . . . 256--278
P. M. Lewis and
D. J. Rosenkrantz and
R. E. Stearns Attributed translations . . . . . . . . 279--307
Stephen A. Cook An observation on time-storage trade off 308--316
Michael J. Fischer and
Larry J. Stockmeyer Fast on-line integer multiplication . . 317--331
Jean Vuillemin Correct and optimal implementations of
recursion in a simple programming
language . . . . . . . . . . . . . . . . 332--354
R. Endre Tarjan Testing flow graph reducibility . . . . 355--365
Anonymous Author index . . . . . . . . . . . . . . 366--366
Anonymous Editorial Board . . . . . . . . . . . . i--i
J. A. Goguen Discrete-time machines in closed
monoidal categories. I . . . . . . . . . 1--43
Victor Harnik Effective proper procedures and
universal classes of program schemata 44--61
I. H. Sudborough On tape-bounded complexity classes and
multihead finite automata . . . . . . . 62--76
Serafino Amoroso and
Gerald Cooper and
Yale Patt Some clarifications of the concept of a
Garden-of-Eden configuration . . . . . . 77--82
James C. Owings Splitting a Context-Sensitive Set . . . 83--87
Donald I. Kiel Two-way $a$-transducers and AFL . . . . 88--109
E. A. Ashcroft Proving assertions about parallel
programs . . . . . . . . . . . . . . . . 110--135
Aravind K. Joshi and
Leon S. Levy and
Masako Takahashi Tree adjunct grammars . . . . . . . . . 136--163
Seymour Ginsburg and
Jonathan Goldstine and
Sheila Greibach Uniformly erasable AFL . . . . . . . . . 165--182
Michael Machtey On the density of honest subrecursive
classes . . . . . . . . . . . . . . . . 183--199
Kenneth B. Salomon The decidability of a mapping problem
for generalized sequential machines with
final states . . . . . . . . . . . . . . 200--218
M. Mizumoto and
J. Toyoda and
K. Tanaka Various kinds of automata with weights 219--236
S. A. Greibach One counter languages and the IRS
condition . . . . . . . . . . . . . . . 237--247
Wallace L. Hamilton and
John R. Mertens Reproduction in tessellation structures 248--252
Akira Nakamura On causal $ \omega^2$-systems . . . . . 253--265
Suad Alagi\'c Natural state transformations . . . . . 266--307
Leslie G. Valiant General context-free recognition in less
than cubic time . . . . . . . . . . . . 308--315
C. Beeri Two-way nested stack automata are
equivalent to two-way stack automata . . 317--339
Leslie G. Valiant and
Michael S. Paterson Deterministic one-counter automata . . . 340--350
Jonathan Goldstine Some independent families of one-letter
languages . . . . . . . . . . . . . . . 351--369
G. Germano and
A. Maggiolo-Schettini Proving a compiler correct: a simple
approach . . . . . . . . . . . . . . . . 370--383
J. D. Ullman NP-complete scheduling problems . . . . 384--393
Sister Teresemarie McCloskey Abstract families of length-preserving
processors . . . . . . . . . . . . . . . 394--427
Anonymous Author index . . . . . . . . . . . . . . 428--428
Anonymous Editorial Board . . . . . . . . . . . . i--i
Branislav Rovan Proving containment of bounded AFL . . . 1--55
Oscar H. Ibarra and
Sartaj K. Sahni Hierarchies of Turing machines with
restricted tape alphabet size . . . . . 56--67
Neil D. Jones Space-bounded reducibility among
combinatorial problems . . . . . . . . . 68--85
Armin Cremers and
Seymour Ginsburg Context-free grammar forms . . . . . . . 86--117
A. R. Freedman and
R. E. Ladner Space bounds for processing contentless
inputs . . . . . . . . . . . . . . . . . 118--128
G. Rozenberg and
K. P. Lee Some properties of the class of $L$
languages with interactions . . . . . . 129--147
Michael A. Arbib and
E. K. Blum Editors' foreword . . . . . . . . . . . 149--149
Hidenosuke Nishio and
Youichi Kobuchi Fault tolerant cellular spaces . . . . . 150--170
Masateru Harao and
Shoichi Noguchi Fault tolerant cellular automata . . . . 171--185
Václav Rajlich Dynamics of discrete systems and pattern
reproduction . . . . . . . . . . . . . . 186--202
Jan Van Leeuwen The tape-complexity of
context-independent developmental
languages . . . . . . . . . . . . . . . 203--211
Hartmut Ehrig and
Karl Wilhelm Tischer Graph grammars and applications to
specialization and evolution in biology 212--236
W. O. Höllerer and
R. Vollmar On ``forgetful'' cellular automata . . . 237--251
Adrian Walker Formal grammars and the regeneration
capability of biological systems . . . . 252--261
Ann Reedy and
Walter J. Savitch Ambiguity in the developmental systems
of Lindenmayer . . . . . . . . . . . . . 262--283
Robert M. Baer Computation by assembly . . . . . . . . 285--294
Michael J. Best and
Klaus Ritter An accelerated conjugate direction
method to solve linearly constrained
minimization problems . . . . . . . . . 295--322
J. W. de Bakker and
L. G. L. T. Meertens On the completeness of the inductive
assertion method . . . . . . . . . . . . 323--357
Barry K. Rosen Program equivalence and context-free
grammars . . . . . . . . . . . . . . . . 358--374
Eduardo D. Sontag On some questions of rationality and
decidability . . . . . . . . . . . . . . 375--381
S. Di Gregorio and
G. Trautteur On reversibility in cellular automata 382--391
Andrzej Ehrenfeucht Practical decidability . . . . . . . . . 392--396
Anonymous Erratum . . . . . . . . . . . . . . . . 397--397
E. K. Blum Editor's note . . . . . . . . . . . . . 397--397
Anonymous Author index for volume 11 . . . . . . . 398--398
Anonymous Editorial Board . . . . . . . . . . . . i--i
Takeo Yaku Surjectivity of nondeterministic
parallel maps induced bynondeterministic
cellular automata . . . . . . . . . . . 1--5
D. Richardson Continuous self-reproduction . . . . . . 6--12
F. Joanne Helton The semigroup of an algebra automaton 13--24
Sam Savage and
Peter Weiner and
A. Bagchi Neighborhood search algorithms for
guaranteeing optimal traveling salesman
tours must be inefficient . . . . . . . 25--35
Masakazu Nasu and
Namio Honda A completeness property of
one-dimensional tessellation automata 36--48
Yoshinori Ezawa and
Masaharu Mizumoto and
Junichi Toyoda and
Kokichi Tanaka Interactive languages . . . . . . . . . 49--63
Johnson M. Hart The derivation language of a phrase
structure grammar . . . . . . . . . . . 64--79
Klaus Weihrauch The computational complexity of program
schemata . . . . . . . . . . . . . . . . 80--107
R. R. Meyer Sufficient conditions for the
convergence of monotonic mathematical
programming algorithms . . . . . . . . . 108--121
F. D. Lewis On computational reducibility . . . . . 122--131
Robert L. Constable and
E. K. Blum and
M. A. Harrison Special SIGACT issue: Sixth Annual ACM
Symposium on Theory of Computing . . . . 133--133
Andrzej Ehrenfeucht and
Paul Zeiger Complexity measures for regular
expressions . . . . . . . . . . . . . . 134--146
Kurt Mehlhorn Polynomial and abstract subrecursive
classes . . . . . . . . . . . . . . . . 147--178
Bruno Courcelle and
Jean Vuillemin Completeness results for the equivalence
of recursive schemas . . . . . . . . . . 179--197
Vaughan R. Pratt and
Larry J. Stockmeyer A characterization of the power of
vector machines . . . . . . . . . . . . 198--221
Harry B. Hunt and
Daniel J. Rosenkrantz and
Thomas G. Szymanski On the equivalence, containment, and
covering problems for the regular and
context-free languages . . . . . . . . . 222--268
Hartmut Ehrig and
Hans-Jörg Kreowski Systematic approach to reduction and
minimization in automata and system
theory . . . . . . . . . . . . . . . . . 269--304
Stephen L. Bloom and
Calvin C. Elgot The existence and construction of free
iterative theories . . . . . . . . . . . 305--318
J. Bruno and
E. G. Coffman and
D. B. Johnson On batch scheduling of jobs with
stochastic service times and cost
structures on a single server . . . . . 319--335
Y. Breitbart Some bounds on the complexity of
predicate recognition by finite automata 336--349
Zvi Galil and
Janos Simon A note on multiple-entry finite automata 350--351
K. Hashiguchi and
N. Honda Properties of code events and
homomorphisms over regular events . . . 352--367
Donald A. Alton Nonexistence of program optimizers in
several abstract settings . . . . . . . 368--393
Peter Gordon Anderson Another proof of the theorem on pattern
reproduction in tessellation structures 394--398
J. Goldstine Bounded AFLs . . . . . . . . . . . . . . 399--419
Anonymous Author index for volume 12 . . . . . . . 420--420
James L. Peterson Computation sequence sets . . . . . . . 1--24
Stephen Cook and
Ravi Sethi Storage requirements for deterministic
polynomial-time recognizable languages 25--37
Kenichi Taniguchi and
Tadao Kasami A result on the equivalence problem for
deterministic pushdown automata . . . . 38--50
Patrick C. Fischer and
Edward L. Robertson and
Lawrence V. Saxton On the sequential nature of functions 51--68
David Dobkin A nonlinear lower bound on linear search
tree programs for solving knapsack
problems . . . . . . . . . . . . . . . . 69--73
Yoshifumi Masunaga and
Shoichi Noguchi and
Juro Oizumi A characterization of automata and a
direct product decomposition . . . . . . 74--89
G. Rozenberg and
A. Salomaa Context-free grammars with
graph-controlled tables . . . . . . . . 90--99
Nancy Lynch Complexity-class-encoding sets . . . . . 100--118
Robert M. Baer and
Jan van Leeuwen The halting problem for linear Turing
assemblers . . . . . . . . . . . . . . . 119--135
Serafino Amoroso and
Irving J. Epstein Indecomposable parallel maps in
tessellation structures . . . . . . . . 136--142
Yukio Shibata On the structure of abelian automata . . 143--152
Oscar H. Ibarra and
Chul E. Kim A useful device for showing the
solvability of some decision problems 153--160
A. Nozaki Hazard analysis of asynchronous circuits
in Muller--Bartky's sense . . . . . . . 161--171
Richard Laing Automaton introspection . . . . . . . . 172--183
A. Schönhage and
M. Paterson and
N. Pippenger Finding the median . . . . . . . . . . . 184--199
Stephen L. Bloom Varieties of ordered algebras . . . . . 200--212
S. F. McCormick Some convergence results on the method
of gradients for $ A x = \lambda B x $ 213--222
André Arnold and
Max Dauchet Un théor\`eme de duplication pour les
forêts algébriques. (French) [A
duplication theorem for algebraic
forests] . . . . . . . . . . . . . . . . 223--244
William C. Rounds and
E. K. Blum and
M. A. Harrison Editors' foreword . . . . . . . . . . . 245--245
C. Raymond Perrault Intercalation lemmas for tree transducer
languages . . . . . . . . . . . . . . . 246--277
Leslie G. Valiant Graph-theoretic properties in
computational complexity . . . . . . . . 278--285
A. V. Aho and
J. D. Ullman Node listings for reducible flow graphs 286--299
Gary L. Miller Riemann's hypothesis and tests for
primality . . . . . . . . . . . . . . . 300--317
Harry B. Hunt and
Thomas G. Szymanski Complexity metatheorems for context-free
grammar problems . . . . . . . . . . . . 318--334
Kellogg S. Booth and
George S. Lueker Testing for the consecutive ones
property, interval graphs, and graph
planarity using PQ-tree algorithms . . . 335--379
Anonymous Author index for volume 13 . . . . . . . 380--380
Anonymous Editorial Board . . . . . . . . . . . . i--i
Herbert Fleischner On the equivalence of Mealy-type and
Moore-type automata and a relation
between reducibility and
Moore-reducibility . . . . . . . . . . . 1--16
Kripasindhu Sikdar On topological machines . . . . . . . . 17--48
R. J. Lipton and
R. E. Miller and
L. Snyder Synchronization and computing
capabilities of linear asynchronous
structures . . . . . . . . . . . . . . . 49--72
Joel I. Seiferas Techniques for separating space
complexity classes . . . . . . . . . . . 73--99
Joel I. Seiferas Relating refined space complexity
classes . . . . . . . . . . . . . . . . 100--129
V. J. Rayward-Smith Hypergrammars: an extension of
macrogrammars . . . . . . . . . . . . . 130--149
D. J. Hartfiel and
C. J. Maxson A semigroup characterization of a
linearly realizable automaton over GF(p) 150--155
Arnold L. Rosenberg On storing concatenable arrays . . . . . 157--174
Garry Rodrigue The method of closest approach for
finding nonisolate zeros of functions 175--186
Detlef Wotschke Degree-languages: a new concept of
acceptance . . . . . . . . . . . . . . . 187--209
David Alan Plaisted Sparse complex polynomials and
polynomial reducibility . . . . . . . . 210--221
Ronald Fagin Asymptotic miss ratios over independent
references . . . . . . . . . . . . . . . 222--250
Stephen L. Bloom and
Susanna Ginali and
Joseph D. Rutledge Scalar and vector iteration . . . . . . 251--256
Tadashi Ae Direct or cascade product of pushdown
automata . . . . . . . . . . . . . . . . 257--263
Matthew M. Geller and
Michael A. Harrison Characteristic parsing: a framework for
producing compact deterministic parsers,
I . . . . . . . . . . . . . . . . . . . 265--317
Matthew M. Geller and
Michael A. Harrison Characteristic parsing: a framework for
producing compact deterministic parsers,
II . . . . . . . . . . . . . . . . . . . 318--343
Emily P. Friedman Equivalence problems for deterministic
context-free languages and monadic
recursion schemes . . . . . . . . . . . 344--359
W. S. Ching and
B. F. Wyman Duality and the regulator problem for
linear systems over commutative rings 360--368
T. S. E. Maibaum Erratum . . . . . . . . . . . . . . . . 369--369
Anonymous Author index for volume 14 . . . . . . . 370--370
Anonymous Editorial Board . . . . . . . . . . . . i--i
Toshimasa Watanabe and
Shoichi Noguchi The amalgamation of automata . . . . . . 1--16
T. Tsuji and
J. Toyoda and
K. Tanaka Relational data graphs and some
properties of them . . . . . . . . . . . 17--34
S. A. Greibach Control sets on context-free grammar
forms . . . . . . . . . . . . . . . . . 35--98
Anton Nijholt On the covering of parsable grammars . . 99--110
Adrian Atanasiu C-grammars and tree-codifications . . . 111--120
Tadakazu Sato and
Namio Honda Certain relations between properties of
maps of tessellation automata . . . . . 121--145
Bernd Reusch Linear realization of finite automata 146--168
Rina S. Cohen and
Arie Y. Gold Theory of $ \omega $-languages: I:
Characterizations of $ \omega
$-context-free languages . . . . . . . . 169--184
Rina S. Cohen and
Arie Y. Gold Theory of $ \omega $-languages. II: a
study of various models of $ \omega
$-type generation and recognition . . . 185--208
Mitchell Wand A characterization of weakest
preconditions . . . . . . . . . . . . . 209--212
Tommaso Toffoli Computation and construction
universality of reversible cellular
automata . . . . . . . . . . . . . . . . 213--231
György Révész Algebraic properties of derivation words 232--240
Neil D. Jones Space-bounded reducibility among
combinatorial problems . . . . . . . . . 241--241
Stephen J. Willson Limiting shapes for configurations . . . 243--261
Armin Cremers and
Seymour Ginsburg and
Edwin H. Spanier The structure of context-free
grammatical families . . . . . . . . . . 262--279
Walter A. Burkhard Associative Retrieval Trie Hash-Coding 280--299
Amelia C. Fong and
Jeffrey D. Ullman Finding the depth of a flow graph . . . 300--309
Meera Blattner and
Tom Head Single-valued $a$-transducers . . . . . 310--327
Joost Engelfriet and
Erik Meineche Schmidt IO and OI. I . . . . . . . . . . . . . . 328--353
Igal Golan Conditional grammars . . . . . . . . . . 354--371
Anonymous Author index for volume 15 . . . . . . . 372--372
Theodore P. Baker ``Natural'' properties of flowchart
step-counting measures . . . . . . . . . 1--22
M. B. Smyth Power domains . . . . . . . . . . . . . 23--36
J. A. Brzozowski and
R. Knast The dot-depth hierarchy of star-free
languages is infinite . . . . . . . . . 37--55
Torleiv Klòve On complements of unary $L$ languages 56--66
Joost Engelfriet and
Erik Meineche Schmidt IO and OI. II . . . . . . . . . . . . . 67--99
J. Berger and
C. Pair Inference for regular bilanguages . . . 100--122
Ashok Chandra and
E. K. Blum and
M. A. Harrison Editors' foreword . . . . . . . . . . . 123--123
Richard J. Lipton and
Larry J. Stockmeyer Evaluation of polynomials with
super-preconditioning . . . . . . . . . 124--139
Zvi Galil Palindrome recognition in real time by a
multitape Turing machine . . . . . . . . 140--157
M. S. Paterson and
M. N. Wegman Linear unification . . . . . . . . . . . 158--167
Kenneth L. Manders and
Leonard Adleman NP-Complete decision problems for binary
quadratics . . . . . . . . . . . . . . . 168--184
Thomas J. Schaefer On the complexity of some two-person
perfect-information games . . . . . . . 185--225
Leo J. Guibas and
Endre Szemerédi The Analysis of Double Hashing . . . . . 226--274
Rina S. Cohen and
Arie Y. Gold $ \omega $-Computations on deterministic
pushdown machines . . . . . . . . . . . 275--300
Arne T. Jonassen and
Donald E. Knuth A trivial algorithm whose analysis isn't 301--322
Derek C. Oppen A $ 2^{2^{2^{pn}}} $ upper bound on the
complexity of Presburger Arithmetic . . 323--332
Francis Chin and
David Houck Algorithms for updating minimal spanning
trees . . . . . . . . . . . . . . . . . 333--344
H. A. Maurer and
A. Salomaa and
D. Wood ET0L forms . . . . . . . . . . . . . . . 345--361
Calvin C. Elgot and
Stephen L. Bloom and
Ralph Tindell On the algebraic structure of rooted
trees . . . . . . . . . . . . . . . . . 362--399
P. F. Schuler Inductive definability in formal
language theory . . . . . . . . . . . . 400--412
David Dobkin and
Richard J. Lipton A lower bound of $ 12 n^2 $ on linear
search programs for the Knapsack problem 413--417
J. Hartmanis and
L. Berman On polynomial time isomorphisms of some
new complete sets . . . . . . . . . . . 418--422
Paul M. B. Vitányi and
Walter J. Savitch On inverse deterministic pushdown
transductions . . . . . . . . . . . . . 423--444
Andrew G. Barto A note on pattern reproduction in
tessellation structures . . . . . . . . 445--455
Detlef Wotschke Nondeterminism and boolean operations in
pda's . . . . . . . . . . . . . . . . . 456--461
Anonymous Author index for volume 16 . . . . . . . 462--462
Yasuyoshi Inagaki and
Toshiki Sakabe and
Teruo Fukumura Addressable approximations to
nonaddressable data graphs . . . . . . . 1--34
Anita K. Jones and
Richard J. Lipton The enforcement of security policies for
computation . . . . . . . . . . . . . . 35--55
Seth Breidbart On splitting recursive sets . . . . . . 56--64
Masami Ito A representation of strongly connected
automata and its applications . . . . . 65--80
Yaacov Choueka Finite automata, definable sets, and
regular expressions over $
\omega^n$-tapes . . . . . . . . . . . . 81--97
Carlton J. Maxson and
Kirby C. Smith Endomorphisms of linear automata . . . . 98--107
William F. McColl The circuit depth of symmetric boolean
functions . . . . . . . . . . . . . . . 108--115
Stephen J. Hegner Duality theory for discrete-time linear
systems . . . . . . . . . . . . . . . . 116--143
Nicholas Pippenger On rearrangeable and non-blocking
switching networks . . . . . . . . . . . 145--162
K. Culik and
Arto Salomaa On the decidability of homomorphism
equivalence for languages . . . . . . . 163--175
Ulrich Golze (A-)synchronous (non-)deterministic cell
spaces simulating each other . . . . . . 176--193
Bernd Reusch Realization of finite automata with
linear parts . . . . . . . . . . . . . . 194--206
Sudhir Aggarwal A note on ``indecomposable parallel
maps'' by S. Amoroso and I. J. Epstein 207--208
G. Plotkin $ T^\omega $ as a Universal Domain . . . 209--236
Lutz Priese A note on asynchronous cellular automata 237--252
Dan Moore and
John Case The complexity of total order structures 253--269
Cláudio L. Lucchesi and
Sylvia L. Osborn Candidate keys for relations . . . . . . 270--279
K. N. King and
C. Wrathall Stack languages and $ \log n $ space . . 281--299
Kojiro Kobayashi The firing squad synchronization problem
for a class of polyautomata networks . . 300--318
T. S. E. Maibaum Pumping lemmas for term languages . . . 319--330
A. Ehrenfeucht and
G. Rozenberg On the structure of derivations in
deterministic ET0L systems . . . . . . . 331--347
Robin Milner A theory of type polymorphism in
programming . . . . . . . . . . . . . . 348--375
Tadao Takaoka A definition of measures over language
space . . . . . . . . . . . . . . . . . 376--387
Bruno Courcelle and
Ir\`ene Guessarian On some classes of interpretations . . . 388--413
Moshe Rabinovitz Closure properties and languages defined
by bilinear automata . . . . . . . . . . 414--423
Anonymous Author index for volume 17 . . . . . . . 424--424
Jon T. Butler Decomposable maps in general
tessellation structures . . . . . . . . 1--7
A. Nozaki Equivalence problem of non-deterministic
finite automata . . . . . . . . . . . . 8--17
Eitan M. Gurari and
Oscar H. Ibarra Some decision problems concerning
sequential transducers and checking
automata . . . . . . . . . . . . . . . . 18--34
R. Valette Analysis of petri nets by stepwise
refinements . . . . . . . . . . . . . . 35--46
Akira Maruoka and
Masayuki Kimura Injectivity and surjectivity of parallel
maps for cellular automata . . . . . . . 47--64
Yves Rouchaleau and
Eduardo D. Sontag On the existence of minimal realizations
of linear dynamical systems over
Noetherian integral domains . . . . . . 65--75
S. L. Mitchell and
E. J. Cockayne and
S. T. Hedetniemi Linear algorithms on recursive
representations of trees . . . . . . . . 76--85
David P. Dobkin and
Richard J. Lipton On the complexity of computations under
varying sets of primitives . . . . . . . 86--91
Matti Linna Two decidability results for
deterministic pushdown automata . . . . 92--107
Raymond E. Miller and
E. K. Blum and
R. M. Karp Editors' foreword . . . . . . . . . . . 109--109
Robert Endre Tarjan A class of algorithms which require
nonlinear time to maintain disjoint sets 110--127
Gary L. Miller Graph isomorphism, general remarks . . . 128--142
J. Lawrence Carter and
Mark N. Wegman Universal Classes of Hash Functions . . 143--154
D. Angluin and
L. G. Valiant Fast probabilistic algorithms for
Hamiltonian circuits and matchings . . . 155--193
Michael J. Fischer and
Richard E. Ladner Propositional dynamic logic of regular
programs . . . . . . . . . . . . . . . . 194--211
Arthur G. Werschulz Optimal order for approximation of
derivatives . . . . . . . . . . . . . . 213--217
David A. Poplawski On LL-regular grammars . . . . . . . . . 218--227
Susanna Ginali Regular trees and the free iterative
theory . . . . . . . . . . . . . . . . . 228--242
Hiroakira Ono and
Akira Nakamura Undecidability of the first-order
arithmetic $A [P(x), 2 x, x + 1]$ . . . 243--253
Emily P. Friedman and
Sheila A. Greibach Monadic recursion schemes: The effect of
constants . . . . . . . . . . . . . . . 254--266
Gheorghe Páun On the family of finite index matrix
languages . . . . . . . . . . . . . . . 267--280
Elaine J. Weyuker Modifications of the program scheme
model . . . . . . . . . . . . . . . . . 281--293
Dan Gordon Complexity classes of provable recursive
functions . . . . . . . . . . . . . . . 294--303
Paulo A. S. Veloso and
Arthur Gill Some remarks on multiple-entry finite
automata . . . . . . . . . . . . . . . . 304--306
Michel Latteux Cônes rationnels commutatifs . . . . . . 307--333
Anonymous Author index for volume 18 . . . . . . . 334--334
C. Pair and
M. Amirchahy and
D. Neel Correctness proofs of syntax-directed
processing descriptions by attributes 1--17
Carlton J. Maxson and
Kirby C. Smith Automorphisms of linear automata . . . . 18--26
Mitchell Wand Final algebra semantics and data type
extensions . . . . . . . . . . . . . . . 27--44
Meera Blattner and
Tom Head The decidability of equivalence for
deterministic finite transducers . . . . 45--49
David B. Benson Parameter passing in nondeterministic
recursive programs . . . . . . . . . . . 50--62
Michael A. Harrison and
Amiram Yehudai A hierarchy of deterministic languages 63--78
E. P. Friedman and
S. A. Greibach Superdeterministic DPDAs: The method of
accepting does affect decision problems 79--117
Tero Harju A simulation result for the auxiliary
pushdown automata . . . . . . . . . . . 119--132
Giorgio Germano and
Andrea Maggiolo-Schettini Computable stack functions for semantics
of stack programs . . . . . . . . . . . 133--144
Eitan M. Gurari and
Oscar H. Ibarra Simple counter machines and
number-theoretic problems . . . . . . . 145--162
Jirí Adámek and
Václav Koubek Least fixed point of a functor . . . . . 163--178
G. Rozenberg and
D. Vermeir On recursion in ETOL systems . . . . . . 179--196
W. J. Paul On time hierarchies . . . . . . . . . . 197--202
Tom Head Codeterministic Lindenmayer schemes and
systems . . . . . . . . . . . . . . . . 203--210
Sharad V. Kanetkar and
Meghanad D. Wagh Group character tables in discrete
transform theory . . . . . . . . . . . . 211--221
H. B. Hunt Observations on the complexity of
regular expression problems . . . . . . 222--236
A. Ehrenfeucht and
G. Rozenberg and
D. Vermeir On ET0L Systems with rank . . . . . . . 237--255
Ronald V. Book and
Sheila A. Greibach and
Celia Wrathall Reset machines . . . . . . . . . . . . . 256--276
G. Naudé Universal realization . . . . . . . . . 277--289
Nissim Francez and
C. A. R. Hoare and
Daniel J. Lehmann and
Willem P. De Roever Semantics of nondeterminism,
concurrency, and communication . . . . . 290--308
A. Nozaki Sorting using networks of deques . . . . 309--315
Anonymous Author index for volume 19 . . . . . . . 316--316
Takumi Kasai and
Akeo Adachi A characterization of time complexity by
simple loop programs . . . . . . . . . . 1--17
William J. Masek and
Michael S. Paterson A faster algorithm computing string edit
distances . . . . . . . . . . . . . . . 18--31
J. A. Brzozowski and
Faith E. Fich Languages of R-trivial monoids . . . . . 32--49
John Gallant and
David Maier and
James Astorer On finding minimal length superstrings 50--58
Satoru Miyano One-way weak-stack-counter automata . . 59--76
Teofilo Gonzalez and
Joseph Ja'Ja' On the complexity of computing bilinear
forms with 0, 1 constants . . . . . . . 77--95
Matthew C. B. Hennessy A proof system for the first-order
relational calculus . . . . . . . . . . 96--110
Paul Dietz and
S. Rao Kosaraju Recognition of topological equivalence
of patterns by array automata . . . . . 111--116
Richard Lipton and
E. K. Blum and
A. V. Aho Editors' foreword . . . . . . . . . . . 117--117
Martin Tompa Time-space tradeoffs for computing
functions, using connectivity properties
of their circuits . . . . . . . . . . . 118--132
Andrea S. Lapaugh and
Ronald L. Rivest The subgraph homeomorphism problem . . . 133--149
Joost Engelfriet and
Grzegorz Rozenberg and
Giora Slutzki Tree transducers, $L$ systems, and
two-way machines . . . . . . . . . . . . 150--202
Raymond E. Miller and
Chee K. Yap On formulating simultaneity for studying
parallelism and synchronization . . . . 203--218
John M. Lewis and
Mihalis Yannakakis The node-deletion problem for hereditary
properties is NP-complete . . . . . . . 219--230
Vaughan R. Pratt A near-optimal method for reasoning
about action . . . . . . . . . . . . . . 231--254
I. S. Filotti An algorithm for imbedding cubic graphs
in the torus . . . . . . . . . . . . . . 255--276
A. Ginzburg and
M. Yoeli Vector addition systems and regular
languages . . . . . . . . . . . . . . . 277--284
Luc Boasson and
Maurice Nivat Adherences of languages . . . . . . . . 285--309
Jan Paredaens The interaction of integrity constraints
in an information system . . . . . . . . 310--329
Michael A. Arbib and
Ernest G. Manes Foundations of system theory: The Hankel
matrix . . . . . . . . . . . . . . . . . 330--378
Karel Culik and
Arto Salomaa Test sets and checking words for
homomorphism equivalence . . . . . . . . 379--395
R. L. Rivest and
A. R. Meyer and
D. J. Kleitman and
K. Winklmann and
J. Spencer Coping with errors in binary search
procedures . . . . . . . . . . . . . . . 396--404
Anonymous Author index for volume 20 . . . . . . . 405--405
Daniel J. Lehmann On the algebra of order . . . . . . . . 1--23
Lazaros P. Mavrides A finite step-size procedure for the
F--W method . . . . . . . . . . . . . . 24--29
Shigeko Seki and
Youichi Kobuchi On DIL schemes simulated by D0L schemes 30--45
Dana Angluin Finding patterns common to a set of
strings . . . . . . . . . . . . . . . . 46--62
Satoru Fujishige An efficient PQ-graph algorithm for
solving the graph-realization problem 63--86
Tom Head A-transducers and the monotonicity of IL
schemes . . . . . . . . . . . . . . . . 87--91
Jeffrey M. Jaffe The equivalence of R.E. program schemes
and data flow schemes . . . . . . . . . 92--109
H. A. Maurer and
A. Salomaa and
D. Wood Context-free grammar forms with strict
interpretations . . . . . . . . . . . . 110--135
G. Ausiello and
A. D'Atri and
M. Protasi Structure preserving reductions among
convex optimization problems . . . . . . 136--153
Lawrence Snyder and
E. K. Blum and
Nicholas Pippenger Editor's foreword . . . . . . . . . . . 155--155
Ashok K. Chandra and
David Harel Computable queries for relational data
bases . . . . . . . . . . . . . . . . . 156--178
Richard E. Ladner The complexity of problems in systems of
communicating sequential processes . . . 179--194
Michael Sipser Lower bounds on the size of sweeping
automata . . . . . . . . . . . . . . . . 195--202
Zvi Galil and
Amnon Naamad An $ O(E V \log^2 V) $ algorithm for the
maximal flow problem . . . . . . . . . . 203--217
Walter L. Ruzzo Tree-size bounded alternation . . . . . 218--235
J. Ian Munro and
Hendra Suwanda Implicit data structures for fast search
and update . . . . . . . . . . . . . . . 236--250
Nancy A. Lynch Straight-line program length as a
parameter for complexity analysis . . . 251--280
G. Naudé A duality theory for decomposable
systems in a category . . . . . . . . . 281--291
Franz-Josef Brandenburg Multiple equality sets and post machines 292--316
Harry R. Lewis Complexity results for classes of
quantificational formulas . . . . . . . 317--353
Gaston H. Gonnet Open-Addressing Hashing with
Unequal-Probability Keys . . . . . . . . 354--367
David Maier and
Alberto O. Mendelzon and
Fereidoon Sadri and
Jeffrey Dullman Adequacy of decompositions of relational
databases . . . . . . . . . . . . . . . 368--379
Anonymous Author index for volume 21 . . . . . . . 380--380
Shlomo Moran Some results on relativized
deterministic and nondeterministic time
hierarchies . . . . . . . . . . . . . . 1--8
Tsuyoshi Nakamura Regularity and firing sequences of
computation graphs . . . . . . . . . . . 9--28
Stephen J. Willson Growth patterns of ordered cellular
automata . . . . . . . . . . . . . . . . 29--41
Keijo Ruohonen The decidability of the DOL-DTOL
equivalence problem . . . . . . . . . . 42--52
Paul Chew and
Michael Machtey A note on structure and looking back
applied to the relative complexity of
computable functions . . . . . . . . . . 53--59
Tatsuo Ohtsuki and
Hajimu Mori and
Toshinobu Kashiwabara and
Toshio Fujisawa On minimal augmentation of a graph to
obtain an interval graph . . . . . . . . 60--97
Robert Melville An improved simulation result for
ink-bounded Turing machines . . . . . . 98--105
Gregory A. Riccardi The independence of control structures
in abstract programming systems . . . . 107--143
D. Janssens and
G. Rozenberg Decision problems for node label
controlled graph grammars . . . . . . . 144--177
David A. Workman SR($s$, $k$) parsers: a class of
shift-reduce bounded-context parsers . . 178--197
M. P. Georgeff Interdependent translation schemes . . . 198--219
Eitan M. Gurari and
Oscar H. Ibarra The complexity of decision problems for
finite-turn multicounter machines . . . 220--229
John E. Savage Area-time tradeoffs for matrix
multiplication and related problems in
VLSI models . . . . . . . . . . . . . . 230--242
Theodore P. Baker Extending lookahead for LR parsers . . . 243--259
S. Rao Kosaraju and
Albert R. Meyer Editor's foreword . . . . . . . . . . . 261--261
Albert R. Meyer Dedicated to our colleague and friend
Michael Machtey . . . . . . . . . . . . 262--264
Mark N. Wegman and
J. Lawrence Carter New Hash Functions and Their Use in
Authentication and Set Equality . . . . 265--279
Gilles Brassard A time-luck tradeoff in relativized
cryptography . . . . . . . . . . . . . . 280--311
W. Paul and
R. Reischuk On time versus space II . . . . . . . . 312--327
Dexter Kozen Semantics of probabilistic programs . . 328--350
Allan Borodin and
Michael J. Fischer and
David G. Kirkpatrick and
Nancy A. Lynch and
Martin Tompa A time-space tradeoff for sorting on
non-oblivious machines . . . . . . . . . 351--364
Walter L. Ruzzo On uniform circuit complexity . . . . . 365--383
Neil Immerman Number of quantifiers is better than
number of tape cells . . . . . . . . . . 384--406
Ofer Gabber and
Zvi Galil Explicit constructions of linear-sized
superconcentrators . . . . . . . . . . . 407--420
Janos Simon Division in idealized unit cost RAMs . . 421--441
Michael Machtey and
Paul Young Remarks on Recursion versus
Diagonalization and Exponentially
Difficult Problems . . . . . . . . . . . 442--453
Nicholas Pippenger Computational Complexity of Algebraic
Functions . . . . . . . . . . . . . . . 454--470
Anonymous Author index for volume 22 . . . . . . . 471--471
H. A. Maurer and
A. Salomaa and
D. Wood Completeness of context-free grammar
forms . . . . . . . . . . . . . . . . . 1--10
Gérard Huet A complete proof of correctness of the
Knuth--Bendix completion algorithm . . . 11--21
Katsuhiko Nakamura Synchronous to asynchronous
transformation of polyautomata . . . . . 22--37
Arthur G. Werschulz On maximal order for local and global
numerical problems . . . . . . . . . . . 38--48
R. J. R. Back On correct refinement of programs . . . 49--68
Jean H. Gallier Recursion-closed algebraic theories . . 69--105
Martin Tompa Corrigendum . . . . . . . . . . . . . . 106--106
Walter J. Savitch and
B. S. Baker and
R. E. Miller Editor's foreword . . . . . . . . . . . 107--107
Wolfgang J. Paul and
Joel I. Seiferas and
Janos Simon An information-theoretic approach to
time bounds for on-line computation . . 108--126
Martin Tompa An optimal solution to a wire-routing
problem . . . . . . . . . . . . . . . . 127--150
Nicholas Pippenger Pebbling with an auxiliary pushdown . . 151--165
Mark H. Overmars and
Jan van Leeuwen Maintenance of configurations in the
plane . . . . . . . . . . . . . . . . . 166--204
Deborah Joseph and
Paul Young Independence results in computer
science? . . . . . . . . . . . . . . . . 205--222
Hartmut Ehrig and
Bernd Mahr Complexity of algebraic implementations
for abstract data types . . . . . . . . 223--253
Nancy A. Lynch Upper bounds for static resource
allocation in a distributed system . . . 254--278
Albert R. Meyer and
Rohit Parikh Definability in dynamic logic . . . . . 279--298
Rüdiger Valk and
Guy Vidal-Naquet Petri nets and regular languages . . . . 299--325
Alan L. Selman Some observations on NP real numbers and
P-selective sets . . . . . . . . . . . . 326--332
Lawrence Snyder Theft and conspiracy in the take-grant
protection model . . . . . . . . . . . . 333--347
Ernst Leiss The complexity of restricted regular
expressions and the synthesis problem
for finite automata . . . . . . . . . . 348--354
Michael L. Fredman and
Dennis J. Volper Query time versus redundancy trade-offs
for range queries . . . . . . . . . . . 355--365
Michio Oyamaguchi and
Yasuyoshi Inagaki and
Namio Honda The equivalence problem for two dpda's,
one of which is a finite-turn or
one-counter machine . . . . . . . . . . 366--382
Luigia Aiello and
Gianfranco Print An efficient interpreter for the
lambda-calculus . . . . . . . . . . . . 383--424
Anonymous Author index for volume 23 . . . . . . . 425--425
Sharon J. Laskowski Computing lower bounds on tensor rank
over finite fields . . . . . . . . . . . 1--14
Ker-I Ko The maximum value problem and NP real
numbers . . . . . . . . . . . . . . . . 15--35
Jan Pittl On LLP($k$) parsers . . . . . . . . . . 36--68
Oscar H. Ibarra and
Shlomo Moran On some decision problems for RAM
programs . . . . . . . . . . . . . . . . 69--81
Nicholas Pippenger Superconcentrators of depth 2 . . . . . 82--90
Amiram Yehudai A hierarchy of real-time deterministic
languages and their equivalence . . . . 91--100
Nancy A. Lynch Accessibility of values as a determinant
of relative complexity in algebras . . . 101--113
Jiri Adamek and
Evelyn Nelson and
Jan Reiterman Tree constructions of free continuous
algebras . . . . . . . . . . . . . . . . 114--146
Anonymous Announcement . . . . . . . . . . . . . . 147--147
Anton Nijholt The equivalence problem for LL- and
LR-regular grammars . . . . . . . . . . 149--161
Michael Rodeh Finding the median distributively . . . 162--166
J. Albert and
K. Culik Tree correspondence problems . . . . . . 167--179
Jerry Goldman and
Steven Homer Quadratic automata . . . . . . . . . . . 180--196
Greg N. Frederickson and
Donald B. Johnson The complexity of selection and ranking
in $X + Y$ and matrices with sorted
columns . . . . . . . . . . . . . . . . 197--208
Joseph Ja'Ja' The computational complexity of a set of
quadratic functions . . . . . . . . . . 209--223
Timothy J. Long A note on sparse oracles for NP . . . . 224--232
K. Hashiguchi Limitedness theorem on finite automata
with distance functions . . . . . . . . 233--244
Andrea Maggiolo-Schettini and
Jozef Winkowski Processes of transforming structures . . 245--282
Joost Engelfriet and
Gilberto Filé Simple multi-visit attribute grammars 283--314
Seymour Ginsburg and
Jonathan Goldstine and
Edwin H. Spanier A prime decomposition theorem for
grammatical families . . . . . . . . . . 315--361
Hajime Machida and
Takumi Kasai Space complexity in on-line computation 362--372
M. B. Thuraisingham Representation of one-one degrees by
decision problems for system functions 373--377
Deborah Joseph and
Paul Young Corrigendum . . . . . . . . . . . . . . 378--378
Anonymous Author index for volume 24 . . . . . . . 379--379
Alan L. Selman Editor's foreword . . . . . . . . . . . 1--1
Mihalis Yannakakis and
Christos H. Papadimitriou Algebraic dependencies . . . . . . . . . 2--41
Eugene M. Luks Isomorphism of graphs of bounded valence
can be tested in polynomial time . . . . 42--65
Michael O. Rabin $N$-Process mutual exclusion with
bounded waiting by $ 4 \cdot \Log_2
N$-valued shared variable . . . . . . . 66--75
Neil Immerman Upper and lower bounds for first order
expressibility . . . . . . . . . . . . . 76--98
Ashok Chandra and
David Harel Structure and complexity of relational
queries . . . . . . . . . . . . . . . . 99--128
Alan L. Selman Editor's foreword . . . . . . . . . . . 129--129
Stephen R. Mahaney Sparse complete sets for NP: Solution of
a conjecture of Berman and Hartmanis . . 130--143
David Harel and
Dexter Kozen and
Rohit Parikh Process logic: Expressiveness,
decidability, completeness . . . . . . . 144--170
Philippe Flajolet and
Andrew Odlyzko The average height of binary trees and
other simple trees . . . . . . . . . . . 171--213
Jon Louis Bentley and
Donna J. Brown A general class of resource tradeoffs 214--238
Gerard Huet and
Jean-Marie Hullot Proofs by induction in equational
theories with constructors . . . . . . . 239--266
J. A. Bergstra and
J. V. Tucker Expressiveness and the completeness of
Hoare's logic . . . . . . . . . . . . . 267--284
Takumi Kasai and
Raymond E. Miller Homomorphisms between models of parallel
computation . . . . . . . . . . . . . . 285--331
Christoph M. Hoffmann Subcomplete generalizations of graph
isomorphism . . . . . . . . . . . . . . 332--359
Wolfgang Thomas Classifying regular events in symbolic
logic . . . . . . . . . . . . . . . . . 360--376
W. Kuich An algebraic characterization of some
principal regulated rational cones . . . 377--401
Mordechai Ben-Ari and
Joseph Y. Halpern and
Amir Pnueli Deterministic propositional dynamic
logic: Finite models, complexity, and
completeness . . . . . . . . . . . . . . 402--417
Joost Engelfriet and
Sven Skyum The copying power of one-state tree
transducers . . . . . . . . . . . . . . 418--435
Anonymous Author index for volume 25 . . . . . . . 436--436
Douglas Comer Effects of Updates on Optimality in
Tries . . . . . . . . . . . . . . . . . 1--13
Michel Latteux Langages \`a un Compteur. (French)
[One-Counter Languages] . . . . . . . . 14--33
A. Ehrenfeucht and
J. Engelfriet and
G. Rozenberg Context Free Normal Systems and ETOL
Systems . . . . . . . . . . . . . . . . 34--46
Oscar H. Ibarra and
Brian S. Leininger On the Zero-inequivalence Problem far
Loop Programs . . . . . . . . . . . . . 47--64
David A. Carlson and
John E. Savage Size-Space Tradeoffs for Oblivious
Computations . . . . . . . . . . . . . . 65--81
Jürgen Albert and
Derick Wood Checking Sets, Test Sets, Rich Languages
and Commutatively Closed Languages . . . 82--91
Dave Riffelmacher Multiplicative Complexity and Algebraic
Structure . . . . . . . . . . . . . . . 92--106
Toshimasa Watanabe and
Akira Nakamura On the Transformation Semigroups of
Finite Automata . . . . . . . . . . . . 107--138
John J. Grefenstette Network Structure and the Firing Squad
Synchronization problem . . . . . . . . 139--152
Esko Ukkonen Lower bounds on the size of
deterministic parsers . . . . . . . . . 153--170
Seymour Ginsburg and
Jonathan Goldstine and
Edwin H. Spanier On the equality of grammatical families 171--196
Takao Asano and
Tomio Hirata Edge-contraction problems . . . . . . . 197--208
Ker-I Ko On self-reducibility and weak
P-selectivity . . . . . . . . . . . . . 209--221
David Harel and
Amir Pnueli and
Jonathan Stavi Propositional dynamic logic of
nonregular programs . . . . . . . . . . 222--243
Seppo Sippu and
Eljas Soisalon-Soininen On the complexity of LL(k) testing . . . 244--268
Maurice Tchuente Computation of Boolean functions on
networks of binary automata . . . . . . 269--277
Richard Demillo and
Ronald Rivest and
E. K. Blum Editors' foreword . . . . . . . . . . . 279--279
Zvi Galil and
Joel Seiferas Time-space-optimal string matching . . . 280--294
David E. Muller and
Paul E. Schupp Groups, the theory of ends, and
context-free languages . . . . . . . . . 295--310
Deborah Joseph Polynomial time computations in models
of ET . . . . . . . . . . . . . . . . . 311--338
Daniel Kleitman and
Frank Thomson Leighton and
Margaret Lepley and
Gary L. Miller An asymptotically optimal layout for the
shuffle-exchange graph . . . . . . . . . 339--361
Daniel D. Sleator and
Robert Endre Tarjan A data structure for dynamic trees . . . 362--391
Faith E. Fich Lower bounds for the cycle detection
problem . . . . . . . . . . . . . . . . 392--409
K. N. Venkataraman and
Ann Yasuhara and
Frank M. Hawrusik A view of computability on term algebras 410--471
Anonymous Author index for volume 26 . . . . . . . 472--472
Stephan Heilbrunner Tests for the LR-, LL-, and LC-regular
conditions . . . . . . . . . . . . . . . 1--13
Uwe Schöning A low and a high hierarchy within NP . . 14--28
Martha Steenstrup and
Michael A. Arbib and
Ernest G. Manes Port automata and the algebra of
concurrent processes . . . . . . . . . . 29--50
Ichiro Suzuki and
Tadao Murata A method for stepwise refinement and
abstraction of Petri nets . . . . . . . 51--76
James A. Storer On the complexity of chess . . . . . . . 77--100
K. Hashiguchi Representation theorems on regular
languages . . . . . . . . . . . . . . . 101--115
Satoru Miyano Remarks on multihead pushdown automata
and multihead stack automata . . . . . . 116--124
Masanobu Itô and
Nobuyasu Ôsato and
Masakazu Nasu Linear cellular automata over $ \mathbb
{Z}_m $ . . . . . . . . . . . . . . . . 125--140
J. C. Shepherdson Calvin C. Elgot 1922--1980 . . . . . . . 141--144
R. E. Miller Reminiscences 1 . . . . . . . . . . . . 145--145
E. K. Blum Reminiscences 2 . . . . . . . . . . . . 146--147
Stephen L. Bloom and
James W. Thatcher and
Eric G. Wagner and
Jesse B. Wright Recursion and iteration in continuous
theories: The ``$M$-construction'' . . . 148--164
Hartmut Schmeck Algebraic characterization of reducible
flowcharts . . . . . . . . . . . . . . . 165--199
Francesco Parisi-Presicce Extensions of iterative congruences on
free iterative algebras . . . . . . . . 200--220
Douglas R. Troeger An axiomatization of D-scheme strong
equivalence . . . . . . . . . . . . . . 221--224
Stephen L. Bloom All solutions of a system of recursion
equations in infinite trees and other
contraction theories . . . . . . . . . . 225--255
Michael O. Rabin Transaction protection by beacons . . . 256--267
J. A. Goguen and
J. Meseguer Correctness of recursive parallel
nondeterministic flow programs . . . . . 268--290
Z. Ésik Algebras of iteration theories . . . . . 291--303
Edward K. Blum and
Francesco Parisi-Presicce Implementation of data types by
algebraic methods . . . . . . . . . . . 304--330
Richard Hull Acyclic join dependency and data base
projections . . . . . . . . . . . . . . 331--349
Nancy A. Lynch and
Michael J. Fischer A technique for decomposing algorithms
which use a single shared variable . . . 350--377
Bernard R. Hodgson and
Clement F. Kent A normal form for arithmetical
representation of NP-sets . . . . . . . 378--388
Egidio Astesiano and
Gerardo Costa The insensitivity theorem for
nonreducing reflexive types . . . . . . 389--399
Richard J. Lorentz and
David B. Benson Deterministic and nondeterministic
flowchart interpretations . . . . . . . 400--433
Ludwig Staiger Finite-state $ \omega $-languages . . . 434--448
Anonymous Author index for volume 27 . . . . . . . 449--449
Alfred V. Aho and
E. K. Blum Editors' foreword . . . . . . . . . . . 1--1
Anthony C. Klug and
Alfred V. Aho Obituary . . . . . . . . . . . . . . . . 2--2
Moshe Y. Vardi The implication and finite implication
problems for typed template dependencies 3--28
Marco A. Casanova and
Ronald Fagin and
Christos H. Papadimitriou Inclusion dependencies and their
interaction with functional dependencies 29--59
Nathan Goodman and
Oded Shmueli The tree projection theorem and
relational query processing . . . . . . 60--79
Tomasz Imieli\'nski and
Witold Lipski The relational model of data and
cylindric algebras . . . . . . . . . . . 80--102
Paris C. Kanellakis and
Christos H. Papadimitriou Is distributed locking harder? . . . . . 103--120
Marc H. Graham and
Mihalis Yannakakis Independent database schemas . . . . . . 121--141
Carlo Zaniolo Database relations with null values . . 142--166
D. S. Johnson and
A. Klug Testing containment of conjunctive
queries under functional and inclusion
dependencies . . . . . . . . . . . . . . 167--189
Harry R. A. Lewis Editor's foreword . . . . . . . . . . . 191--191
Yishai A. Feldman and
David Harel A probabilistic dynamic logic . . . . . 193--215
Walter L. Ruzzo and
Janos Simon and
Martin Tompa Space-bounded hierarchies and
probabilistic computations . . . . . . . 216--230
Martin Fürer Data structures for distributed counting 231--243
C. H. Papadimitriou and
M. Yannakakis The complexity of facets (and some
facets of complexity) . . . . . . . . . 244--259
Christos H. Papadimitriou and
Michael Sipser Communication complexity . . . . . . . . 260--269
Shafi Goldwasser and
Silvio Micali Probabilistic Encryption . . . . . . . . 270--299
Sandeep N. Bhatt and
Frank Thomson Leighton A framework for solving VLSI graph
layout problems . . . . . . . . . . . . 300--343
Manfred K. Warmuth and
David Haussler On the complexity of iterated shuffle 345--358
Michael C. Low Minimizing access pointers into trees
and arrays . . . . . . . . . . . . . . . 359--378
Dan E. Willard New trie data structures which support
very fast search operations . . . . . . 379--394
H. B. Hunt and
D. J. Rosenkrantz The complexity of monadic recursion
schemes: exponential time bounds . . . . 395--419
Errol L. Lloyd and
S. S. Ravi One-layer routing without component
constraints . . . . . . . . . . . . . . 420--438
Robin Milner A complete inference system for a class
of regular behaviours . . . . . . . . . 439--466
Anonymous Author index for volume 28 . . . . . . . 467--467
Luc Devroye Exponential bounds for the running time
of a selection algorithm . . . . . . . . 1--7
David A. Plaisted Complete problems in the first-order
predicate calculus . . . . . . . . . . . 8--35
Kokichi Sugihara An $ n \log n $ algorithm for
determining the congruity of polyhedra 36--47
Jan K. Pachl Finding pseudoperipheral nodes in graphs 48--53
M. Latteux and
G. Rozenberg Commutative One-counter languages are
regular . . . . . . . . . . . . . . . . 54--57
Tsong Yueh Chen On the fixpoints of nondeterministic
recursive definitions . . . . . . . . . 58--79
F. Kröger A generalized nexttime operator in
temporal logic . . . . . . . . . . . . . 80--98
Douglas R. Troeger Weak equivalence in a class of
structured program schemes . . . . . . . 99--117
Walter J. Savitch and
Patrick W. Dymond Consistency in nondeterministic storage 118--132
W. J. Hsu and
M. W. Du New algorithms for the LCS problem . . . 133--152
Antonio Restivo and
Christophe Reutenauer On cancellation properties of languages
which are supports of rational power
series . . . . . . . . . . . . . . . . . 153--159
Albert R. Meyer and
Jerzy Tiuryn Equivalences among logics of programs 160--170
Hiromi Miyajima and
Masateru Harao and
Shoichi Noguchi Indecomposable maps in tessellation
structures of arbitrary dimension . . . 171--182
Yaacov Yesha Time-space tradeoffs for matrix
multiplication and the Discrete Fourier
Transform on any general sequential
random-access computer . . . . . . . . . 183--197
Sara Porat and
Michael Yoeli Towards a hierarchy of nets . . . . . . 198--206
Shojiro Muro and
Tiko Kameda and
Toshimi Minoura Multi-version concurrency control scheme
for a database system . . . . . . . . . 207--224
Simeon Ntafos and
Teofilo Gonzalez On the computational complexity of path
cover problems . . . . . . . . . . . . . 225--242
John E. Savage The performance of multilective VLSI
algorithms . . . . . . . . . . . . . . . 243--273
John H. Reif The complexity of two-player games of
incomplete information . . . . . . . . . 274--301
Paul M. B. Vitányi On two-tape real-time computation and
queues . . . . . . . . . . . . . . . . . 303--311
Tatsuya Motoki An application of Cohen's result on star
height to the theory of control
structures . . . . . . . . . . . . . . . 312--329
Mikhail Atallah and
Uzi Vishkin Finding Euler tours in parallel . . . . 330--337
Nathan Goodman and
Oded Shmueli and
Y. C. Tay GYO reductions, canonical connections,
tree and cyclic schemas, and tree
projections . . . . . . . . . . . . . . 338--358
D. Harel and
M. S. Paterson Undecidability of PDL with $ L = \{ a^{2
i} |; i \geq 0 \} $ . . . . . . . . . . 359--365
Joost Engelfriet and
Giora Slutzki Extended macro grammars and stack
controlled machines . . . . . . . . . . 366--408
Clement T. Yu and
Z. Meral Ozsoyoglu and
K. Lam Optimization of distributed tree queries 409--445
Anonymous Author index for volume 29 . . . . . . . 446--446
E. Allen Emerson and
Joseph Y. Halpern Decision procedures and expressiveness
in the temporal logic of branching time 1--24
Karl M. Schimpf and
Jean H. Gallier Tree pushdown automata . . . . . . . . . 25--40
John Reif and
A. P. Sistla A multiprocess network logic with
temporal and spatial modalities . . . . 41--53
Norishige Chiba and
Takao Nishizeki and
Shigenobu Abe and
Takao Ozawa A linear algorithm for embedding planar
graphs using PQ-trees . . . . . . . . . 54--76
Marek Chrobak Variations on the technique of Duris and
Galil . . . . . . . . . . . . . . . . . 77--85
Joost Engelfriet Hierarchies of hyper-AFLs . . . . . . . 86--115
Richard E. Ladner and
Jeffrey K. Norman Solitaire automata . . . . . . . . . . . 116--129
A. Borodin and
J. E. Hopcroft Routing, merging, and sorting on
parallel models of computation . . . . . 130--145
Anonymous Announcement . . . . . . . . . . . . . . 146--146
Walter L. Ruzzo and
Edward K. Blum Editors' foreword . . . . . . . . . . . 147--147
Patrick W. Dymond and
Martin Tompa Speedups of deterministic machines by
synchronous parallel machines . . . . . 149--161
Dexter Kozen A probabilistic PDL . . . . . . . . . . 162--178
Susan Landau and
Gary Lee Miller Solvability by radicals is in polynomial
time . . . . . . . . . . . . . . . . . . 179--208
Harold N. Gabow and
Robert Endre Tarjan A linear-time algorithm for a special
case of disjoint set union . . . . . . . 209--221
Ashok K. Chandra and
Steven Fortune and
Richard Lipton Unbounded fan-in circuits and
associative functions . . . . . . . . . 222--234
Arjen K. Lenstra Factoring multivariate polynomials over
finite fields . . . . . . . . . . . . . 235--248
J. Gonczarowski and
E. Shamir Pattern selector grammars and several
parsing algorithms in the context-free
style . . . . . . . . . . . . . . . . . 249--273
Antonio Bahamondf Cost functors and optimal realization 274--290
Hirotomo Aso and
Namio Honda Dynamical characteristics of linear
cellular automata . . . . . . . . . . . 291--317
Michael G. Main and
David B. Benson Free semiring-representations and
nondeterminism . . . . . . . . . . . . . 318--328
Ferng-Ching Lin and
I-Chen Wu Area-period tradeoffs for multiplication
of rectangular matrices . . . . . . . . 329--342
Paliath Narendran and
Colm Ó'Dúnlaing and
Heinrich Rolletschek Complexity of certain decision problems
about congruential languages . . . . . . 343--358
William M. Kantor Sylow's theorem in polynomial time . . . 359--394
Ronald V. Book and
Timothy J. Long and
Alan L. Selman Qualitative relativizations of
complexity classes . . . . . . . . . . . 395--413
Anonymous Author index for volume 30 . . . . . . . 414--414
Rami Melhem Formal analysis of a systolic system for
finite element stiffness matrices . . . 1--27
Juraj Hromkovic On the power of alternation in automata
theory . . . . . . . . . . . . . . . . . 28--39
Martin E. Kaliski and
Quentin L. Klein Behavior of a class of nonlinear
discrete-time systems . . . . . . . . . 40--62
Mikhail J. Atallah A matching problem in the plane . . . . 63--70
Joost Engelfriet and
Heiko Vogler Macro tree transducers . . . . . . . . . 71--146
Lawrence Snyder Editor's foreword . . . . . . . . . . . 147--147
Harold N. Garbow Scaling algorithms for network problems 148--168
Christopher B. Wilson Relativized circuit complexity . . . . . 169--181
Philippe Flajolet and
G. Nigel Martin Probabilistic Counting Algorithms for
Data Base Applications . . . . . . . . . 182--209
Janet Incerpi and
Robert Sedgewick Improved upper bounds on shellsort . . . 210--224
Joachim von zur Gathen Irreducibility of multivariate
polynomials . . . . . . . . . . . . . . 225--264
Joachim von zur Gathen and
Erich Kaltofen Factoring sparse multivariate
polynomials . . . . . . . . . . . . . . 265--287
Christos H. Papadimitriou Games against nature . . . . . . . . . . 288--301
G. Senizergues The equivalence and inclusion problems
for NTS languages . . . . . . . . . . . 303--331
L. Boasson and
G. Senizergues NTS languages are deterministic and
congruential . . . . . . . . . . . . . . 332--342
Patrick C. Fischer and
Lawrence V. Saxton and
Stan J. Thomas and
Dirk Van Gucht Interactions between dependencies and
nested relational structures . . . . . . 343--354
Philip A. Bernstein and
Nathan Goodman Serializability theory for replicated
databases . . . . . . . . . . . . . . . 355--374
Stephen L. Bloom and
Zoltán Esik Axiomatizing schemes and their behaviors 375--393
A. Apostolico and
F. P. Preparata Structural properties of the string
statistics problem . . . . . . . . . . . 394--411
Anonymous Author index for volume 31 . . . . . . . 412--412
Shuo-Yen Robert Li Binary trees and uniform distribution of
traffic cutback . . . . . . . . . . . . 1--14
Peter Gács Reliable computation with cellular
automata . . . . . . . . . . . . . . . . 15--78
Dennis de Champeaux About the Paterson--Wegman linear
unification algorithm . . . . . . . . . 79--90
Ingo Wegener Time-space trade-offs for branching
programs . . . . . . . . . . . . . . . . 91--96
Pawel Urzyczyn ``During'cannot be expressed by
``after'' . . . . . . . . . . . . . . . 97--104
Louis E. Rosier and
Hsu-Chun Yen A multiparameter analysis of the
boundedness problem for vector addition
systems . . . . . . . . . . . . . . . . 105--135
V. Kantabutra and
S. R. Kosaraju New algorithms for multilink robot arms 136--153
Richard A. DeMillo and
Edward K. Blum Editors' foreword . . . . . . . . . . . 155--155
Bernard Chazelle Reporting and counting segment
intersections . . . . . . . . . . . . . 156--182
Moshe Y. Vardi and
Pierre Wolper Automata-theoretic techniques for modal
logics of programs . . . . . . . . . . . 183--221
Ravi B. Boppana Threshold functions and bounded depth
monotone circuits . . . . . . . . . . . 222--229
Danny Dolev and
Joseph Y. Halpern and
H. Raymond Strong On the possibility and impossibility of
achieving clock synchronization . . . . 230--250
Michael Ben-Or and
Dexter Kozen and
John Reif The complexity of elementary algebra and
geometry . . . . . . . . . . . . . . . . 251--264
Gary L. Miller Finding small simple cycle separators
for $2$-connected planar graphs . . . . 265--279
John H. Reif and
Harry R. Lewis Efficient symbolic analysis of programs 280--314
J. Karhumäki and
Y. Maon A simple undecidable problem:
Existential agreement of inverses of two
morphisms on a regular language . . . . 315--322
J. A. Bergstra and
J. W. Klop Conditional rewrite rules: Confluence
and termination . . . . . . . . . . . . 323--362
Bernard R. Hodgson and
Clement F. Kent Uniform normal form for general
time-bounded complexity classes . . . . 363--369
James C. Owings Effective choice functions and index
sets . . . . . . . . . . . . . . . . . . 370--373
Bogdan S. Chlebus Domino-tiling games . . . . . . . . . . 374--392
Dominique Perrin and
Jean-Eric Pin First-order logic and star-free sets . . 393--406
N. Lakshmipathy and
Karl Winklmann ``Global'' graph problems tend to be
intractable . . . . . . . . . . . . . . 407--428
Anonymous Author index for volume 32 . . . . . . . 429--429
Larry Stockmeyer Editor's foreword . . . . . . . . . . . 1--1
Ketan Mulmuley Fully abstract submodels of typed lambda
calculi . . . . . . . . . . . . . . . . 2--46
Amos Fiat and
Adi Shamir Polymorphic arrays: a novel VLSI layout
for systolic computers . . . . . . . . . 47--65
J. Ian Munro An implicit data structure supporting
insertion, deletion, and search in $
O(\log^2 n) $ time . . . . . . . . . . . 66--74
Miklos Santha and
Umesh V. Vazirani Generating Quasi-Random Sequences from
Semi-Random Sources . . . . . . . . . . 75--87
Albert G. Greenberg and
Alan Weiss A lower bound for probabilistic
algorithms for finite state machines . . 88--105
Ramamohan Paturi and
Janos Simon Probabilistic communication complexity 106--123
Jeff Ullman Editor's foreword . . . . . . . . . . . 125--125
Heikki Mannila and
Karijouko Raihä Design by example: an application of
Armstrong relations . . . . . . . . . . 126--141
Moshe Y. Vardi Querying logical databases . . . . . . . 142--160
Ouri Wolfson and
Mihalis Yannakakis Deadlock-freedom (and safety) of
transactions in a distributed database 161--178
Giorgio Ausiello and
Alessandro D'Atri and
Marina Moscarini Chordality properties on graphs and
minimal conceptual connections in
semantic data models . . . . . . . . . . 179--202
Stavros S. Cosmadakis and
Paris C. Kanellakis and
Nicolas Spyratos Partition semantics for relations . . . 203--233
Tim Connors Equivalence of views by query capacity 234--274
Yehoshua Sagiv Concurrent operations on B$^*$-trees
with overtaking . . . . . . . . . . . . 275--296
Thanasis Hadzilacos and
Christos H. Papadimitriou Algorithmic aspects of multiversion
concurrency control . . . . . . . . . . 297--310
T. Imielinski Witold Lipski, Jr. (1949--1985) . . . . 311--311
Orna Grumberg and
Nissim Francez and
Shmuel Katz A complete rule for equifair termination 313--332
Andrzej Tarlecki Quasi-varieties in abstract algebraic
institutions . . . . . . . . . . . . . . 333--360
Serge Abiteboul and
Nicole Bidoit Non First Normal Form relations: an
algebra allowing data restructuring . . 361--393
Martin E. Kaliski and
S. Yunkap Kwankam and
Pamela Halpern and
David Shulman A theory of orbital behavior in a class
of nonlinear systems: Chaos and a
signature-based approach . . . . . . . . 394--414
Dirk Janssens and
Grzegorz Rozenberg and
Emo Welzl The bounded degree problem for NLC
grammars is decidable . . . . . . . . . 415--422
Günter Hotz A representation theorem of infinite
dimensional algebras and applications to
language theory . . . . . . . . . . . . 423--455
Elias Dahlhaus and
Manfred K. Warmuth Membership for growing context-sensitive
grammars is polynomial . . . . . . . . . 456--472
H. C. Card and
A. Thanailakis and
W. Pries and
R. D. McLeod Analysis of bounded linear cellular
automata based on a method of image
charges . . . . . . . . . . . . . . . . 473--480
Anonymous Author index for volume 33 . . . . . . . 481--481
D. Cantone and
A. Ferro and
J. T. Schwartz Decision procedures for elementary
sublanguages of set theory. V.
Multilevel syllogistic extended by the
general union operator . . . . . . . . . 1--18
Greg N. Frederickson Upper bounds for time-space trade-offs
in sorting and selection . . . . . . . . 19--26
Amihood Amir Expressive completeness failure in
branching time structures . . . . . . . 27--42
Andranik Mirzaian River routing in VLSI . . . . . . . . . 43--54
Rodney R. Howell and
Louis E. Rosier An analysis of the nonemptiness problem
for classes of reversal-bounded
multicounter machines . . . . . . . . . 55--74
Ker-I Ko and
Chin-Ming Hua A note on the two-variable
pattern-finding problem . . . . . . . . 75--86
Heiko Vogler Basic tree transducers . . . . . . . . . 87--128
Karl R. Abrahamson Succinct representation of regular sets
using gotos and boolean variables . . . 129--148
Hartmut Ehrig Editor's foreword . . . . . . . . . . . 149--149
Donald Sannella and
Andrzej Tarlecki On observational equivalence and
algebraic specification . . . . . . . . 150--178
Peter Padawitz Parameter-preserving data type
specifications . . . . . . . . . . . . . 179--209
Ilaria Castellani Bisimulations and abstraction
homomorphisms . . . . . . . . . . . . . 210--235
Manfred Broy Specification and top-down design of
distributed systems . . . . . . . . . . 236--265
J. A. Makowsky Why horn formulas matter in computer
science: Initial structures and generic
examples . . . . . . . . . . . . . . . . 266--292
E. K. Blum and
H. Ehrig and
F. Parisi-Presicce Algebraic specification of modules and
their basic interconnections . . . . . . 293--339
Axel Poigné and
Josef Voss On the implementation of abstract data
types by programming language constructs 340--376
Paul Boehm and
Harald-Reto Fonio and
Annegret Habel Amalgamation of graph transformations: A
synchronization mechanism . . . . . . . 377--408
R. M. Burstall Inductively defined functions in
functional programming languages . . . . 409--421
Pierpaolo Degano and
Ugo Montanari Concurrent histories: a basis for
observing distributed systems . . . . . 422--461
Anonymous Author index for volume 34 . . . . . . . 462--462
Joachim Biskup and
Renate Meyer Design of relational database schemes by
deleting attributes in the canonical
decomposition . . . . . . . . . . . . . 1--22
David Peleg Communication in concurrent dynamic
logic . . . . . . . . . . . . . . . . . 23--58
R. P. Kurshan Complementing deterministic Büchi
automata in polynomial time . . . . . . 59--71
Francesco Parisi-Presicce Union and actualization of module
specifications: Some compatibility
results . . . . . . . . . . . . . . . . 72--95
Toshimasa Watanabe and
Akira Nakamura Edge-connectivity augmentation problems 96--144
Seinosuke Toda $ \Sigma_2 $ SPACE($n$) is closed under
complement . . . . . . . . . . . . . . . 145--152
László Babai and
Péter Hajnal and
Endre Szemerédi and
György Turán A lower bound for read-once-only
branching programs . . . . . . . . . . . 153--162
Gheorghe \cSteffanescu On flowchart theories. Part I. The
deterministic case . . . . . . . . . . . 163--191
Michael G. Main and
Grzegorz Rozenberg Handle NLC grammars and R. E. languages 192--205
Józef Winkowski and
Andrea Maggiolo-Schettini An algebra of processes . . . . . . . . 206--228
Vera Trnková and
Jan Reiterman Dynamic algebras with test . . . . . . . 229--242
Jean-Michel Autebert and
Luc Boasson and
Géraud Sénizergues Groups and NTS languages . . . . . . . . 243--267
Michael L. Fredman and
Thomas H. Spencer Refined complexity analysis for heap
operations . . . . . . . . . . . . . . . 269--284
Friedrich Otto On deciding the confluence of a finite
string-rewriting system on a given
congruence class . . . . . . . . . . . . 285--310
J. Beauquier and
M. Blattner and
M. Latteux On commutative context-free languages 311--320
N. Bidoit The verso algebra or how to answer
queries with fewer joins . . . . . . . . 321--364
David B. Benson and
Ir\`ene Guessarian Algebraic solutions to recursion schemes 365--400
Anonymous Author index for volume 35 . . . . . . . 401--401
Pierre Baldi Group actions and learning for a family
of automata . . . . . . . . . . . . . . 1--15
Peter A. Lindsay On alternating $ \omega $-automata . . . 16--24
Masashi Katsura Automorphism groups and factor automata
of strongly connected automata . . . . . 25--65
Z. Ésik Independence of the equational axioms
for iteration theories . . . . . . . . . 66--76
Dirk Van Gucht and
Patrick C. Fischer Multilevel nested relational structures 77--105
Andrew Odlyzko Editor's foreword . . . . . . . . . . . 107--107
Robert Wilber White pebbles help . . . . . . . . . . . 108--124
Peter Gács and
John Reif A simple three-dimensional real-time
reliable cellular array . . . . . . . . 125--147
F. R. K. Chung and
D. J. Hajela and
P. D. Seymour Self-organizing sequential search and
Hilbert's inequalities . . . . . . . . . 148--157
J. W. de Bakker and
J.-J. Ch. Meyer and
E.-R. Olderog and
J. I. Zucker Transition systems, metric spaces and
ready sets in the semantics of uniform
concurrency . . . . . . . . . . . . . . 158--224
Richard M. Karp and
Eli Upfal and
Avi Wigderson The complexity of parallel search . . . 225--253
László Babai and
Shlomo Moran Arthur--Merlin games: a randomized proof
system, and a hierarchy of complexity
classes . . . . . . . . . . . . . . . . 254--276
Stephen R. Mahaney Editor's foreword . . . . . . . . . . . 277--277
Ian Parberry and
Georg Schnitger Parallel computation with threshold
functions . . . . . . . . . . . . . . . 278--302
Christopher B. Wilson A measure of relativized space which is
faithful with respect to depth . . . . . 303--312
Martin Dietzfelbinger and
Wolfgang Maass Lower bound arguments with
``Inaccessible'' numbers . . . . . . . . 313--335
Eric W. Allender Isomorphisms and $ 1 - L $ reductions 336--350
Jonathan F. Buss Relativized alternation and
space-bounded computation . . . . . . . 351--378
Michael Sipser Expanders, randomness, or time versus
space . . . . . . . . . . . . . . . . . 379--383
Kenneth W. Regan The topology of provability in
complexity theory . . . . . . . . . . . 384--432
Stathis Zachos Probabilistic quantifiers and games . . 433--451
Anne Condon and
Richard E. Ladner Probabilistic game automata . . . . . . 452--489
Mark W. Krentel The complexity of optimization problems 490--509
Anonymous Author index for volume 36 . . . . . . . 510--510
Jeff Lagarias Editor's foreword . . . . . . . . . . . 1--1
Christos H. Papadimitriou and
David Wolfe The complexity of facets resolved . . . 2--13
Lefteris M. Kirousis and
Christos H. Papadimitriou The complexity of recognizing polyhedral
scenes . . . . . . . . . . . . . . . . . 14--38
Eugene M. Luks and
Pierre McKenzie Parallel algorithms for solvable
permutation groups . . . . . . . . . . . 39--62
Gad M. Landau and
Uzi Vishkin Fast string matching with k differences 63--78
David S. Johnson and
Christos H. Papadimitriou and
Mihalis Yannakakis How easy is local search? . . . . . . . 79--100
Ming Li Simulating two pushdown stores by one
tape in $ O(n^{1.5} \sqrt {\log n}) $
time . . . . . . . . . . . . . . . . . . 101--116
Ravi Kannan Editors's foreword . . . . . . . . . . . 117--117
Noga Alon and
Wolfgang Maasst Meanders and their applications in lower
bounds arguments . . . . . . . . . . . . 118--129
Prabhakar Raghavan Probabilistic construction of
deterministic algorithms: Approximating
packing integer programs . . . . . . . . 130--143
Marek Chrobak and
Ming Li k + 1Heads are better than k for PDAs 144--155
Gilles Brassard and
David Chaum and
Claude Crépeau Minimum disclosure proofs of knowledge 156--189
Philip N. Klein and
John H. Reif An efficient parallel algorithm for
planarity . . . . . . . . . . . . . . . 190--246
Stuart A. Kurtz and
Stephen R. Mahaney and
James S. Royer Collapsing degrees . . . . . . . . . . . 247--268
Tat-Hung Chan Pushdown automata with reversal-bounded
counters . . . . . . . . . . . . . . . . 269--291
Errol L. Lloyd and
Mary Lou Soffa and
Ching-Chy Wang On locating minimum feedback vertex sets 292--311
Uwe Schöning Graph isomorphism is in the low
hierarchy . . . . . . . . . . . . . . . 312--323
Mary G. O'Connor An unpredictability approach to
finite-state randomness . . . . . . . . 324--336
Greg N. Frederickson Distributed algorithms for selection in
sets . . . . . . . . . . . . . . . . . . 337--348
Rodney R. Howell and
Louis E. Rosier Completeness results for conflict-free
vector replacement systems . . . . . . . 349--366
Kai Salomaa Deterministic tree pushdown automata and
monadic tree rewriting systems . . . . . 367--394
Nicholas Pippenger Correction to ``Computational complexity
of algebraic functions'' . . . . . . . . 395--399
Anonymous Author index for volume 37 . . . . . . . 400--400
Juris Hartmanis Editor's foreword . . . . . . . . . . . 1--1
E. G. Coffman and
F. T. Leighton A provably efficient algorithm for
dynamic storage allocation . . . . . . . 2--35
Mihalis Yannakakis Embedding planar graphs in four pages 36--67
Jin-Yi Cai With probability one, a random oracle
separates PSPACE from the
polynomial-time hierarchy . . . . . . . 68--85
James R. Driscoll and
Neil Sarnak and
Daniel D. Sleator and
Robert E. Tarjan Making data structures persistent . . . 86--124
Miklós Ajtai and
János Komlós and
W. L. Steiger and
Endre Szemerédi Optimal parallel selection has
complexity $ O (\Log \Log N) $ . . . . . 125--133
Zvi Galil and
Ravi Kannan and
Endre Szemerédi On nontrivial separators for $k$-page
graphs and simulations by
nondeterministic one-tape Turing
machines . . . . . . . . . . . . . . . . 134--149
David A. Barrington Bounded-width polynomial-size branching
programs recognize exactly those
languages in NC 1 . . . . . . . . . . . 150--164
Herbert Edelsbrunner and
Leonidas J. Guibas Topologically sweeping an arrangement 165--194
Joseph Y. Halpern and
Moshe Y. Vardi The complexity of reasoning about
knowledge and time. I. Lower bounds . . 195--237
Avi Silberschatz Editor's foreword . . . . . . . . . . . 239--239
Heikki Mannila and
Kari-Jouko Räihä Automatic generation of test data for
relational queries . . . . . . . . . . . 240--258
Jeffrey F. Naughton Data independent recursion in deductive
databases . . . . . . . . . . . . . . . 259--289
Nicole Bidoit and
Richard Hull Minimalism, justification and
non-monotonicity in deductive databases 290--325
François Bancilhon and
Setrag Khoshafian A calculus for complex objects . . . . . 326--340
Foto Afrati and
Christos H. Papadimitriou and
George Papageorgiou and
Athena Roussou and
Yehoshua Sagiv and
Jeffrey D. Ullman On the convergence of query evaluation 341--359
Thanasis Hadzilacos and
Nihalis Yannakakis Deleting completed transactions . . . . 360--379
Yehoshua Sagiv and
Oded Shmueli A characterization of finite
fd-acyclicity . . . . . . . . . . . . . 380--404
Frank Olken and
Doron Rotem Rearranging data to maximize the
efficiency of compression . . . . . . . 405--430
Juraj Hromkovic and
Katsushi Inoue and
Itsuo Takanami Lower bounds for language recognition on
two-dimensional alternating multihead
machines . . . . . . . . . . . . . . . . 431--451
Oscar H. Ibarra and
Tao Jiang and
Jik H. Chang On iterative and cellular tree arrays 452--473
Marie-Paule Flé Serialization of concurrent programs . . 474--493
Victor Pan and
John Reif Fast and efficient solution of path
algebra problems . . . . . . . . . . . . 494--510
Craig A. Rich Positive relativizations of the P =? NP
problem . . . . . . . . . . . . . . . . 511--523
Anonymous Author index for volume 38 . . . . . . . 524--524
Steve Mahaney and
Alan L. Selman Editors' foreword . . . . . . . . . . . 1--1
Moon Jung Chung and
B. Ravikumar Strong nondeterministic Turing reduction
--- A technique for proving
intractability . . . . . . . . . . . . . 2--20
Martín Abadi and
Joan Feigenbaum and
Joe Kilian On hiding information from an oracle . . 21--50
Daniel Leivant Descriptive characterizations of
computational complexity . . . . . . . . 51--83
Uwe Schöning Probabilistic complexity classes and
lowness . . . . . . . . . . . . . . . . 84--100
Eric W. Allender Some consequences of the existence of
pseudorandom generators . . . . . . . . 101--124
Chef Yap Guest Editor's foreword . . . . . . . . 125--125
Leonidas J. Guibas and
John Hershberger Optimal shortest path queries in a
simple polygon . . . . . . . . . . . . . 126--152
N. Dadoun and
D. G. Kirkpatrick Parallel construction of subdivision
hierarchies . . . . . . . . . . . . . . 153--165
Joseph Culberson and
Robert A. Reckhow Orthogonally convex coverings of
orthogonal polygons without holes . . . 166--204
L. Paul Chew There are planar graphs almost as good
as the complete graph . . . . . . . . . 205--219
Subhash Suri Computing geodesic furthest neighbors in
simple polygons . . . . . . . . . . . . 220--235
Kokichi Sugihara On finite-precision representations of
geometric objects . . . . . . . . . . . 236--247
Steve Mahaney and
Alan L. Selman Editors' foreword . . . . . . . . . . . 249--249
Klaus Ambos-Spies Honest polynomial time reducibilities
and the P=?NP problem . . . . . . . . . 250--281
Jim Kadin P$^{NP[O(\log n)]}$ and sparse
Turing-complete sets for NP . . . . . . 282--298
Lane A. Hemachandra The strong exponential hierarchy
collapses . . . . . . . . . . . . . . . 299--322
Raymond Greenlaw Ordered vertex removal and subgraph
problems . . . . . . . . . . . . . . . . 323--342
Pierre America and
Jan Rutten Solving reflexive domain equations in a
category of complete metric spaces . . . 343--375
A. G. Robinson and
A. J. Goldman The set coincidence game: Complexity,
attainability, and symmetric strategies 376--387
Anonymous Author index for volume 39 . . . . . . . 388--388
Christopher J. Van Wyk Editor's foreword . . . . . . . . . . . 1--1
Chee-Keng Yap A geometric consistency theorem for a
symbolic perturbation scheme . . . . . . 2--18
Rajeev Motwani and
Arvind Raghunathan and
Huzur Saran Covering orthogonal polygons with star
polygons: The perfect graph approach . . 19--48
Marshall Bern Hidden surface removal for rectangles 49--69
David Dobkin and
Deborah Silver Applied computational geometry: Towards
robust solutions of basic problems . . . 70--87
Joseph S. B. Mitchell On maximum flows in polyhedral domains 88--123
Kevin E. Flannery and
Johannes J. Martin The Hoare and Smyth power domain
constructors commute under composition 125--135
Etienne Grandjean First-order spectra with one variable 136--153
J. Dassow and
H. Jürgensen Soliton automata . . . . . . . . . . . . 154--181
Damas P. Gruska Genomorphisms of semi-modular lattices 182--187
Michael G. Main and
Grzegorz Rozenberg Edge-label controlled graph grammars . . 188--228
Axel Poigné Parametrization for order-sorted
algebraic specification . . . . . . . . 229--268
Georg Lausen and
Eljas Soisalon-Soininen and
Peter Widmayer On the power of safe locking . . . . . . 269--288
Changwook Kim Picture iteration and picture ambiguity 289--306
Joost Engelfriet and
George Leih and
Emo Welzl Boundary graph grammars with dynamic
edge relabeling . . . . . . . . . . . . 307--345
Seymour Ginsburg and
Dan Tian Input-dependent-only object histories 346--375
Ijsbrand Jan Aalbersberg and
Joost Engelfriet and
Grzegorz Rozenberg The complexity of regular DNLC graph
languages . . . . . . . . . . . . . . . 376--404
Gultekin Ozsoyoglu and
Tzong-An Su On inference control in semantic data
models for statistical databases . . . . 405--443
Mark A. Fulk A note on A.E. $h$-complex functions . . 444--449
Anonymous Author index for volume 40 . . . . . . . 450--450
Moshe Y. Vardi Editor's foreword . . . . . . . . . . . 1--1
Rina Dechter Decomposing a relation into a tree of
binary relations . . . . . . . . . . . . 2--24
Paolo Atzeni and
Maria Cristina De Bernardis A new interpretation for null values in
the weak instance model . . . . . . . . 25--43
Gabriel M. Kuper Logic programming with sets . . . . . . 44--64
Alan Fekete and
Nancy Lynch and
Michael Merritt and
William Weihl Commutativity-based locking for nested
transactions . . . . . . . . . . . . . . 65--156
Catriel Beeri and
Paris Kanellakis and
François Bancilhon and
Raghu Ramakrishnan Bounds on the propagation of selection
into logic programs . . . . . . . . . . 157--180
Serge Abiteboul and
Victor Vianu Procedural languages for database
queries and updates . . . . . . . . . . 181--229
Manuel E. Bermudez and
Karl M. Schimpf Practical arbitrary lookahead LR parsing 230--250
Lane A. Hemachandra and
Steven Rudich On the complexity of ranking . . . . . . 251--271
Richard E. Ladner Editor's foreword . . . . . . . . . . . 273--273
David A. Mix Barrington and
Neil Immerman and
Howard Straubing On uniformity within NC 1 . . . . . . . 274--306
Jack H. Lutz Pseudorandom sources for BPP . . . . . . 307--320
Juichi Shinoda and
Theodore A. Slaman On the theory of the PTIME degrees of
the recursive sets . . . . . . . . . . . 321--366
JoséL. Balcázar Self-reducibility . . . . . . . . . . . 367--388
Luc Longpré and
Paul Young Cook reducibility is faster than Karp
reducibility in NP . . . . . . . . . . . 389--401
Bernd Halstenberg and
Rüdiger Reischuk Relations between communication
complexity classes . . . . . . . . . . . 402--429
Leonard Pitt and
Manfred K. Warmuth Prediction-preserving reducibility . . . 430--467
Anonymous Author index for volume 41 . . . . . . . 468--468
Manfred Broy and
Christian Lengauer On denotational versus predicative
semantics . . . . . . . . . . . . . . . 1--29
Eric Bach Realistic analysis of some randomized
algorithms . . . . . . . . . . . . . . . 30--53
Jia-Hual You Unification modulo an equality theory
for equational logic programming . . . . 54--75
Richard Beigel Relativized counting classes: Relations
among thresholds, parity, and mods . . . 76--96
H. L. Bodlaender Some lower bound results for
decentralized extrema-finding in rings
of processors . . . . . . . . . . . . . 97--118
Ming Li and
Yaacov Yesha Resource bounds for parallel computation
of threshold and symmetric functions . . 119--137
Elio Giovannetti and
Giorgio Levi and
Corrado Moiso and
Catuscia Palamidessi Kernel-LEAF: a logic plus functional
language . . . . . . . . . . . . . . . . 139--185
Friedrich Otto and
Celia Wrathall Overlaps in free partially commutative
monoids . . . . . . . . . . . . . . . . 186--198
Jeffrey F. Naughton One-sided recursions . . . . . . . . . . 199--236
Max Garzon and
Yechezkel Zalcstein On isomorphism testing of a class of
$2$-Nilpotent groups . . . . . . . . . . 237--248
Anonymous Corrigendum . . . . . . . . . . . . . . 249--251
S. Rao Kosaraju Editor's foreword . . . . . . . . . . . 253--253
Pavol Duris and
Zvi Galil Two lower bounds in asynchronous
distributed computation . . . . . . . . 254--266
Andrew Chi-Chih Yao Lower bounds to randomized algorithms
for graph properties . . . . . . . . . . 267--287
Arkady Kanevsky and
Vijaya Ramachandran Improved algorithms for graph four-
connectivity . . . . . . . . . . . . . . 288--306
Abhiram G. Ranade How to emulate shared memory . . . . . . 307--326
William Aiello and
Johan Hastad Statistical zero-knowledge languages can
be recognized in two rounds . . . . . . 327--345
Yuri Gurevich Average case completeness . . . . . . . 346--398
Anonymous Author index for volume 42 . . . . . . . 399--399
Mihalis Yannakakis Editor's foreword . . . . . . . . . . . 1--1
Thanasis Hadzilacos and
Vassos Hadzilacos Transaction synchronisation in object
bases . . . . . . . . . . . . . . . . . 2--24
Maurice P. Herlihy and
William E. Weihl Hybrid concurrency control for abstract
data types . . . . . . . . . . . . . . . 25--61
Serge Abiteboul and
Victor Vianu Datalog extensions for database queries
and updates . . . . . . . . . . . . . . 62--124
Phokion G. Kolaitis and
Christos H. Papadimitriou Why not negation by fixpoint? . . . . . 125--144
Ramsey W. Haddad and
Jeffrey F. Naughtont A counting algorithm for a cyclic binary
query . . . . . . . . . . . . . . . . . 145--169
O. P. Buneman and
S. B. Davidson and
A. Watters A semantics for complex objects and
approximate answers . . . . . . . . . . 170--218
Richard Hull and
Jianwen Su On the expressive power of database
queries with intermediate types . . . . 219--267
Karl Abrahamson Time-space tradeoffs for algebraic
problems on general sequential machines 269--289
Noga Alon and
Amotz Bar-Noy and
Nathan Linial and
David Peleg A lower bound for radio broadcast . . . 290--298
Oscar Habarra and
Tao Jiang Learning regular languages from
counterexamples . . . . . . . . . . . . 299--316
Danny Krizanc Oblivious routing with limited buffer
capacity . . . . . . . . . . . . . . . . 317--327
Joost Engelfriet and
Linda Heyker The string generating power of
context-free hypergraph grammars . . . . 328--360
Sabine Stifter An axiomatic approach to
Voronoi-diagrams in $3$D . . . . . . . . 361--379
H. Venkateswaran Properties that characterize LOGCFL . . 380--404
Jeffrey D. Ullman Editor's foreword . . . . . . . . . . . 405--405
Amos Fiat and
J. Ian Munro and
Moni Naor and
Alejandro A. Schäffer and
Jeanette P. Schmidt and
Alan Siegel An implicit data structure for searching
a multikey table in logarithmic time . . 406--424
Christos H. Papadimitriou and
Mihalis Yannakakis Optimization, approximation, and
complexity classes . . . . . . . . . . . 425--440
Mihalis Yannakakis Expressing combinatorial optimization
problems by Linear Programs . . . . . . 441--466
N. E. Fenton and
R. W. Whitty Program structures: Some new
characterisations . . . . . . . . . . . 467--483
M. Ito and
H. Jürgensen and
H. J. Shyr and
G. Thierrin Outfix and infix codes and related
classes of languages . . . . . . . . . . 484--508
Leong Kwan Li On computing decision regions with
neural nets . . . . . . . . . . . . . . 509--512
Anonymous Author index for volume 43 . . . . . . . 513--513
Edward P. F. Chan and
Paolo Atzeni Connection-trap-free database schemes 1--22
Razvan Diaconescu Contraction algebras and unification of
(infinite) terms . . . . . . . . . . . . 23--42
D. E. Muller and
F. P. Preparata Parallel restructuring and evaluation of
expressions . . . . . . . . . . . . . . 43--62
T. Lengauer and
K. W. Wagner The correlation between the complexities
of the nonhierarchical and hierarchical
versions of graph problems . . . . . . . 63--93
Elias Dahlhaus and
Marek Karpinski Perfect matching for regular graphs is
AC$^0$-hard for the general matching
problem . . . . . . . . . . . . . . . . 94--102
Prabhakar Ragde Processor-time tradeoffs in PRAM
simulations . . . . . . . . . . . . . . 103--113
Satoshi Takahashi Self-similarity of linear cellular
automata . . . . . . . . . . . . . . . . 114--140
Ravinderpal Singh Sandhu Undecidability of safety for the
schematic protection model with cyclic
creates . . . . . . . . . . . . . . . . 141--159
Thomas Herbst Some remarks on a theorem of Sakarovitch 160--165
Paul Young Editor's foreword . . . . . . . . . . . 167--167
Wolfgang Maass and
Theodore A. Slaman The complexity types of computable sets 168--192
Shai Ben-David and
Benny Chor and
Oded Goldreich and
Michel Luby On the theory of average case complexity 193--219
Jack H. Lutz Almost everywhere high nonuniform
complexity . . . . . . . . . . . . . . . 220--258
Uriel Feige and
Adi Shamir Multi-oracle interactive protocols with
constant space verifiers . . . . . . . . 259--271
Johannes Kobler and
Uwe Sch\"\ing and
Seinosuke Toda and
Jacobo Torán Turing machines with few accepting
computations and low sets for PP . . . . 272--286
Steven Homer and
Alan L. Selman Oracles for structural properties: The
isomorphism problem and public-key
cryptography . . . . . . . . . . . . . . 287--301
Ernst W. Mayr and
Ashok Subramanian The complexity of circuit value and
network stability . . . . . . . . . . . 302--323
Tak Wah Lam and
Walter L. Ruzzo Results on communication complexity
classes . . . . . . . . . . . . . . . . 324--342
Ming Li and
Paul M. B. Vitányi Inductive reasoning and Kolmogorov
complexity . . . . . . . . . . . . . . . 343--384
Steven Lindell The invariant problem for binary string
structures and the parallel complexity
theory of queries . . . . . . . . . . . 385--410
A. Klapper Distributed event algebras . . . . . . . 411--424
Michael Kaminski and
Shlomit S. Pinter Finite automata on directed graphs . . . 425--446
Manuel Silva and
Tadao Murata B-fairness and structural B-fairness in
Petri net models of concurrent systems 447--477
David A. Mix Barrington and
Kevin Compton and
Howard Straubing and
Denis Thérien Regular languages in NC 1 . . . . . . . 478--499
Osamu Watanabe On polynomial time one-truth-table
reducibility to a sparse set . . . . . . 500--516
Anonymous Author index for volume 44 . . . . . . . 517--517
Xin Wang and
Edward K. Blum Discrete-time versus continuous-time
models of neural networks . . . . . . . 1--19
Eduardo D. Sontag Feedforward nets for interpolation and
classification . . . . . . . . . . . . . 20--48
Furio Honsell and
Simonetta Ronchi Della Rocca An approximation theorem for topological
lambda models and the topological
incompleteness of lambda calculus . . . 49--75
Marl Gyssens and
Dirk Van Gucht The powerset algebra as a natural tool
to handle nested database relations . . 76--103
Reuven Bar-Yehuda and
Oded Goldreich and
Alon Itai On the time-complexity of broadcast in
multi-hop radio networks: an exponential
gap between determinism and
randomization . . . . . . . . . . . . . 104--126
Iain A. Stewart Using the Hamiltonian path operator to
capture NP . . . . . . . . . . . . . . . 127--151
Christos H. Papadimitriou Editor's foreword . . . . . . . . . . . 153--153
Jean-Camille Birget Positional simulation of two-way
automata: Proof of a conjecture of R.
Kannan and generalizations . . . . . . . 154--179
Allan Borodin and
Walter L. Ruzzo and
Martin Tompat Lower bounds on the length of universal
traversal sequences . . . . . . . . . . 180--203
László Babai and
Noam Nisant and
Márió Szegedy Multiparty protocols, pseudorandom
generators for logspace, and time-space
trade-offs . . . . . . . . . . . . . . . 204--232
Tomás Feder A new fixed point approach for stable
networks and stable marriages . . . . . 233--284
Kenneth W. Regan Minimum-complexity pairing functions . . 285--295
Tak Lam and
Prasoon Tiwari and
Martin Tompa Trade-offs between communication and
space . . . . . . . . . . . . . . . . . 296--315
Pascal Weil Closure of varieties of languages under
products with counter . . . . . . . . . 316--339
Said Bettayeb and
Zevi Miller and
I. Hal Sudborough Embedding grids into hypercubes . . . . 340--366
Ian F. Carlstrom Foreground automata . . . . . . . . . . 367--384
Rod Downey Nondiamond theorems for polynomial time
reducibility . . . . . . . . . . . . . . 385--395
Daniel Krob Models of a K-rational identity system 396--434
Li-Yan Yuan and
Z. Meral Ozsoyoglu Design of desirable relational database
schemes . . . . . . . . . . . . . . . . 435--470
Zoran Obradovic and
Ian Parberry Computing with discrete multi-valued
neurons . . . . . . . . . . . . . . . . 471--492
U. Schmid and
J. Blieberger Some investigations on FCFS scheduling
in hard real time applications . . . . . 493--512
Anonymous Author index for volume 45 . . . . . . . 513--513
Rodney R. Howell and
Louis E. Rosier and
Hsu-Chun Yen Normal and sinkless petri nets . . . . . 1--26
Klaus Jansen The interconnection problem . . . . . . 27--38
Wojciech Ziarko Variable precision rough set model . . . 39--59
D. Janssens and
M. Lens and
G. Rozenberg Computation graphs for actor grammars 60--90
Toshimasa Watanabe and
Akira Nakamura A minimum $3$-connectivity augmentation
of a graph . . . . . . . . . . . . . . . 91--128
András Hajnal and
Wolfgang Maass and
Pavel Pudlák and
Márió Szegedy and
György Turán Threshold circuits of bounded depth . . 129--154
J. Dassow and
H. Jürgensen Deterministic soliton automata with at
most one cycle . . . . . . . . . . . . . 155--197
Santosh S. Venkatesh Directed drift: a new linear threshold
algorithm for learning binary weights
on-line . . . . . . . . . . . . . . . . 198--217
Bruno Courcelle and
Joost Engelfriet and
Grzegorz Rozenberg Handle-rewriting hypergraph grammars . . 218--270
Joëlle Cohen and
Dominique Perrin and
Jean-Eric Pin On the expressive power of temporal
logic . . . . . . . . . . . . . . . . . 271--294
Mitsunori Ogiwara and
Lane A. Hemachandra A complexity theory for feasible closure
properties . . . . . . . . . . . . . . . 295--325
S. S. Ravi and
Errol L. Lloyd Graph theoretic analysis of PLA folding
heuristics . . . . . . . . . . . . . . . 326--348
Judy Goldsmith and
Deborah Joseph and
Paul Young A note on bi-immunity and $p$-closeness
of $p$-cheatable sets in P/poly . . . . 349--362
Lane A. Hemachandra and
Albrecht Hoeno Collapsing degrees via strong
computation . . . . . . . . . . . . . . 363--380
Stephen L. Bloom and
Zoltán Ésik Matrix and matricial iteration theories,
Part I . . . . . . . . . . . . . . . . . 381--408
Stephen L. Bloom and
Zoltán Ésik Matrix and matricial iteration theories,
Part II . . . . . . . . . . . . . . . . 409--439
Anonymous Author index for volume 46 . . . . . . . 440--440
Ashok K. Chandra Editor's foreword . . . . . . . . . . . 1--1
Simona R. Cohen and
Ouri Wolfson Why a single parallelization strategy is
not enough in knowledge bases . . . . . 2--44
Theodore Johnson and
Dennis Shasha B-trees with inserts and deletes: Why
free-at-empty is better than
merge-at-half . . . . . . . . . . . . . 45--76
Michael Kifer and
James Wu A logic for programming with complex
objects . . . . . . . . . . . . . . . . 77--120
Richard Hull and
Jianwen Su Algebraic and calculus query languages
for recursively typed complex objects 121--156
William E. Weihl The impact of recovery on concurrency
control . . . . . . . . . . . . . . . . 157--184
Allen Van Gelder The alternating fixpoint of logic
programs with negation . . . . . . . . . 185--221
Raghu Ramakrishnan and
Yehoshua Sagiv and
Jeffrey D. Ullman and
Moshe Y. Vardi Logical query optimization by proof-tree
transformation . . . . . . . . . . . . . 222--248
Dexter Kozen Editor's foreword . . . . . . . . . . . 249--249
Michael Luby Removing randomness in parallel
computation without a processor penalty 250--286
David McAllester and
Prakash Panangaden and
Vasant Shanbhogue Nonexpressibility of fairness and
signaling . . . . . . . . . . . . . . . 287--321
László Lovasz and
Michael Saks Communication complexity and
combinatorial lattice theory . . . . . . 322--349
János Komlós and
Ramamohan Paturi Effect of connectivity in an associative
memory model . . . . . . . . . . . . . . 350--373
Harold N. Gabow Editor's Foreword . . . . . . . . . . . 375--375
J. Håstad and
A. W. Schrift and
A. Shamir The discrete logarithm modulo a
composite hides $ 0 (n) $ Bits . . . . . 376--404
Mario Szegedy Functions with bounded symmetric
communication complexity, programs over
commutative monoids, and ACC . . . . . . 405--423
Michael L. Fredman and
Dan E. Willard Surpassing the information theoretic
bound with fusion trees . . . . . . . . 424--436
Ketan Mulmuley Output sensitive and dynamic
constructions of higher order Voronoi
diagrams and levels in arrangements . . 437--458
Ming-Yang Kao and
Philip N. Klein Towards overcoming the
transitive-closure bottleneck: Efficient
parallel algorithms for planar digraphs 459--500
Robert Cypher and
C. Greg Plaxton Deterministic sorting in nearly
logarithmic time on the hypercube and
related computers . . . . . . . . . . . 501--548
Manuel Blum and
Michael Luby and
Ronitt Rubinfeld Self-testing/correcting with
applications to numerical problems . . . 549--595
Anonymous Author index for volume 47 . . . . . . . 596--596
Anonymous Editorial Board . . . . . . . . . . . . i--i
Mihály Geréb-Graus and
Ming Li Three one-way heads cannot do string
matching . . . . . . . . . . . . . . . . 1--8
Stephen J. Hegner Unique complements and decompositions of
database schemata . . . . . . . . . . . 9--57
Joost Engelfriet and
Linda Heyker Hypergraph languages of bounded degree 58--89
Guy E. Blelloch and
James J. Little Parallel solutions to geometric problems
in the scan model of computation . . . . 90--115
Stephen A. Fenner and
Lance J. Fortnow and
Stuart A. Kurtz Gap-definable counting classes . . . . . 116--148
Jarkko Kari Reversibility and surjectivity problems
of cellular automata . . . . . . . . . . 149--182
Jin-yi Cai and
Anne Condon and
Richard J. Lipton PSPACE is provable by two provers in one
round . . . . . . . . . . . . . . . . . 183--193
Noga Alon and
Pavel Pudlak Superconcentrators of depths 2 and 3;
odd levels help (rarely) . . . . . . . . 194--202
Leong Kwan Li Learning fixed point patterns by
recurrent networks . . . . . . . . . . . 203--213
Omer Berkman and
Uzi Vishkin Finding level-ancestors in trees . . . . 214--230
Martin Dietzfelbinger and
Miroslaw Kutylowski and
Rüdiger Reischuk Exact lower time bounds for computing
Boolean functions on CREW PRAMs . . . . 231--254
Marco Cadoli and
Maurizio Lenzerini The complexity of propositional closed
world reasoning and circumscription . . 255--310
Gyora M. Benedek and
Alon Itai Nonuniform learnability . . . . . . . . 311--323
Steven Homer and
Luc Longpré On reductions of NP sets to sparse sets 324--336
D. R. Stinson Combinatorial Techniques for Universal
Hashing . . . . . . . . . . . . . . . . 337--346
Kai-Yeung Siu and
Amir Dembo and
Thomas Kailath On the perceptron learning algorithm on
data with high precision . . . . . . . . 347--356
Alan L. Selman A taxonomy of complexity classes of
functions . . . . . . . . . . . . . . . 357--381
Mihalis Yannakakis Editor's foreword . . . . . . . . . . . 383--383
Marshall Bern and
David Eppstein and
John Gilbert Provably good mesh generation . . . . . 384--409
Amos Fiat and
Yuval Rabani and
Yiftach Ravid Competitive $k$-server algorithms . . . 410--428
C. Andrew Neff Specified precision polynomial root
isolation is in NC . . . . . . . . . . . 429--463
Michael J. Kearns and
Robert E. Schapire Efficient distribution-free learning of
probabilistic concepts . . . . . . . . . 464--497
Christos H. Papadimitriou On the complexity of the parity argument
and other inefficient proofs of
existence . . . . . . . . . . . . . . . 498--532
Michael L. Fredman and
Dan E. Willard Trans-dichotomous algorithms for minimum
spanning trees and shortest paths . . . 533--551
Anonymous Author index for volume 48 . . . . . . . 552--552
Anonymous Editorial Board . . . . . . . . . . . . i--i
Seinosuke Toda Simple characterizations of P(#P) and
complete problems . . . . . . . . . . . 1--17
Tadakazu Sato Group structured linear cellular
automata over $ \mathbb {Z} m $ . . . . 18--23
Richard Chang and
Benny Chor and
Oded Goldreich and
Juris Hartmanis and
Johan Håstad and
Desh Ranjan and
Pankaj Rohatgi The random oracle hypothesis is false 24--39
Takashi Hattori Time-extraction for temporal logic-logic
programming and local process time . . . 40--56
Egon Wanke The complexity of connectivity problems
on context-free graph languages . . . . 57--82
Nicholas Pippenger Symmetry in self-correcting cellular
automata . . . . . . . . . . . . . . . . 83--95
Sanjay Jain and
Arun Sharma Characterizing language identification
by standardizing operations . . . . . . 96--107
Vijay Raghavan Bounded degree graph inference from
walks . . . . . . . . . . . . . . . . . 108--132
E. Fachini and
A. Monti A kleene-like characterization of
languages accepted by systolic tree
automata . . . . . . . . . . . . . . . . 133--147
Noam Nisan and
Avi Wigderson Hardness vs randomness . . . . . . . . . 149--167
Taishin Nishida and
Youichi Kobuchi Invariant sets for substitution . . . . 168--174
Narayanan Krishnakumar On computing serial dependency relations 175--188
John Case and
Sanjay Jain and
Arun Sharma Vacillatory learning of nearly minimal
size grammars . . . . . . . . . . . . . 189--207
Amihood Amir and
Martin Farach and
Zvi Galil and
Raffaele Giancarlo and
Kunsoo Park Dynamic dictionary matching . . . . . . 208--222
Michael Kaminski A branching time logic with past
operators . . . . . . . . . . . . . . . 223--246
Mauricio Karchmer and
Ilan Newman and
Mike Saks and
Avi Wigderson Non-deterministic communication
complexity with few witnesses . . . . . 247--257
Joost Engelfriet and
Heiko Vogler The translation power of top-down
tree-to-graph transducers . . . . . . . 258--305
Dexter Kozen and
Jens Palsberg and
Michael I. Schwartzbach Efficient inference of partial types . . 306--324
Vitit Kantabutra A linear-time near-optimum-length
triangulation algorithm for convex
polygons . . . . . . . . . . . . . . . . 325--333
Jia-Huai You and
Li Yan Yuan A three-valued semantics for deductive
databases and logic programs . . . . . . 334--361
Kai Salomaa and
Sheng Yu Measures of nondeterminism for pushdown
automata . . . . . . . . . . . . . . . . 362--374
Zoran Obradovi\'c and
Ian Parberry Learning with discrete multivalued
neurons . . . . . . . . . . . . . . . . 375--390
Kokichi Sugihara Robust gift wrapping for the
three-dimensional convex hull . . . . . 391--407
Leslie Ann Goldberg Listing graphs that satisfy first-order
sentences . . . . . . . . . . . . . . . 408--424
Zvi Galil Editor's foreword . . . . . . . . . . . 425--425
Ketan Mulmuley An efficient algorithm for hidden
surface removal, II . . . . . . . . . . 427--453
Bonnie Berger and
John Rompel and
Peter W. Shor Efficient NC algorithms for set cover
with applications to learning and
geometry . . . . . . . . . . . . . . . . 454--477
Rajeev Motwani and
Joseph (Seffi) Naor and
Moni Naor The probabilistic method yields
deterministic parallel algorithms . . . 478--516
Vijaya Ramachandran and
John Reif Planarity testing in parallel . . . . . 517--561
Miklos Ajtai and
Yuri Gurevich Datalog vs first-order logic . . . . . . 562--588
Mark Fulk and
Sanjay Jain and
Daniel N. Osherson Open problems in ``systems that learn'' 589--604
Jin-yi Cai and
Juris Hartmanis On Hausdorff and topological dimensions
of the Kolmogorov complexity of the real
line . . . . . . . . . . . . . . . . . . 605--619
Zhenyu Qian Another look at parameterization for
order-sorted algebraic specifications 620--666
Joan Boyar and
Kim S. Larsen Efficient rebalancing of chromatic
search trees . . . . . . . . . . . . . . 667--682
Mark Levene and
George Loizou The nested universal relation data model 683--717
Bruno Durand The surjectivity problem for 2D cellular
automata . . . . . . . . . . . . . . . . 718--725
Minoru Ito and
Grant E. Weddell Implication problems for functional
constraints on databases supporting
complex objects . . . . . . . . . . . . 726--768
Michael R. Fellows and
Michael A. Langston On search, decision, and the efficiency
of polynomial-time algorithms . . . . . 769--779
Anonymous Author index for volume 49 . . . . . . . 780--781
K. Kalpakis and
Y. Yesha On the Power of the Linear Array
Architecture for Performing
Tree-Structured Computations . . . . . . 1--10
J. Karhumaki and
W. Plandowski and
W. Rytter Polynomial Size Test Sets For
Context-Free Languages . . . . . . . . . 11--19
S. A. Goldman and
M. J. Kearns On the Complexity of Teaching . . . . . 20--31
A. Blum and
L. Hellerstein and
N. Littlestone Learning in the Presence of Finitely or
Infinitely Many Irrelevant Attributes 32--40
E. Kinber and
C. H. Smith and
M. Velauthapillai and
R. Wiehagen On Learning Multiple Concepts in
Parallel . . . . . . . . . . . . . . . . 41--52
T. Jiang and
A. Salomaa and
K. Salomaa and
S. Yu Decision Problems for Patterns . . . . . 53--63
I. Parberry Load Sharing with Parallel Priority
Queues . . . . . . . . . . . . . . . . . 64--73
J. Halpern and
B. Awerbuch and
M. Benor and
A. Chandra and
J. Feigenbaum and
J. Vonzurgathen and
L. Guibas and
L. Pitt and
M. Saks and
D. Shmoys and
D. Sleator and
E. Upfal and
U. Vazirani and
A. Yao Editors' Foreword . . . . . . . . . . . 189--189
R. Beigel and
N. Reingold and
D. Spielman PP Is Closed under Intersection . . . . 191--202
J. Matousek Approximations and Optimal Geometric
Divide-and-Conquer . . . . . . . . . . . 203--208
M. Yannakakis and
D. Lee Testing Finite State Machines: Fault
Detection . . . . . . . . . . . . . . . 209--227
T. Leighton and
F. Makedon and
S. Plotkin and
C. Stein and
E. Tardos and
S. Tragoudas Fast Approximation Algorithms for
Multicommodity Flow Problems . . . . . . 228--243
A. Borodin and
S. Irani and
P. Raghavan and
B. Schieber Competitive Paging with Locality of
Reference . . . . . . . . . . . . . . . 244--258
H. N. Gabow A Matroid Approach to Finding Edge
Connectivity and Packing Arborescences 259--273
E. Kaltofen Effective Noether Irreducibility Forms
and Applications . . . . . . . . . . . . 274--295
L. Babai and
G. Cooperman and
L. Finkelstein and
E. Luks and
A. Seress Fast Monte Carlo Algorithms for
Permutation Groups . . . . . . . . . . . 296--308
S. Abiteboul and
V. Vianu Computing with First-Order Logic . . . . 309--335
Dana Angluin and
Michael Kharitonov When Won't Membership Queries Help? . . 336--355
N. Immerman Editor's Foreword . . . . . . . . . . . 357--357
R. Chang and
J. Kadin and
P. Rohatgi On Unique Satisfiability and the
Threshold Behavior of Randomized
Reductions . . . . . . . . . . . . . . . 359--373
D. A. M. Barrington and
H. Straubing Superlinear Lower Bounds for
Bounded-Width Branching Programs . . . . 374--381
D. P. Bovet and
P. Crescenzi and
R. Silvestri Complexity Classes and Sparse Oracles 382--390
P. G. Kolaitis and
M. N. Thakur Approximation Properties of NP
Minimization Classes . . . . . . . . . . 391--411
S. Gupta Closure Properties and Witness Reduction 412--432
M. Grigni and
M. Sipser Monotone Separation of Logarithmic Space
from Logarithmic Depth . . . . . . . . . 433--437
T. Long Editor's Foreword . . . . . . . . . . . 439--439
M. Beaudry and
P. Mckenzie Circuits, Matrices, and Nonassociative
Computation . . . . . . . . . . . . . . 441--455
F. Green and
J. Kobler and
K. W. Regan and
T. Schwentick and
J. Toran The Power of the Middle Bit of a #P
Function . . . . . . . . . . . . . . . . 456--467
R. Gavalda Bounding the Complexity of Advice
Functions . . . . . . . . . . . . . . . 468--475
P. Rohatgi Saving Queries with Randomness . . . . . 476--492
S. Saluja and
K. V. Subrahmanyam and
M. N. Thakur Descriptive Complexity of #P Functions 493--505
A. Condon and
R. Ladner Interactive Proof Systems with
Polynomially Bounded Strategies . . . . 506--518
M. Li Editor's Foreword . . . . . . . . . . . 519--519
N. H. Bshouty and
T. R. Hancock and
L. Hellerstein Learning Boolean Read-Once Formulas over
Generalized Bases . . . . . . . . . . . 521--542
Y. Mansour An $ O(n^{\log \log n}) $ Learning
Algorithm for DNF under the Uniform
Distribution . . . . . . . . . . . . . . 543--550
D. P. Helmbold and
M. K. Warmuth On Weak Learning . . . . . . . . . . . . 551--573
R. Daley and
B. Kalyansundaram and
M. Velauthapillai Breaking the Probability 12 Barrier in
FIN-Type Learning . . . . . . . . . . . 574--599
M. Kharitonov Cryptographic Lower Bounds for
Learnability of Boolean Functions on the
Uniform Distribution . . . . . . . . . . 600--610
Anonymous Author Index for Volume 50 . . . . . . . 611--611
Y. Sagiv Editor's Foreword . . . . . . . . . . . 1--1
F. Kabanza and
J. M. Stevenne and
P. Wolper Handling Infinite Temporal Data . . . . 3--17
R. J. Lipton and
J. F. Naughton Query Size Estimation by Adaptive
Sampling . . . . . . . . . . . . . . . . 18--25
P. C. Kanellakis and
G. M. Kuper and
P. Z. Revesz Constraint Query Languages . . . . . . . 26--52
D. Agrawal and
A. Elabbadi Constrained Shared Locks for Increasing
Concurrency in Databases . . . . . . . . 53--63
J. S. Schlipf The Expressive Powers of the Logic
Programming Semantics . . . . . . . . . 64--86
Y. P. Saraiya On the Efficiency of Transforming
Database Logic Programs . . . . . . . . 87--109
P. G. Kolaitis and
M. Y. Vardi On the Expressive Power of Datalog:
Tools and a Case Study . . . . . . . . . 110--134
A. O. Mendelzon Editor's Foreword . . . . . . . . . . . 135--135
S. Seshadri and
J. F. Naughton On the Expected Size of Recursive
Datalog Queries . . . . . . . . . . . . 137--148
S. Grumbach and
V. Vianu Tractable Query Languages for Complex
Object Databases . . . . . . . . . . . . 149--167
D. B. Johnson and
L. Raab A Tight Upper Bound on the Benefits of
Replica Control Protocols . . . . . . . 168--176
F. Afrati and
S. S. Cosmadakis and
M. Yannakakis On Datalog vs Polynomial Time . . . . . 177--196
R. Helm and
K. Marriott and
M. Odersky Spatial Query Optimization: From Boolean
Constraints to Range Queries . . . . . . 197--210
H. Garciamolina and
K. Salem Non-deterministic Queue Operations . . . 211--222
C. Beeri and
T. Milo Subtyping in OODBs . . . . . . . . . . . 223--243
S. Ganguly and
S. Greco and
C. Zaniolo Extrema Predicates in Deductive
Databases . . . . . . . . . . . . . . . 244--259
T. Feder and
R. Motwani Clique Partitions, Graph Compression and
Speeding-Up Algorithms . . . . . . . . . 261--272
G. Baliga and
J. Case and
S. Jain Language Learning with Some Negative
Information . . . . . . . . . . . . . . 273--285
R. Cole and
O. Zajicek The Expected Advantage of Asynchrony . . 286--300
H. H. Ali and
H. Elrewini An Optimal Algorithm for Scheduling
Interval Ordered Tasks with
Communication on $ N $ Processors . . . 301--306
V. Grolmusz Separating the Communication
Complexities of MOD $m$ and MOD $p$
Circuits . . . . . . . . . . . . . . . . 307--313
J. Desel and
J. Esparza Shortest Paths in Reachability Graphs 314--323
F. Blanchetsadri Some Logical Characterizations of the
Dot-Depth Hierarchy and Applications . . 324--337
W. Maass Editor's Foreword . . . . . . . . . . . 339--339
Y. Bartal and
A. Fiat and
Y. Rabani Competitive Algorithms for Distributed
Data Management . . . . . . . . . . . . 341--358
Y. Bartal and
A. Fiat and
H. Karloff and
R. Vohra New Algorithms for an Ancient Scheduling
Problem . . . . . . . . . . . . . . . . 359--366
A. Blum and
S. Rudich Fast Learning of $k$-Term DNF Formulas
with Queries . . . . . . . . . . . . . . 367--373
M. T. Goodrich Planar Separators and Parallel Polygon
Triangulation . . . . . . . . . . . . . 374--389
J. Kahn and
J. H. Kim Entropy and Sorting . . . . . . . . . . 390--399
R. Seidel On the All-Pairs-Shortest-Path Problem
in Unweighted Undirected Graphs . . . . 400--403
T. Imielinski and
R. Vandermeyden and
K. V. Vadaparty Complexity Tailored Design: a New Design
Methodology for Databases With
Incomplete Information . . . . . . . . . 405--432
S. Abiteboul and
P. Kanellakis and
S. Ramaswamy and
E. Waller Method Schemas . . . . . . . . . . . . . 433--455
C. Seo and
J. Lim and
H. C. Eun On Comparison and Analysis of Algorithms
for Multiplication in GF$ (2^m) $ . . . 456--459
J. Adamek and
E. Nelson and
J. Reiterman Continuous Algebras Revisited . . . . . 460--471
K. Skodinis and
E. Wanke Emptiness Problems of eNCE Graph
Languages . . . . . . . . . . . . . . . 472--485
C. R. Vela and
A. Bahamonde The Best Nondeterministic
Representations of Finite Orderings . . 486--494
Y. Benasher and
I. Newman Decision Trees with Boolean Threshold
Queries . . . . . . . . . . . . . . . . 495--502
T. Asano An $ O(n \log \log n) $ Time Algorithm
for Constructing a Graph of Maximum
Connectivity with Prescribed Degrees . . 503--510
N. Creignou A Dichotomy Theorem for Maximum
Generalized Satisfiability Problems . . 511--522
J. Chomicki and
D. Niwinski On the Feasibility of Checking Temporal
Integrity Constraints . . . . . . . . . 523--535
Anonymous Author Index for Volume 51 . . . . . . . 536--536
Michael T. Goodrich and
Chee Yap Editors' Foreword . . . . . . . . . . . 1--1
David Eppstein and
Zvi Galil and
Giuseppe F. Italiano and
Thomas H. Spencer Separator Based Sparsification: I.
Planarity Testing and Minimum Spanning
Trees . . . . . . . . . . . . . . . . . 3--27
Brenda S. Baker Parameterized Pattern Matching:
Algorithms and Applications . . . . . . 28--42
Noam Nisan and
David Zuckerman Randomness is Linear in Space . . . . . 43--52
Nicholas Pippenger Self-routing superconcentrators . . . . 53--60
Alessandra Cherubini and
Pierluigi San Pietro A Polynomial-Time Parsing Algorithm for
$K$-Depth Languages . . . . . . . . . . 61--79
Tsong Yueh Chen On the Structural Properties of the Set
of Fixpoints for Nondeterministic
Recursive Definitions . . . . . . . . . 80--86
Han La Poutré Lower Bounds for the Union-Find and the
Split-Find Problem on Pointer Machines 87--99
Ravi Krishnamurthy and
Raghu Ramakrishnan and
Oded Shmueli A Framework for Testing Safety and
Effective Computability . . . . . . . . 100--124
Leonid Libkin and
Limsoon Wong Semantic Representations and Query
Languages for Or-Sets . . . . . . . . . 125--142
Egidio Astesiano and
Elena Zucca A Free Construction of Dynamic Terms . . 143--156
Dan E. Willard Applications of Range Query Theory to
Relational Data Base Join and Selection
Operations . . . . . . . . . . . . . . . 157--169
Andrzej Ehrenfeucht and
Joost Engelfriet and
Grzegorz Rozenberg Finite Languages for the Representation
of Finite Graphs . . . . . . . . . . . . 170--184
Juha Honkala On Parikh Slender Languages and Power
Series . . . . . . . . . . . . . . . . . 185--190
Lance Fortnow and
Tomoyuki Yamakami Generic Separations . . . . . . . . . . 191--197
Wolfgang Maass Editor's Foreword . . . . . . . . . . . 199--199
Robert E. Schapire and
Linda M. Sellie Learning Sparse Multivariate Polynomials
over a Field with Queries and
Counterexamples . . . . . . . . . . . . 201--213
Martin Kummer and
Frank Stephan On the Structure of Degrees of
Inferability . . . . . . . . . . . . . . 214--238
Hans Ulrich Simon General Bounds on the Number of Examples
Needed for Learning Probabilistic
Concepts . . . . . . . . . . . . . . . . 239--254
Sally A. Goldman and
H. David Mathias Teaching a Smarter Learner . . . . . . . 255--267
Nader H. Bshouty and
Sally A. Goldman and
Thomas R. Hancock and
Sleiman Matar Asking Questions to Minimize Errors . . 268--286
Ajay D. Kshemkalyani Temporal Interactions of Intervals in
Distributed Systems . . . . . . . . . . 287--298
Amihood Amir and
Gary Benson and
Martin Farach Let Sleeping Files Lie: Pattern Matching
in Z-Compressed Files . . . . . . . . . 299--307
Rainer Schuler and
Tomoyuki Yamakami Structural Average Case Complexity . . . 308--327
Vijay K. Vaishnavi On $k$-Dimensional Balanced Binary Trees 328--348
Gavin J. Gibson Exact Classification with Two-Layer
Neural Nets . . . . . . . . . . . . . . 349--356
Marc Andries and
Jan Paredaens On Instance-Completeness for Database
Query Languages involving Object
Creation . . . . . . . . . . . . . . . . 357--373
Shao C. Fang and
Santosh S. Venkatesh Learning Binary Perceptrons Perfectly
Efficiently . . . . . . . . . . . . . . 374--389
William Gasarch and
Ming Li Editors' Foreword . . . . . . . . . . . 391--391
Sanjay Jain and
Arun Sharma The Intrinsic Complexity of Language
Identification . . . . . . . . . . . . . 393--402
Martin Kummer and
Frank Stephan Inclusion Problems in Parallel Learning
and Games . . . . . . . . . . . . . . . 403--420
Nader H. Bshouty and
Richard Cleve and
Ricard Gavald\`a and
Sampath Kannan and
Christino Tamon Oracles and Queries That Are Sufficient
for Exact Learning . . . . . . . . . . . 421--433
Peter L. Bartlett and
Philip M. Long and
Robert C. Williamson Fat-Shattering and the Learnability of
Real-Valued Functions . . . . . . . . . 434--452
David P. Dobkin and
Dimitrios Gunopulos and
Wolfgang Maass Computing the Maximum Bichromatic
Discrepancy, with Applications to
Computer Graphics and Machine Learning 453--470
Michael Frazier and
Sally Goldman and
Nina Mishra and
Leonard Pitt Learning from a Consistently Ignorant
Teacher . . . . . . . . . . . . . . . . 471--492
Catriel Beeri Editor's Foreword . . . . . . . . . . . 493--493
Limsoon Wong Normal Forms and Conservative Extension
Properties for Query Languages over
Collection Types . . . . . . . . . . . . 495--505
Shinichi Morishita An Extension of Van Gelder's Alternating
Fixpoint to Magic Programs . . . . . . . 506--521
Tirza Hirst and
David Harel Completeness Results for Recursive Data
Bases . . . . . . . . . . . . . . . . . 522--536
Jan Van den Bussche and
Dirk van Gucht and
Gottfried Vossen Reflective Programming in the Relational
Algebra . . . . . . . . . . . . . . . . 537--549
Peter J. Haas and
Jeffrey F. Naughton and
S. Seshadri and
Arun N. Swami Selectivity and Cost Estimation for
Joins Based on Random Sampling . . . . . 550--569
Stéphane Grumbach and
Tova Milo Towards Tractable Algebras for Bags . . 570--588
Paris Kanellakis and
Sridhar Ramaswamy and
Darren E. Vengroff and
Jeffrey Scott Vitter Indexing for Data Models with
Constraints and Classes . . . . . . . . 589--612
Anonymous Author Index for Volume 52 . . . . . . . 613--613
Narayan Vikas An $ O(n) $ Algorithm for Abelian
$p$-Group Isomorphism and an $ O(n \log
n)$ Algorithm for Abelian Group
Isomorphism . . . . . . . . . . . . . . 1--9
Jeffrey Shallit and
Yuri Breitbart Automaticity I: Properties of a Measure
of Descriptional Complexity . . . . . . 10--25
Ganesh Baliga and
John Case Learnability: Admissible, Co-Finite, and
Hypersimple Languages . . . . . . . . . 26--32
Frank Drewes Language Theoretic and Algorithmic
Properties of $d$-dimensional Collages
and Patterns in a Grid . . . . . . . . . 33--60
Shlomo Moran and
Gadi Taubenfeld and
Irit Yadin Concurrent Counting . . . . . . . . . . 61--78
Detlef Sieling New Lower Bounds and Hierarchy Results
for Restricted Branching Programs . . . 79--87
Steffen Lange and
Thomas Zeugmann Incremental Learning from Positive Data 88--103
Faith E. Fich and
Russell Impagliazzo and
Bruce Kapron and
Valerie King and
Miroslaw Kutylowski Limits on the Power of Parallel Random
Access Machines with Weak Forms of Write
Conflict Resolution . . . . . . . . . . 104--111
Feng Gao Towards Structured Parallel Computing on
Architecture-Independent Parallel
Algorithm Design for Distributed-Memory
Architectures . . . . . . . . . . . . . 112--128
Harold N. Gabow and
Ying Xu Efficient Theoretic and Practical
Algorithms for Linear Matroid
Intersection Problems . . . . . . . . . 129--147
Paul F. Dietz A Space Efficient Variant of Path
Copying for Partially Persistent Sorted
Sets . . . . . . . . . . . . . . . . . . 148--152
Steven Homer Editor's Foreword . . . . . . . . . . . 153--153
Manindra Agrawal and
Somenath Biswas Polynomial-Time Isomorphism of $ 1 - L
$-Complete Sets . . . . . . . . . . . . 155--160
Christos H. Papadimitriou and
Mihalis Yannakakis On Limited Nondeterminism and the
Complexity of the V--C Dimension . . . . 161--170
Mitsunori Ogihara and
Thomas Thierauf and
Seinosuke Toda and
Osamu Watanabe On Closure Properties of $ \# P $ in the
Context of $ P F \cdot \# P $ . . . . . 171--179
Tirza Hirst and
David Harel Taking It to the Limit: On Infinite
Variants of NP-Complete Problems . . . . 180--193
Edith Hemaspaandra and
Ashish V. Naik and
Mitsunori Ogihara and
Alan L. Selman P-Selective Sets and Reducing Search to
Decision vs Self-Reducibility . . . . . 194--209
Harry Buhrman and
Leen Torenvliet P-Selective Self-Reducible Sets: a New
Characterization of P . . . . . . . . . 210--217
Patrick W. Dymond and
Faith E. Fich and
Naomi Nishimura and
Prabhakar Ragde and
Walter L. Ruzzo Pointers versus Arithmetic in PRAMs . . 218--232
Uwe Schöning Editor's Foreword: Special Issue on the
9th Annual Structure in Complexity
Theory Conference in Amsterdam, June
28--July 1, 1994 . . . . . . . . . . . . 233--233
Steven M. Kautz and
Peter Bro Miltersen Relative to a Random Oracle, NP Is Not
Small . . . . . . . . . . . . . . . . . 235--250
Gábor Tardos Multi-prover Encoding Schemes and
Three-prover Proof Systems . . . . . . . 251--260
Harry Buhrman and
Pekka Orponen Random Strings Make Hard Instances . . . 261--266
Manindra Agrawal On the Isomorphism Conjecture for Weak
Reducibilities . . . . . . . . . . . . . 267--282
Kevin J. Compton and
Erich Grädel Logical Definability of Counting
Functions . . . . . . . . . . . . . . . 283--297
Richard Chang On the Query Complexity of Clique Size
and Maximum Satisfiability . . . . . . . 298--313
Anonymous Editors' Foreword . . . . . . . . . . . 315--315
Michael Mitzenmacher Bounds on the Greedy Routing Algorithm
for Array Networks . . . . . . . . . . . 317--327
Eric J. Schwabe and
Ian M. Sutherland Improved Parity-Declustered Layouts for
Disk Arrays . . . . . . . . . . . . . . 328--343
Margaret Reid-Miller List Ranking and List Scan on the Cray
C90 . . . . . . . . . . . . . . . . . . 344--356
Bhaskar Ghosh and
S. Muthukrishnan Dynamic Load Balancing by Random
Matchings . . . . . . . . . . . . . . . 357--370
Hisao Tamaki Construction of the Mesh and the Torus
Tolerating a Large Number of Faults . . 371--379
M. Leoncini On the Parallel Complexity of Gaussian
Elimination with Pivoting . . . . . . . 380--394
Shay Halperin and
Uri Zwick An Optimal Randomised Logarithmic Time
Connectivity Algorithm for the EREW PRAM 395--416
Phillip B. Gibbons and
Yossi Matias and
Vijaya Ramachandran Efficient Low-Contention Parallel
Algorithms . . . . . . . . . . . . . . . 417--442
Carlo Meghini and
Costantino Thanos An Optimal Predicate Locking Scheduler 443--468
Andreas Goerdt A Threshold for Unsatisfiability . . . . 469--486
Lila Kari and
Gabriel Thierrin Maximal and Minimal Solutions to
Language Equations . . . . . . . . . . . 487--496
Thomas Eiter and
Georg Gottlob The Complexity of Nested Counterfactuals
and Iterated Knowledge Base Revisions 497--512
Tao Jiang and
Ming Li $k$ One-Way Heads Cannot Do
String-Matching . . . . . . . . . . . . 513--524
Jean R. S. Blair and
Errol L. Lloyd River Routing with a Generalized Model 525--544
Suresh Chari and
Pankaj Rohatgi On Completeness under Random Reductions 545--555
Joost Engelfriet and
Vincent van Oostrom Regular Description of Context-free
Graph Languages . . . . . . . . . . . . 556--574
Jerzy W. Grzymala-Busse and
Soe Than Partition Triples: a Tool for Reduction
of Data Sets . . . . . . . . . . . . . . 575--582
Sanjay Jain Program Synthesis in the Presence of
Infinite Number of Inaccuracies . . . . 583--591
Anonymous Author Index for Volume 53 . . . . . . . 592--592
Ronald Fagin Editor's Foreword . . . . . . . . . . . 1--1
Catriel Beeri and
Tova Milo Comparison of Functional and Predicative
Query Paradigms . . . . . . . . . . . . 3--33
Jan Van den Bussche and
Dirk Van Gucht A Semideterministic Approach to Object
Creation and Nondeterminism in Database
Queries . . . . . . . . . . . . . . . . 34--47
Christos H. Papadimitriou and
Mihalis Yannakakis Tie-Breaking Semantics and Structural
Totality . . . . . . . . . . . . . . . . 48--60
Surajit Chaudhuri and
Moshe Y. Vardi On the Equivalence of Recursive and
Nonrecursive Datalog Programs . . . . . 61--78
Kenneth A. Ross and
Yehoshua Sagiv Monotonic Aggregation in Deductive
Databases . . . . . . . . . . . . . . . 79--97
Gösta Grahne and
Alberto O. Mendelzon and
Peter Z. Revesz Knowledgebase Transformations . . . . . 98--112
Ron van der Meyden The Complexity of Querying Indefinite
Data about Linearly Ordered Domains . . 113--135
Anthony J. Bonner and
Tomasz Imielinski Reusing and Modifying Rulebases by
Predicate Substitution . . . . . . . . . 136--166
Wolfgang Maass Editor's Foreword . . . . . . . . . . . 167--167
Marek Karpinski and
Angus Macintyre Polynomial Bounds for VC Dimension of
Sigmoidal and General Pfaffian Neural
Networks . . . . . . . . . . . . . . . . 169--176
Pascal Koiran A Weak Version of the Blum, Shub, and
Smale Model . . . . . . . . . . . . . . 177--189
Pascal Koiran and
Eduardo D. Sontag Neural Networks with Quadratic VC
Dimension . . . . . . . . . . . . . . . 190--198
György Turán and
Farrokh Vatan On the Computation of Boolean Functions
by Analog Circuits of Bounded Fan-In . . 199--212
Michael Sipser Editor's Foreword . . . . . . . . . . . 213--213
Dror Lapidot and
Adi Shamir Fully Parallelized Multi-prover
Protocols for NEXP-Time . . . . . . . . 215--220
Jaikumar Radhakrishnan Better Lower Bounds for Monotone
Threshold Formulas . . . . . . . . . . . 221--226
Donald B. Johnson and
Panagiotis Metaxas Connected Components in $ O(\log^{3 / 2}
n) $ Parallel Time for the CREW PRAM . . 227--242
Zvi Galil and
Oded Margalit All Pairs Shortest Paths for Graphs with
Small Integer Length Edges . . . . . . . 243--254
Noga Alon and
Zvi Galil and
Oded Margalit On the Exponent of the All Pairs
Shortest Path Problem . . . . . . . . . 255--262
David Epstein Editor's Foreword . . . . . . . . . . . 263--263
Tom Leighton and
Yuan Ma and
C. Greg Plaxton Breaking the $ \Theta (n \log^2 n) $
Barrier for Sorting with Faults . . . . 265--304
Uriel Feige A Spectrum of Time-Space Trade-offs for
Undirected $s$--$t$ Connectivity . . . . 305--316
Sanjeev Arora and
László Babai and
Jacques Stern and
Z. Sweedyk The Hardness of Approximate Optima in
Lattices, Codes, and Systems of Linear
Equations . . . . . . . . . . . . . . . 317--331
Charles E. Leiserson and
Satish Rao and
Sivan Toledo Efficient Out-of-Core Algorithms for
Linear Relaxation Using Blocking Covers 332--344
Amir M. Ben-Amram and
Zvi Galil When Can We Sort in $ o(n \log n) $
Time? . . . . . . . . . . . . . . . . . 345--370
Avrim L. Blum and
Ravindran Kannan Learning an Intersection of a Constant
Number of Halfspaces over a Uniform
Distribution . . . . . . . . . . . . . . 371--380
Eric Allender Editor's Foreword . . . . . . . . . . . 381--381
Manindra Agrawal DSPACE($n$) $ = ?$ NSPACE($n$): a Degree
Theoretic Characterization . . . . . . . 383--392
Harry Buhrman and
Elvira Mayordomo An Excursion to the Kolmogorov Random
Strings . . . . . . . . . . . . . . . . 393--399
Kousha Etessami Counting Quantifiers, Successor
Relations, and Logarithmic Space . . . . 400--411
John Rogers The Isomorphism Conjecture Holds and
One-Way Functions Exist Relative to an
Oracle . . . . . . . . . . . . . . . . . 412--423
James S. Royer Semantics vs Syntax vs Computations:
Machine Models for Type-2
Polynomial-Time Bounded Functionals . . 424--436
Nicholas Tran On P-Immunity of Exponential Time
Complete Sets . . . . . . . . . . . . . 437--440
Domenico Sacc\`a The Expressive Powers of Stable Models
for Bound and Unbound DATALOG Queries 441--464
Liming Cai and
Jianer Chen On Fixed-Parameter Tractability and
Approximability of NP Optimization
Problems . . . . . . . . . . . . . . . . 465--474
Yosi Ben-Asher and
Ilan Newman Geometric Approach for Optimal Routing
on a Mesh with Buses . . . . . . . . . . 475--486
H. David Mathias A Model of Interactive Teaching . . . . 487--501
Karl Meinke A Completeness Theorem for the
Expressive Power of Higher-Order
Algebraic Specifications . . . . . . . . 502--519
Anonymous Author Index for Volume 54 . . . . . . . 520--520
Richard Beigel and
Roberto Tamassia Guest Editors' Foreword . . . . . . . . 1--1
Monika R. Henzinger and
Philip Klein and
Satish Rao and
Sairam Subramanian Faster Shortest-Path Algorithms for
Planar Graphs . . . . . . . . . . . . . 3--23
Alexander A. Razborov and
Steven Rudich Natural Proofs . . . . . . . . . . . . . 24--35
Andrew Chi-Chih Yao Decision Tree Complexity and Betti
Numbers . . . . . . . . . . . . . . . . 36--43
Ramesh Hariharan Optimal Parallel Suffix Tree
Construction . . . . . . . . . . . . . . 44--69
Ming Li and
Paul Vitányi Editors' Foreword . . . . . . . . . . . 71--71
Ray J. Solomonoff The Discovery of Algorithmic Probability 73--88
J. Rissanen Stochastic Complexity in Learning . . . 89--95
V. G. Vovk Learning about the Parameter of the
Bernoulli Model . . . . . . . . . . . . 96--104
Kenji Yamanishi On-Line Maximum Likelihood Prediction
with Respect to General Loss Functions 105--118
Yoav Freund and
Robert E. Schapire A Decision-Theoretic Generalization of
On-Line Learning and an Application to
Boosting . . . . . . . . . . . . . . . . 119--139
Dale Schuurmans Characterizing Rational versus
Exponential Learning Curves . . . . . . 140--160
Leonid Gurvits and
Pascal Koiran Approximation and Learning of Convex
Superpositions . . . . . . . . . . . . . 161--170
Shai Ben-David and
Michael Lindenbaum Learning Distributions by Their Density
Levels: A Paradigm for Learning without
a Teacher . . . . . . . . . . . . . . . 171--182
John Case and
Susanne Kaufmann and
Efim Kinber and
Martin Kummer Learning Recursive Functions from
Approximations . . . . . . . . . . . . . 183--196
Sushant Patnaik and
Neil Immerman Dyn-FO: a Parallel, Dynamic Complexity
Class . . . . . . . . . . . . . . . . . 199--209
Foto N. Afrati Bounded Arity fDatalog(/=) Queries on
Graphs . . . . . . . . . . . . . . . . . 210--228
Christos Faloutsos and
Ibrahim Kamel Relaxing the Uniformity and Independence
Assumptions Using the Concept of Fractal
Dimension . . . . . . . . . . . . . . . 229--240
Leonid Libkin and
Limsoon Wong Query Languages for Bags and Aggregate
Functions . . . . . . . . . . . . . . . 241--272
Stéphane Grumbach and
Jianwen Su Finitely Representable Databases . . . . 273--298
Dan Suciu and
Val Tannen A Query Language for NC . . . . . . . . 299--321
Dan Suciu and
Jan Paredaens The Complexity of the Evaluation of
Complex Algebra Expressions . . . . . . 322--343
V. Krishnaswamy and
D. Agrawal and
J. L. Bruno and
A. El Abbadi Relative Serializability: an Approach
for Relaxing the Atomicity of
Transactions . . . . . . . . . . . . . . 344--354
Surajit Chaudhuri and
Phokion G. Kolaitis Can Datalog Be Approximated? . . . . . . 355--369
Shafi Goldwasser and
S. Rao Kosaraju Editors' Foreword . . . . . . . . . . . 371--371
Rakesh Kumar Sinha and
Jayram S. Thathachar Efficient Oblivious Branching Programs
for Threshold and Mod Functions . . . . 373--384
Dan Kleitman and
Tom Leighton and
Yuan Ma On the Design of Reliable Boolean
Circuits That Contain Partially
Unreliable Gates . . . . . . . . . . . . 385--401
David R. Karger and
Daphne Koller (De)randomized Construction of Small
Sample Spaces in NC . . . . . . . . . . 402--413
Jeffrey C. Jackson An Efficient Membership-Query Algorithm
for Learning DNF with Respect to the
Uniform Distribution . . . . . . . . . . 414--440
Edith Cohen Size-Estimation Framework with
Applications to Transitive Closure and
Reachability . . . . . . . . . . . . . . 441--453
Karsten Weihe Maximum $ (s, t)$-Flows in Planar
Networks in $ O(|V| \log |V|)$ Time . . 454--475
Jean Berstel and
L. Boasson The Set of Minimal Words of a
Context-free Language is Context-free 477--488
Joost Engelfriet and
Vincent van Oostrom Logical Description of Context-free
Graph Languages . . . . . . . . . . . . 489--503
Joan Boyar and
Rolf Fagerberg and
Kim S. Larsen Amortization Results for Chromatic
Search Trees, with an Application to
Priority Queues . . . . . . . . . . . . 504--521
Eddy Fromentin and
Michel Raynal Shared Global States in Distributed
Computations . . . . . . . . . . . . . . 522--528
G. Y. Yan and
A. Albrecht and
G. H. F. Young and
C. K. Wong The Steiner Tree Problem in Orientation
Metrics . . . . . . . . . . . . . . . . 529--546
Lane A. Hemaspaandra and
Mitsunori Ogihara Universally Serializable Computation . . 547--560
Anonymous Author Index for Volume 55 . . . . . . . 561--561
Seymour Ginsburg and
X. Sean Wang Regular Sequence Operations and Their
Use in Database Queries . . . . . . . . 1--26
Giorgio Satta Trading Independent for Synchronized
Parallelism in Finite Copying Parallel
Rewriting Systems . . . . . . . . . . . 27--45
Andreas Weber Transforming a Single-Valued Transducer
Into a Mealy Machine . . . . . . . . . . 46--59
Giovanni Manzini and
Luciano Margara Invertible Linear Cellular Automata over
$ \mathbf {Z}_m $:: Algorithmic and
Dynamical Aspects . . . . . . . . . . . 60--67
Rajeev Rastogi and
Sharad Mehrotra and
Yuri Breitbart and
Henry F. Korth and
Avi Silberschatz On Correctness of Nonserializable
Executions . . . . . . . . . . . . . . . 68--82
Sanguthevar Rajasekaran and
Shibu Yooseph TAL Recognition in $ O(M(n^2)) $ Time 83--89
Pavol Duris and
José D. P. Rolim Lower Bounds on the Multiparty
Communication Complexity . . . . . . . . 90--95
Richard E. Ladner and
Anthony LaMarca and
Ewan Tempero Counting Protocols for Reliable
End-to-End Transmission . . . . . . . . 96--111
Daoud Bshouty and
Nader H. Bshouty On Interpolating Arithmetic Read-Once
Formulas with Exponentiation . . . . . . 112--124
Juha Kortelainen Remarks about Commutative Context-Free
Languages . . . . . . . . . . . . . . . 125--129
Robert E. Shapire Guest Editor's Foreword . . . . . . . . 131--131
Dana Ron and
Yoram Singer and
Naftali Tishby On the Learnability and Usage of Acyclic
Probabilistic Finite Automata . . . . . 133--152
V. Vovk A Game of Prediction with Expert Advice 153--173
Peter L. Bartlett and
Philip M. Long Prediction, Learning, Uniform
Convergence, and Scale-Sensitive
Dimensions . . . . . . . . . . . . . . . 174--190
Javed A. Aslam and
Scott E. Decatur Specification and Simulation of
Statistical Query Algorithms for
Efficiency and Noise Tolerance . . . . . 191--208
Avrim Blum and
Prasad Chalasani and
Sally A. Goldman and
Donna K. Slonim Learning with Unreliable Boundary
Queries . . . . . . . . . . . . . . . . 209--222
Jeong Han Kim and
James R. Roche Covering Cubes by Random Half Cubes,
with Applications to Binary Neural
Networks . . . . . . . . . . . . . . . . 223--252
Lucian Ilie and
Arto Salomaa $2$-Testability and Relabelings Produce
Everything . . . . . . . . . . . . . . . 253--262
Christer Berg and
Staffan Ulfberg A Lower Bound for Perceptrons and an
Oracle Separation of the PP$^{PH}$
Hierarchy . . . . . . . . . . . . . . . 263--271
Arun Sharma A Note on Batch and Incremental
Learnability . . . . . . . . . . . . . . 272--276
Shai Ben-David and
Eli Dichterman Learning with Restricted Focus of
Attention . . . . . . . . . . . . . . . 277--298
Francesco Mario Malvestuto and
Marina Moscarini A Fast Algorithm for Query Optimization
in Universal-Relation Databases . . . . 299--309
Nader Bshouty and
Lisa Hellerstein Attribute-Efficient Learning in Query
and Mistake-Bound Models . . . . . . . . 310--319
Lin Chen Optimal Circular Arc Representations:
Properties, Recognition, and
Construction . . . . . . . . . . . . . . 320--331
Joost Engelfriet and
Heiko Vogler The Equivalence of Bottom-Up and
Top-Down Tree-to-Graph Transducers . . . 332--356
Anonymous Author Index for Volume 56 . . . . . . . 357--357
Harold N. Gabow Guest Editor's Foreword . . . . . . . . 1--1
Paul Beame and
Stephen Cook and
Jeff Edmonds and
Russell Impagliazzo and
Toniann Pitassi The Relative Complexity of NP Search
Problems . . . . . . . . . . . . . . . . 3--19
P. Diaconis and
L. Saloff-Coste What Do We Know about the Metropolis
Algorithm? . . . . . . . . . . . . . . . 20--36
Peter Bro Miltersen and
Noam Nisan and
Shmuel Safra and
Avi Wigderson On Data Structures and Asymmetric
Communication Complexity . . . . . . . . 37--49
Lydia E. Kavraki and
Jean-Claude Latombe and
Rajeev Motwani and
Prabhakar Raghavan Randomized Query Processing in Robot
Path Planning . . . . . . . . . . . . . 50--60
Jon Kleinberg and
Éva Tardos Approximations for the Disjoint Paths
Problem in High-Diameter Planar Networks 61--73
Arne Andersson and
Torben Hagerup and
Stefan Nilsson and
Rajeev Raman Sorting in Linear Time? . . . . . . . . 74--93
Thomas A. Henzinger and
Peter W. Kopke and
Anuj Puri and
Pravin Varaiya What's Decidable about Hybrid Automata? 94--124
Jin-Yi Cai and
Alan Selman Editors' Foreword . . . . . . . . . . . 125--125
Manindra Agrawal and
Eric Allender and
Steven Rudich Reductions in Circuit Complexity: an
Isomorphism Theorem and a Gap Theorem 127--143
Ian Barland and
Phokion G. Kolaitis and
Madhukar N. Thakur Integer Programming as a Framework for
Optimization and Approximability . . . . 144--161
Samuel R. Buss and
Toniann Pitassi Good Degree Bounds on Nullstellensatz
Refutations of the Induction Principle 162--171
Eric Bach and
Anne Condon and
Elton Glaser and
Celena Tanguay DNA Models and Algorithms for
NP-Complete Problems . . . . . . . . . . 172--186
Uriel Feige and
Joe Kilian Zero Knowledge and the Chromatic Number 187--199
Hervé Caussinus and
Pierre McKenzie and
Denis Thérien and
Heribert Vollmer Nondeterministic NC$^1$ Computation . . 200--212
Dieter van Melkebeek Deterministic and Randomized Bounded
Truth-Table Reductions of P, NL, and L
to Sparse Sets . . . . . . . . . . . . . 213--232
Serge Abiteboul Guest Editor's Foreword . . . . . . . . 233--233
Anthony Bonner and
Giansalvatore Mecca Sequences, Datalog, and Transducers . . 234--259
Vinay K. Chaudhri and
Vassos Hadzilacos Safe Locking Policies for Dynamic
Databases . . . . . . . . . . . . . . . 260--271
Mariano P. Consens and
Tova Milo Algebras for Querying Text Regions:
Expressive Power and Optimization . . . 272--288
Guozhu Dong and
Jianwen Su Arity Bounds in First-Order Incremental
Evaluation and Definition of Polynomial
Time Database Queries . . . . . . . . . 289--308
Idit Keidar and
Danny Dolev Increasing the Resilience of Distributed
and Replicated Database Systems . . . . 309--324
Philippe Picouet and
Victor Vianu Semantics and Expressiveness Issues in
Active Databases . . . . . . . . . . . . 325--355
Sanjay Jain Learning with Refutation . . . . . . . . 356--365
Torben Hagerup and
Jyrki Katajainen and
Naomi Nishimura and
Prabhakar Ragde Characterizing Multiterminal Flow
Networks and Computing Flows in Networks
of Small Treewidth . . . . . . . . . . . 366--375
Peter Auer and
Philip M. Long and
Aravind Srinivasan Approximating Hyper-Rectangles: Learning
and Pseudorandom Sets . . . . . . . . . 376--388
Eugene Asarin and
Oded Maler Achilles and the Tortoise Climbing Up
the Arithmetical Hierarchy . . . . . . . 389--398
Leonard J. Schulman A Three-Party Communication Problem . . 399--401
Anonymous Author Index for Volume 57 . . . . . . . 402--402
Richard Hull Editor's Foreword . . . . . . . . . . . iv--iv
Takeshi Fukuda and
Yasuhiko Morimoto and
Shinichi Morishita and
Takeshi Tokuyama Mining Optimized Association Rules for
Numeric Attributes . . . . . . . . . . . 1--12
H. V. Jagadish and
Alberto O. Mendelzon and
Inderpal Singh Mumick Managing Conflicts between Rules . . . . 13--28
CH. Papadimitriou and
D. Suciu and
V. Vianu Topological Queries in Spatial Databases 29--53
Serge Abiteboul and
Laurent Herr and
Jan Van den Bussche Temporal Connectives versus Explicit
Timestamps to Query Temporal Databases 54--68
Alon Y. Levy and
Anand Rajaraman and
Jeffrey D. Ullman Answering Queries Using Limited External
Query Processors . . . . . . . . . . . . 69--82
Ronald Fagin Combining Fuzzy Information from
Multiple Systems . . . . . . . . . . . . 83--99
Monika R. Henzinger and
Ronitt Rubinfeld Editors' Foreword . . . . . . . . . . . 100--100
Avrim Blum and
R. Ravi and
Santosh Vempala A Constant-Factor Approximation
Algorithm for the $k$-MST Problem . . . 101--108
Michael Kearns and
Yishay Mansour On the Boosting Ability of Top-Down
Decision Tree Learning Algorithms . . . 109--128
Eyal Kushilevitz and
Rafail Ostrovsky and
Adi Rosén Characterizing Linear Size Circuits in
Terms of Privacy . . . . . . . . . . . . 129--136
Noga Alon and
Yossi Matias and
Mario Szegedy The Space Complexity of Approximating
the Frequency Moments . . . . . . . . . 137--147
Noam Nisan and
Amnon Ta-Shma Extracting Randomness: a Survey and New
Constructions . . . . . . . . . . . . . 148--173
Amir Ben-Dor and
Anna Karlin and
Nathan Linial and
Yuri Rabinovich A Note on the Influence of an $ \epsilon
$-Biased Random Source . . . . . . . . . 174--176
Marcus Schaefer Deciding the Vapnik--Cervonenkis
Dimension is P$ \Sigma^p_3 $-complete 177--182
Joel Ratsaby and
Vitaly Maiorov On the Learnability of Rich Function
Classes . . . . . . . . . . . . . . . . 183--192
Sanjeev Arora and
David Karger and
Marek Karpinski Polynomial Time Approximation Schemes
for Dense Instances of NP-Hard Problems 193--210
John Case and
Mark A. Fulk Maximal Machine Learnable Classes . . . 211--214
Gheorghe Antonoiu and
Pradip K. Srimani A Self-Stabilizing Distributed Algorithm
to Find the Median of a Tree Graph . . . 215--221
Carsten Lund and
Steven Phillips and
Nick Reingold Paging against a Distribution and IP
Networking . . . . . . . . . . . . . . . 222--231
Leslie Ann Goldberg and
Philip D. MacKenzie Analysis of Practical Backoff Protocols
for Contention Resolution with Multiple
Servers . . . . . . . . . . . . . . . . 232--258
Pankaj K. Agarwal and
Stephen Cook Guest Editors' Foreword . . . . . . . . 259--259
Robert Beals Algorithms for Matrix Groups and the
Tits Alternative . . . . . . . . . . . . 260--279
Jin-Yi Cai and
D. Sivakumar Sparse Hard Sets for P: Resolution of a
Conjecture of Hartmanis . . . . . . . . 280--296
Tamal K. Dey and
Sumanta Guha Transforming Curves on Surfaces . . . . 297--325
Armin Haken and
Stephen A. Cook An Exponential Lower Bound for the Size
of Monotone Real Circuits . . . . . . . 326--335
Moni Naor and
Omer Reingold Synthesizers and Their Application to
the Parallel Construction of
Pseudo-Random Functions . . . . . . . . 336--375
Michael Saks and
Shiyu Zhou BP$_H$SPACE(S) $ \subseteq $ DSPACE ($
S^{3 / 2}$) . . . . . . . . . . . . . . 376--403
Anonymous Editor's Foreword . . . . . . . . . . . 405--406
Christos H. Papadimitriou and
Mihalis Yannakakis On the Complexity of Database Queries 407--427
Serge Abiteboul and
Victor Vianu Regular Path Queries with Constraints 428--452
Giansalvatore Mecca and
Paolo Atzeni Cut and Paste . . . . . . . . . . . . . 453--482
Marc Gyssens and
Jan Van den Bussche and
Dirk Van Gucht Complete Geometric Query Languages . . . 483--511
Joseph Albert and
Yannis Ioannidis and
Raghu Ramakrishnan Equivalence of Keyed Relational Schemas
by Conjunctive Queries . . . . . . . . . 512--534
Freddy Dumortier and
Marc Gyssens and
Luc Vandeurzen and
Dirk Van Gucht On the Decidability of Semilinearity for
Semialgebraic Sets and Its Implications
for Spatial Databases . . . . . . . . . 535--571
Jonathan F. Buss and
Gudmund S. Frandsen and
Jeffrey O. Shallit The Computational Complexity of Some
Problems of Linear Algebra . . . . . . . 572--596
Giovanni Manzini and
Luciano Margara Attractors of Linear Cellular Automata 597--610
Jürgen Dassow and
Victor Mitrana Stack Cooperation in Multistack Pushdown
Automata . . . . . . . . . . . . . . . . 611--621
Jianer Chen and
Donald K. Friesen and
Hao Zheng Tight Bound on Johnson's Algorithm for
Maximum Satisfiability . . . . . . . . . 622--640
Adam Krawczyk The Complexity of Finding a Second
Hamiltonian Cycle in Cubic Graphs . . . 641--647
Lane A. Hemaspaandra and
Jörg Rothe Creating Strong, Total, Commutative,
Associative One-Way Functions from Any
One-Way Function in Complexity Theory 648--659
Anonymous Author Index for Volume 58 . . . . . . . 660--660
Oscar H. Ibarra and
Jianwen Su A Technique for Proving Decidability of
Containment and Equivalence of Linear
Constraint Queries . . . . . . . . . . . 1--28
Yuri Breitbart and
Henry F. Korth Replication and Consistency in a
Distributed Environment . . . . . . . . 29--69
Zhixiang Chen and
Foued Ameur The Learnability of Unions of Two
Rectangles in the Two-Dimensional
Discretized Space . . . . . . . . . . . 70--83
Pranay Chaudhuri A Self-Stabilizing Algorithm for
Detecting Fundamental Cycles in a Graph 84--93
Marianne Baudinet and
Jan Chomicki and
Pierre Wolper Constraint-Generating Dependencies . . . 94--115
Gösta Grahne and
Matti Nykänen and
Esko Ukkonen Reasoning about Strings in Databases . . 116--162
Joan Feigenbaum and
Alan Selman Guest Editors' Foreword . . . . . . . . 163--163
Eric Allender and
Klaus Reinhardt and
Shiyu Zhou Isolation, Matching, and Counting
Uniform and Nonuniform Upper Bounds . . 164--181
Harry Buhrman and
Lance Fortnow Two Queries . . . . . . . . . . . . . . 182--194
Amos Beimel and
Anna Gál On Arithmetic Branching Programs . . . . 195--220
Jin-Yi Cai and
Ajay Nerurkar Approximating the SVP to within a Factor
$ (1 + 1 / \dim \epsilon) $ Is NP-Hard
under Randomized Reductions . . . . . . 221--239
Lance Fortnow and
John Rogers Complexity Limitations on Quantum
Computation . . . . . . . . . . . . . . 240--252
Oded Goldreich and
Madhu Sudan Computational Indistinguishability: a
Sample Hierarchy . . . . . . . . . . . . 253--269
D. Sivakumar On Membership Comparable Sets . . . . . 270--280
John Watrous Space-Bounded Quantum Complexity . . . . 281--326
Harry Buhrman and
Dieter van Melkebeek Hard Sets Are Hard to Find . . . . . . . 327--345
Ran Raz and
Gábor Tardos and
Oleg Verbitsky and
Nikolai Vereshchagin Arthur--Merlin Games in Boolean Decision
Trees . . . . . . . . . . . . . . . . . 346--372
Stéphane Gaubert and
Alessandro Giua Petri Net Languages and Infinite Subsets
of $ N^m $ . . . . . . . . . . . . . . . 373--391
Nicol\`o Cesa-Bianchi Analysis of Two Gradient-Based
Algorithms for On-Line Regression . . . 392--411
Flavio Corradini and
Rocco De Nicola and
Anna Labella Models of Nondeterministic Regular
Expressions . . . . . . . . . . . . . . 412--449
Lin Chen Graph Isomorphism and Identification
Matrices: Sequential Algorithms . . . . 450--475
Petr Jancar and
Javier Esparza and
Faron Moller Petri Nets and Regular Processes . . . . 476--503
B. P. Weems Bistable Versions of the Marriages and
Roommates Problems . . . . . . . . . . . 504--520
Leo Liberti Structure of the Invertible CA
Transformations Group . . . . . . . . . 521--536
Roberto Barbuti and
Nicoletta De Francesco and
Antonella Santone and
Gigliola Vaglini Selective Mu-Calculus and Formula-Based
Equivalence of Transition Systems . . . 537--556
Anonymous Corrigendum: Volume 58, Number 3 (1999),
in Article No. ``On the Decidability of
Semilinearity for Semialgebraic Sets and
Its Implications for Spatial
Databases,'' by Freddy Dumortier, Marc
Gyssens, Luc Vandeurzen, and Dirk Van
Gucht, pages 535--571 . . . . . . . . . 557--562
Anonymous Author Index for Volume 59 . . . . . . . 563--563
Bin Ma and
Lusheng Wang On the Inapproximability of Disjoint
Paths and Minimum Steiner Forest with
Bandwidth Constraints . . . . . . . . . 1--12
Wan Fokkink Rooted Branching Bisimulation as a
Congruence . . . . . . . . . . . . . . . 13--37
Jinde Cao Global Exponential Stability and
Periodic Solutions of Delayed Cellular
Neural Networks . . . . . . . . . . . . 38--46
Tatsuaki Okamoto On Relationships between Statistical
Zero-Knowledge Proofs . . . . . . . . . 47--108
Klaus-Jörn Lange and
Rolf Niedermeier Data Independence of Read, Write, and
Control Structures in PRAM Computations 109--144
József Békési and
Gábor Galambos and
Hans Kellerer A $ 5 / 4 $ Linear Time Bin Packing
Algorithm . . . . . . . . . . . . . . . 145--160
Rocco A. Servedio Computational Sample Complexity and
Attribute-Efficient Learning . . . . . . 161--178
Jinde Cao and
Qing Tao Estimation of the Domain of Attraction
and the Convergence Rate of a Hopfield
Associative Memory and an Application 179--186
Christel Baier and
Bettina Engelen and
Mila Majster-Cederbaum Deciding Bisimilarity and Similarity for
Probabilistic Processes . . . . . . . . 187--231
Vijay Raghavan Editor's Foreword . . . . . . . . . . . 233--233
John Case and
Sanjay Jain and
Matthias Ott and
Arun Sharma and
Frank Stephan Robust Learning Aided by Context . . . . 234--257
Andreas Birkendorf and
Norbert Klasner and
Christian Kuhlmann and
Hans U. Simon Structural Results about Exact Learning
with Unspecified Attribute Values . . . 258--277
Christopher D. Rosin Sample Complexity of Model-Based Search 278--301
Rüdiger Reischuk and
Thomas Zeugmann An Average-Case Optimal One-Variable
Pattern Language Learner . . . . . . . . 302--335
José L. Balcázar Editor's Foreword . . . . . . . . . . . 336--336
Lance Fortnow Time-Space Tradeoffs for Satisfiability 337--353
Klaus-Jörn Lange and
Pierre McKenzie and
Alain Tapp Reversible Space Equals Deterministic
Space . . . . . . . . . . . . . . . . . 354--367
Cristopher Moore and
Denis Thérien and
François Lemieux and
Joshua Berman and
Arthur Drisko Circuits and Expressions with
Nonassociative Gates . . . . . . . . . . 368--394
Manindra Agrawal and
Eric Allender and
Samir Datta On TC$^0$, AC$^0$, and Arithmetic
Circuits . . . . . . . . . . . . . . . . 395--421
Richard Beigel and
Bin Fu Circuits over PP and PL . . . . . . . . 422--441
Daniel Hammer and
Andrei Romashchenko and
Alexander Shen and
Nikolai Vereshchagin Inequalities for Shannon Entropy and
Kolmogorov Complexity . . . . . . . . . 442--464
Rod Downey and
André Nies Undecidability Results for Low
Complexity Time Classes . . . . . . . . 465--479
Anonymous Papers to Appear in Forthcoming Issues 480--480
Fan Chung Graham Guest Editor's Foreword . . . . . . . . 481--481
William Aiello and
Eyal Kushilevitz and
Rafail Ostrovsky and
Adi Rosén Adaptive Packet Routing for Bursty
Adversarial Traffic . . . . . . . . . . 482--509
Uriel Feige Approximating the Bandwidth via Volume
Respecting Embeddings . . . . . . . . . 510--539
Oded Goldreich and
Shafi Goldwasser On the Limits of Nonapproximability of
Lattice Problems . . . . . . . . . . . . 540--563
Gruia Calinescu and
Howard Karloff and
Yuval Rabani An Improved Approximation Algorithm for
MULTIWAY CUT . . . . . . . . . . . . . . 564--574
Sanjeev Khanna and
Shiyu Zhou On Indexed Data Broadcast . . . . . . . 575--591
Yael Gertner and
Yuval Ishai and
Eyal Kushilevitz and
Tal Malkin Protecting Data Privacy in Private
Information Retrieval Schemes . . . . . 592--629
Andrei Z. Broder and
Moses Charikar and
Alan M. Frieze and
Michael Mitzenmacher Min-Wise Independent Permutations . . . 630--659
Miklos Ajtai and
Ronald Fagin and
Larry Stockmeyer The Closure of Monadic NP . . . . . . . 660--716
Funda Ergün and
Sampath Kannan and
S. Ravi Kumar and
Ronitt Rubinfeld and
Mahesh Viswanathan Spot-Checkers . . . . . . . . . . . . . 717--751
Anonymous Papers to Appear in Forthcoming Issues 752--752
Anonymous Author Index for Volume 60 . . . . . . . 753--753
Roderick Bloem and
Joost Engelfriet A Comparison of Tree Transductions
Defined by Monadic Second Order Logic
and by Attribute Grammars . . . . . . . 1--50
Dario Catalano and
Rosario Gennaro New Efficient and Secure Protocols for
Verifiable Signature Sharing and Other
Applications . . . . . . . . . . . . . . 51--80
Suresh Chari and
Pankaj Rohatgi and
Aravind Srinivasan Improved Algorithms via Approximations
of Probability Distributions . . . . . . 81--107
Gheorghe Paun Computing with Membranes . . . . . . . . 108--143
Anonymous Papers to Appear in Forthcoming Issues 144--144
Jan Paredaens Guest Editor's Foreword . . . . . . . . 145--145
Peter Buneman and
Wenfei Fan and
Scott Weinstein Path Constraints in Semistructured
Databases . . . . . . . . . . . . . . . 146--193
Pankaj K. Agarwal and
Lars Arge and
Jeff Erickson and
Paulo G. Franciosa and
Jeffrey Scott Vitter Efficient Searching with Linear
Constraints . . . . . . . . . . . . . . 194--216
Christos H. Papadimitriou and
Prabhakar Raghavan and
Hisao Tamaki and
Santosh Vempala Latent Semantic Indexing: a
Probabilistic Analysis . . . . . . . . . 217--235
Serge Abiteboul and
Victor Vianu and
Brad Fordham and
Yelena Yesha Relational Transducers for Electronic
Commerce . . . . . . . . . . . . . . . . 236--269
Luc Segoufin and
Victor Vianu Querying Spatial Databases via
Topological Invariants . . . . . . . . . 270--301
Phokion G. Kolaitis and
Moshe Y. Vardi Conjunctive-Query Containment and
Constraint Satisfaction . . . . . . . . 302--332
Anonymous Papers to Appear in Forthcoming Issues 333--333
Klaus Ambos-Spies and
Levke Bentzien Separating NP-Completeness Notions under
Strong Hypotheses . . . . . . . . . . . 335--361
Mihir Bellare and
Joe Kilian and
Phillip Rogaway The Security of the Cipher Block
Chaining Message Authentication Code . . 362--399
Francesco Quaglia and
Roberto Baldoni and
Bruno Ciciani On the No-Z-Cycle Property in
Distributed Executions . . . . . . . . . 400--427
Michael Kearns and
Dana Ron Testing Problems with Sublearning Sample
Complexity . . . . . . . . . . . . . . . 428--456
Sheng-Tzong Cheng and
Chia-Mei Chen and
Satish K. Tripathi A Fault-Tolerance Model for
Multiprocessor Real-Time Systems . . . . 457--477
Thomas Eiter and
Toshihide Ibaraki and
Kazuhisa Makino On the Difference of Horn Theories . . . 478--507
Kim S. Larsen AVL Trees with Relaxed Balance . . . . . 508--522
Jun-ichi Takeuchi and
Naoki Abe and
Shun-ichi Amari The Lob-Pass Problem . . . . . . . . . . 523--557
Beate Bollig and
Ingo Wegener Asymptotically Optimal Bounds for OBDDs
and the Solution of Some Basic OBDD
Problems . . . . . . . . . . . . . . . . 558--579
Anonymous Papers to Appear in Forthcoming Issues 580--580
Anonymous Author Index for Volume 61 . . . . . . . 581--581
Silvia Ghilezan Full Intersection Types and Topologies
in Lambda Calculus . . . . . . . . . . . 1--14
Fosca Giannotti and
Dino Pedreschi and
Carlo Zaniolo Semantics and Expressive Power of
Nondeterministic Constructs in Deductive
Databases . . . . . . . . . . . . . . . 15--42
Paolo Liberatore and
Marco Schaerf Belief Revision and Update: Complexity
of Model Checking . . . . . . . . . . . 43--72
Anna Philippou and
David Walker A Process-Calculus Analysis of
Concurrent Operations on B-Trees . . . . 73--122
Sally A. Goldman and
Stephen S. Kwek and
Stephen D. Scott Agnostic Learning of Geometric Patterns 123--151
Richard J. Cole and
Bruce M. Maggs and
Ramesh K. Sitaraman On the Benefit of Supporting Virtual
Channels in Wormhole Routers . . . . . . 152--177
Sanjay Jain and
Carl Smith and
Rolf Wiehagen Robust Learning Is Rich . . . . . . . . 178--212
Anonymous Papers to Appear in Forthcoming Issues 213--213
Lance Fortnow Guest Editor's Foreword . . . . . . . . 215--215
J. Maurice Rojas Computational Arithmetic Geometry: I.
Sentences Nearly in the Polynomial
Hierarchy . . . . . . . . . . . . . . . 216--235
Madhu Sudan and
Luca Trevisan and
Salil Vadhan Pseudorandom Generators without the XOR
Lemma . . . . . . . . . . . . . . . . . 236--266
Sam Buss and
Dima Grigoriev and
Russell Impagliazzo and
Toniann Pitassi Linear Gaps between Degrees for the
Polynomial Calculus Modulo Distinct
Primes . . . . . . . . . . . . . . . . . 267--289
Marcus Schaefer Graph Ramsey Theory and the Polynomial
Hierarchy . . . . . . . . . . . . . . . 290--322
Stephen J. Ponzio and
Jaikumar Radhakrishnan and
S. Venkatesh The Communication Complexity of Pointer
Chasing . . . . . . . . . . . . . . . . 323--355
Eric Allender and
Michael Saks and
Igor Shparlinski A Lower Bound for Primality . . . . . . 356--366
Russell Impagliazzo and
Ramamohan Paturi On the Complexity of $k$-SAT . . . . . . 367--375
John Watrous Quantum Simulations of Classical Random
Walks and Undirected Graph Connectivity 376--391
Anonymous Papers to Appear in Forthcoming Issues 392--392
Baruch Awerbuch and
Yossi Azar and
Serge Plotkin and
Orli Waarts Competitive Routing of Virtual Circuits
with Unknown Duration . . . . . . . . . 385--397
John H. Reif Parallel Output-Sensitive Algorithms for
Combinatorial and Linear Algebra
Problems . . . . . . . . . . . . . . . . 398--412
John Case and
Sanjay Jain Synthesizing Learners Tolerating
Computable Noisy Data . . . . . . . . . 413--441
Vincent D. Blondel and
Olivier Bournez and
Pascal Koiran and
John N. Tsitsiklis The Stability of Saturated Linear
Dynamical Systems Is Undecidable . . . . 442--462
Francesco Buccafurri and
Thomas Eiter and
Georg Gottlob and
Nicola Leone On ACTL Formulas Having Linear
Counterexamples . . . . . . . . . . . . 463--515
Yi Li and
Philip M. Long and
Aravind Srinivasan Improved Bounds on the Sample Complexity
of Learning . . . . . . . . . . . . . . 516--527
Jinde Cao and
Qing Tao Estimation on Domain of Attraction and
Convergence Rate of Hopfield Continuous
Feedback Neural Networks . . . . . . . . 528--534
Anonymous Papers to Appear in Forthcoming Issues 535--535
Yasunori Ishihara and
Shougo Shimizu and
Hiroyuki Seki and
Minoru Ito Refinements of Complexity Results on
Type Consistency for Object-Oriented
Databases . . . . . . . . . . . . . . . 537--564
Juraj Hromkovic and
Sebastian Seibert and
Thomas Wilke Translating Regular Expressions into
Small $ \epsilon $-Free Nondeterministic
Finite Automata . . . . . . . . . . . . 565--588
Yonatan Aumann and
Johan Håstad and
Michael O. Rabin and
Madhu Sudan Linear-Consistency Testing . . . . . . . 589--607
Changwook Kim Separation Results for Separated Apex
NLC and NCE Graph Languages . . . . . . 608--628
Clemens Lautemann and
Pierre McKenzie and
Thomas Schwentick and
Heribert Vollmer The Descriptive Complexity Approach to
LOGCFL . . . . . . . . . . . . . . . . . 629--652
Marcus Hutter New Error Bounds for Solomonoff
Prediction . . . . . . . . . . . . . . . 653--667
Yonit Kesten and
Amir Pnueli and
Moshe Y. Vardi Verification by Augmented Abstraction:
The Automata-Theoretic View . . . . . . 668--690
Anonymous Papers to Appear in Forthcoming Issues 691--691
Anonymous Author Index for Volume 62 . . . . . . . 692--692
Fan Chung Graham Editor's Foreword . . . . . . . . . . . 1--1
Jon Kleinberg and
Yuval Rabani and
Éva Tardos Fairness in Routing and Load Balancing 2--20
Joan Feigenbaum and
Christos H. Papadimitriou and
Scott Shenker Sharing the Cost of Multicast
Transmissions . . . . . . . . . . . . . 21--41
Ravi Kumar and
Prabhakar Raghavan and
Sridhar Rajagopalan and
Andrew Tomkins Recommendation Systems: a Probabilistic
Analysis . . . . . . . . . . . . . . . . 42--61
Ashish Goel and
Adam Meyerson and
Serge Plotkin Combining Fairness with Throughput:
Online Routing with Multiple Objectives 62--79
Philip J. Hanlon and
Dean Chung and
Siddhartha Chatterjee and
Daniela Genius and
Alvin R. Lebeck and
Erin Parker The Combinatorics of Cache Misses during
Matrix Multiplication . . . . . . . . . 80--126
Micah Adler and
Tom Leighton Compression Using Efficient Multicasting 127--145
Anonymous Papers to Appear in Forthcoming Issues 146--146
Pavel Pudlák Guest Editor's Foreword . . . . . . . . 147--147
Andris Ambainis and
Harry Buhrman and
William Gasarch and
Bala Kalyanasundaram and
Leen Torenvliet The Communication Complexity of
Enumeration, Elimination, and Selection 148--185
David Mix Barrington and
Peter Kadau and
Klaus-Jörn Lange and
Pierre McKenzie On the Complexity of Some Problems on
Groups Input as Multiplication Tables 186--200
André Berthiaume and
Wim van Dam and
Sophie Laplante Quantum Kolmogorov Complexity . . . . . 201--221
Oliver Giel Branching Program Size Is Almost Linear
in Formula Size . . . . . . . . . . . . 222--235
Valentine Kabanets Easiness Assumptions and Hardness Tests:
Trading Time for Zero Error . . . . . . 236--252
Ketan Mulmuley and
Pradyut Shah A Lower Bound for the Shortest Path
Problem . . . . . . . . . . . . . . . . 253--267
Iannis Tourlakis Time-Space Tradeoffs for SAT on
Nonuniform Machines . . . . . . . . . . 268--287
Ke Yang Integer Circuit Evaluation Is
PSPACE-Complete . . . . . . . . . . . . 288--303
Anonymous Papers to Appear in Forthcoming Issues 304--304
Sanjay Jain and
Efim Kinber and
Rolf Wiehagen Language Learning from Texts: Degrees of
Intrinsic Complexity and Their
Characterizations . . . . . . . . . . . 305--354
Sanjay Gupta and
R. K. P. Zia Quantum Neural Networks . . . . . . . . 355--383
Hing Leung Tight Lower Bounds on the Size of
Sweeping Automata . . . . . . . . . . . 384--393
Nicolas Bedon Logic over Words on Denumerable Ordinals 394--431
Fan Chung and
Mark Garrett and
Ronald Graham and
David Shallcross Distance Realization Problems with
Applications to Internet Tomography . . 432--448
Satyanarayana V. Lokam Spectral Methods for Matrix Rigidity
with Applications to Size-Depth
Trade-offs and Communication Complexity 449--473
David Peleg and
Eilon Reshef Low Complexity Variants of the Arrow
Distributed Directory . . . . . . . . . 474--485
Jay Sethuraman and
Chung-Piaw Teo A Polynomial-time Algorithm for the
Bistable Roommates Problem . . . . . . . 486--497
Johan Håstad A Slight Sharpening of LMN . . . . . . . 498--508
Anonymous Papers to Appear in Forthcoming Issues 509--509
Rajeev Motwani Guest Editor's Foreword . . . . . . . . 511--511
Russell Impagliazzo and
Ramamohan Paturi and
Francis Zane Which Problems Have Strongly Exponential
Complexity? . . . . . . . . . . . . . . 512--530
W. Fernandez de la Vega and
Claire Kenyon A Randomized Approximation Scheme for
Metric MAX-CUT . . . . . . . . . . . . . 531--541
Paul Beame and
T. S. Jayram and
Michael Saks Time-Space Tradeoffs for Branching
Programs . . . . . . . . . . . . . . . . 542--572
Micah Adler and
Bruce M. Maggs Protocols for Asymmetric Communication
Channels . . . . . . . . . . . . . . . . 573--596
Christopher Umans The Minimum Equivalent DNF Problem and
Shortest Implicants . . . . . . . . . . 597--611
Alexander Russell and
David Zuckerman Perfect Information Leader Election in $
\log^* n + O(1) $ Rounds . . . . . . . . 612--626
Piotr Indyk On Approximate Nearest Neighbors under $
l_\infty $ Norm . . . . . . . . . . . . 627--638
Uriel Feige and
Joe Kilian Heuristics for Semirandom Graph Problems 639--671
Russell Impagliazzo and
Avi Wigderson Randomness vs Time: Derandomization
under a Uniform Assumption . . . . . . . 672--688
Anonymous Papers to Appear in Forthcoming Issues 689--689
Anonymous Author Index for Volume 63 . . . . . . . 690--690
Sally Goldman Guest Editor's Foreword . . . . . . . . 1--1
José L. Balcázar and
Jorge Castro and
David Guijarro A New Abstract Combinatorial Dimension
for Exact Learning via Queries . . . . . 2--21
Shai Ben-David and
Nadav Eiron and
Hans Ulrich Simon The Computational Complexity of Densest
Region Detection . . . . . . . . . . . . 22--47
Peter Auer and
Nicol\`o Cesa-Bianchi and
Claudio Gentile Adaptive and Self-Confident On-Line
Learning Algorithms . . . . . . . . . . 48--75
Jürgen Forster and
Manfred K. Warmuth Relative Expected Instantaneous Loss
Bounds . . . . . . . . . . . . . . . . . 76--102
Yishay Mansour and
David McAllester Boosting Using Branching Programs . . . 103--112
Yoav Freund and
Manfred Opper Drifting Games and Brownian Motion . . . 113--132
Peter L. Bartlett and
Jonathan Baxter Estimation and Approximation Bounds for
Gradient-Based Reinforcement Learning 133--150
Anonymous Papers to Appear in Forthcoming Issues 151--151
Mark Fulk Inductive Inference with Additional
Information . . . . . . . . . . . . . . 153--159
Cristina Bazgan and
Miklos Santha and
Zsolt Tuza Efficient Approximation Algorithms for
the Subset-Sums Equality Problem . . . . 160--170
Martin Große-Rhode and
Francesco Parisi Presicce and
Marta Simeoni Formal Software Specification with
Refinements and Modules of Typed Graph
Transformation Systems . . . . . . . . . 171--218
Minos Garofalakis and
Yannis Ioannidis and
Banu Özden and
Avi Silberschatz Competitive On-line Scheduling of
Continuous-Media Streams . . . . . . . . 219--248
Frank Drewes and
Berthold Hoffmann and
Detlef Plump Hierarchical Graph Transformation . . . 249--283
T. H. Westerdale Minimality of an Automaton Cascade
Decomposition for Learning System
Environments . . . . . . . . . . . . . . 284--307
Martin R. Bridson and
Robert H. Gilman Context-Free Languages of
Sub-exponential Growth . . . . . . . . . 308--310
Lane A. Hemaspaandra and
Mitsunori Ogihara and
Gerd Wechsung Reducing the Number of Solutions of NP
Functions . . . . . . . . . . . . . . . 311--328
J. M. Hélary and
A. Mostefaoui and
M. Raynal Interval Consistency of Asynchronous
Distributed Computations . . . . . . . . 329--349
Joost Engelfriet and
Sebastian Maneth Output String Languages of Compositions
of Deterministic Macro Tree Transducers 350--395
Volker Diekert and
Paul Gastin LTL Is Expressively Complete for
Mazurkiewicz Traces . . . . . . . . . . 396--418
Detlef Sieling Lower Bounds for Linearly Transformed
OBDDs and FBDDs . . . . . . . . . . . . 419--438
Anonymous Papers to Appear in Forthcoming Issues 439--439
Yannis Ioannidis and
Christos Papadimitriou Guest Editors' Foreword . . . . . . . . 441--442
Diego Calvanese and
Giuseppe De Giacomo and
Maurizio Lenzerini and
Moshe Y. Vardi Rewriting of Regular Expressions and
Regular Path Queries . . . . . . . . . . 443--465
Stavros Cosmadakis Inherent Complexity of Recursive Queries 466--495
Steven Dawson and
Sabrina De Capitani di Vimercati and
Patrick Lincoln and
Pierangela Samarati Maximizing Sharing of Protected
Information . . . . . . . . . . . . . . 496--541
Venkatesh Ganti and
Johannes Gehrke and
Raghu Ramakrishnan and
Wei-Yin Loh A Framework for Measuring Differences in
Data Characteristics . . . . . . . . . . 542--578
Georg Gottlob and
Nicola Leone and
Francesco Scarcello Hypertree Decompositions and Tractable
Queries . . . . . . . . . . . . . . . . 579--627
Michael Benedikt and
Leonid Libkin Aggregate Operators in Constraint Query
Languages . . . . . . . . . . . . . . . 628--654
Yaron Kanza and
Werner Nutt and
Yehoshua Sagiv Querying Incomplete Information in
Semistructured Data . . . . . . . . . . 655--693
Jan Van den Bussche and
Emmanuel Waller Polymorphic Type Inference for the
Relational Algebra . . . . . . . . . . . 694--718
Noga Alon and
Phillip B. Gibbons and
Yossi Matias and
Mario Szegedy Tracking Join and Self-Join Sizes in
Limited Storage . . . . . . . . . . . . 719--747
Anonymous Papers to Appear in Forthcoming Issues 748--748
Sanjeev Khanna Guest Editor's Foreword . . . . . . . . 749--749
Andris Ambainis Quantum Lower Bounds by Quantum
Arguments . . . . . . . . . . . . . . . 750--767
Dan Boneh Finding Smooth Integers in Short
Intervals Using CRT Decoding . . . . . . 768--784
Moses Charikar and
Ronald Fagin and
Venkatesan Guruswami and
Jon Kleinberg and
Prabhakar Raghavan and
Amit Sahai Query Strategies for Priced Information 785--819
David Kempe and
Jon Kleinberg and
Amit Kumar Connectivity and Inference Problems for
Temporal Networks . . . . . . . . . . . 820--842
Alexis Maciel and
Toniann Pitassi and
Alan R. Woods A New Proof of the Weak Pigeonhole
Principle . . . . . . . . . . . . . . . 843--872
Omer Barkol and
Yuval Rabani Tighter Lower Bounds for Nearest
Neighbor Search and Related Problems in
the Cell Probe Model . . . . . . . . . . 873--896
Anonymous Papers to Appear in Forthcoming Issues 897--897
Anonymous Author Index for Volume 64 . . . . . . . 898--898
Lenore Cowen and
Ronald Fagin and
Joe Kilian and
Jon Kleinberg Guest Editor's Foreword . . . . . . . . 1--1
Miklós Ajtai Determinism versus Nondeterminism for
Linear Time RAMs with Memory
Restrictions . . . . . . . . . . . . . . 2--37
Paul Beame and
Faith E. Fich Optimal Bounds for the Predecessor
Problem and Related Problems . . . . . . 38--72
Ming Li and
Bin Ma and
Lusheng Wang Finding Similar Regions in Many
Sequences . . . . . . . . . . . . . . . 73--96
Ran Raz and
Omer Reingold and
Salil Vadhan Extracting all the Randomness and
Reducing the Error in Trevisan's
Extractors . . . . . . . . . . . . . . . 97--128
Moses Charikar and
Sudipto Guha and
Éva Tardos and
David B. Shmoys A Constant-Factor Approximation
Algorithm for the $k$-Median Problem . . 129--149
Valerie King and
Garry Sagert A Fully Dynamic Algorithm for
Maintaining the Transitive Closure . . . 150--167
Anonymous Papers to Appear in Forthcoming Issues 168--168
Charles Stewart Reducibility between Classes of Port
Graph Grammar . . . . . . . . . . . . . 169--223
Atsuyoshi Nakamura and
Naoki Abe Online Learning of Binary and $n$-ary
Relations over Clustered Domains . . . . 224--256
V. Arvind and
Johannes Köbler New Lowness Results for ZPP NP and Other
Complexity Classes . . . . . . . . . . . 257--277
Tero Harju and
Oscar Ibarra and
Juhani Karhumäki and
Arto Salomaa Some Decision Problems Concerning
Semilinearity and Commutation . . . . . 278--294
Dan E. Willard An Algorithm for Handling Many
Relational Calculus Queries Efficiently 295--331
Piotr Berman and
Marek Karpinski and
Lawrence L. Larmore and
Wojciech Plandowski and
Wojciech Rytter On the Complexity of Pattern Matching
for Highly Compressed Two-Dimensional
Texts . . . . . . . . . . . . . . . . . 332--350
K. Skodinis and
E. Wanke Node Replacements in Embedding Normal
Form . . . . . . . . . . . . . . . . . . 351--376
Juha Honkala The Equivalence Problem for DF0L
Languages and Power Series . . . . . . . 377--392
Giovanni Pighizzini and
Jeffrey Shallit and
Ming-wei Wang Unary Context-Free Grammars and Pushdown
Automata, Descriptional Complexity and
Auxiliary Space Lower Bounds . . . . . . 393--414
Llew Mason and
Peter L. Bartlett and
Mostefa Golea Generalization Error of Combined
Classifiers . . . . . . . . . . . . . . 415--438
Anonymous Papers to Appear in Forthcoming Issues 439--439
Anonymous Advertisement #sciencejobs\_N . . . . . ii--ii
Ming Li and
Pavel Pevzner and
Ron Shamir Foreword . . . . . . . . . . . . . . . . 441--441
Nadia El-Mabrouk Reconstructing an ancestral genome using
minimum segments duplications and
reversals . . . . . . . . . . . . . . . 442--464
Guohui Lin and
Zhi-Zhong Chen and
Tao Jiang and
Jianjun Wen The longest common subsequence problem
for sequences with nested arc
annotations . . . . . . . . . . . . . . 465--480
J. Lagergren Combining polynomial running time and
fast convergence for the disk-covering
method . . . . . . . . . . . . . . . . . 481--493
Deep Jaitly and
Paul Kearney and
Guohui Lin and
Bin Ma Methods for reconstructing the history
of tandem repeats and their application
to the human genome . . . . . . . . . . 494--507
Bernard M. E. Moret and
Jijun Tang and
Li-San Wang and
Tandy Warnow Steps toward accurate reconstructions of
phylogenies from gene-order data . . . . 508--525
Gopal Pandurangan and
H. Ramesh The restriction mapping problem
revisited . . . . . . . . . . . . . . . 526--544
Rune B. Lyngsò and
Christian N. S. Pedersen The consensus string problem and the
complexity of comparing hidden Markov
models . . . . . . . . . . . . . . . . . 545--569
Yaw-Ling Lin and
Tao Jiang and
Kun-Mao Chao Efficient algorithms for locating the
length-constrained heaviest segments
with applications to biomolecular
sequence analysis . . . . . . . . . . . 570--586
Glenn Tesler Efficient algorithms for
multichromosomal genome rearrangements 587--609
Anonymous Papers to Appear . . . . . . . . . . . . 610--610
Anonymous C3 --- Advertisement #09111 . . . . . . ibc--ibc
Anonymous C4 --- TOC . . . . . . . . . . . . . . . obc--obc
Anonymous Editorial board . . . . . . . . . . . . ifc--ifc
Anonymous Advertisement . . . . . . . . . . . . . ii--ii
Anonymous Volume TOC . . . . . . . . . . . . . . . III--V
Madhu Sudan Foreword . . . . . . . . . . . . . . . . 611--611
Jürgen Forster A linear lower bound on the unbounded
error probabilistic communication
complexity . . . . . . . . . . . . . . . 612--625
Albert Atserias and
Nicola Galesi and
Pavel Pudlák Monotone simulations of non-monotone
proofs . . . . . . . . . . . . . . . . . 626--638
Amir Shpilka Affine projections of symmetric
polynomials . . . . . . . . . . . . . . 639--659
Elchanan Mossel and
Christopher Umans On the complexity of approximating the
VC dimension . . . . . . . . . . . . . . 660--671
Russell Impagliazzo and
Valentine Kabanets and
Avi Wigderson In search of an easy witness:
exponential time vs. probabilistic
polynomial time . . . . . . . . . . . . 672--694
William Hesse and
Eric Allender and
David A. Mix Barrington Uniform constant-depth threshold
circuits for division and iterated
multiplication . . . . . . . . . . . . . 695--716
Michal Koucký Universal traversal sequences with
backtracking . . . . . . . . . . . . . . 717--726
Anonymous Papers to Appear . . . . . . . . . . . . 727--727
Anonymous Volume Author Index . . . . . . . . . . 728--728
Anonymous C3 --- Advertisement . . . . . . . . . . ibc--ibc
Anonymous C4 --- TOC . . . . . . . . . . . . . . . obc--obc
Anonymous Editorial board . . . . . . . . . . . . ifc--ifc
Anonymous Advertisement #praise\_5X8\_els.pdf . . ii--ii
Anonymous Publisher's Note . . . . . . . . . . . . iii--iv
Georg Gottlob Guest Editor's Foreword . . . . . . . . 1--1
James F. Lynch Analysis and application of adaptive
sampling . . . . . . . . . . . . . . . . 2--19
Todd Millstein and
Alon Halevy and
Marc Friedman Query containment for data integration
systems . . . . . . . . . . . . . . . . 20--39
Marc Spielmann Verification of relational transducers
for electronic commerce . . . . . . . . 40--65
Tova Milo and
Dan Suciu and
Victor Vianu Typechecking for XML transformers . . . 66--97
Zhiyuan Chen and
Flip Korn and
Nick Koudas and
S. Muthukrishnan Generalized substring selectivity
estimation . . . . . . . . . . . . . . . 98--132
Stéphane Grumbach and
Leonardo Tininini On the content of materialized aggregate
views . . . . . . . . . . . . . . . . . 133--168
Michael Benedikt and
Martin Grohe and
Leonid Libkin and
Luc Segoufin Reachability and connectivity queries in
constraint databases . . . . . . . . . . 169--206
Pankaj K. Agarwal and
Lars Arge and
Jeff Erickson Indexing Moving Points . . . . . . . . . 207--243
Jon Kleinberg and
Christos Papadimitriou and
Prabhakar Raghavan Auditing Boolean attributes . . . . . . 244--253
Wenfei Fan and
Jérôme Siméon Integrity constraints for XML . . . . . 254--291
Anonymous Papers to Appear . . . . . . . . . . . . 292--292
Anonymous Advertisement #HA08111M . . . . . . . . ibc--ibc
Anonymous Ed. Board . . . . . . . . . . . . . . . ifc--ifc
Anonymous TOC . . . . . . . . . . . . . . . . . . obc--obc
Anonymous Advertisement #HA05062O (FTP file \tt
HA05062ABCNOP.pdf.sea) . . . . . . . . . ii--ii
Vincenza Carchiolo and
Michele Malgeri and
Giuseppe Mangioni TTL: a modular language for
hardware/software systems design . . . . 293--315
Simone Tini An axiomatic semantics for the
synchronous language Gentzen . . . . . . 316--348
Hans Kellerer and
Renata Mansini and
Ulrich Pferschy and
Maria Grazia Speranza An efficient fully polynomial
approximation scheme for the Subset-Sum
Problem . . . . . . . . . . . . . . . . 349--370
Marcos Kiwi and
Frédéric Magniez and
Miklos Santha Approximate testing with error relative
to input size . . . . . . . . . . . . . 371--392
M. Reynolds The complexity of the temporal logic
with ``until'' over general linear time 393--426
Anonymous Papers to Appear . . . . . . . . . . . . 427--427
Anonymous C3 --- Advertisement #better\_5X8\_els
(FTP file #better\_5X8\_els.pdf) in
generic folder . . . . . . . . . . . . . ibc--ibc
Anonymous C1--C2 Ed. Board . . . . . . . . . . . . ifc--ifc
Anonymous C4 --- TOC . . . . . . . . . . . . . . . obc--obc
Anonymous Blank . . . . . . . . . . . . . . . . . III
Anonymous Advertisement #HA03022M (FTP file
HA03022LMS.sea) . . . . . . . . . . . . IV
Anonymous Advertisement #HA05062O (FTP file
HA05062ABCNOP.pdf.sea) . . . . . . . . . V
Anonymous Advertisement #AM01053M (FTP file
HA01053LMS.zip) . . . . . . . . . . . . VI
Hirotada Kobayashi and
Keiji Matsumoto Quantum multi-prover interactive proof
systems with limited prior entanglement 429--450
Viliam Geffert Translation of binary regular
expressions into nondeterministic $
\epsilon $-free automata with $ O(n \log
n)$ transitions . . . . . . . . . . . . 451--472
Martin Sauerhoff Guess-and-verify versus unrestricted
nondeterminism for OBDDs and one-way
Turing machines . . . . . . . . . . . . 473--495
Shai Ben-David and
Nadav Eiron and
Philip M. Long On the difficulty of approximately
maximizing agreements . . . . . . . . . 496--514
Bruno Gaujal and
Stefan Haar and
Jean Mairesse Blocking a transition in a free choice
net and what it tells about its
throughput . . . . . . . . . . . . . . . 515--548
Birgit Jenner and
Johannes Köbler and
Pierre McKenzie and
Jacobo Torán Completeness results for graph
isomorphism . . . . . . . . . . . . . . 549--566
Monika R. Henzinger and
Stefano Leonardi Scheduling multicasts on unit-capacity
trees and meshes . . . . . . . . . . . . 567--611
Anonymous Papers to Appear . . . . . . . . . . . . 612--612
Anonymous C3 --- Advertisement #HA06043M (FTP file
HA06043LMSU.zip) . . . . . . . . . . . . ibc--ibc
Anonymous C2 --- Ed. Board . . . . . . . . . . . . ifc--ifc
Anonymous C4 --- TOC . . . . . . . . . . . . . . . obc--obc
Anonymous Volume TOC . . . . . . . . . . . . . . . III--V
Anonymous Advertisement #HA03022M (FTP file
HA03022LMS.sea) . . . . . . . . . . . . IX
Anonymous Advertisement #HA05062N (FTP file \tt
HA05062ABCNOP.pdf.sea) . . . . . . . . . X
Anonymous Advertisement #AM01053M (FTP file
AM01053LMS.zip) . . . . . . . . . . . . XI
Peter Buneman Guest Editor's Foreword . . . . . . . . 613--613
Ronald Fagin and
Amnon Lotem and
Moni Naor Optimal aggregation algorithms for
middleware . . . . . . . . . . . . . . . 614--656
Kim S. Larsen Relaxed multi-way trees with group
updates . . . . . . . . . . . . . . . . 657--670
Dimitris Achlioptas Database-friendly random projections:
Johnson--Lindenstrauss with binary coins 671--687
Noga Alon and
Tova Milo and
Frank Neven and
Dan Suciu and
Victor Vianu XML with data values: typechecking
revisited . . . . . . . . . . . . . . . 688--727
Nilesh N. Dalvi and
Sumit K. Sanghai and
Prasan Roy and
S. Sudarshan Pipelining in multi-query optimization 728--762
Paolo Ferragina and
Nick Koudas and
S. Muthukrishnan and
Divesh Srivastava Two-dimensional substring indexing . . . 763--774
Georg Gottlob and
Nicola Leone and
Francesco Scarcello Robbers, marshals, and guards: game
theoretic and logical characterizations
of hypertree width . . . . . . . . . . . 775--808
Anand Rajaraman and
Jeffrey D. Ullman Querying websites using compact
skeletons . . . . . . . . . . . . . . . 809--851
Anonymous Papers to Appear . . . . . . . . . . . . 852--852
Anonymous Volume Author Index . . . . . . . . . . 853--853
Anonymous C3 --- Advertisement #HA06043M (FTP file
HA06043LMSU.zip) . . . . . . . . . . . . ibc--ibc
Anonymous C2 --- Ed. Board . . . . . . . . . . . . ifc--ifc
Anonymous C4 --- TOC . . . . . . . . . . . . . . . obc--obc
Anonymous Ad #HA06043M (FTP file HA06043LMSU.zip) ii--ii
Anonymous Ad #econdirectM (FTP file
econdirectLMS.zip) . . . . . . . . . . . III
Hwakyung Rim and
Ju-wook Jang and
Sungchun Kim A simple reduction of non-uniformity in
dynamic load balancing of quantized
loads on hypercube multiprocessors and
hiding balancing overheads . . . . . . . 1--25
Shlomi Dolev and
Sergio Rajsbaum Stability of long-lived consensus . . . 26--45
Peter Damaschke On parallel attribute-efficient learning 46--62
William Gasarch and
Evan Golub and
Clyde Kruskal Constant time parallel sorting: an
empirical view . . . . . . . . . . . . . 63--91
Edith Cohen and
Haim Kaplan and
Uri Zwick Connection caching: model and algorithms 92--126
K. Meinke Proof theory of higher-order equations:
conservativity, normal forms and term
rewriting . . . . . . . . . . . . . . . 127--173
J.-P. Allouche and
G. Skordev Remarks on permutive cellular automata 174--182
Marek Chrobak and
Leah Epstein and
John Noga and
Ji\vrí Sgall and
Robvan Stee and
Tomá\vs Tichýd and
Nodari Vakhania Preemptive scheduling in overloaded
systems . . . . . . . . . . . . . . . . 183--197
Abhiram G. Ranade Scheduling loosely connected task graphs 198--208
Anonymous Papers to Appear . . . . . . . . . . . . 209--209
Anonymous C3 --- Ad #AM01053M (FTP file
AM01053LMS.zip) . . . . . . . . . . . . ibc--ibc
Anonymous C2 --- Ed. Board . . . . . . . . . . . . ifc--ifc
Anonymous C4 --- TOC . . . . . . . . . . . . . . . obc--obc
Anonymous Advertisement: AS007M (FTP file
AS007M.pdf) . . . . . . . . . . . . . . ii--ii
Anonymous Advertisement: AS004M (FTP file
AS004M.pdf) . . . . . . . . . . . . . . III
John H. Reif Guest Editor's Foreword . . . . . . . . 211--211
Noga Alon and
W. Fernandez de la Vega and
Ravi Kannan and
Marek Karpinski Random sampling and approximation of
MAX-CSPs . . . . . . . . . . . . . . . . 212--243
Saugata Basu Computing the Betti numbers of
arrangements via spectral sequences . . 244--262
Steve Chien and
Lars Rasmussen and
Alistair Sinclair Clifford algebras and approximating the
permanent . . . . . . . . . . . . . . . 263--290
Mary Cryan and
Martin Dyer A polynomial-time algorithm to
approximately count contingency tables
when the number of rows is constant . . 291--310
Xiaotie Deng and
Christos Papadimitriou and
Shmuel Safra On the complexity of price equilibria 311--324
Sanjeev Arora and
Subhash Khot Fitting algebraic curves to noisy data 325--340
Tim Roughgarden The price of anarchy is independent of
the network topology . . . . . . . . . . 341--364
Marcus Schaefer and
Eric Sedgwick and
Daniel Stefankovic Recognizing string graphs in NP . . . . 365--380
Gerth Stòlting Brodal and
George Lagogiannis and
Christos Makris and
Athanasios Tsakalidis and
Kostas Tsichlas Optimal finger search trees in the
pointer machine . . . . . . . . . . . . 381--418
Christopher Umans Pseudo-random generators for all
hardnesses . . . . . . . . . . . . . . . 419--440
Dimitris Achlioptas and
Cristopher Moore Almost all graphs with average degree 4
are $3$-colorable . . . . . . . . . . . 441--471
Anonymous Papers to Appear . . . . . . . . . . . . 472--472
Anonymous C3 --- AS008M (FTP file AS008M.pdf) . . ibc--ibc
Anonymous C4 --- TOC . . . . . . . . . . . . . . . obc--obc
Anonymous Ed. Board . . . . . . . . . . . . . . . ifc--ifc
Anonymous sdmathM (FTP file sdmathLMS.zip) . . . . ii--ii
Venkatesan Guruswami and
Sanjeev Khanna and
Rajmohan Rajaraman and
Bruce Shepherd and
Mihalis Yannakakis Near-optimal hardness results and
approximation algorithms for
edge-disjoint paths and related problems 473--496
Olivier Ly Automatic graphs and D0L-sequences of
finite graphs . . . . . . . . . . . . . 497--545
Sanjay Jain and
Efim Kinber Intrinsic complexity of learning
geometrical concepts from positive data 546--607
Christopher M. Homan and
Mayur Thakur One-way permutations and self-witnessing
languages . . . . . . . . . . . . . . . 608--622
Chunguang Li and
Xiaofeng Liao and
Juebang Yu Complex-valued wavelet network . . . . . 623--632
Aravind Srinivasan On the approximability of clique and
related maximization problems . . . . . 633--651
Anonymous Papers to Appear . . . . . . . . . . . . 652--652
Anonymous Ed. Board . . . . . . . . . . . . . . . ifc--ifc
Anonymous HA11093M (FTP file HA11093LMS.zip) . . . ibc--ibc
Anonymous TOC . . . . . . . . . . . . . . . . . . obc--obc
Anonymous Advertisement . . . . . . . . . . . . . ii--ii
Anonymous Volume TOC . . . . . . . . . . . . . . . III--V
Jianer Chen and
Michael R. Fellows Foreword from the guest editors . . . . 653--653
Marco Cesati The Turing way to parameterized
complexity . . . . . . . . . . . . . . . 654--685
Carlos Cotta and
Pablo Moscato The $k$-Feature Set problem is $
W[2]$-complete . . . . . . . . . . . . . 686--690
James Cheetham and
Frank Dehne and
Andrew Rau-Chaplin and
Ulrike Stege and
Peter J. Taillon Solving large FPT problems on
coarse-grained parallel machines . . . . 691--706
R. Sai Anand and
Thomas Erlebach and
Alexander Hall and
Stamatis Stefanakos Call control with k rejections . . . . . 707--722
Jens Gramm and
Rolf Niedermeier A fixed-parameter algorithm for minimum
quartet inconsistency . . . . . . . . . 723--741
J. A. Makowsky and
J. P. Mariño The parametrized complexity of knot
polynomials . . . . . . . . . . . . . . 742--756
Krzysztof Pietrzak On the parameterized complexity of the
fixed alphabet shortest common
supersequence and longest common
subsequence problems . . . . . . . . . . 757--771
Peter Heusch and
Stefan Porschen and
Ewald Speckenmeyer Improving a fixed parameter tractability
time bound for the shadow problem . . . 772--788
Liming Cai and
David Juedes On the existence of subexponential
parameterized algorithms . . . . . . . . 789--807
Jochen Alber and
Henning Fernau and
Rolf Niedermeier Graph separators: a parameterized view 808--832
Jianer Chen and
Iyad A. Kanj Constrained minimum vertex cover in
bipartite graphs: complexity and
parameterized algorithms . . . . . . . . 833--847
Anonymous Papers to Appear . . . . . . . . . . . . 848--848
Anonymous Volume Author Index . . . . . . . . . . 849--849
Anonymous C3 --- Advertisement . . . . . . . . . . ibc--ibc
Anonymous C4 --- TOC . . . . . . . . . . . . . . . obc--obc
Anonymous Ed. Board . . . . . . . . . . . . . . . ifc--ifc
Anonymous Advertisement . . . . . . . . . . . . . ii--ii
Anonymous Advertisement . . . . . . . . . . . . . III
Anonymous Advertisement . . . . . . . . . . . . . IV
Anonymous Advertisement . . . . . . . . . . . . . V
Alexandru Mateescu and
Arto Salomaa and
Sheng Yu Subword histories and Parikh matrices 1--21
Kwok Pui Choi and
Louxin Zhang Sensitivity analysis and efficient
method for identifying optimal spaced
seeds . . . . . . . . . . . . . . . . . 22--40
Ng\.oc-Minh Lê Abstract Voronoi diagram in $3$-space 41--79
Luca Becchetti and
Stefano Leonardi and
S. Muthukrishnan Average stretch without migration . . . 80--95
Rod G. Downey and
Denis R. Hirschfeldt and
Geoff LaForte Randomness and reducibility . . . . . . 96--114
Deng-Feng Li Some measures of dissimilarity in
intuitionistic fuzzy structures . . . . 115--122
E. Anceaume and
A. Fernández and
A. Mostefaoui and
G. Neiger and
M. Raynal A necessary and sufficient condition for
transforming limited accuracy failure
detectors . . . . . . . . . . . . . . . 123--133
Wolfgang Merkle and
Frank Stephan Trees and learning . . . . . . . . . . . 134--156
James H. Anderson and
Anand Srinivasan Mixed Pfair/ERfair scheduling of
asynchronous periodic tasks . . . . . . 157--204
Nader H. Bshouty and
Jeffrey C. Jackson and
Christino Tamon More efficient PAC-learning of DNF with
membership queries under the uniform
distribution . . . . . . . . . . . . . . 205--234
Anonymous Papers to Appear . . . . . . . . . . . . 235--235
Anonymous C3 --- Advertisement . . . . . . . . . . ibc--ibc
Anonymous C2 --- Ed. Board . . . . . . . . . . . . ifc--ifc
Anonymous C4 --- TOC . . . . . . . . . . . . . . . obc--obc
Sampath Kannan and
Mihalis Yannakakis Guest Editors' foreword . . . . . . . . 237--237
Dimitris Achlioptas and
Paul Beame and
Michael Molloy A sharp threshold in proof complexity
yields lower bounds for satisfiability
search . . . . . . . . . . . . . . . . . 238--268
Bernard Chazelle and
Ding Liu Lower bounds for intersection searching
and fractional cascading in higher
dimension . . . . . . . . . . . . . . . 269--284
Martin Grohe Computing crossing numbers in quadratic
time . . . . . . . . . . . . . . . . . . 285--302
Adam R. Klivans and
Rocco A. Servedio Learning DNF in time $ 2^{O(n^{1 / 3})}
$ . . . . . . . . . . . . . . . . . . . 303--318
Marcus Schaefer and
Daniel \vStefankovi\vc Decidability of string graphs . . . . . 319--334
John Dunagan and
Santosh Vempala Optimal outlier removal in
high-dimensional spaces . . . . . . . . 335--373
Luca de Alfaro and
Rupak Majumdar Quantitative solution of omega-regular
games . . . . . . . . . . . . . . . . . 374--397
Andris Ambainis A new protocol and lower bounds for
quantum coin flipping . . . . . . . . . 398--416
Moses Charikar and
Rina Panigrahy Clustering to minimize the sum of
cluster diameters . . . . . . . . . . . 417--441
Michel X. Goemans and
David P. Williamson Approximation algorithms for Max-3-Cut
and other problems via complex
semidefinite programming . . . . . . . . 442--470
Anonymous Papers to Appear . . . . . . . . . . . . 471--471
Anonymous C2 --- Ed. Board . . . . . . . . . . . . ifc--ifc
Anonymous C4 --- TOC . . . . . . . . . . . . . . . obc--obc
Narayan Vikas Computational complexity of compaction
to irreflexive cycles . . . . . . . . . 473--496
Wojciech Palacz Algebraic hierarchical graph
transformation . . . . . . . . . . . . . 497--520
P. Kuusela and
D. Ocone Learning with side information: PAC
learning bounds . . . . . . . . . . . . 521--545
Etienne Grandjean and
Frédéric Olive Graph properties checkable in linear
time in the number of vertices . . . . . 546--597
Hung-Min Sun and
Bing-Chang Chen and
Her-Tyan Yeh On the design of time-stamped signatures 598--610
Frank Drewes and
Joost Engelfriet Branching synchronization grammars with
nested tables . . . . . . . . . . . . . 611--656
Christopher M. Homan Tight lower bounds on the ambiguity of
strong, total, associative, one-way
functions . . . . . . . . . . . . . . . 657--674
Pavol Duris and
Juraj Hromkovic and
Katsushi Inoue On the power of nondeterminism and Las
Vegas randomization for two-dimensional
finite automata . . . . . . . . . . . . 675--699
Anonymous Papers to Appear . . . . . . . . . . . . 700--700
Anonymous C2 --- Ed. Board . . . . . . . . . . . . ifc--ifc
Anonymous C4 --- TOC . . . . . . . . . . . . . . . obc--obc
Anonymous Volume TOC . . . . . . . . . . . . . . . III--V
Edith Cohen and
Venkatesan Guruswami Guest Editors' foreword . . . . . . . . 701--701
Ziv Bar-Yossef and
T. S. Jayram and
Ravi Kumar and
D. Sivakumar An information statistics approach to
data stream and communication complexity 702--732
Jon Feldman and
David R. Karger Decoding turbo-like codes via linear
programming . . . . . . . . . . . . . . 733--752
Eldar Fischer and
Guy Kindler and
Dana Ron and
Shmuel Safra and
Alex Samorodnitsky Testing juntas . . . . . . . . . . . . . 753--787
Gianni Franceschini and
Roberto Grossi and
J. Ian Munro and
Linda Pagli Implicit B-trees: a new data structure
for the dictionary problem . . . . . . . 788--807
Adam R. Klivans and
Ryan O'Donnell and
Rocco A. Servedio Learning intersections and thresholds of
halfspaces . . . . . . . . . . . . . . . 808--840
Santosh Vempala and
Grant Wang A spectral algorithm for learning
mixture models . . . . . . . . . . . . . 841--860
Anonymous Papers to Appear . . . . . . . . . . . . 861--861
Anonymous Volume Author Index . . . . . . . . . . 862--862
Anonymous C2 --- Ed. Board . . . . . . . . . . . . ifc--ifc
Anonymous C4 --- TOC . . . . . . . . . . . . . . . obc--obc
Anne Condon Guest Editor's foreword . . . . . . . . 1--2
Alexander A. Razborov Resolution lower bounds for perfect
matching principles . . . . . . . . . . 3--27
Frederic Green The correlation between parity and
quadratic polynomials mod 3 . . . . . . 28--44
Uriel Feige and
Daniele Micciancio The inapproximability of lattice and
coding problems with preprocessing . . . 45--67
Ryan O'Donnell Hardness amplification within NP . . . . 68--94
Anonymous Papers to Appear . . . . . . . . . . . . 95--95
Anonymous C2 --- Ed. Board . . . . . . . . . . . . ifc--ifc
Anonymous C4 --- TOC . . . . . . . . . . . . . . . obc--obc
John M. Hitchcock and
Jack H. Lutz and
Elvira Mayordomo Scaled dimension and nonuniform
complexity . . . . . . . . . . . . . . . 97--122
John Case and
Sanjay Jain and
Frank Stephan and
Rolf Wiehagen Robust learning-rich and poor . . . . . 123--165
Erik D. Demaine and
Mohammad Taghi Hajiaghayi and
Naomi Nishimura and
Prabhakar Ragde and
Dimitrios M. Thilikos Approximation algorithms for classes of
graphs excluding single-crossing graphs
as minors . . . . . . . . . . . . . . . 166--195
Deepak Chawla and
Lin Li and
Stephen Scott On approximating weighted sums with
exponentially many terms . . . . . . . . 196--234
Boris Alexeev Minimal DFA for testing divisibility . . 235--243
Howard Barnum and
Michael Saks A lower bound on the quantum query
complexity of read-once functions . . . 244--258
Carsten Damm and
Matthias Krause and
Christoph Meinel and
Stephan Waack On relations between counting
communication complexity classes . . . . 259--280
Andrew Lomonosov and
Meera Sitharam and
Kihong Park Network QoS games: stability vs
optimality tradeoff . . . . . . . . . . 281--302
Anonymous Papers to Appear . . . . . . . . . . . . 303--303
Anonymous Contents . . . . . . . . . . . . . . . . obc--obc
Anonymous C2 --- Ed. Board . . . . . . . . . . . . ifc--ifc
Sanjeev Khanna and
Aravind Srinivasan Special issue: 35th Annual ACM Symposium
on Theory of Computing . . . . . . . . . 305--305
Rene Beier and
Berthold Vöcking Random knapsack in expected polynomial
time . . . . . . . . . . . . . . . . . . 306--329
Mikkel Thorup Integer priority queues with decrease
key in constant time and the single
source shortest paths problem . . . . . 330--353
Noga Alon and
Asaf Shapira Testing subgraphs in directed graphs . . 354--382
Yossi Azar and
Edith Cohen and
Amos Fiat and
Haim Kaplan and
Harald Räcke Optimal oblivious routing in polynomial
time . . . . . . . . . . . . . . . . . . 383--394
Iordanis Kerenidis and
Ronald de Wolf Exponential lower bound for $2$-query
locally decodable codes via a quantum
argument . . . . . . . . . . . . . . . . 395--420
Elchanan Mossel and
Ryan O'Donnell and
Rocco A. Servedio Learning functions of k relevant
variables . . . . . . . . . . . . . . . 421--434
T. S. Jayram and
Subhash Khot and
Ravi Kumar and
Yuval Rabani Cell-probe lower bounds for the partial
match problem . . . . . . . . . . . . . 435--447
Leonid Gurvits Classical complexity and quantum
entanglement . . . . . . . . . . . . . . 448--484
Jittat Fakcharoenphol and
Satish Rao and
Kunal Talwar A tight bound on approximating arbitrary
metrics by tree metrics . . . . . . . . 485--497
Anonymous Papers to Appear . . . . . . . . . . . . 498--498
Anonymous C2 --- Ed. Board . . . . . . . . . . . . ifc--ifc
Anonymous C4 --- TOC . . . . . . . . . . . . . . . obc--obc
Anonymous Volume TOC . . . . . . . . . . . . . . . III--V
Mitsunori Ogihara and
Till Tantau On the reducibility of sets inside NP to
sets with low information content . . . 499--524
Dan Gusfield and
Jens Stoye Linear time algorithms for finding and
representing all the tandem repeats in a
string . . . . . . . . . . . . . . . . . 525--546
Reuven Bar-Yehuda and
Zehavit Kehat Approximating the dense set-cover
problem . . . . . . . . . . . . . . . . 547--561
Eric Bach and
Susan Coppersmith and
Marcel Paz Goldschen and
Robert Joynt and
John Watrous One-dimensional quantum walks with
absorbing boundaries . . . . . . . . . . 562--592
Wolfgang Maass and
Henry Markram On the computational power of circuits
of spiking neurons . . . . . . . . . . . 593--616
Luc Vandeurzen and
Marc Gyssens and
Dirk Van Gucht An expressive language for linear
spatial database queries . . . . . . . . 617--655
Stefan Szeider Minimal unsatisfiable formulas with
bounded clause-variable difference are
fixed-parameter tractable . . . . . . . 656--674
Ning Chen and
Xiaotie Deng and
Xiaoming Sun On complexity of single-minded auction 675--687
He Huang and
Jinde Cao and
Yuzhong Qu Global robust stability of delayed
neural networks with a class of general
activation functions . . . . . . . . . . 688--700
Anonymous Papers to Appear . . . . . . . . . . . . 701--701
Anonymous Volume Author Index . . . . . . . . . . 702--702
Anonymous C2 --- Ed. Board . . . . . . . . . . . . ifc--ifc
Anonymous C4 --- TOC . . . . . . . . . . . . . . . obc--obc
Sergio Flesca and
Sergio Greco Partially ordered regular languages for
graph queries . . . . . . . . . . . . . 1--25
Chongfu Huang and
Claudio Moraga Extracting fuzzy if-then rules by using
the information matrix technique . . . . 26--52
Robert A. Legenstein and
Wolfgang Maass Wire length as a circuit complexity
measure . . . . . . . . . . . . . . . . 53--72
Deng-Feng Li Multiattribute decision making models
and methods using intuitionistic fuzzy
sets . . . . . . . . . . . . . . . . . . 73--85
Jin Hyun Son and
Jung Sun Kim and
Myoung Ho Kim Extracting the workflow critical path
from the extended well-formed workflow
schema . . . . . . . . . . . . . . . . . 86--106
Wenxing Zhu A provable better Branch and Bound
method for a nonconvex integer quadratic
programming problem . . . . . . . . . . 107--117
Guy Even and
Peter-M. Seidel and
Warren E. Ferguson A parametric error analysis of
Goldschmidt's division algorithm . . . . 118--139
Sun-Yuan Hsieh Efficiently parallelizable problems on a
class of decomposable graphs . . . . . . 140--156
Lila Kari and
Stavros Konstantinidis Language equations, maximality and
error-detection . . . . . . . . . . . . 157--178
Anonymous Papers to Appear . . . . . . . . . . . . 179--179
Anonymous C2 --- Ed. Board . . . . . . . . . . . . ifc--ifc
Anonymous C4 --- TOC . . . . . . . . . . . . . . . obc--obc
David A. Mix Barrington and
Neil Immerman and
Clemens Lautemann and
Nicole Schweikardt and
Denis Thérien First-order expressibility of languages
with neutral letters or: The Crane Beach
conjecture . . . . . . . . . . . . . . . 101--127
Michael H. Goldwasser and
Ming-Yang Kao and
Hsueh-I Lu Linear-time algorithms for computing
maximum-density sequence segments with
bioinformatics applications . . . . . . 128--144
Susanne Albers and
Lene M. Favrholdt and
Oliver Giel On paging with locality of reference . . 145--175
Daowen Qiu and
Huaiqing Wang A probabilistic model of computing with
words . . . . . . . . . . . . . . . . . 176--200
Jia Lee and
Susumu Adachi and
Ferdinand Peper and
Shinro Mashiko Delay-insensitive computation in
asynchronous cellular automata . . . . . 201--220
Frank Neven Attribute grammars for unranked trees as
a query language for structured
documents . . . . . . . . . . . . . . . 221--257
Antonella Santone and
Gigliola Vaglini A local approach for temporal model
checking of Java bytecode . . . . . . . 258--281
Anonymous Papers to Appear . . . . . . . . . . . . 282--282
Anonymous C2 --- Ed. Board . . . . . . . . . . . . CO2
Anonymous C4 --- TOC . . . . . . . . . . . . . . . CO4
Richard Karp and
Ming Li and
Pavel Pevzner and
Ron Shamir Guest Editors' foreword . . . . . . . . 283--283
Lusheng Wang and
Daming Zhu and
Xiaowen Liu and
Shaohan Ma An O(n2) algorithm for signed
translocation . . . . . . . . . . . . . 284--299
Tzvika Hartman and
Roded Sharan A 1.5-approximation algorithm for
sorting by transpositions and
transreversals . . . . . . . . . . . . . 300--320
Haim Kaplan and
Elad Verbin Sorting signed permutations by
reversals, revisited . . . . . . . . . . 321--341
Jeremy Buhler and
Uri Keich and
Yanni Sun Designing seeds for similarity search in
genomic DNA . . . . . . . . . . . . . . 342--363
Brona Brejová and
Daniel G. Brown and
Tomás Vinar Vector seeds: an extension to spaced
seeds . . . . . . . . . . . . . . . . . 364--380
Dan Gusfield Optimal, efficient reconstruction of
root-unknown phylogenetic networks with
constrained and structured recombination 381--398
Yonatan Aumann and
Efrat Manisterski and
Zohar Yakhini Designing optimally multiplexed SNP
genotyping assays . . . . . . . . . . . 399--417
Bin Ma and
Kaizhong Zhang and
Chengzhi Liang An effective algorithm for peptide de
novo sequencing from MS/MS spectra . . . 418--430
Anonymous Papers to Appear . . . . . . . . . . . . 431--431
Anonymous C2 --- Ed. Board . . . . . . . . . . . . CO2
Anonymous C4 --- TOC . . . . . . . . . . . . . . . CO4
Anonymous Volume TOC . . . . . . . . . . . . . . . III--V
Robert Sloan Special issue on computational learning
theory . . . . . . . . . . . . . . . . . 433--434
Lisa Hellerstein and
Vijay Raghavan Exact learning of DNF formulas using DNF
hypotheses . . . . . . . . . . . . . . . 435--470
Nader H. Bshouty and
Jeffrey C. Jackson and
Christino Tamon Exploring learnability between exact and
PAC . . . . . . . . . . . . . . . . . . 471--484
Ke Yang New lower bounds for statistical query
learning . . . . . . . . . . . . . . . . 485--509
Sandra Zilles Increasing the power of uniform
inductive learners . . . . . . . . . . . 510--538
Michael V. Vyugin and
Vladimir V. V'yugin Predictive complexity and information 539--554
Sanjoy Dasgupta and
Philip M. Long Performance guarantees for hierarchical
clustering . . . . . . . . . . . . . . . 555--569
Lance Fortnow and
Jack H. Lutz Prediction and dimension . . . . . . . . 570--589
Anonymous Papers to Appear . . . . . . . . . . . . 590--590
Anonymous Volume Author Index . . . . . . . . . . 591--591
Anonymous C2 --- Ed. Board . . . . . . . . . . . . CO2
Anonymous C4 --- TOC . . . . . . . . . . . . . . . CO4
Manuel Koch and
L. V. Mancini and
Francesco Parisi-Presicce Graph-based specification of access
control policies . . . . . . . . . . . . 1--33
Ruggero Lanotte and
Andrea Maggiolo-Schettini Monotonic hybrid systems . . . . . . . . 34--69
Tetz C. Huang A self-stabilizing algorithm for the
shortest path problem assuming
read/write atomicity . . . . . . . . . . 70--85
John H. Reif Efficient parallel factorization and
solution of structured and unstructured
linear systems . . . . . . . . . . . . . 86--143
Anonymous Papers to Appear . . . . . . . . . . . . 144--144
Anonymous C2 --- Ed. Board . . . . . . . . . . . . CO2
Anonymous C4 --- TOC . . . . . . . . . . . . . . . CO4
Piotr Berman and
Bhaskar DasGupta and
Ming-Yang Kao Tight approximability results for test
set problems in bioinformatics . . . . . 145--162
Baowen Xu and
Yuming Zhou and
Hongmin Lu An improved accuracy measure for rough
sets . . . . . . . . . . . . . . . . . . 163--173
Gregory Gutin and
Ton Kloks and
Chuan Min Lee and
Anders Yeo Kernels in planar digraphs . . . . . . . 174--184
Eike Kiltz and
Hans Ulrich Simon Threshold circuit lower bounds on
cryptographic functions . . . . . . . . 185--212
Amos Beimel and
Yuval Ishai and
Eyal Kushilevitz General constructions for
information-theoretic private
information retrieval . . . . . . . . . 213--247
Anonymous Papers to Appear . . . . . . . . . . . . 248--248
Anonymous C2 --- Ed. Board . . . . . . . . . . . . CO2
Anonymous C4 --- TOC . . . . . . . . . . . . . . . CO4
Sally Goldman Special Issue: Learning Theory 2003 . . 249--249
Nader H. Bshouty and
Elchanan Mossel and
Ryan O'Donnell and
Rocco A. Servedio Learning DNF from random walks . . . . . 250--265
Adam Tauman Kalai and
Rocco A. Servedio Boosting in the presence of noise . . . 266--290
Adam Kalai and
Santosh Vempala Efficient algorithms for online decision
problems . . . . . . . . . . . . . . . . 291--307
John Case and
Sanjay Jain and
Franco Montagna and
Giulia Simi and
Andrea Sorbi On learning to coordinate: random bits
help, insightful normal forms, and
competency isomorphisms . . . . . . . . 308--332
Matthias Hein and
Olivier Bousquet and
Bernhard Schölkopf Maximal margin classification for metric
spaces . . . . . . . . . . . . . . . . . 333--359
Moses Charikar and
Venkatesan Guruswami and
Anthony Wirth Clustering with qualitative information 360--383
Anonymous Papers to Appear . . . . . . . . . . . . 384--384
Anonymous C2 --- Ed. Board . . . . . . . . . . . . CO2
Anonymous C4 --- TOC . . . . . . . . . . . . . . . CO4
Anonymous Learning Theory 2003 . . . . . . . . . . ??
Jochen Alber and
Hongbing Fan and
Michael R. Fellows and
Henning Fernau and
Rolf Niedermeier and
Fran Rosamond and
Ulrike Stege A refined search tree technique for
Dominating Set on planar graphs . . . . 385--405
Narayan Vikas A complete and equal computational
complexity classification of compaction
and retraction to all graphs with at
most four vertices and some general
results . . . . . . . . . . . . . . . . 406--439
Jonathan Goldstine and
Hing Leung and
Detlef Wotschke Measuring nondeterminism in pushdown
automata . . . . . . . . . . . . . . . . 440--466
Devdatt Dubhashi and
Alessandro Mei and
Alessandro Panconesi and
Jaikumar Radhakrishnan and
Aravind Srinivasan Fast distributed algorithms for (weakly)
connected dominating sets and
linear-size skeletons . . . . . . . . . 467--479
Mehmet Hakan Karaata An optimal self-stabilizing
strarvation-free alternator . . . . . . 480--494
Stavros G. Kolliopoulos and
Neal E. Young Approximation algorithms for
covering/packing integer programs . . . 495--505
Juha Honkala An $ n^2$-bound for the ultimate
equivalence problem of certain D0L
systems over an $n$-letter alphabet . . 506--519
Philipp Woelfel Bounds on the OBDD-size of integer
multiplication via universal hashing . . 520--534
Roberta Gori and
Giorgio Levi On the verification of finite failure 535--575
Anonymous Papers to Appear . . . . . . . . . . . . 576--576
Anonymous C2 --- Ed. Board . . . . . . . . . . . . CO2
Anonymous C4 --- TOC . . . . . . . . . . . . . . . CO4
Daniel R. Dooly and
Sally A. Goldman and
Stephen S. Kwek Real-valued multiple-instance learning
with queries . . . . . . . . . . . . . . 1--15
Rajiv Gandhi and
Eran Halperin and
Samir Khuller and
Guy Kortsarz and
Aravind Srinivasan An improved approximation algorithm for
vertex cover with hard capacities . . . 16--33
Jörg Flum and
Martin Grohe and
Mark Weyer Bounded fixed-parameter tractability and
log2n nondeterministic bits . . . . . . 34--71
Roni Khardon and
Marta Arias The subsumption lattice and query
learning . . . . . . . . . . . . . . . . 72--94
Marcus Hutter Sequential predictions based on
algorithmic complexity . . . . . . . . . 95--117
Matthew Andrews and
Lisa Zhang Minimizing maximum fiber requirement in
optical networks . . . . . . . . . . . . 118--131
Leah Epstein and
Tamir Tassa Optimal preemptive scheduling for
general target functions . . . . . . . . 132--162
Pierre McKenzie and
Thomas Schwentick and
Denis Thérien and
Heribert Vollmer The many faces of a translation . . . . 163--179
G. Geeraerts and
J.-F. Raskin and
L. Van Begin Expand, Enlarge and Check: New
algorithms for the coverability problem
of WSTS . . . . . . . . . . . . . . . . 180--203
Anonymous Papers to Appear . . . . . . . . . . . . 204--204
Anonymous C2 --- Ed. Board . . . . . . . . . . . . CO2
Anonymous C4 --- TOC . . . . . . . . . . . . . . . CO4
Chandra Chekuri and
Daniele Micciancio Special Issue: FOCS 2003 . . . . . . . . 205--205
Subhash Khot Hardness of approximating the Shortest
Vector Problem in high $ \ell_p $ norms 206--219
Andris Ambainis Polynomial degree vs. quantum query
complexity . . . . . . . . . . . . . . . 220--238
Milena Mihail and
Christos Papadimitriou and
Amin Saberi On certain connectivity properties of
the Internet topology . . . . . . . . . 239--251
Nayantara Bhatnagar and
Parikshit Gopalan and
Richard J. Lipton Symmetric polynomials over $ \mathbb
{Z}_m $ and simultaneous communication
protocols . . . . . . . . . . . . . . . 252--285
Russell Impagliazzo and
Bruce M. Kapron Logics for reasoning about cryptographic
constructions . . . . . . . . . . . . . 286--320
Boaz Barak and
Yehuda Lindell and
Salil Vadhan Lower bounds for non-black-box zero
knowledge . . . . . . . . . . . . . . . 321--391
László Lovász and
Santosh Vempala Simulated annealing in convex bodies and
an O*(n4) volume algorithm . . . . . . . 392--417
Anonymous Papers to Appear . . . . . . . . . . . . 418--418
Anonymous C2 --- Ed. Board . . . . . . . . . . . . CO2
Anonymous C4 --- TOC . . . . . . . . . . . . . . . CO4
Fan Chung Graham Foreword . . . . . . . . . . . . . . . . 419--419
Fan Chung Graham A brief overview of network algorithms 420--424
C. Greg Plaxton Approximation algorithms for
hierarchical location problems . . . . . 425--443
Richard Cole and
Yevgeniy Dodis and
Tim Roughgarden How much can taxes help selfish routing? 444--467
Jiangzhuo Chen and
Rajmohan Rajaraman and
Ravi Sundaram Meet and merge: Approximation algorithms
for confluent flows . . . . . . . . . . 468--489
R. Elsässer and
L. G\kasieniec Radio communication in random graphs . . 490--506
Anonymous Papers to Appear . . . . . . . . . . . . 507--507
Anonymous C2 --- Ed. Board . . . . . . . . . . . . CO2
Anonymous C4 --- TOC . . . . . . . . . . . . . . . CO4
Lars Engebretsen and
Marek Karpinski TSP with bounded metrics . . . . . . . . 509--546
S. Demri and
F. Laroussinie and
Ph. Schnoebelen A parametric analysis of the
state-explosion problem in model
checking . . . . . . . . . . . . . . . . 547--575
David Gross-Amblard and
Michel de Rougemont Uniform generation in spatial constraint
databases and applications . . . . . . . 576--591
Yehuda Hassin and
David Peleg Average probe complexity in quorum
systems . . . . . . . . . . . . . . . . 592--616
Blaise Genest and
Anca Muscholl and
Helmut Seidl and
Marc Zeitoun Infinite-state high-level MSCs:
Model-checking and realizability . . . . 617--647
Michael Elkin and
Guy Kortsarz Sublogarithmic approximation for
telephone multicast . . . . . . . . . . 648--659
Holger Spakowski and
Rahul Tripathi LWPP and WPP are not uniformly
gap-definable . . . . . . . . . . . . . 660--689
Zuhua Shao Security of the design of time-stamped
signatures . . . . . . . . . . . . . . . 690--705
Li Chunlin and
Li Layuan A distributed multiple dimensional QoS
constrained resource scheduling
optimization policy in computational
grid . . . . . . . . . . . . . . . . . . 706--726
I-En Liao and
Cheng-Chi Lee and
Min-Shiang Hwang A password authentication scheme over
insecure networks . . . . . . . . . . . 727--740
Hui-Cheng Xia and
Deng-Feng Li and
Ji-Yan Zhou and
Jian-Ming Wang Fuzzy LINMAP method for multiattribute
decision making under fuzzy environments 741--759
John M. Hitchcock and
N. V. Vinodchandran Dimension, entropy rates, and
compression . . . . . . . . . . . . . . 760--782
Birgit Jenner and
Johannes Köbler and
Pierre McKenzie and
Jacobo Torán Corrigendum to ``Completeness results
for graph isomorphism'' [J. Comput.
System Sci. \bf 66 (2003) 549--566] . . 783--783
Anonymous Papers to appear in forthcoming issues 784--784
Anonymous Editorial Board . . . . . . . . . . . . CO2
Moses Charikar Guest Editor's foreword . . . . . . . . 785--785
Amnon Ta-Shma and
David Zuckerman and
Shmuel Safra Extractors from Reed--Muller codes . . . 786--812
Camil Demetrescu and
Giuseppe F. Italiano Fully dynamic all pairs shortest paths
with real edge weights . . . . . . . . . 813--837
Lisa Fleischer and
Kamal Jain and
David P. Williamson Iterative rounding $2$-approximation
algorithms for minimum-cost vertex
connectivity problems . . . . . . . . . 838--867
Jittat Fakcharoenphol and
Satish Rao Planar graphs, negative weight edges,
shortest paths, and near linear time . . 868--889
Yair Bartal and
Béla Bollobás and
Manor Mendel Ramsey-type theorems for metric spaces
with applications to online problems . . 890--921
Tim Roughgarden On the severity of Braess's Paradox:
Designing networks for selfish users is
hard . . . . . . . . . . . . . . . . . . 922--953
Anonymous Papers to appear in forthcoming issues 954--954
Anonymous Editorial Board . . . . . . . . . . . . CO2
Yogish Sabharwal and
Nishant Sharma and
Sandeep Sen Nearest neighbors search using point
location in balls with applications to
approximate Voronoi decompositions . . . 955--977
Mario Di Raimondo and
Rosario Gennaro Provably secure threshold
password-authenticated key exchange . . 978--1001
Hung-Min Sun and
Her-Tyan Yeh Password-based authentication and key
distribution protocols with perfect
forward secrecy . . . . . . . . . . . . 1002--1011
Michal Parnas and
Dana Ron and
Ronitt Rubinfeld Tolerant property testing and distance
approximation . . . . . . . . . . . . . 1012--1042
Elmar Böhler and
Christian Glaßer and
Daniel Meister Error-bounded probabilistic computations
between MA and AM . . . . . . . . . . . 1043--1076
James Aspnes and
Kevin Chang and
Aleksandr Yampolskiy Inoculation strategies for victims of
viruses and the sum-of-squares partition
problem . . . . . . . . . . . . . . . . 1077--1093
Anand Srinivasan and
James H. Anderson Optimal rate-based scheduling on
multiprocessors . . . . . . . . . . . . 1094--1117
Anonymous Contents . . . . . . . . . . . . . . . . CO4
Anonymous Editorial Board . . . . . . . . . . . . CO2
Irfan Awan Performance modelling and evaluation of
computer systems . . . . . . . . . . . . 1119--1120
Armando Ferro and
Igor Delgado and
Alex Muñoz and
Fidel Liberal An analytical model for loss estimation
in network traffic analysis systems . . 1121--1133
Alessio Botta and
Donato Emma and
Antonio Pescapé and
Giorgio Ventre Systematic performance modeling and
characterization of heterogeneous IP
networks . . . . . . . . . . . . . . . . 1134--1143
Inn Inn Er and
Winston K. G. Seah Clustering overhead and convergence time
analysis of the mobility-based multi-hop
clustering algorithm for mobile ad hoc
networks . . . . . . . . . . . . . . . . 1144--1155
Almudena Konrad and
Ben Y. Zhao and
Anthony D. Joseph Determining model accuracy of network
traces . . . . . . . . . . . . . . . . . 1156--1171
E. Grishikashvili Pereira and
R. Pereira and
A. Taleb-Bendiab Performance evaluation for self-healing
distributed services and fault detection
mechanisms . . . . . . . . . . . . . . . 1172--1182
Makoto Ikeda and
Leonard Barolli and
Akio Koyama and
Arjan Durresi and
Giuseppe De Marco and
Jiro Iwashige Performance evaluation of an intelligent
CAC and routing framework for multimedia
applications in broadband networks . . . 1183--1200
Guang Tan and
Stephen A. Jarvis Prediction of short-lived TCP transfer
latency on bandwidth asymmetric links 1201--1210
Satoshi Itaya and
Naohiro Hayashibara and
Tomoya Enokido and
Makoto Takizawa HAMS: Scalable peer-to-peer multimedia
streaming model in heterogeneous
networks . . . . . . . . . . . . . . . . 1211--1225
Muhammad Younas and
Kuo-Ming Chao A tentative commit protocol for
composite web services . . . . . . . . . 1226--1237
L. Guan and
M. E. Woodward and
I. U. Awan Control of queueing delay in a buffer
with time-varying arrival rate . . . . . 1238--1248
Anonymous Papers to appear in forthcoming issues 1249--1249
Anonymous Contents . . . . . . . . . . . . . . . . CO4
Anonymous Editorial Board . . . . . . . . . . . . CO2
Anonymous Contents of Volume 72 . . . . . . . . . III--VII
Jon Grov and
Ragnar Normann Technical note: Replication graphs
revisited . . . . . . . . . . . . . . . 1251--1261
Bogdan S. Chlebus and
Dariusz R. Kowalski Robust gossiping with an application to
consensus . . . . . . . . . . . . . . . 1262--1281
Michael Elkin A faster distributed protocol for
constructing a minimum spanning tree . . 1282--1308
Fan Chung and
Ronald Graham and
Ranjita Bhagwan and
Stefan Savage and
Geoffrey M. Voelker Maximizing data locality in distributed
systems . . . . . . . . . . . . . . . . 1309--1316
Christopher L. Barrett and
Harry B. Hunt and
Madhav V. Marathe and
S. S. Ravi and
Daniel J. Rosenkrantz and
Richard E. Stearns Complexity of reachability problems for
finite discrete dynamical systems . . . 1317--1345
Jianer Chen and
Xiuzhen Huang and
Iyad A. Kanj and
Ge Xia Strong computational lower bounds via
parameterized complexity . . . . . . . . 1346--1367
Yousuke Takada and
Teijiro Isokawa and
Ferdinand Peper and
Nobuyuki Matsui Construction universality in purely
asynchronous cellular automata . . . . . 1368--1385
Jiong Guo and
Jens Gramm and
Falk Hüffner and
Rolf Niedermeier and
Sebastian Wernicke Compression-based fixed-parameter
algorithms for feedback vertex set and
edge bipartization . . . . . . . . . . . 1386--1396
Sara Gradara and
Antonella Santone and
Maria Luisa Villani DELFIN +: an efficient deadlock
detection tool for CCS processes . . . . 1397--1412
Anonymous Papers to appear in forthcoming issues 1413--1413
Anonymous Author Index for Volume 72 . . . . . . . 1414--1415
Anonymous Contents . . . . . . . . . . . . . . . . CO4
Anonymous Editorial Board . . . . . . . . . . . . CO2
Véronique Bruy\`ere and
Olivier Carton Automata on linear orderings . . . . . . 1--24
Jin-Yi Cai S$^p_2 \subseteq $ ZPP$^{NP}$ . . . . . 25--35
Christian Glaßer Languages polylog-time reducible to
dot-depth 1/2 . . . . . . . . . . . . . 36--56
Rodney G. Downey and
Catherine McCartin Online promise problems with online
width metrics . . . . . . . . . . . . . 57--72
Edith Hemaspaandra and
Lane A. Hemaspaandra Dichotomy for voting systems . . . . . . 73--83
Lin Lin and
Xue-Hai Yuan and
Zun-Quan Xia Multicriteria fuzzy decision-making
methods based on intuitionistic fuzzy
sets . . . . . . . . . . . . . . . . . . 84--88
Sanjay Jain and
Yen Kaow Ng and
Tiong Seng Tay Learning languages in a union . . . . . 89--108
Valentina S. Harizanov and
Frank Stephan On the learnability of vector spaces . . 109--122
Sheng-Tzong Cheng and
Ming-Hung Tao Quantum cooperative search algorithm for
$3$-SAT . . . . . . . . . . . . . . . . 123--136
Petr Sosík and
Alfonso Rodríguez-Patón Membrane computing and complexity
theory: A characterization of PSPACE . . 137--152
Anonymous Papers to appear in forthcoming issues 153--153
Anonymous Editorial Board . . . . . . . . . . . . CO2
Anonymous Volume 73, Number 1, February 2007 . . . CO4
Christopher Gill and
Oleg Sokolsky Guest Editors' Foreword . . . . . . . . 155--155
Rajeev Alur and
Arun Chandrashekharapuram Dispatch sequences for embedded control
models . . . . . . . . . . . . . . . . . 156--170
Krishnakumar Balasubramanian and
Jaiganesh Balasubramanian and
Jeff Parsons and
Aniruddha Gokhale and
Douglas C. Schmidt A Platform-Independent Component
Modeling Language for Distributed
Real-time and Embedded Systems . . . . . 171--185
Rodolfo Pellizzoni and
Giuseppe Lipari Holistic analysis of asynchronous
real-time transactions with earliest
deadline scheduling . . . . . . . . . . 186--206
Ernesto Wandeler and
Lothar Thiele Workload correlations in multi-processor
hard real-time systems . . . . . . . . . 207--224
Björn Andersson and
Cecilia Ekelin Exact admission-control for integrated
aperiodic and periodic tasks . . . . . . 225--241
Anonymous Papers to appear in forthcoming issues 242--242
Anonymous Editorial Board . . . . . . . . . . . . CO2
Anonymous Volume 73, Number 2, March 2007 . . . . CO4
Michael Benedikt Database Theory 2004 . . . . . . . . . . 243--244
Mayank Bawa and
Aristides Gionis and
Hector Garcia-Molina and
Rajeev Motwani The price of validity in dynamic
networks . . . . . . . . . . . . . . . . 245--264
Edith Cohen and
Haim Kaplan Spatially-decaying aggregation over a
network . . . . . . . . . . . . . . . . 265--288
Thomas Schwentick Automata for XML-A survey . . . . . . . 289--315
Susan Davidson and
Wenfei Fan and
Carmem Hara Propagating XML constraints to relations 316--361
Wim Martens and
Frank Neven Frontiers of tractability for
typechecking simple XML transformations 362--390
Ziv Bar-Yossef and
Marcus Fontoura and
Vanja Josifovski On the memory requirements of XPath
evaluation over XML streams . . . . . . 391--441
Alin Deutsch and
Liying Sui and
Victor Vianu Specification and verification of
data-driven Web applications . . . . . . 442--474
Francesco Scarcello and
Gianluigi Greco and
Nicola Leone Weighted hypertree decompositions and
optimal query plans . . . . . . . . . . 475--506
Gerome Miklau and
Dan Suciu A formal analysis of information
disclosure in data exchange . . . . . . 507--534
Anonymous Papers to appear in forthcoming issues 535--535
Anonymous Contents . . . . . . . . . . . . . . . . CO4
Anonymous Editorial Board . . . . . . . . . . . . CO2
Dan Suciu Special issue on database theory . . . . 537--537
Dirk Leinders and
Jan Van den Bussche On the complexity of division and set
joins in the relational algebra . . . . 538--549
Wim Martens and
Joachim Niehren On the minimization of XML Schemas and
tree automata for unranked trees . . . . 550--583
Wolfgang Faber and
Gianluigi Greco and
Nicola Leone Magic Sets and their application to data
integration . . . . . . . . . . . . . . 584--609
Ariel Fuxman and
Renée J. Miller First-order query rewriting for
inconsistent databases . . . . . . . . . 610--635
Solmaz Kolahi Dependency-preserving normalization of
relational and XML data . . . . . . . . 636--647
Sara Cohen and
Yehoshua Sagiv An incremental algorithm for computing
ranked full disjunctions . . . . . . . . 648--668
J. Nathan Foster and
Michael B. Greenwald and
Christian Kirkegaard and
Benjamin C. Pierce and
Alan Schmitt Exploiting schemas in data
synchronization . . . . . . . . . . . . 669--689
Anonymous Contents . . . . . . . . . . . . . . . . obc--obc
Anonymous Editorial Board . . . . . . . . . . . . ifc--ifc
Peter Jonsson and
Andrei Krokhin Maximum H-colourable subdigraphs and
constraint optimization with arbitrary
weights . . . . . . . . . . . . . . . . 691--702
Foto N. Afrati and
Chen Li and
Jeffrey D. Ullman Using views to generate efficient
evaluation plans for queries . . . . . . 703--724
Martin Anthony On the generalization error of fixed
combinations of classifiers . . . . . . 725--734
Christian Glaßer and
Mitsunori Ogihara and
A. Pavan and
Alan L. Selman and
Liyu Zhang Autoreducibility, mitoticity, and
immunity . . . . . . . . . . . . . . . . 735--754
MohammadTaghi Hajiaghayi and
Naomi Nishimura Subgraph isomorphism, log-bounded
fragmentation, and graphs of (locally)
bounded treewidth . . . . . . . . . . . 755--768
Rod Downey and
Denis R. Hirschfeldt and
Geoff LaForte Undecidability of the structure of the
Solovay degrees of c.e. reals . . . . . 769--787
Yasunori Ishihara and
Toshiyuki Morita and
Hiroyuki Seki and
Minoru Ito An equational logic based approach to
the security problem against inference
attacks on object-oriented databases . . 788--817
Joan Boyar and
Lene M. Favrholdt and
Kim S. Larsen The relative worst-order ratio applied
to paging . . . . . . . . . . . . . . . 818--843
Anonymous Contents . . . . . . . . . . . . . . . . obc--obc
Anonymous Editorial Board . . . . . . . . . . . . ifc--ifc
Gabriel M. Kuper and
Jianwen Su A representation independent language
for planar spatial databases with
Euclidean distance . . . . . . . . . . . 845--874
Stefano Leonardi and
Danny Raz Approximating total flow time on
parallel machines . . . . . . . . . . . 875--891
Jianer Chen and
Iyad A. Kanj and
Ljubomir Perkovi\'c and
Eric Sedgwick and
Ge Xia Genus characterizes the complexity of
certain graph problems: Some tight
results . . . . . . . . . . . . . . . . 892--907
Gregor Gramlich and
Georg Schnitger Minimizing nfa's and regular expressions 908--923
José L. Balcázar and
Jorge Castro and
David Guijarro and
Johannes Köbler and
Wolfgang Lindner A general dimension for query learning 924--940
Parke Godfrey and
Jarek Gryz View disassembly: a rewrite that
extracts portions of views . . . . . . . 941--961
Denis Xavier Charles Counting lattice vectors . . . . . . . . 962--972
Harry Buhrman and
Hartmut Klauck and
Nikolai Vereshchagin and
Paul Vitányi Individual communication complexity . . 973--985
T. Kavitha Linear time algorithms for Abelian group
isomorphism and related problems . . . . 986--996
Bin Ma and
Lusheng Wang and
Ming Li Near optimal multiple alignment within a
band in polynomial time . . . . . . . . 997--1011
Radim Belohlavek and
Jirí Dvorák and
Jan Outrata Fast factorization by similarity in
formal concept analysis of data with
fuzzy attributes . . . . . . . . . . . . 1012--1022
Anonymous Contents . . . . . . . . . . . . . . . . obc--obc
Anonymous Editorial Board . . . . . . . . . . . . ifc--ifc
Richard Karp and
Ming Li and
Pavel Pevzner and
Ron Shamir Special issue on computational molecular
biology . . . . . . . . . . . . . . . . 1023--1023
Bin Ma and
Ming Li On the complexity of the spaced seeds 1024--1034
Martin Farach-Colton and
Gad M. Landau and
S. Cenk Sahinalp and
Dekel Tsur Optimal spaced seeds for faster
approximate string matching . . . . . . 1035--1044
Yun Cui and
Lusheng Wang and
Daming Zhu A 1.75-approximation algorithm for
unsigned translocation distance . . . . 1045--1059
Brona Brejová and
Daniel G. Brown and
Tomás Vinar The most probable annotation problem in
HMMs and its application to
bioinformatics . . . . . . . . . . . . . 1060--1077
Shlomo Moran and
Sagi Snir Efficient approximation of convex
recolorings . . . . . . . . . . . . . . 1078--1089
F. K. Hwang and
F. H. Chang The identification of positive clones in
a general inhibitor model . . . . . . . 1090--1094
Gad M. Landau and
Eugene Myers and
Michal Ziv-Ukelson Two algorithms for LCS Consecutive
Suffix Alignment . . . . . . . . . . . . 1095--1117
Anonymous Contents . . . . . . . . . . . . . . . . obc--obc
Anonymous Editorial Board . . . . . . . . . . . . ifc--ifc
H. Sarbazi-Azad and
L. M. Mackenzie Network-based computing . . . . . . . . 1119--1120
N. Alzeidi and
A. Khonsari and
M. Ould-Khaoua and
L. Mackenzie A new approach to model virtual channels
in interconnection networks . . . . . . 1121--1130
F. Safaei and
A. Khonsari and
M. Fathy and
M. Ould-Khaoua Communication delay analysis of
fault-tolerant pipelined circuit
switching in torus . . . . . . . . . . . 1131--1144
Yu Jiao and
Ali R. Hurson Energy-efficient wireless information
retrieval . . . . . . . . . . . . . . . 1145--1163
Rafael Moreno-Vozmediano and
Krishna Nadiminti and
Srikumar Venugopal and
Ana B. Alonso-Conde and
Hussein Gibbins and
Rajkumar Buyya Portfolio and investment risk analysis
on global grids . . . . . . . . . . . . 1164--1175
Riky Subrata and
Albert Y. Zomaya and
Bjorn Landfeldt Artificial life techniques for load
balancing in computational grids . . . . 1176--1190
Kai Lu and
Riky Subrata and
Albert Y. Zomaya On the performance-driven load
distribution for heterogeneous
computational grids . . . . . . . . . . 1191--1206
Xiaolong Jin and
Geyong Min Performance analysis of priority
scheduling mechanisms under
heterogeneous network traffic . . . . . 1207--1220
Maziar Goudarzi and
Naser MohammadZadeh and
Shaahin Hessabi Using on-chip networks to implement
polymorphism in the co-design of
object-oriented embedded systems . . . . 1221--1231
Wenjun Xiao and
Behrooz Parhami Structural properties of Cayley digraphs
with applications to mesh and pruned
torus interconnection networks . . . . . 1232--1239
Azzedine Boukerche and
Raed A. Al-Shaikh and
Mirela Sechi Moretti Annoni Notare Towards highly available and scalable
high performance clusters . . . . . . . 1240--1251
Anonymous Contents . . . . . . . . . . . . . . . . obc--obc
Anonymous Editorial Board . . . . . . . . . . . . ifc--ifc
Sanjoy Dasgupta Special issue on learning theory . . . . 1--1
Laurence Bisht and
Nader H. Bshouty and
Lawrance Khoury Learning with errors in answers to
membership queries . . . . . . . . . . . 2--15
Misha Alekhnovich and
Mark Braverman and
Vitaly Feldman and
Adam R. Klivans and
Toniann Pitassi The complexity of properly learning
simple concept classes . . . . . . . . . 16--34
Adam R. Klivans and
Rocco A. Servedio Learning intersections of halfspaces
with a margin . . . . . . . . . . . . . 35--48
Jon Kleinberg and
Mark Sandler Using mixture models for collaborative
filtering . . . . . . . . . . . . . . . 49--69
David Kempe and
Frank McSherry A decentralized algorithm for spectral
analysis . . . . . . . . . . . . . . . . 70--83
David McAllester and
Michael Collins and
Fernando Pereira Case-factor diagrams for structured
probabilistic modeling . . . . . . . . . 84--96
Baruch Awerbuch and
Robert Kleinberg Online linear optimization and adaptive
routing . . . . . . . . . . . . . . . . 97--114
Sham M. Kakade and
Dean P. Foster Deterministic calibration and Nash
equilibrium . . . . . . . . . . . . . . 115--130
Anonymous Contents . . . . . . . . . . . . . . . . obc--obc
Anonymous Editorial Board . . . . . . . . . . . . ifc--ifc
Muhammad Younas and
Elhadi Shakshuki and
Kuo-Ming Chao Special issue: Web and mobile
information systems . . . . . . . . . . 131--132
Maya Rupert and
Amjad Rattrout and
Salima Hassas The web from a complex adaptive systems
perspective . . . . . . . . . . . . . . 133--145
H. N. Chua and
S. D. Scott and
Y. W. Choi Enabling device independent co-browsing
through adaptive view points . . . . . . 146--157
Arne Ketil Eidsvik and
Randi Karlsen and
Gordon Blair and
Paul Grace Interfacing remote transaction services
using UPnP . . . . . . . . . . . . . . . 158--169
Eric Pardede and
J. Wenny Rahayu and
David Taniar XML data update management in
XML-enabled database . . . . . . . . . . 170--195
Binyu Zang and
Yinsheng Li and
Wei Xie and
Zhuangjian Chen and
Chen-Fang Tsai and
Christopher Laing An ontological engineering approach for
automating inspection and quarantine at
airports . . . . . . . . . . . . . . . . 196--210
Wei-Li Lin and
Chi-Chun Lo and
Kuo-Ming Chao and
Muhammad Younas Consumer-centric QoS-aware selection of
web services . . . . . . . . . . . . . . 211--231
Irfan Awan and
Shakeel Ahmad and
Bashir Ahmad Performance analysis of multimedia based
web traffic with QoS constraints . . . . 232--242
Rachid Anane and
Sukhvir Dhillon and
Behzad Bordbar Stateless data concealment for
distributed systems . . . . . . . . . . 243--254
Hao Lan Zhang and
Clement H. C. Leung and
Gitesh K. Raikundalia Topological analysis of AOCD-based agent
networks and experimental results . . . 255--278
Elhadi Shakshuki and
Hsiang-Hwa Koo and
Darcy Benoit and
Daniel Silver A distributed multi-agent meeting
scheduler . . . . . . . . . . . . . . . 279--296
Anonymous Contents . . . . . . . . . . . . . . . . obc--obc
Anonymous Editorial Board . . . . . . . . . . . . ifc--ifc
Harry Buhrman Foreword . . . . . . . . . . . . . . . . 297--297
Ryan O'Donnell and
Rocco A. Servedio Extremal properties of polynomial
threshold functions . . . . . . . . . . 298--312
Scott Aaronson Quantum certificate complexity . . . . . 313--322
Albert Atserias and
Víctor Dalmau A combinatorial characterization of
resolution width . . . . . . . . . . . . 323--334
Subhash Khot and
Oded Regev Vertex cover might be hard to
approximate to within $ 2 - \epsilon $ 335--349
Wolfgang Merkle The complexity of stochastic sequences 350--357
Lance Fortnow and
A. Pavan and
Samik Sengupta Proving SAT does not have small circuits
with an application to the two queries
problem . . . . . . . . . . . . . . . . 358--363
Pranab Sen and
S. Venkatesh Lower bounds for predecessor searching
in the cell probe model . . . . . . . . 364--385
Chris Calabro and
Russell Impagliazzo and
Valentine Kabanets and
Ramamohan Paturi The complexity of Unique $k$-SAT: an
Isolation Lemma for $k$-CNFs . . . . . . 386--393
Detlef Sieling Minimization of decision trees is hard
to approximate . . . . . . . . . . . . . 394--403
Susan Davidson and
Wenfei Fan and
Carmem Hara Erratum to ``Propagating XML constraints
to relations'' [J. Comput. System Sci.
\bf 73 (2007) 316--361] . . . . . . . . 404--405
Anonymous Contents . . . . . . . . . . . . . . . . obc--obc
Anonymous Editorial Board . . . . . . . . . . . . ifc--ifc
Anonymous Obituary for Carl Smith . . . . . . . . 407--407
William Gasarch Memorial issue for Carl Smith . . . . . 408--408
Lorenzo Carlucci and
John Case and
Sanjay Jain and
Frank Stephan Non-U-shaped vacillatory and team
learning . . . . . . . . . . . . . . . . 409--430
Sanjay Jain and
Efim Kinber Learning languages from positive data
and negative counterexamples . . . . . . 431--456
Andris Ambainis Probabilistic and team PFIN-type
learning: General properties . . . . . . 457--489
William I. Gasarch and
Andrew C. Y. Lee Inferring answers to queries . . . . . . 490--512
Bala Kalyanasundaram and
Mahendran Velauthapillai Taming teams with mind changes . . . . . 513--526
Janis Barzdins and
Rusins Freivalds and
Carl H. Smith Learning with belief levels . . . . . . 527--545
Dana Angluin and
Jiang Chen Learning a hidden graph using $ O(\log
n) $ queries per edge . . . . . . . . . 546--556
Boaz Leskes and
Leen Torenvliet The value of agreement a new boosting
algorithm . . . . . . . . . . . . . . . 557--586
Clyde P. Kruskal The orchard visibility problem and some
variants . . . . . . . . . . . . . . . . 587--597
Clyde P. Kruskal The chromatic number of the plane: The
bounded case . . . . . . . . . . . . . . 598--627
William Gasarch and
James Glenn and
Clyde P. Kruskal Finding large $3$-free sets I: The small
n case . . . . . . . . . . . . . . . . . 628--655
Anonymous Contents . . . . . . . . . . . . . . . . obc--obc
Anonymous Editorial Board . . . . . . . . . . . . ifc--ifc
Tao Xiang and
Kwok-wo Wong and
Xiaofeng Liao Cryptanalysis of a password
authentication scheme over insecure
networks . . . . . . . . . . . . . . . . 657--661
Guy Kortsarz and
Zeev Nutov Tight approximation algorithm for
connectivity augmentation problems . . . 662--670
Paola Bonizzoni and
Gianluca Della Vedova and
Riccardo Dondi and
Tao Jiang On the Approximation of Correlation
Clustering and Consensus Clustering . . 671--696
Tova Milo and
Assaf Sagi and
Elad Verbin Compact samples for data dissemination 697--720
David Cohen and
Peter Jeavons and
Marc Gyssens A unified theory of structural
tractability for constraint satisfaction
problems . . . . . . . . . . . . . . . . 721--743
Michael A. Bender and
Dongdong Ge and
Simai He and
Haodong Hu and
Ron Y. Pinter and
Steven Skiena and
Firas Swidan Improved bounds on sorting by
length-weighted reversals . . . . . . . 744--774
Marta Arias and
Lenore J. Cowen and
Kofi A. Laing Compact roundtrip routing with
topology-independent node names . . . . 775--795
Maxime Crochemore and
Lucian Ilie Maximal repetitions in strings . . . . . 796--807
Leszek G\kasieniec and
Ralf Klasing and
Russell Martin and
Alfredo Navarra and
Xiaohui Zhang Fast periodic graph exploration with
constant memory . . . . . . . . . . . . 808--822
Rachid Guerraoui and
Petr Kuznetsov The gap in circumventing the
impossibility of consensus . . . . . . . 823--830
François Nicolas and
Eric Rivals Hardness of optimal spaced seed design 831--849
Shlomo Moran and
Sagi Snir Convex recolorings of strings and trees:
Definitions, hardness results and
algorithms . . . . . . . . . . . . . . . 850--869
Qiang Li and
Huimin Xie Finite automata for testing
composition-based reconstructibility of
sequences . . . . . . . . . . . . . . . 870--874
Cristina Bazgan and
Zsolt Tuza and
Daniel Vanderpooten Approximation of satisfactory bisection
problems . . . . . . . . . . . . . . . . 875--883
Martin Kutz and
Khaled Elbassioni and
Irit Katriel and
Meena Mahajan Simultaneous matchings: Hardness and
approximation . . . . . . . . . . . . . 884--897
Peter Jonsson and
Andrei Krokhin Computational complexity of auditing
finite attributes in statistical
databases . . . . . . . . . . . . . . . 898--909
Mark McCann and
Nicholas Pippenger Fault tolerance in cellular automata at
high fault rates . . . . . . . . . . . . 910--918
Josep Díaz and
Maria Serna and
Dimitrios M. Thilikos Efficient algorithms for counting
parameterized list H-colorings . . . . . 919--937
Anonymous Contents . . . . . . . . . . . . . . . . obc--obc
Anonymous Editorial Board . . . . . . . . . . . . ifc--ifc
M. Ould-Khaoua and
G. Min Performance analysis and evaluation of
parallel, cluster, and grid computing
systems . . . . . . . . . . . . . . . . 939--941
D. Filippopoulos and
H. Karatza A two-class parallel system with general
service times of the parallel class . . 942--964
Subhash Saini and
Robert Ciotti and
Brian T. N. Gunney and
Thomas E. Spelce and
Alice Koniges and
Don Dossa and
Panagiotis Adamidis and
Rolf Rabenseifner and
Sunil R. Tiyyagura and
Matthias Mueller Performance evaluation of supercomputers
using HPCC and IMB Benchmarks . . . . . 965--982
Basile Schaeli and
Sebastian Gerlach and
Roger D. Hersch A simulator for adaptive parallel
applications . . . . . . . . . . . . . . 983--999
A. E. Kiasari and
H. Sarbazi-Azad Analytic performance comparison of
hypercubes and star graphs with
implementation constraints . . . . . . . 1000--1012
Jeremy T. Bradley and
Stephen T. Gilmore and
Jane Hillston Analysing distributed Internet worm
attacks using continuous state-space
approximation of process algebra models 1013--1032
N. Alzeidi and
M. Ould-Khaoua and
A. Khonsari A new general method to compute virtual
channels occupancy probabilities in
wormhole networks . . . . . . . . . . . 1033--1042
Azzedine Boukerche and
Yunfeng Gu and
Regina B. Araujo An Adaptive Dynamic Grid-Based approach
to DDM for large-scale distributed
simulation systems . . . . . . . . . . . 1043--1054
Xiaolong Jin and
Geyong Min A heuristic flow-decomposition approach
for generalized processor sharing under
self-similar traffic . . . . . . . . . . 1055--1066
Nigel Thomas Comparing job allocation schemes where
service demand is unknown . . . . . . . 1067--1081
Luiz Angelo Steffenel and
Grégory Mounié A framework for adaptive collective
communications for heterogeneous
hierarchical computing systems . . . . . 1082--1093
Anonymous Editorial Board . . . . . . . . . . . . ifc--ifc
Anonymous Editorial Board . . . . . . . . . . . . obc--obc
Katsuhiko Nakamura Languages not recognizable in real time
by one-dimensional cellular automata . . 1095--1102
Nadia Creignou and
Phokion Kolaitis and
Bruno Zanuttini Structure identification of Boolean
relations and plain bases for co-clones 1103--1115
Michael Domaratzki and
Kai Salomaa Lower bounds for the transition
complexity of NFAs . . . . . . . . . . . 1116--1130
Haik Grigorian and
Samvel Shoukourian The equivalence problem of
multidimensional multitape automata . . 1131--1138
Devdatta Gangal and
Abhiram Ranade Precedence constrained scheduling in $
(2 - 7 / (3 p + 1)) \cdot $ optimal . . 1139--1146
Sara Cohen and
Benny Kimelfeld and
Yehoshua Sagiv Generating all maximal induced subgraphs
for hereditary and connected-hereditary
graph properties . . . . . . . . . . . . 1147--1159
Guomin Yang and
Duncan S. Wong and
Huaxiong Wang and
Xiaotie Deng Two-factor mutual authentication based
on smart cards and passwords . . . . . . 1160--1172
Christian Glaßer and
Alan L. Selman and
Stephen Travers and
Klaus W. Wagner The complexity of unions of disjoint
sets . . . . . . . . . . . . . . . . . . 1173--1187
Jianer Chen and
Fedor V. Fomin and
Yang Liu and
Songjian Lu and
Yngve Villanger Improved algorithms for feedback vertex
set problems . . . . . . . . . . . . . . 1188--1198
Martin Gairing and
Thomas Lücking and
Marios Mavronicolas and
Burkhard Monien and
Manuel Rode Nash equilibria in discrete routing
games with convex latency functions . . 1199--1225
Anonymous Contents . . . . . . . . . . . . . . . . obc--obc
Anonymous Editorial Board . . . . . . . . . . . . ifc--ifc
Peter Auer and
Philip M. Long Guest Editors' introduction: Special
issue on learning theory . . . . . . . . 1227--1227
Yuri Kalnishkan and
Michael V. Vyugin The weak aggregating algorithm and weak
mixability . . . . . . . . . . . . . . . 1228--1244
Maria-Florina Balcan and
Avrim Blum and
Jason D. Hartline and
Yishay Mansour Reducing mechanism design to algorithm
design via machine learning . . . . . . 1245--1270
Baruch Awerbuch and
Robert Kleinberg Competitive collaborative learning . . . 1271--1288
Mikhail Belkin and
Partha Niyogi Towards a theoretical foundation for
Laplacian-based manifold methods . . . . 1289--1308
Alexander L. Strehl and
Michael L. Littman An analysis of model-based Interval
Estimation for Markov Decision Processes 1309--1331
Anonymous Contents . . . . . . . . . . . . . . . . obc--obc
Anonymous Editorial Board . . . . . . . . . . . . ifc--ifc
Lisa Hellerstein and
Hans U. Simon Special Issue: Learning Theory 2006 . . 1--1
Adam R. Klivans and
Alexander A. Sherstov Cryptographic hardness for learning
intersections of halfspaces . . . . . . 2--12
Vitaly Feldman Hardness of approximate two-level logic
minimization and PAC learning with
membership queries . . . . . . . . . . . 13--26
Lance Fortnow and
Adam R. Klivans Efficient learning algorithms yield
circuit lower bounds . . . . . . . . . . 27--36
Benjamin I. P. Rubinstein and
Peter L. Bartlett and
J. Hyam Rubinstein Shifting: One-inclusion mistake bounds
and sample compression . . . . . . . . . 37--59
Dana Angluin and
James Aspnes and
Jiang Chen and
Yinghua Wu Learning a circuit by injecting values 60--77
Maria-Florina Balcan and
Alina Beygelzimer and
John Langford Agnostic active learning . . . . . . . . 78--89
Anonymous Contents . . . . . . . . . . . . . . . . obc--obc
Anonymous Editorial Board . . . . . . . . . . . . ifc--ifc
Jonathan Katz and
Chiu-Yuen Koo On expected constant-round protocols for
Byzantine agreement . . . . . . . . . . 91--112
Lila Kari and
Shinnosuke Seki On pseudoknot-bordered words and their
properties . . . . . . . . . . . . . . . 113--121
Leah Epstein and
Asaf Levin Better bounds for minimizing SONET ADMs 122--136
Meena Mahajan and
Venkatesh Raman and
Somnath Sikdar Parameterizing above or below guaranteed
values . . . . . . . . . . . . . . . . . 137--153
Anonymous Contents . . . . . . . . . . . . . . . . obc--obc
Anonymous Editorial Board . . . . . . . . . . . . ifc--ifc
Chaim Linhart and
Ron Shamir Faster pattern matching with character
classes using prime number encoding . . 155--162
Felix Brandt and
Felix Fischer and
Markus Holzer Symmetries and the complexity of pure
Nash equilibrium . . . . . . . . . . . . 163--177
Cristian Martín and
Mikel Larrea and
Ernesto Jiménez Implementing the Omega failure detector
in the crash-recovery failure model . . 178--189
Vincenzo Auletta and
Roberto De Prisco and
Paolo Penna and
Giuseppe Persiano The power of verification for
one-parameter agents . . . . . . . . . . 190--211
Anonymous Contents . . . . . . . . . . . . . . . . obc--obc
Anonymous Editorial Board . . . . . . . . . . . . ifc--ifc
Andrea E. F. Clementi and
Angelo Monti and
Francesco Pasquale and
Riccardo Silvestri Broadcasting in dynamic radio networks 213--230
Hans L. Bodlaender and
Michael R. Fellows and
Dimitrios M. Thilikos Derivation of algorithms for cutwidth
and related graph layout parameters . . 231--244
Eric Allender and
Michael Bauland and
Neil Immerman and
Henning Schnoor and
Heribert Vollmer The complexity of satisfiability
problems: Refining Schaefer's theorem 245--254
Harumichi Nishimura and
Tomoyuki Yamakami An application of quantum finite
automata to interactive proof systems 255--269
Anonymous Contents . . . . . . . . . . . . . . . . obc--obc
Anonymous Editorial Board . . . . . . . . . . . . ifc--ifc
Joost Engelfriet and
Sebastian Maneth and
Helmut Seidl Deciding equivalence of top-down XML
transformations in polynomial time . . . 271--286
Mary Ashley and
Tanya Berger-Wolf and
Piotr Berman and
Wanpracha Chaovalitwongse and
Bhaskar DasGupta and
Ming-Yang Kao On approximating four covering and
packing problems . . . . . . . . . . . . 287--302
Sherif Sakr XML compression techniques: a survey and
comparison . . . . . . . . . . . . . . . 303--322
Anonymous Contents . . . . . . . . . . . . . . . . obc--obc
Anonymous Editorial Board . . . . . . . . . . . . ifc--ifc
Nader H. Bshouty and
Yi Li and
Philip M. Long Using the doubling dimension to analyze
the generalization of learning
algorithms . . . . . . . . . . . . . . . 323--335
Bogdan Cautis and
Serge Abiteboul and
Tova Milo Reasoning about XML update constraints 336--358
Amihood Amir and
Yonatan Aumann and
Gary Benson and
Avivit Levy and
Ohad Lipsky and
Ely Porat and
Steven Skiena and
Uzi Vishne Pattern matching with address errors:
Rearrangement distances . . . . . . . . 359--370
Anonymous Contents . . . . . . . . . . . . . . . . obc--obc
Anonymous Editorial Board . . . . . . . . . . . . ifc--ifc
Ting-Yu Chen and
Jih-Chang Wang Interval-valued fuzzy permutation method
and experimental analysis on cardinal
and ordinal evaluations . . . . . . . . 371--387
UmaMaheswari C. Devi and
James H. Anderson Improved conditions for bounded
tardiness under EPDF Pfair
multiprocessor scheduling . . . . . . . 388--420
Katsuhiko Nakamura Erratum to ``Languages not recognizable
in real time by one-dimensional cellular
automata'' [J. Comput. System Sci. \bf
74 (7) (2008) 1095--1102] . . . . . . . 421--421
Anonymous Contents . . . . . . . . . . . . . . . . obc--obc
Anonymous Editorial Board . . . . . . . . . . . . ifc--ifc
Hans L. Bodlaender and
Rodney G. Downey and
Michael R. Fellows and
Danny Hermelin On problems without polynomial kernels 423--434
Igor Razgon and
Barry O'Sullivan Almost $2$-SAT is fixed-parameter
tractable . . . . . . . . . . . . . . . 435--450
Tzu-Chin Lin and
Chung-Chin Kuo and
Yong-Hsiang Hsieh and
Biing-Feng Wang Efficient algorithms for the inverse
sorting problem with bound constraints
under the $ l_\infty $-norm and the
Hamming distance . . . . . . . . . . . . 451--464
Prakash Ramanan Worst-case optimal algorithm for XPath
evaluation over XML streams . . . . . . 465--485
Anonymous Contents . . . . . . . . . . . . . . . . obc--obc
Anonymous Editorial Board . . . . . . . . . . . . ifc--ifc
Radim Belohlavek and
Rudolf Kruse Editor's foreword . . . . . . . . . . . 1--2
Radim Belohlavek and
Vilem Vychodil Discovery of optimal factors in binary
data via a novel method of matrix
decomposition . . . . . . . . . . . . . 3--20
Christian Borgelt A conditional independence algorithm for
learning undirected graphical models . . 21--33
Petr Hájek and
Martin Holena and
Jan Rauch The GUHA method and its meaning for data
mining . . . . . . . . . . . . . . . . . 34--48
Eyke Hüllermeier and
Johannes Fürnkranz On predictive accuracy and risk
minimization in pairwise label ranking 49--62
Guoqing Liu and
Vladik Kreinovich Fast convolution and Fast Fourier
Transform under interval and fuzzy
uncertainty . . . . . . . . . . . . . . 63--76
Matthias Steinbrecher and
Rudolf Kruse Visualizing and fuzzy filtering for
discovering temporal trajectories of
association rules . . . . . . . . . . . 77--87
Karam Gouda and
Mosab Hassaan and
Mohammed J. Zaki Prism: an effective approach for
frequent sequence mining via prime-block
encoding . . . . . . . . . . . . . . . . 88--102
Anonymous Contents . . . . . . . . . . . . . . . . obc--obc
Anonymous Editorial Board . . . . . . . . . . . . ifc--ifc
Marko Samer and
Stefan Szeider Constraint satisfaction with bounded
treewidth revisited . . . . . . . . . . 103--114
Raphaël Clifford and
Klim Efremenko and
Ely Porat and
Amir Rothschild Pattern matching with don't cares and
few errors . . . . . . . . . . . . . . . 115--124
H. M. W. Verbeek and
M. T. Wynn and
W. M. P. van der Aalst and
A. H. M. ter Hofstede Reduction rules for reset/inhibitor nets 125--143
Jean Daligault and
Gregory Gutin and
Eun Jung Kim and
Anders Yeo FPT algorithms and kernels for the
Directed $k$-Leaf problem . . . . . . . 144--152
Anonymous Contents . . . . . . . . . . . . . . . . obc--obc
Anonymous Editorial Board . . . . . . . . . . . . ifc--ifc
Anonymous Obituary for our editor Arthur W. Burks 153--153
Nikolaj Bjòrner and
Andreas Blass and
Yuri Gurevich Content-dependent chunking for
differential compression, the local
maximum approach . . . . . . . . . . . . 154--203
Michael Dom and
Jiong Guo and
Rolf Niedermeier Approximation and fixed-parameter
algorithms for consecutive ones
submatrix problems . . . . . . . . . . . 204--221
Pierre Fraigniaud and
David Ilcinkas and
Andrzej Pelc Communication algorithms with advice . . 222--232
Sanjay Jain and
Frank Stephan Numberings optimal for learning . . . . 233--250
Alexander Okhotin Decision problems for language equations 251--266
Martin Dyer and
Leslie Ann Goldberg and
Mark Jerrum An approximation trichotomy for Boolean
#CSP . . . . . . . . . . . . . . . . . . 267--277
Benjamin I. P. Rubinstein and
Peter L. Bartlett and
J. Hyam Rubinstein Corrigendum to ``Shifting: One-inclusion
mistake bounds and sample compression''
[J. Comput. System Sci. \bf 75 (1)
(2009) 37--59] . . . . . . . . . . . . . 278--280
Anonymous Contents . . . . . . . . . . . . . . . . obc--obc
Anonymous Editorial Board . . . . . . . . . . . . ifc--ifc
Wilfrid Hodges and
Ruy de Queiroz Editors' foreword for JCSS WoLLIC 2008 281--282
Christophe Calv\`es and
Maribel Fernández Matching and alpha-equivalence check for
nominal terms . . . . . . . . . . . . . 283--301
Olivier Danvy and
Jacob Johannsen Inter-deriving semantic artifacts for
object-oriented programming . . . . . . 302--323
Anuj Dawar Homomorphism preservation on quasi-wide
classes . . . . . . . . . . . . . . . . 324--332
Santiago Figueira and
Daniel Gorín and
Rafael Grimson On the formal semantics of IF-like
logics . . . . . . . . . . . . . . . . . 333--346
Pascal Koiran and
Jürgen Landes and
Natacha Portier and
Penghui Yao Adversary lower bounds for nonadaptive
quantum algorithms . . . . . . . . . . . 347--355
Ilya Mezhirov and
Nikolay Vereshchagin On abstract resource semantics and
computability logic . . . . . . . . . . 356--372
Livio Robaldo Interpretation and inference with
maximal referential terms . . . . . . . 373--388
Anonymous Contents . . . . . . . . . . . . . . . . obc--obc
Anonymous Editorial Board . . . . . . . . . . . . ifc--ifc
Jinjun Chen and
Lizhe Wang Special issue: Scientific workflow 2009 389--389
Ping Yang and
Shiyong Lu and
Mikhail I. Gofman and
Zijiang Yang Information flow analysis of scientific
workflows . . . . . . . . . . . . . . . 390--402
Rafael Tolosana-Calasanz and
José Ángel Bañares and
Pedro Álvarez and
Joaquín Ezpeleta and
Omer Rana An uncoordinated asynchronous
checkpointing model for hierarchical
scientific workflows . . . . . . . . . . 403--415
Wanchun Dou and
J. Leon Zhao and
Shaokun Fan A collaborative scheduling approach for
service-driven scientific workflow
execution . . . . . . . . . . . . . . . 416--427
Scott Callaghan and
Ewa Deelman and
Dan Gunter and
Gideon Juve and
Philip Maechling and
Christopher Brooks and
Karan Vahi and
Kevin Milner and
Robert Graves and
Edward Field and
David Okaya and
Thomas Jordan Scaling up workflow-based applications 428--446
Daniel Zinn and
Shawn Bowers and
Sven Köhler and
Bertram Ludäscher Parallelizing XML data-streaming
workflows via MapReduce . . . . . . . . 447--463
Jinjun Chen and
Yun Yang Localising temporal constraints in
scientific workflows . . . . . . . . . . 464--474
Jiangang Ma and
Jinli Cao and
Yanchun Zhang Efficiently supporting secure and
reliable collaboration in scientific
workflows . . . . . . . . . . . . . . . 475--489
Jacek Sroka and
Jan Hidders and
Paolo Missier and
Carole Goble A formal semantics for the Taverna 2
workflow model . . . . . . . . . . . . . 490--508
Anonymous Contents . . . . . . . . . . . . . . . . obc--obc
Anonymous Editorial Board . . . . . . . . . . . . ifc--ifc
Anonymous The 2nd International Workshop on
Workflow Management and Application in
Grid Environments & The 3rd International
Workshop on Workflow Management and
Applications in Grid Environments . . . ??
V. Arvind and
Bireswar Das and
Partha Mukhopadhyay Isomorphism and canonization of
tournaments and hypertournaments . . . . 509--523
Faisal N. Abu-Khzam A kernelization algorithm for
$d$-Hitting Set . . . . . . . . . . . . 524--531
Joachim Wehler Simplified proof of the blocking theorem
for free-choice Petri nets . . . . . . . 532--537
Bart Kuijpers and
Walied Othman Trajectory databases: Data models,
uncertainty and complete query languages 538--560
Edith Hemaspaandra and
Henning Schnoor and
Ilka Schnoor Generalized modal satisfiability . . . . 561--578
Hubie Chen and
Omer Giménez Causal graphs and structurally
restricted planning . . . . . . . . . . 579--592
Henning Fernau and
Michael Kaufmann and
Mathias Poths Comparing trees via crossing
minimization . . . . . . . . . . . . . . 593--608
Miroslav \'Ciri\'c and
Aleksandar Stamenkovi\'c and
Jelena Ignjatovi\'c and
Tatjana Petkovi\'c Fuzzy relation equations and reduction
of fuzzy automata . . . . . . . . . . . 609--633
Miki Hermann and
Reinhard Pichler Counting complexity of propositional
abduction . . . . . . . . . . . . . . . 634--649
Nathann Cohen and
Fedor V. Fomin and
Gregory Gutin and
Eun Jung Kim and
Saket Saurabh and
Anders Yeo Algorithm for finding $k$-vertex
out-trees and its application to
$k$-internal out-branching problem . . . 650--662
Jesus Arias Fisteus and
Norberto Fernández García and
Luis Sánchez Fernández and
Carlos Delgado Kloos Hashing and canonicalizing Notation 3
graphs . . . . . . . . . . . . . . . . . 663--685
S. Muthukrishnan and
Gopal Pandurangan Thresholding random geometric graph
properties motivated by ad hoc sensor
networks . . . . . . . . . . . . . . . . 686--696
Anonymous Contents . . . . . . . . . . . . . . . . obc--obc
Anonymous Editorial Board . . . . . . . . . . . . ifc--ifc
Chih-Chiang Yu and
Chien-Hsin Lin and
Biing-Feng Wang Improved algorithms for finding
length-bounded two vertex-disjoint paths
in a planar graph and minmax k
vertex-disjoint paths in a directed
acyclic graph . . . . . . . . . . . . . 697--708
Friedrich Eisenbrand and
Fabrizio Grandoni and
Thomas Rothvoß and
Guido Schäfer Connected facility location via random
facility sampling and core detouring . . 709--726
Michael R. Fellows and
Jiong Guo and
Iyad Kanj The parameterized complexity of some
minimum label problems . . . . . . . . . 727--740
Saehwa Kim Dual ceiling protocol for real-time
synchronization under preemption
threshold scheduling . . . . . . . . . . 741--750
Dekel Tsur Sequencing by hybridization in few
rounds . . . . . . . . . . . . . . . . . 751--758
Ofer Dekel and
Felix Fischer and
Ariel D. Procaccia Incentive compatible regression learning 759--777
Tony Tan On pebble automata for data languages
with decidable emptiness problem . . . . 778--791
Christian Glaßer Space-efficient informational redundancy 792--811
Nadja Betzler and
Britta Dorn Towards a dichotomy for the Possible
Winner problem in elections based on
scoring rules . . . . . . . . . . . . . 812--836
Tomás Masopust Simple restriction in context-free
rewriting . . . . . . . . . . . . . . . 837--846
Hubie Chen and
Martin Grohe Constraint satisfaction with succinctly
specified relations . . . . . . . . . . 847--860
Arto Salomaa Subword balance, position indices and
power sums . . . . . . . . . . . . . . . 861--871
Gregory Gutin and
Eun Jung Kim and
Matthias Mnich and
Anders Yeo Betweenness parameterized above tight
lower bound . . . . . . . . . . . . . . 872--878
David Gamarnik and
Dmitriy Katz A deterministic approximation algorithm
for computing the permanent of a 0,1
matrix . . . . . . . . . . . . . . . . . 879--883
Shlomi Dolev and
Ronen I. Kat and
Elad M. Schiller When consensus meets self-stabilization 884--900
Anonymous Contents . . . . . . . . . . . . . . . . obc--obc
Anonymous Editorial Board . . . . . . . . . . . . ifc--ifc
Jin-Yi Cai and
Alan L. Selman Foreword . . . . . . . . . . . . . . . . 1--2
Manindra Agrawal The isomorphism conjecture for constant
depth reductions . . . . . . . . . . . . 3--13
Eric Allender and
Michal Koucký and
Detlef Ronneburger and
Sambuddha Roy The pervasive reach of resource-bounded
Kolmogorov complexity in computational
complexity theory . . . . . . . . . . . 14--40
Jin-Yi Cai and
Pinyan Lu Holographic algorithms: From art to
science . . . . . . . . . . . . . . . . 41--61
Chandan Dubey and
Uriel Feige and
Walter Unger Hardness results for approximating the
bandwidth . . . . . . . . . . . . . . . 62--90
Lance Fortnow and
Rahul Santhanam Infeasibility of instance compression
and succinct PCPs for NP . . . . . . . . 91--106
Parikshit Gopalan and
Venkatesan Guruswami Hardness amplification within NP against
deterministic algorithms . . . . . . . . 107--121
Richard M. Karp Heuristic algorithms in computational
molecular biology . . . . . . . . . . . 122--128
Subhash Khot and
Rishi Saket On the hardness of learning
intersections of two halfspaces . . . . 129--141
David Buchfuhrer and
Christopher Umans The complexity of Boolean formula
minimization . . . . . . . . . . . . . . 142--153
Leslie G. Valiant A bridging model for multi-core
computing . . . . . . . . . . . . . . . 154--166
Ran Raz and
Amir Yehudayoff Multilinear formulas, maximal-partition
discrepancy and mixed-sources extractors 167--190
Jesse Kamp and
Anup Rao and
Salil Vadhan and
David Zuckerman Deterministic extractors for small-space
sources . . . . . . . . . . . . . . . . 191--220
Anonymous Contents . . . . . . . . . . . . . . . . obc--obc
Anonymous Editorial Board . . . . . . . . . . . . ifc--ifc
Rachid Anane and
Muhammad Younas Editorial for the special issue on
``Adaptivity in Heterogeneous
Environments'' . . . . . . . . . . . . . 221--222
Wei-Li Lin and
Chi-Chun Lo and
Kuo-Ming Chao and
Nick Godwin Multi-group QoS consensus for web
services . . . . . . . . . . . . . . . . 223--243
Christian Glasner and
Jens Volkert Adaps --- a three-phase adaptive
prediction system for the run-time of
jobs based on user behaviour . . . . . . 244--261
Agustín Caminero and
Omer Rana and
Blanca Caminero and
Carmen Carrión Network-aware heuristics for
inter-domain meta-scheduling in Grids 262--281
Fuad Bajaber and
Irfan Awan Adaptive decentralized re-clustering
protocol for wireless sensor networks 282--292
Martin Randles and
David Lamb and
E. Odat and
A. Taleb-Bendiab Distributed redundancy and robustness in
complex systems . . . . . . . . . . . . 293--304
Richard Anthony and
Mona Ghassemian Automatic mobility status estimation in
wireless self-organised networks . . . . 305--321
Sandford Bessler and
Alexander Fischer and
Eva Kühn and
Richard Mordinyi and
Slobodanka Tomic Using tuple-spaces to manage the storage
and dissemination of spatial-temporal
content . . . . . . . . . . . . . . . . 322--331
Mohamed A. Ameedeen and
Behzad Bordbar and
Rachid Anane Model interoperability via Model Driven
Development . . . . . . . . . . . . . . 332--347
Q. Shi and
N. Zhang and
M. Merabti Fair exchange of valuable information: a
generalised framework . . . . . . . . . 348--371
Pablo Arrighi and
Vincent Nesme and
Reinhard Werner Unitarity plus causality implies
localizability . . . . . . . . . . . . . 372--378
Bin Fu Theory and application of width bounded
geometric separators . . . . . . . . . . 379--392
M. Manna and
F. Scarcello and
N. Leone On the complexity of regular-grammars
with integer attributes . . . . . . . . 393--421
Gregory Gutin and
Eun Jung Kim and
Stefan Szeider and
Anders Yeo A probabilistic approach to problems
parameterized above or below tight
bounds . . . . . . . . . . . . . . . . . 422--429
Wendy Myrvold and
William Kocay Errors in graph embedding algorithms . . 430--438
Leah Epstein and
Asaf Levin and
Gerhard J. Woeginger Graph coloring with rejection . . . . . 439--447
Anonymous Contents . . . . . . . . . . . . . . . . obc--obc
Anonymous Editorial Board . . . . . . . . . . . . ifc--ifc
Marcelo Arenas Guest editorial: Special issue on
database theory . . . . . . . . . . . . 449--449
Henrik Björklund and
Wim Martens and
Thomas Schwentick Conjunctive query containment over trees 450--472
Nilesh Dalvi and
Christopher Re and
Dan Suciu Queries and materialized views on
probabilistic databases . . . . . . . . 473--490
Floris Geerts and
Jan Van den Bussche Relational completeness of query
languages for annotated databases . . . 491--504
Wouter Gelade and
Frank Neven Succinctness of pattern-based schema
languages for XML . . . . . . . . . . . 505--519
Claudio Gutierrez and
Carlos A. Hurtado and
Alberto O. Mendelzon and
Jorge Pérez Foundations of Semantic Web databases 520--541
Leonid Libkin and
Cristina Sirangelo Data exchange and schema mappings in
open and closed worlds . . . . . . . . . 542--571
Riccardo Rosati On the finite controllability of
conjunctive query answering in databases
under open-world assumption . . . . . . 572--594
Anonymous Contents . . . . . . . . . . . . . . . . obc--obc
Anonymous Editorial Board . . . . . . . . . . . . ifc--ifc
Fatos Xhafa and
Leonard Barolli Special issue foreword: Advances in
pervasive computing systems and
applications . . . . . . . . . . . . . . 595--596
François Siewe and
Hussein Zedan and
Antonio Cau The Calculus of Context-aware Ambients 597--620
George Papamarkos and
Alexandra Poulovassilis and
Peter T. Wood Performance modelling of
Event-Condition-Action rules in P2P
networks . . . . . . . . . . . . . . . . 621--636
Kefeng Xuan and
Geng Zhao and
David Taniar and
Wenny Rahayu and
Maytham Safar and
Bala Srinivasan Voronoi-based range and continuous range
query processing in mobile databases . . 637--651
Jason B. Ernst and
Mieso K. Denko The design and evaluation of fair
scheduling in wireless mesh networks . . 652--664
Jie Wang and
Lin Guan and
Lee Booi Lim and
X. G. Wang and
A. Grigg and
I. Awan and
I. Philips and
X. Chi QoS enhancements and performance
analysis for delay sensitive
applications . . . . . . . . . . . . . . 665--676
Arjan Durresi and
Mimoza Durresi and
Leonard Barolli Network trust management in emergency
situations . . . . . . . . . . . . . . . 677--686
Hai Dong and
Farookh Khadeer Hussain and
Elizabeth Chang A framework for discovering and
classifying ubiquitous services in
digital health ecosystems . . . . . . . 687--704
Tarek R. Sheltami and
Elhadi M. Shakshuki and
Hussein T. Mouftah Video streaming application over WEAC
protocol in MANET . . . . . . . . . . . 705--719
Hui-Huang Hsu and
Hsuan-Ting Liao A mobile RFID-based tour system with
instant microblogging . . . . . . . . . 720--727
Timothy Y. Chow Almost-natural proofs . . . . . . . . . 728--737
Sebastiaan A. Terwijn and
Leen Torenvliet and
Paul M. B. Vitányi Nonapproximability of the normalized
information distance . . . . . . . . . . 738--742
Émilie Charlier and
Marion Le Gonidec and
Michel Rigo Representing real numbers in a
generalized numeration system . . . . . 743--759
Sanjay Jain and
Frank Stephan and
Jason Teutsch Index sets and universal numberings . . 760--773
Nadja Betzler and
Jiong Guo and
Christian Komusiewicz and
Rolf Niedermeier Average parameterization and partial
kernelization for computing medians . . 774--789
Ren-Chiun Wang and
Wen-Shenq Juang and
Chin-Laung Lei Provably secure and efficient
identification and key agreement
protocol with user anonymity . . . . . . 790--798
Michael R. Fellows and
Guillaume Fertin and
Danny Hermelin and
Stéphane Vialette Upper and lower bounds for finding
connected motifs in vertex-colored
graphs . . . . . . . . . . . . . . . . . 799--811
Cristian S. Calude and
Nicholas J. Hay and
Frank Stephan Representation of left-computable $
\epsilon $-random reals . . . . . . . . 812--819
Vincent Blondel and
Stéphane Gaubert and
Natacha Portier The set of realizations of a max-plus
linear sequence is semi-polyhedral . . . 820--833
Anonymous Contents . . . . . . . . . . . . . . . . obc--obc
Anonymous Editorial Board . . . . . . . . . . . . ifc--ifc
Lin Guan and
Xingang Wang and
Irfan Awan and
Waltenegus Dargie Performance modeling and evaluation of
heterogeneous computer networks . . . . 835--836
Glenford Mapp and
Dhawal Thakker and
Orhan Gemikonakli Exploring gate-limited analytical models
for high-performance network storage
servers . . . . . . . . . . . . . . . . 837--851
Waltenegus Dargie and
Alexander Schill Stability and performance analysis of
randomly deployed wireless networks . . 852--860
Richard G. Clegg and
Raul Landa and
Miguel Rio Criticisms of modelling packet traffic
using long-range dependence (extended
version) . . . . . . . . . . . . . . . . 861--868
Jinpyo Hong and
Hwangnam Kim An empirical framework for user mobility
models: Refining and modeling user
registration patterns . . . . . . . . . 869--883
Sureshkumar V. Subramanian and
Rudra Dutta A study of performance and scalability
metrics of a SIP proxy server --- a
practical approach . . . . . . . . . . . 884--897
L. B. Lim and
L. Guan and
A. Grigg and
I. W. Phillips and
X. G. Wang and
I. U. Awan Controlling mean queuing delay under
multi-class bursty and correlated
traffic . . . . . . . . . . . . . . . . 898--916
Dong Kun Noh and
Kyungtae Kang Balanced energy allocation scheme for a
solar-powered sensor system and its
effects on network-wide performance . . 917--932
Anonymous Contents . . . . . . . . . . . . . . . . obc--obc
Anonymous Editorial Board . . . . . . . . . . . . ifc--ifc
Alfredo Cuzzocrea and
David Taniar Distributed XML Processing and
Management: Theory and Practice . . . . 933--935
S. Abiteboul and
G. Gottlob and
M. Manna Distributed XML design . . . . . . . . . 936--964
Alfredo Cuzzocrea and
Elisa Bertino Privacy Preserving OLAP over Distributed
XML Data: A Theoretically-Sound
Secure-Multiparty-Computation Approach 965--987
Sergio Greco and
Francesco Gullo and
Giovanni Ponti and
Andrea Tagarelli Collaborative clustering of XML
documents . . . . . . . . . . . . . . . 988--1008
Leonardo O. Moreira and
Flávio R. C. Sousa and
Javam C. Machado A distributed concurrency control
mechanism for XML data . . . . . . . . . 1009--1022
Stasys Jukna and
Georg Schnitger Min-rank conjecture for log-depth
circuits . . . . . . . . . . . . . . . . 1023--1038
Sung-Soon Choi and
Kyomin Jung and
Jeong Han Kim Almost tight upper bound for finding
Fourier coefficients of bounded
pseudo-Boolean functions . . . . . . . . 1039--1053
Bang Ye Wu A note on approximating the min-max
vertex disjoint paths on directed
acyclic graphs . . . . . . . . . . . . . 1054--1057
Iyad Kanj and
Michael J. Pelsmajer and
Marcus Schaefer and
Ge Xia On the induced matching problem . . . . 1058--1070
Stéphane Bessy and
Fedor V. Fomin and
Serge Gaspers and
Christophe Paul and
Anthony Perez and
Saket Saurabh and
Stéphan Thomassé Kernels for feedback arc set in
tournaments . . . . . . . . . . . . . . 1071--1078
Foto Afrati and
Rada Chirkova Selecting and using views to compute
aggregate queries . . . . . . . . . . . 1079--1107
Feodor F. Dragan and
Fedor V. Fomin and
Petr A. Golovach Spanners in sparse graphs . . . . . . . 1108--1119
Prakash Ramanan Memory lower bounds for XPath evaluation
over XML streams . . . . . . . . . . . . 1120--1140
Michael R. Fellows and
Jiong Guo and
Hannes Moser and
Rolf Niedermeier A generalization of Nemhauser and
Trotter's local optimization theorem . . 1141--1158
Omid Amini and
Fedor V. Fomin and
Saket Saurabh Implicit branching and parameterized
partial cover problems . . . . . . . . . 1159--1171
Carme \`Alvarez and
Joaquim Gabarro and
Maria Serna Equilibria problems on games: Complexity
versus succinctness . . . . . . . . . . 1172--1197
Anonymous Contents . . . . . . . . . . . . . . . . ibc--ibc
Anonymous Contents . . . . . . . . . . . . . . . . obc--obc
Anonymous Editorial Board . . . . . . . . . . . . ifc--ifc
Luigi Palopoli Editor's foreword . . . . . . . . . . . 1--1
Vincent Conitzer and
Tuomas Sandholm Computing optimal outcomes under an
expressive representation of settings
with externalities . . . . . . . . . . . 2--14
Shahar Dobzinski and
Noam Nisan and
Michael Schapira Truthful randomized mechanisms for
combinatorial auctions . . . . . . . . . 15--25
Diego Calvanese and
Giuseppe De Giacomo and
Maurizio Lenzerini and
Riccardo Rosati View-based query answering in
Description Logics: Semantics and
complexity . . . . . . . . . . . . . . . 26--46
Thomas Eiter and
Magdalena Ortiz and
Mantas Simkus Conjunctive query answering in the
description logic SH using knots . . . . 47--85
D. Pearce and
A. Valverde Synonymous theories and knowledge
representations in answer set
programming . . . . . . . . . . . . . . 86--104
Sivan Albagli and
Rachel Ben-Eliyahu-Zohary and
Solomon E. Shimony Markov network based ontology matching 105--118
Alessandro Armando and
Enrico Giunchiglia and
Marco Maratea and
Serena Elisa Ponta An action-based approach to the formal
specification and automatic analysis of
business processes under authorization
constraints . . . . . . . . . . . . . . 119--141
Marko Hölbl and
Tatjana Welzer and
Bostjan Brumen An improved two-party identity-based
authenticated key agreement protocol
using pairings . . . . . . . . . . . . . 142--150
Gregory Gutin and
Leo van Iersel and
Matthias Mnich and
Anders Yeo Every ternary permutation constraint
satisfaction problem parameterized above
average has a kernel with a quadratic
number of variables . . . . . . . . . . 151--163
Zhi-Zhong Chen and
Bin Ma and
Lusheng Wang A three-string approach to the closest
string problem . . . . . . . . . . . . . 164--178
Luke Mathieson and
Stefan Szeider Editing graphs to satisfy degree
constraints: A parameterized approach 179--191
Franco P. Preparata Accurate and precise aggregation
counting . . . . . . . . . . . . . . . . 192--197
Henrik Björklund and
Wim Martens The tractability frontier for NFA
minimization . . . . . . . . . . . . . . 198--210
Jianer Chen and
Jie Meng A 2 k kernel for the cluster editing
problem . . . . . . . . . . . . . . . . 211--220
Florentin Ipate Learning finite cover automata from
queries . . . . . . . . . . . . . . . . 221--244
Klaus Jansen and
Hu Zhang Scheduling malleable tasks with
precedence constraints . . . . . . . . . 245--259
Vladimir Braverman and
Rafail Ostrovsky and
Carlo Zaniolo Optimal sampling from sliding windows 260--272
Yung-Hsing Peng and
Chang-Biau Yang and
Chiou-Ting Tseng and
Chiou-Yi Hor A new efficient indexing algorithm for
one-dimensional real scaled patterns . . 273--278
Moran Feldman and
Guy Kortsarz and
Zeev Nutov Improved approximation algorithms for
Directed Steiner Forest . . . . . . . . 279--292
Jürgen Dassow and
Tomás Masopust On restricted context-free grammars . . 293--304
Serge Gaspers and
Gregory B. Sorkin A universally fastest algorithm for Max
2-Sat, Max 2-CSP, and everything in
between . . . . . . . . . . . . . . . . 305--335
Matthijs Bomhoff and
Walter Kern and
Georg Still On bounded block decomposition problems
for under-specified systems of equations 336--347
Jürg Kohlas and
Marc Pouly and
Cesar Schneuwly Generic local computation . . . . . . . 348--369
Amir Talaei-Khoei and
Terje Solvoll and
Pradeep Ray and
Nandan Parameshwaran Maintaining awareness using policies;
Enabling agents to identify relevance of
information . . . . . . . . . . . . . . 370--391
Anonymous Contents . . . . . . . . . . . . . . . . obc--obc
Anonymous Editorial Board . . . . . . . . . . . . ifc--ifc
Helmut Veith Special Issue: Games in Verification . . 393--393
Krishnendu Chatterjee and
Thomas A. Henzinger A survey of stochastic $ \omega
$-regular games . . . . . . . . . . . . 394--413
Sharon Shoham and
Orna Grumberg Multi-valued model checking games . . . 414--429
Keijo Heljanko and
Misa Keinänen and
Martin Lange and
Ilkka Niemelä Solving parity games by a reduction to
SAT . . . . . . . . . . . . . . . . . . 430--440
Barbara Jobstmann and
Stefan Staber and
Andreas Griesmayer and
Roderick Bloem Finding and fixing faults . . . . . . . 441--460
Markus Lohrey Model-checking hierarchical structures 461--490
Emilio Di Giacomo and
Walter Didimo and
Giuseppe Liotta and
Henk Meijer Drawing a tree as a minimum spanning
tree approximation . . . . . . . . . . . 491--503
Jing Tian and
Xianzhong Zhao Representations of commutative
asynchronous automata . . . . . . . . . 504--516
Nicolas Bedon and
Chloé Rispal Schützenberger and Eilenberg theorems for
words on linear orderings . . . . . . . 517--536
Christos Kapoutsis and
Richard Královic and
Tobias Mömke Size complexity of rotating and sweeping
automata . . . . . . . . . . . . . . . . 537--558
Mathias Weller and
Christian Komusiewicz and
Rolf Niedermeier and
Johannes Uhlmann On making directed graphs transitive . . 559--574
Pedro Lara and
Fábio Borges and
Renato Portugal and
Nadia Nedjah Parallel modular exponentiation using
load balancing without precomputation 575--582
Daniel Deutch and
Tova Milo A structural/temporal query language for
Business Processes . . . . . . . . . . . 583--609
Zehui Shao and
Fei Deng and
Meilian Liang and
Xiaodong Xu On sets without $k$-term arithmetic
progression . . . . . . . . . . . . . . 610--618
Jesper Jansson and
Kunihiko Sadakane and
Wing-Kin Sung Ultra-succinct representation of ordered
trees with applications . . . . . . . . 619--631
Raphael Yuster Approximate shortest paths in weighted
graphs . . . . . . . . . . . . . . . . . 632--637
Andrei A. Bulatov and
Víctor Dalmau and
Martin Grohe and
Dániel Marx Enumerating homomorphisms . . . . . . . 638--650
Jonathan Katz and
Philip MacKenzie and
Gelareh Taban and
Virgil Gligor Two-server password-only authenticated
key exchange . . . . . . . . . . . . . . 651--669
Ken-ichi Kawarabayashi and
Yusuke Kobayashi A linear time algorithm for the induced
disjoint paths problem in planar graphs 670--680
Andrei Bulatov and
Martin Dyer and
Leslie Ann Goldberg and
Markus Jalsenius and
Mark Jerrum and
David Richerby The complexity of weighted and
unweighted #CSP . . . . . . . . . . . . 681--688
Anonymous Contents . . . . . . . . . . . . . . . . ibc--ibc
Anonymous Contents . . . . . . . . . . . . . . . . obc--obc
Anonymous Editorial Board . . . . . . . . . . . . ifc--ifc
Minghui Jiang Approximability of constrained LCS . . . 689--697
Fedor V. Fomin and
Daniel Lokshtanov and
Venkatesh Raman and
Saket Saurabh and
B. V. Raghavendra Rao Faster algorithms for finding and
counting subgraphs . . . . . . . . . . . 698--706
Michael R. Fellows and
Fedor V. Fomin and
Daniel Lokshtanov and
Frances Rosamond and
Saket Saurabh and
Yngve Villanger Local search: Is brute-force avoidable? 707--719
Guohui Lin and
Randy Goebel and
Zhong Li and
Lusheng Wang An improved approximation algorithm for
the complementary maximal strip recovery
problem . . . . . . . . . . . . . . . . 720--730
Bruno Durand and
Andrei Romashchenko and
Alexander Shen Fixed-point tile sets and their
applications . . . . . . . . . . . . . . 731--764
Samir Datta and
Raghav Kulkarni and
Raghunath Tewari and
N. V. Vinodchandran Space complexity of perfect matching in
bounded genus bipartite graphs . . . . . 765--779
Benedek Nagy and
Friedrich Otto On CD-systems of stateless deterministic
R-automata with window size one . . . . 780--806
Tianrong Lin Another approach to the equivalence of
measure-many one-way quantum finite
automata and its application . . . . . . 807--821
Ahmed Bouajjani and
David Harel and
Lenore Zuck Editor's foreword . . . . . . . . . . . 822--822
Krzysztof R. Apt and
Frank S. de Boer and
Ernst-Rüdiger Olderog and
Stijn de Gouw Verification of object-oriented
programs: A transformational approach 823--852
Ittai Balaban and
Amir Pnueli and
Yaniv Sa'ar and
Lenore D. Zuck Verification of multi-linked heaps . . . 853--876
Albert Benveniste and
Timothy Bourke and
Beno\^\it Caillaud and
Marc Pouzet Non-standard semantics of hybrid systems
modelers . . . . . . . . . . . . . . . . 877--910
Roderick Bloem and
Barbara Jobstmann and
Nir Piterman and
Amir Pnueli and
Yaniv Sa'ar Synthesis of Reactive(1) designs . . . . 911--938
Egon Börger and
Antonio Cisternino and
Vincenzo Gervasi Ambient Abstract State Machines with
applications . . . . . . . . . . . . . . 939--959
Nissim Francez When are different type-logical semantic
definitions defining equivalent
meanings? . . . . . . . . . . . . . . . 960--969
David Harel and
Itai Segall Synthesis from scenario-based
specifications . . . . . . . . . . . . . 970--980
Orna Kupferman and
Amir Pnueli and
Moshe Y. Vardi Once and for all . . . . . . . . . . . . 981--996
Anonymous Contents . . . . . . . . . . . . . . . . obc--obc
Anonymous Editorial Board . . . . . . . . . . . . ifc--ifc
Chunfu Wei and
Zheng Pei and
Huamin Li An induced OWA operator in coal mine
safety evaluation . . . . . . . . . . . 997--1005
Prakash Ramanan Rewriting XPath queries using
materialized XPath views . . . . . . . . 1006--1025
Sebastian Link Characterisations of multivalued
dependency implication over undetermined
universes . . . . . . . . . . . . . . . 1026--1044
M. W. Vincent and
J. Liu and
M. Mohania The implication problem for `closest
node' functional dependencies in
complete XML documents . . . . . . . . . 1045--1098
Xiaowen Lou and
Daming Zhu A new approximation algorithm for
cut-and-paste sorting of unsigned
circular permutations . . . . . . . . . 1099--1114
Anahí Gajardo and
Jarkko Kari and
Andrés Moreira On time-symmetry in cellular automata 1115--1126
Yicheng Wen and
Asok Ray Vector space formulation of
probabilistic finite state automata . . 1127--1141
Amos Beimel and
Yeow Meng Chee and
Huaxiong Wang and
Liang Feng Zhang Communication-efficient distributed
oblivious transfer . . . . . . . . . . . 1142--1157
Rahat Iqbal and
Nazaraf Shah Information Retrieval, Decision Making
Process and User Needs . . . . . . . . . 1158--1159
Jonathan Gemmell and
Thomas Schimoler and
Bamshad Mobasher and
Robin Burke Resource recommendation in social
annotation systems: A linear-weighted
hybrid approach . . . . . . . . . . . . 1160--1174
Magdalini Eirinaki and
Shamita Pisal and
Japinder Singh Feature-based opinion mining and ranking 1175--1184
Haifeng Shen and
Mark Reilly Personalized multi-user view and content
synchronization and retrieval in
real-time mobile social software
applications . . . . . . . . . . . . . . 1185--1203
Adam Grzywaczewski and
Rahat Iqbal Task-specific information retrieval
systems for software engineers . . . . . 1204--1218
Fazilatur Rahman and
Jawed Siddiqi Semantic annotation of digital music . . 1219--1231
G. Fenza and
D. Furno and
V. Loia Hybrid approach for context-aware
service discovery in healthcare domain 1232--1247
Pir Abdul Rasool Qureshi and
Nasrullah Memon Hybrid model of content extraction . . . 1248--1257
Kashif Iqbal and
Michael O. Odetayo and
Anne James Content-based image retrieval approach
for biometric security using colour,
texture and shape features controlled by
fuzzy heuristics . . . . . . . . . . . . 1258--1277
Anonymous Contents . . . . . . . . . . . . . . . . ibc--ibc
Anonymous Contents . . . . . . . . . . . . . . . . obc--obc
Anonymous Editorial Board . . . . . . . . . . . . ifc--ifc
Jinjun Chen and
Lizhe Wang Special Issue: Cloud Computing 2011 . . 1279--1279
Linlin Wu and
Saurabh Kumar Garg and
Rajkumar Buyya SLA-based admission control for a
Software-as-a-Service provider in Cloud
computing environments . . . . . . . . . 1280--1299
Rafael Tolosana-Calasanz and
José Ángel Bañares and
Congduc Pham and
Omer F. Rana Enforcing QoS in scientific workflow
systems enacted over Cloud
infrastructures . . . . . . . . . . . . 1300--1315
Lianyong Qi and
Wanchun Dou and
Xuyun Zhang and
Jinjun Chen A QoS-aware composition method
supporting cross-platform service
invocation in cloud environment . . . . 1316--1329
David Villegas and
Norman Bobroff and
Ivan Rodero and
Javier Delgado and
Yanbin Liu and
Aditya Devarakonda and
Liana Fong and
S. Masoud Sadjadi and
Manish Parashar Cloud federation in a layered service
model . . . . . . . . . . . . . . . . . 1330--1344
Jing He and
Yanchun Zhang and
Guangyan Huang and
Yong Shi and
Jie Cao Distributed data possession checking for
securing multiple replicas in
geographically-dispersed clouds . . . . 1345--1358
David W. Chadwick and
Kaniz Fatema A privacy preserving authorisation
system for the cloud . . . . . . . . . . 1359--1373
Gaofeng Zhang and
Yun Yang and
Jinjun Chen A historical probability based noise
generation strategy for privacy
protection in cloud computing . . . . . 1374--1381
Fabrizio Marozzo and
Domenico Talia and
Paolo Trunfio P2P-MapReduce: Parallel data processing
in dynamic Cloud environments . . . . . 1382--1402
Alexander Rakhlin Foreword . . . . . . . . . . . . . . . . 1403--1403
Nicol\`o Cesa-Bianchi and
Gábor Lugosi Combinatorial bandits . . . . . . . . . 1404--1422
A. S. Dalalyan and
A. B. Tsybakov Sparse regression learning by
aggregation and Langevin Monte-Carlo . . 1423--1443
Vitaly Feldman A complete characterization of
statistical query learning with
applications to evolvability . . . . . . 1444--1459
Daniel Hsu and
Sham M. Kakade and
Tong Zhang A spectral algorithm for learning Hidden
Markov Models . . . . . . . . . . . . . 1460--1480
Adam Tauman Kalai and
Varun Kanade and
Yishay Mansour Reliable agnostic learning . . . . . . . 1481--1495
Samory Kpotufe and
Sanjoy Dasgupta A tree-based regressor that adapts to
intrinsic dimension . . . . . . . . . . 1496--1515
Alessandro Lazaric and
Rémi Munos Learning with stochastic inputs and
adversarial outputs . . . . . . . . . . 1516--1537
Yisong Yue and
Josef Broder and
Robert Kleinberg and
Thorsten Joachims The $K$-armed dueling bandits problem 1538--1556
Charles Jordan and
Thomas Zeugmann Testable and untestable classes of
first-order formulae . . . . . . . . . . 1557--1578
Prasad Chebolu and
Leslie Ann Goldberg and
Russell Martin The complexity of approximately counting
stable roommate assignments . . . . . . 1579--1605
Frederic Dorn and
Fedor V. Fomin and
Dimitrios M. Thilikos Catalan structures and dynamic
programming in H-minor-free graphs . . . 1606--1622
Lorenzo Carlucci and
Sanjay Jain and
Frank Stephan Learning with ordinal-bounded memory
from positive data . . . . . . . . . . . 1623--1636
Jianer Chen and
Jia-Hao Fan and
Iyad Kanj and
Yang Liu and
Fenghui Zhang Multicut in trees viewed through the
eyes of vertex cover . . . . . . . . . . 1637--1650
Markus Lohrey and
Sebastian Maneth and
Manfred Schmidt-Schauß Parameter reduction and automata
evaluation for grammar-compressed trees 1651--1669
Anonymous Contents . . . . . . . . . . . . . . . . ibc--ibc
Anonymous Contents . . . . . . . . . . . . . . . . obc--obc
Anonymous Editorial Board . . . . . . . . . . . . ifc--ifc
Qun Jin and
Yufeng Wang Special Issue on Multidisciplinary
Emerging Networks and Systems . . . . . 1671--1672
Shinsuke Kajioka and
Naoki Wakamiya and
Masayuki Murata Autonomous and adaptive resource
allocation among multiple nodes and
multiple applications in heterogeneous
wireless networks . . . . . . . . . . . 1673--1685
Chi Lin and
Guowei Wu and
Feng Xia and
Mingchu Li and
Lin Yao and
Zhongyi Pei Energy efficient ant colony algorithms
for data aggregation in wireless sensor
networks . . . . . . . . . . . . . . . . 1686--1702
Eitaro Kohno and
Tomoya Okazaki and
Mario Takeuchi and
Tomoyuki Ohta and
Yoshiaki Kakuda and
Masaki Aida Improvement of assurance including
security for wireless sensor networks
using dispersed data transmission . . . 1703--1715
Agustinus Borgy Waluyo and
David Taniar and
Wenny Rahayu and
Ailixier Aikebaier and
Makoto Takizawa and
Bala Srinivasan Trustworthy-based efficient data
broadcast model for P2P interaction in
resource-constrained wireless
environments . . . . . . . . . . . . . . 1716--1736
Xinxin Fan and
Mingchu Li and
Jianhua Ma and
Yizhi Ren and
Hui Zhao and
Zhiyuan Su Behavior-based reputation management in
P2P file-sharing networks . . . . . . . 1737--1750
Tadashi Dohi and
Toshikazu Uemura An adaptive mode control algorithm of a
scalable intrusion tolerant architecture 1751--1774
Hong Chen and
Xiaokang Zhou and
Qun Jin Socialized ubiquitous personal study:
Toward an individualized information
portal . . . . . . . . . . . . . . . . . 1775--1792
Henning Fernau and
Carlos Martín-Vide From the Guest Editors . . . . . . . . . 1793--1794
Dag Hovland The inclusion problem for regular
expressions . . . . . . . . . . . . . . 1795--1813
Martin Kutrib and
Andreas Malcher Reversible pushdown automata . . . . . . 1814--1827
M. Crochemore and
C. S. Iliopoulos and
M. Kubica and
J. Radoszewski and
W. Rytter and
T. Wale\'n The maximal number of cubic runs in a
word . . . . . . . . . . . . . . . . . . 1828--1836
Stefano Crespi Reghizzi and
Dino Mandrioli Operator precedence and the visibly
pushdown property . . . . . . . . . . . 1837--1867
Alberto Policriti and
Alexandru I. Tomescu and
Francesco Vezzi A randomized Numerical Aligner (rNA) . . 1868--1882
Pablo Arrighi and
Jonathan Grattage Intrinsically universal $n$-dimensional
quantum cellular automata . . . . . . . 1883--1898
Wojciech Buszkowski and
Zhe Lin and
Katarzyna Moroz Pregroup grammars with letter
promotions: Complexity and
context-freeness . . . . . . . . . . . . 1899--1909
Sanjay Jain and
Qinglong Luo and
Frank Stephan Learnability of automatic classes . . . 1910--1927
Anonymous Contents . . . . . . . . . . . . . . . . ibc--ibc
Anonymous Contents . . . . . . . . . . . . . . . . obc--obc
Anonymous Editorial Board . . . . . . . . . . . . ifc--ifc
Fedor V. Fomin and
Serge Gaspers and
Saket Saurabh and
Stéphan Thomassé A linear vertex kernel for maximum
internal spanning tree . . . . . . . . . 1--6
Florin Manea and
Catalin Tiseanu The hardness of counting full words
compatible with partial words . . . . . 7--22
Stéphane Demri and
Marcin Jurdzi\'nski and
Oded Lachish and
Ranko Lazi\'c The covering and boundedness problems
for branching vector addition systems 23--38
Klaus Jansen and
Stefan Kratsch and
Dániel Marx and
Ildikó Schlotter Bin packing with fixed number of bins
revisited . . . . . . . . . . . . . . . 39--49
Bhaskar DasGupta and
Devendra Desai On the complexity of Newman's community
finding approach for biological and
social networks . . . . . . . . . . . . 50--67
Leslie Ann Goldberg and
Mark Jerrum Approximating the Tutte polynomial of a
binary matroid and other related
combinatorial polynomials . . . . . . . 68--78
Manuel Bodirsky and
Víctor Dalmau Datalog and constraint satisfaction with
infinite templates . . . . . . . . . . . 79--100
Juha Honkala The sequence equivalence problem for
primitive D0L systems . . . . . . . . . 101--110
Alexander Kesselman and
Kirill Kogan and
Sergey Nemzer and
Michael Segal Space and speed tradeoffs in TCAM
hierarchical packet classification . . . 111--121
Longyan Gong and
Jingxin Pan and
Beibei Liu and
Shengmei Zhao A novel one-time password mutual
authentication scheme on sharing renewed
finite random sub-passwords . . . . . . 122--130
Peide Liu Some generalized dependent aggregation
operators with intuitionistic linguistic
numbers and their application to group
decision making . . . . . . . . . . . . 131--143
Dániel Marx Completely inapproximable monotone and
antimonotone parameterized problems . . 144--151
Yongzhi Cao and
Lirong Xia and
Mingsheng Ying Probabilistic automata for computing
with words . . . . . . . . . . . . . . . 152--172
Anonymous Contents . . . . . . . . . . . . . . . . obc--obc
Anonymous Editorial Board . . . . . . . . . . . . ifc--ifc
Xiaolong Jin and
Ahmed Y. Al-Dubai and
Laurence T. Yang Special issue: Frontiers and advance
topics of computer and information
technology . . . . . . . . . . . . . . . 173--174
John M. Ye and
Man Cao and
Zening Qu and
Tianzhou Chen Regional cache organization for NoC
based many-core processors . . . . . . . 175--186
Dingding Li and
Hai Jin and
Xiaofei Liao and
Yu Zhang and
Bingbing Zhou Improving disk I/O performance in a
virtualized system . . . . . . . . . . . 187--200
Gang Chen and
Yongwei Wu and
Jie Wu and
Weimin Zheng TopCluster: a hybrid cluster model to
support dynamic deployment in Grid . . . 201--215
You Li and
Kaiyong Zhao and
Xiaowen Chu and
Jiming Liu Speeding up $k$-Means algorithm by GPUs 216--229
Ranieri Baraglia and
Gabriele Capannini and
Patrizio Dazzi and
Giancarlo Pagano A multi-criteria job scheduling
framework for large computing farms . . 230--244
Lihong Zheng and
Xiangjian He and
Bijan Samali and
Laurence T. Yang An algorithm for accuracy enhancement of
license plate recognition . . . . . . . 245--255
Jun Ma and
Long Zheng and
Mianxiong Dong and
Xiangjian He and
Minyi Guo and
Yuichi Yaguchi and
Ryuichi Oka A segmentation-free method for image
classification based on pixel-wise
matching . . . . . . . . . . . . . . . . 256--268
Junfeng Xu and
Keqiu Li and
Geyong Min Asymmetric multi-path division
communications in underwater acoustic
networks with fading channels . . . . . 269--278
Guojun Wang and
Fengshun Yue and
Qin Liu A secure self-destructing scheme for
electronic data . . . . . . . . . . . . 279--290
Ranieri Baraglia and
Patrizio Dazzi and
Matteo Mordacchini and
Laura Ricci A peer-to-peer recommender system for
self-emerging user communities based on
gossip overlays . . . . . . . . . . . . 291--308
Anonymous Contents . . . . . . . . . . . . . . . . obc--obc
Anonymous Editorial Board . . . . . . . . . . . . ifc--ifc
Alfredo Cuzzocrea Theoretical and practical aspects of
warehousing, querying and mining sensor
and streaming data . . . . . . . . . . . 309--311
Rimma V. Nehme and
Karen Works and
Chuan Lei and
Elke A. Rundensteiner and
Elisa Bertino Multi-route query processing and
optimization . . . . . . . . . . . . . . 312--329
Karen Works and
Elke A. Rundensteiner and
Emmanuel Agu Optimizing adaptive multi-route query
processing via time-partitioned indices 330--348
Georgios Chatzimilioudis and
Alfredo Cuzzocrea and
Dimitrios Gunopulos and
Nikos Mamoulis A novel distributed framework for
optimizing query routing trees in
wireless sensor networks via optimal
operator placement . . . . . . . . . . . 349--368
Mohamed Medhat Gaber and
Shonali Krishnaswamy and
Brett Gillick and
Hasnain AlTaiar and
Nicholas Nicoloudis and
Jonathan Liono and
Arkady Zaslavsky Interactive self-adaptive clutter-aware
visualisation for mobile data mining . . 369--382
Lu-An Tang and
Xiao Yu and
Sangkyum Kim and
Quanquan Gu and
Jiawei Han and
Alice Leung and
Thomas La Porta Trustworthiness analysis of sensor data
in cyber-physical systems . . . . . . . 383--401
Anonymous Contents . . . . . . . . . . . . . . . . obc--obc
Anonymous Editorial Board . . . . . . . . . . . . ifc--ifc
H. Sarbazi-Azad and
N. Bagherzadeh Multicore computing systems:
Architecture, programming tools, and
applications . . . . . . . . . . . . . . 403--405
Morteza Mohaqeqi and
Mehdi Kargahi Utility accrual object distribution in
MPSoC real-time embedded systems . . . . 406--420
Chifeng Wang and
Wen-Hsiang Hu and
Nader Bagherzadeh Scalable load balancing congestion-aware
Network-on-Chip router architecture . . 421--439
Amir-Mohammad Rahmani and
Pasi Liljeberg and
Juha Plosila and
Hannu Tenhunen Developing a power-efficient and
low-cost $3$D NoC using smart GALS-based
vertical channels . . . . . . . . . . . 440--456
A. Mahabadi and
S. M. Zahedi and
A. Khonsari Reliable energy-aware application
mapping and voltage-frequency island
partitioning for GALS-based NoC . . . . 457--474
Masoumeh Ebrahimi and
Masoud Daneshtalab and
Pasi Liljeberg and
Juha Plosila and
Hannu Tenhunen Cluster-based topologies for $3$D
Networks-on-Chip using advanced
inter-layer bus architecture . . . . . . 475--491
Mohammad Arjomand and
S. Hamid Amiri and
Hamid Sarbazi-Azad Efficient genetic based topological
mapping using analytical models for
on-chip networks . . . . . . . . . . . . 492--513
Anonymous Contents . . . . . . . . . . . . . . . . obc--obc
Anonymous Editorial Board . . . . . . . . . . . . ifc--ifc
Guojun Wang and
Jianhua Ma and
Xiaolin (Andy) Li and
Athanasios V. Vasilakos Special issue of JCSS on UbiSafe
computing and communications . . . . . . 515--517
Meikang Qiu and
Lei Zhang and
Zhong Ming and
Zhi Chen and
Xiao Qin and
Laurence T. Yang Security-aware optimization for
ubiquitous computing systems with SEAT
graph approach . . . . . . . . . . . . . 518--529
Chaitanya Belwal and
Albert M. K. Cheng and
Bo Liu Feasibility interval for the
transactional event handlers of P-FRP 530--541
Xuyun Zhang and
Chang Liu and
Surya Nepal and
Jinjun Chen An efficient quasi-identifier index
based approach for privacy preservation
over incremental data sets on cloud . . 542--555
Zheng Yan and
Yu Chen and
Yue Shen A practical reputation system for
pervasive social chatting . . . . . . . 556--572
Jun Zhang and
Yang Xiang and
Wanlei Zhou and
Yu Wang Unsupervised traffic classification
using flow statistical properties and IP
packet payload . . . . . . . . . . . . . 573--585
Sancheng Peng and
Guojun Wang and
Shui Yu Modeling the dynamics of worm
propagation using two-dimensional
cellular automata in smartphones . . . . 586--595
Xing Su and
Minjie Zhang and
Yi Mu and
Quan Bai A robust trust model for
service-oriented systems . . . . . . . . 596--608
Jianxin Wang and
Yongjie Yang and
Jiong Guo and
Jianer Chen Planar graph vertex partition for linear
problem kernels . . . . . . . . . . . . 609--621
Dominik D. Freydenberger and
Daniel Reidenbach Inferring descriptive generalisations of
formal languages . . . . . . . . . . . . 622--639
Krishnendu Chatterjee and
Luca de Alfaro and
Thomas A. Henzinger Strategy improvement for concurrent
reachability and turn-based stochastic
safety games . . . . . . . . . . . . . . 640--657
Hamed M. K. Alazemi and
Anton Cerný Several extensions of the Parikh matrix
L-morphism . . . . . . . . . . . . . . . 658--668
Nai-Wen Chang and
Sun-Yuan Hsieh $ \{ 2, 3 \} $-Extraconnectivities of
hypercube-like networks . . . . . . . . 669--688
Stéphane Demri On selective unboundedness of VASS . . . 689--713
Olivier Bournez and
Daniel S. Graça and
Emmanuel Hainry Computation with perturbed dynamical
systems . . . . . . . . . . . . . . . . 714--724
Rohit Khandekar and
Guy Kortsarz and
Zeev Nutov On some network design problems with
degree constraints . . . . . . . . . . . 725--736
Anonymous Contents . . . . . . . . . . . . . . . . obc--obc
Anonymous Editorial Board . . . . . . . . . . . . ifc--ifc
Pablo Barceló Editor's foreword . . . . . . . . . . . 737--738
Serge Abiteboul and
Balder ten Cate and
Yannis Katsis On the equivalence of distributed
systems with queries and communication 739--762
Marcelo Arenas and
Jorge Pérez and
Juan Reutter and
Cristian Riveros The language of plain SO-tgds:
Composition, inversion and structural
properties . . . . . . . . . . . . . . . 763--784
Mikolaj Boja\'nczyk and
Leszek A. Kolodziejczyk and
Filip Murlak Solutions in XML data exchange . . . . . 785--815
Diego Calvanese and
Giuseppe De Giacomo and
Maurizio Lenzerini and
Moshe Y. Vardi On simplification of schema mappings . . 816--834
Evgeny Kharlamov and
Dmitriy Zheleznyakov and
Diego Calvanese Capturing model-based ontology evolution
at the instance level: The case of
DL-Lite . . . . . . . . . . . . . . . . 835--872
Ting Deng and
Wenfei Fan and
Leonid Libkin and
Yinghui Wu On the aggregation problem for
synthesized Web services . . . . . . . . 873--891
Dominik D. Freydenberger and
Nicole Schweikardt Expressiveness and static analysis of
extended conjunctive regular path
queries . . . . . . . . . . . . . . . . 892--909
Wouter Gelade and
Tomasz Idziaszek and
Wim Martens and
Frank Neven and
Jan Paredaens Simplifying XML Schema: Single-type
approximations of regular tree languages 910--936
Michael Meier and
Michael Schmidt and
Fang Wei and
Georg Lausen Semantic query optimization in the
presence of types . . . . . . . . . . . 937--957
Dany Maslowski and
Jef Wijsen A dichotomy in the complexity of
counting database repairs . . . . . . . 958--983
Reinhard Pichler and
Sebastian Skritek Tractable counting of the answers to
conjunctive queries . . . . . . . . . . 984--1001
Anonymous Contents . . . . . . . . . . . . . . . . obc--obc
Anonymous Editorial Board . . . . . . . . . . . . ifc--ifc
Tomoya Enokido and
Leonard Barolli and
Makoto Takizawa Special issue on intelligent and
innovative information systems . . . . . 1003--1004
Joseph Kee-Yin Ng and
Kam-Yiu Lam and
Quan Jia Cheng and
Kevin Chin Yiu Shum An effective signal strength-based
wireless location estimation system for
tracking indoor mobile users . . . . . . 1005--1016
David Taniar and
Wenny Rahayu A taxonomy for nearest neighbour queries
in spatial databases . . . . . . . . . . 1017--1039
Anhar Fazal and
Farookh Khadeer Hussain and
Tharam S. Dillon An innovative approach for automatically
grading spelling in essays using
rubric-based scoring . . . . . . . . . . 1040--1056
Rubén Casado and
Muhammad Younas and
Javier Tuya Multi-dimensional criteria for testing
web services transactions . . . . . . . 1057--1076
Minoru Uehara Advanced orthogonal RAID based on
virtual disks . . . . . . . . . . . . . 1077--1085
Fatos Xhafa and
Xavier Herrero and
Admir Barolli and
Leonard Barolli and
Makoto Takizawa Evaluation of struggle strategy in
Genetic Algorithms for ground stations
scheduling problem . . . . . . . . . . . 1086--1100
Akio Koyama and
Hiroyuki Suzuki Real object-oriented communication
method for ad hoc networks . . . . . . . 1101--1112
Nils Müllner and
Oliver Theel and
Martin Fränzle Combining decomposition and reduction
for state space analysis of a
self-stabilizing system . . . . . . . . 1113--1125
Mark McCann and
Nicholas Pippenger Fault tolerance in cellular automata at
low fault rates . . . . . . . . . . . . 1126--1143
Lavinia Egidi and
Giovanni Manzini Better spaced seeds using Quadratic
Residues . . . . . . . . . . . . . . . . 1144--1155
Uéverton dos Santos Souza and
Fábio Protti and
Maise Dantas da Silva Revisiting the complexity of and/or
graph solution . . . . . . . . . . . . . 1156--1163
Dariusz R. Kowalski and
Andrzej Pelc Leader election in ad hoc radio
networks: a keen ear helps . . . . . . . 1164--1180
Yuan Feng and
Nengkun Yu and
Mingsheng Ying Model checking quantum Markov chains . . 1181--1198
Anonymous Contents . . . . . . . . . . . . . . . . ibc--ibc
Anonymous Contents . . . . . . . . . . . . . . . . obc--obc
Anonymous Editorial Board . . . . . . . . . . . . ifc--ifc
Yanming Shen and
Keqiu Li and
Weisong Shi Advanced topics on cloud computing . . . 1199--1199
Wei Wu and
Jianying Zhou and
Yang Xiang and
Li Xu How to achieve non-repudiation of origin
with privacy protection in cloud
computing . . . . . . . . . . . . . . . 1200--1213
Xuanhua Shi and
Hongbo Jiang and
Ligang He and
Hai Jin and
Chonggang Wang and
Bo Yu and
Xueguang Chen Developing an optimized application
hosting framework in Clouds . . . . . . 1214--1229
Yongqiang Gao and
Haibing Guan and
Zhengwei Qi and
Yang Hou and
Liang Liu A multi-objective ant colony system
algorithm for virtual machine placement
in cloud computing . . . . . . . . . . . 1230--1242
Waseem Ahmed and
Yong Wei Wu A survey on reliability in distributed
systems . . . . . . . . . . . . . . . . 1243--1255
Xingfu Wu and
Valerie Taylor Performance modeling of hybrid
MPI/OpenMP scientific applications on
large-scale multicore supercomputers . . 1256--1268
Iain A. Stewart Multiswapped networks and their
topological and algorithmic properties 1269--1286
Zoltán Ádám Mann and
Anikó Szajkó Average-case complexity of backtrack
search for coloring sparse random graphs 1287--1301
Michael Benedikt and
Gabriele Puppis and
Cristian Riveros Bounded repairability of word languages 1302--1321
Krishnaram Kenthapadi and
Nina Mishra and
Kobbi Nissim Denials leak information: Simulatable
auditing . . . . . . . . . . . . . . . . 1322--1340
Miguel Caballer and
Carlos de Alfonso and
Fernando Alvarruiz and
Germán Moltó EC3: Elastic Cloud Computing Cluster . . 1341--1351
Anonymous Contents . . . . . . . . . . . . . . . . obc--obc
Anonymous Editorial Board . . . . . . . . . . . . ifc--ifc
S. Ventura and
C. Romero and
A. Abraham Foreword: Intelligent data analysis . . 1--2
Manuel Baena-García and
José M. Carmona-Cejudo and
Rafael Morales-Bueno String analysis by sliding positioning
strategy . . . . . . . . . . . . . . . . 3--15
Prakash Shelokar and
Arnaud Quirin and
Óscar Cordón Three-objective subgraph mining using
multiobjective evolutionary programming 16--26
Abir Smiti and
Zied Elouedi WCOID-DG: an approach for case base
maintenance based on Weighting,
Clustering, Outliers, Internal Detection
and Dbsan-Gmeans . . . . . . . . . . . . 27--38
Ricardo Cerri and
Rodrigo C. Barros and
André C. P. L. F. de Carvalho Hierarchical multi-label classification
using local neural networks . . . . . . 39--56
Alvaro Ortigosa and
Rosa M. Carro and
José Ignacio Quiroga Predicting user personality by mining
social interactions in Facebook . . . . 57--71
Pasquale De Meo and
Emilio Ferrara and
Giacomo Fiumara and
Alessandro Provetti Mixing local and global information for
community detection in large networks 72--87
José Otero and
Luciano Sánchez and
Inés Couso and
Ana Palacios Bootstrap analysis of multiple
repetitions of experiments using an
interval-valued multiple comparison
procedure . . . . . . . . . . . . . . . 88--100
David García and
Antonio González and
Raúl Pérez A feature construction approach for
genetic iterative rule learning
algorithm . . . . . . . . . . . . . . . 101--117
M. Martínez-Ballesteros and
I. A. Nepomuceno-Chamorro and
J. C. Riquelme Discovering gene association networks by
multi-objective evolutionary
quantitative association rules . . . . . 118--136
Tomás Brázdil and
Václav Brozek and
Vojtech Forejt and
Antonín Kucera Branching-time model-checking of
probabilistic pushdown automata . . . . 139--156
Fedor V. Fomin and
Petr A. Golovach Parameterized complexity of connected
even/odd subgraph problems . . . . . . . 157--179
Robert Ganian and
Petr Hlin\vený and
Alexander Langer and
Jan Obdr\vzálek and
Peter Rossmanith and
Somnath Sikdar Lower bounds on the complexity of MSO1
model-checking . . . . . . . . . . . . . 180--194
Kaiping Xue and
Peilin Hong and
Changsha Ma A lightweight dynamic pseudonym identity
based authentication and key agreement
protocol without verification tables for
multi-server architecture . . . . . . . 195--206
Archontia C. Giannopoulou and
Iosif Salem and
Dimitris Zoros Effective computation of immersion
obstructions for unions of graph classes 207--216
Jin-Yi Cai and
Pinyan Lu and
Mingji Xia The complexity of complex weighted
Boolean #CSP . . . . . . . . . . . . . . 217--236
Shuping Wan and
Jiuying Dong A possibility degree method for
interval-valued intuitionistic fuzzy
multi-attribute group decision making 237--256
Paolo Romano and
Roberto Palmieri and
Francesco Quaglia and
Nuno Carvalho and
Luis Rodrigues On speculative replication of
transactional systems . . . . . . . . . 257--276
Arnaud Durand and
Stefan Mengel The complexity of weighted counting for
acyclic conjunctive queries . . . . . . 277--296
Mika Göös and
Tuomo Lempiäinen and
Eugen Czeizler and
Pekka Orponen Search methods for tile sets in
patterned DNA self-assembly . . . . . . 297--319
Anonymous Contents . . . . . . . . . . . . . . . . obc--obc
Anonymous Editorial Board . . . . . . . . . . . . ifc--ifc
Anuj Dawar and
Ruy de Queiroz Editor's foreword: WoLLIC 2010 . . . . . 321--322
Naeem Abbasi and
Osman Hasan and
Sofi\`ene Tahar An approach for lifetime reliability
analysis using theorem proving . . . . . 323--345
Aditi Barthwal and
Michael Norrish A mechanisation of some context-free
language theory in HOL4 . . . . . . . . 346--362
T. Kotek and
J. A. Makowsky A representation theorem for
($q$-)holonomic sequences . . . . . . . 363--374
Markus Latte and
Martin Lange Branching-time logics with path
relativisation . . . . . . . . . . . . . 375--389
Glyn Morrill and
Oriol Valentín Displacement logic for anaphora . . . . 390--409
R. H. S. Reiser and
B. C. Bedregal and
G. A. A. dos Reis Interval-valued fuzzy coimplications and
related dual interval-valued conjugate
functions . . . . . . . . . . . . . . . 410--425
Nadia Creignou and
Odile Papini and
Reinhard Pichler and
Stefan Woltran Belief revision within fragments of
propositional logic . . . . . . . . . . 427--449
Aryeh Kontorovich and
Ari Trachtenberg Deciding unique decodability of bigram
counts via finite automata . . . . . . . 450--456
Adrian Ionescu and
Ernst L. Leiss On the role of complementation in
implicit language equations and
relations . . . . . . . . . . . . . . . 457--467
Fedor V. Fomin and
Bart M. P. Jansen and
Michal Pilipczuk Preprocessing subgraph and minor
problems: When does a small vertex cover
help? . . . . . . . . . . . . . . . . . 468--495
William Hesse and
Eric Allender and
David A. Mix Barrington Corrigendum to ``Uniform constant-depth
threshold circuits for division and
iterated multiplication'' [J. Comput.
System Sci. \bf 65 (4) (2002) 695--716] 496--497
Anonymous Contents . . . . . . . . . . . . . . . . obc--obc
Anonymous Editorial Board . . . . . . . . . . . . ifc--ifc
Al-Sakib Khan Pathan and
Zubair Muhammad Fadlullah and
Mostafa M. Fouda and
Hae Young Lee Defending against wireless network
intrusion . . . . . . . . . . . . . . . 499--501
Alif Wahid and
Christopher Leckie and
Chenfeng Zhou Estimating the number of hosts
corresponding to an intrusion alert
while preserving privacy . . . . . . . . 502--519
Yifan Zhao and
Swee-Won Lo and
Robert H. Deng and
Xuhua Ding Technique for authenticating H.264/SVC
and its performance evaluation over
wireless mobile networks . . . . . . . . 520--532
Yang Yang Broadcast encryption based
non-interactive key distribution in
MANETs . . . . . . . . . . . . . . . . . 533--545
Zhiwei Wang and
Guozi Sun and
Danwei Chen A new definition of homomorphic
signature for identity management in
mobile cloud computing . . . . . . . . . 546--553
P. M. Mafra and
J. S. Fraga and
A. O. Santin Algorithms for a distributed IDS in
MANETs . . . . . . . . . . . . . . . . . 554--570
Manuel Gil Pérez and
Félix Gómez Mármol and
Gregorio Martínez Pérez and
Antonio F. Skarmeta Gómez Building a reputation-based
bootstrapping mechanism for newcomers in
collaborative alert systems . . . . . . 571--590
Saeed Ur Rehman and
Kevin W. Sowerby and
Colin Coghill Analysis of impersonation attacks on
systems using RF fingerprinting and
low-end receivers . . . . . . . . . . . 591--601
Guangjie Han and
Jinfang Jiang and
Lei Shu and
Jianwei Niu and
Han-Chieh Chao Management and applications of trust in
Wireless Sensor Networks: a survey . . . 602--617
Thanassis Giannetsos and
Tassos Dimitriou LDAC: a localized and decentralized
algorithm for efficiently countering
wormholes in mobile wireless networks 618--643
H. Shafiei and
A. Khonsari and
H. Derakhshi and
P. Mousavi Detection and mitigation of sinkhole
attacks in wireless sensor networks . . 644--653
M. Conti and
R. Di Pietro and
A. Spognardi Clone wars: Distributed detection of
clone attacks in mobile WSNs . . . . . . 654--669
Leonardo Maccari and
Renato Lo Cigno Betweenness estimation in OLSR-based
multi-hop networks for distributed
filtering . . . . . . . . . . . . . . . 670--685
Anonymous Contents . . . . . . . . . . . . . . . . obc--obc
Anonymous Editorial Board . . . . . . . . . . . . ifc--ifc
R. Crowston and
M. Fellows and
G. Gutin and
M. Jones and
E. J. Kim and
F. Rosamond and
I. Z. Ruzsa and
S. Thomassé and
A. Yeo Satisfying more than half of a system of
linear equations over GF(2): a
multivariate approach . . . . . . . . . 687--696
Edith Hemaspaandra and
Lane A. Hemaspaandra and
Jörg Rothe The complexity of online manipulation of
sequential elections . . . . . . . . . . 697--710
Gabriele Fici On the structure of bispecial Sturmian
words . . . . . . . . . . . . . . . . . 711--719
Stanislav Böhm and
Stefan Göller and
Petr Jancar Bisimulation equivalence and regularity
for real-time one-counter automata . . . 720--743
Richard Královic Infinite vs. finite size-bounded
randomized computations . . . . . . . . 744--765
Sam Buss and
Michael Soltys Unshuffling a square is NP-hard . . . . 766--776
Sanjay Jain and
Eric Martin and
Frank Stephan Robust learning of automatic classes of
languages . . . . . . . . . . . . . . . 777--795
Carlos Gómez-Rodríguez Finding the smallest binarization of a
CFG is NP-hard . . . . . . . . . . . . . 796--805
John Case and
Sanjay Jain and
Yuh Shin Ong and
Pavel Semukhin and
Frank Stephan Automatic learners with feedback queries 806--820
Stefania Tosi and
Sara Casolari and
Michele Colajanni Detecting correlation between server
resources for system management . . . . 821--836
Qi Duan and
Jinhui Xu On the connectivity preserving minimum
cut problem . . . . . . . . . . . . . . 837--848
A. Çivril Column Subset Selection Problem is
UG-hard . . . . . . . . . . . . . . . . 849--859
Danny Dolev and
Matthias Függer and
Markus Posch and
Ulrich Schmid and
Andreas Steininger and
Christoph Lenzen Rigorously modeling self-stabilizing
fault-tolerant circuits: an ultra-robust
clocking scheme for systems-on-chip . . 860--900
Anonymous Contents . . . . . . . . . . . . . . . . obc--obc
Anonymous Editorial Board . . . . . . . . . . . . ifc--ifc
Rebecca Capone Publisher's note . . . . . . . . . . . . 901--901
Jinjun Chen and
Jianxun Liu Special Issue: Dependable and Secure
Computing . . . . . . . . . . . . . . . 902--902
Yongming Xie and
Guojun Wang Message matching-based greedy behavior
detection in delay tolerant networks . . 903--915
Aarthi Nagarajan and
Vijay Varadharajan and
Nathan Tarr Trust enhanced distributed authorisation
for web services . . . . . . . . . . . . 916--934
Christopher Bailey and
David W. Chadwick and
Rogério de Lemos Self-adaptive federated authorization
infrastructures . . . . . . . . . . . . 935--952
Atef Shalan and
Mohammad Zulkernine Software control flow error detection
and correlation with system performance
deviation . . . . . . . . . . . . . . . 953--972
Julian Jang-Jaccard and
Surya Nepal A survey of emerging threats in
cybersecurity . . . . . . . . . . . . . 973--993
Jiaqi Zhao and
Lizhe Wang and
Jie Tao and
Jinjun Chen and
Weiye Sun and
Rajiv Ranjan and
Joanna Ko\lodziej and
Achim Streit and
Dimitrios Georgakopoulos A security framework in G-Hadoop for big
data computing across distributed Cloud
data centres . . . . . . . . . . . . . . 994--1007
Xuyun Zhang and
Chang Liu and
Surya Nepal and
Chi Yang and
Wanchun Dou and
Jinjun Chen A hybrid approach for scalable sub-tree
anonymization over big data using
MapReduce on cloud . . . . . . . . . . . 1008--1020
Yu Wang and
Yang Xiang and
Jun Zhang and
Wanlei Zhou and
Bailin Xie Internet traffic clustering with side
information . . . . . . . . . . . . . . 1021--1036
Anonymous Contents . . . . . . . . . . . . . . . . obc--obc
Anonymous Editorial Board . . . . . . . . . . . . ifc--ifc
Anonymous The 9th IEEE International Conference on
Dependable, Autonomic and Secure
Computing . . . . . . . . . . . . . . . ??
Lev Beklemishev and
Ruy De Queiroz and
Andre Scedrov Editors' foreword . . . . . . . . . . . 1037--1037
Antonis Achilleos A complexity question in justification
logic . . . . . . . . . . . . . . . . . 1038--1045
Samuel Bucheli and
Roman Kuznets and
Thomas Studer Realizing public announcements by
justifications . . . . . . . . . . . . . 1046--1066
Ranald Clouston Nominal Lawvere Theories: a category
theoretic account of equational theories
with names . . . . . . . . . . . . . . . 1067--1086
F. M. Ferreira and
C. M. Freire and
M. R. F. Benevides and
L. Menasché Schechter and
A. T. Martins Polynomial hierarchy graph properties in
hybrid logic . . . . . . . . . . . . . . 1087--1101
Santiago Figueira and
Daniel Gorín and
Rafael Grimson Independence friendly logic with
classical negation via flattening is a
second-order logic with weak
dependencies . . . . . . . . . . . . . . 1102--1118
Julian Gutierrez and
Glynn Winskel On the determinacy of concurrent games
on event structures with infinite
winning sets . . . . . . . . . . . . . . 1119--1137
Max Kanovich Multiset rewriting over Fibonacci and
Tribonacci numbers . . . . . . . . . . . 1138--1151
Juha Kontinen and
Jakub Szymanik A characterization of definability of
second-order generalized quantifiers
with applications to non-definability 1152--1162
Rick Statman On polymorphic types of untyped terms 1163--1173
Anonymous Contents . . . . . . . . . . . . . . . . obc--obc
Anonymous Editorial Board . . . . . . . . . . . . ifc--ifc
J. Aracena and
A. Richard and
L. Salinas Maximum number of fixed points in
AND-OR-NOT networks . . . . . . . . . . 1175--1190
Tom J. Ameloot and
Jan Van den Bussche Positive Dedalus programs tolerate
non-causality . . . . . . . . . . . . . 1191--1213
Edith Cohen and
Nick Duffield and
Haim Kaplan and
Carstent Lund and
Mikkel Thorup Algorithms and estimators for
summarization of unaggregated data
streams . . . . . . . . . . . . . . . . 1214--1244
Amihood Amir and
Alberto Apostolico and
Gad M. Landau and
Avivit Levy and
Moshe Lewenstein and
Ely Porat Range LCP . . . . . . . . . . . . . . . 1245--1253
Jesús García López and
Florin Manea and
Victor Mitrana Prefix-suffix duplication . . . . . . . 1254--1265
Nikolaos Laoutaris and
Laura Poplawski and
Rajmohan Rajaraman and
Ravi Sundaram and
Shang-Hua Teng Bounded Budget Connection (BBC) games or
how to make friends and influence
people, on a budget . . . . . . . . . . 1266--1284
Cristina Bazgan and
Morgan Chopin and
Marek Cygan and
Michael R. Fellows and
Fedor V. Fomin and
Erik Jan van Leeuwen Parameterized complexity of firefighting 1285--1297
Manfred Broy Verifying of interface assertions for
infinite state Mealy machines . . . . . 1298--1322
Amir Talaei-Khoei and
Suchada Vichitvanichphong and
Terje Solvoll and
Pradeep Ray and
Amir Hossein Ghapanchi A methodology to develop awareness in
computer supported collaborative work
using policies . . . . . . . . . . . . . 1323--1338
Chunguang Li and
Shouzhen Zeng and
Tiejun Pan and
Leina Zheng A method based on induced aggregation
operators and distance measures to
multiple attribute decision making under
$2$-tuple linguistic environment . . . . 1339--1349
Haitao Jiang and
Binhai Zhu A linear kernel for the complementary
maximal strip recovery problem . . . . . 1350--1358
Christian Glaßer and
Stephen Travers and
Klaus W. Wagner Perfect correspondences between
dot-depth and polynomial-time
hierarchies . . . . . . . . . . . . . . 1359--1373
Fedor V. Fomin and
Yngve Villanger Searching for better fill-in . . . . . . 1374--1383
Matthias Mnich and
Geevarghese Philip and
Saket Saurabh and
Ondrej Suchý Beyond Max-Cut: $ \lambda $-extendible
properties parameterized above the
Poljak--Turzík bound . . . . . . . . . . 1384--1403
Moein Kianpour and
Reza Sabbaghi-Nadooshan and
Keivan Navi A novel design of $8$-bit
adder/subtractor by quantum-dot cellular
automata . . . . . . . . . . . . . . . . 1404--1414
Albert Atserias and
Sergi Oliva Bounded-width QBF is PSPACE-complete . . 1415--1429
Fedor V. Fomin and
Stefan Kratsch and
Marcin Pilipczuk and
Michal Pilipczuk and
Yngve Villanger Tight bounds for parameterized
complexity of Cluster Editing with a
small number of clusters . . . . . . . . 1430--1447
Sergio Flesca and
Filippo Furfaro and
Francesco Parisi Consistency checking and querying in
probabilistic databases under integrity
constraints . . . . . . . . . . . . . . 1448--1489
Anonymous Contents . . . . . . . . . . . . . . . . obc--obc
Anonymous Editorial Board . . . . . . . . . . . . ifc--ifc
Yang Xiang and
Ivan Stojmenovic and
Peter Mueller Editorial: Special Issue on Theory and
Applications in Parallel and Distributed
Computing Systems . . . . . . . . . . . 1491--1492
Hua Wang and
Lili Sun and
Elisa Bertino Building access control policy model for
privacy preserving and testing policy
conflicting problems . . . . . . . . . . 1493--1503
Ahmed Sallam and
Kenli Li and
Aijia Ouyang and
Zhiyong Li Proactive workload management in dynamic
virtualized environments . . . . . . . . 1504--1517
Lan Zhou and
Vijay Varadharajan and
Michael Hitchens Secure administration of cryptographic
role-based access control for
large-scale cloud storage systems . . . 1518--1533
Zhide Chen and
Cheng Qiao and
Yihui Qiu and
Li Xu and
Wei Wu Dynamics stability in wireless sensor
networks active defense model . . . . . 1534--1548
Guiyi Wei and
Rongxing Lu and
Jun Shao EFADS: Efficient, flexible and anonymous
data sharing protocol for cloud
computing with proxy re-encryption . . . 1549--1562
Chi Yang and
Xuyun Zhang and
Changmin Zhong and
Chang Liu and
Jian Pei and
Kotagiri Ramamohanarao and
Jinjun Chen A spatiotemporal compression based
approach for efficient big data
processing on Cloud . . . . . . . . . . 1563--1583
Younchan Jung and
Enrique Festijo One-time packet key exchange scheme for
secure real-time multimedia applications 1584--1596
Sébastien Gambs and
Marc-Olivier Killijian and
Miguel Núñez del Prado Cortez De-anonymization attack on geolocated
data . . . . . . . . . . . . . . . . . . 1597--1614
Anonymous Editorial Board . . . . . . . . . . . . ifc--ifc
Jia Hu and
Seetharami Seelam and
Laurent Lefevre Introduction to special issue on High
Performance Computing Architectures and
Systems . . . . . . . . . . . . . . . . 1--2
Xiaofei Liao and
Hai Jin and
Shizhan Yu and
Yu Zhang A novel memory allocation scheme for
memory energy reduction in
virtualization environment . . . . . . . 3--15
Hervé Paulino and
Eduardo Marques Heterogeneous programming with Single
Operation Multiple Data . . . . . . . . 16--37
Seren Soner and
Can Özturan Integer programming based heterogeneous
CPU-GPU cluster schedulers for SLURM
resource manager . . . . . . . . . . . . 38--56
Jianliang Ma and
Licheng Yu and
John M. Ye and
Tianzhou Chen MCMG simulator: a unified simulation
framework for CPU and graphic GPU . . . 57--71
I. Chakroun and
N. Melab Towards a heterogeneous and adaptive
parallel Branch-and-Bound algorithm . . 72--84
Hussain Al-Aqrabi and
Lu Liu and
Richard Hill and
Nick Antonopoulos Cloud BI: Future of business
intelligence in the Cloud . . . . . . . 85--96
Mustafa Bani Khalaf and
Ahmed Y. Al-Dubai and
Geyong Min New efficient velocity-aware
probabilistic route discovery schemes
for high mobility Ad hoc networks . . . 97--109
Jianjiang Wang and
Xiaomin Zhu and
Laurence T. Yang and
Jianghan Zhu and
Manhao Ma Towards dynamic real-time scheduling for
multiple earth observation satellites 110--124
Minghui Zheng and
Yang Xiang and
Huihua Zhou A strong provably secure IBE scheme
without bilinear map . . . . . . . . . . 125--131
Wei Li and
Demetres D. Kouvatsos and
Rod J. Fretwell Towards time domain invariant QoS
measures for queues with correlated
traffic . . . . . . . . . . . . . . . . 132--144
Yuwei Xu and
Jeremiah D. Deng and
Mariusz Nowostawski and
Martin K. Purvis Optimized routing for video streaming in
multi-hop wireless networks using
analytical capacity estimation . . . . . 145--157
Petra Berenbrink and
Colin Cooper and
Tom Friedetzky and
Tobias Friedrich and
Thomas Sauerwald Randomized diffusion for indivisible
loads . . . . . . . . . . . . . . . . . 159--185
Eun Jung Kim and
Christophe Paul and
Geevarghese Philip A single-exponential FPT algorithm for
the K4-minor cover problem . . . . . . . 186--207
Yanhui Zhai and
Deyu Li and
Kaishe Qu Decision implication canonical basis: a
logical perspective . . . . . . . . . . 208--218
Andrea Clementi and
Riccardo Silvestri Parsimonious flooding in geometric
random-walks . . . . . . . . . . . . . . 219--233
Evangelos Bampas and
Davide Bil\`o and
Guido Drovandi and
Luciano Gual\`a and
Ralf Klasing and
Guido Proietti Network verification via routing table
queries . . . . . . . . . . . . . . . . 234--248
Juha Kortelainen On simple generators of recursively
enumerable languages . . . . . . . . . . 249--257
Christel Baier and
Marcus Daum and
Benjamin Engel and
Hermann Härtig and
Joachim Klein and
Sascha Klüppelholz and
Steffen Märcker and
Hendrik Tews and
Marcus Völp Locks: Picking key methods for a
scalable quantitative analysis . . . . . 258--287
Tomás Brázdil and
Stefan Kiefer and
Antonín Kucera and
Ivana Hutarová Vareková Runtime analysis of probabilistic
programs with unbounded recursion . . . 288--310
Xi Chen and
Martin Dyer and
Leslie Ann Goldberg and
Mark Jerrum and
Pinyan Lu and
Colin McQuillan and
David Richerby The complexity of approximating
conservative counting CSPs . . . . . . . 311--329
Leslie Ann Goldberg and
Mark Jerrum and
Colin McQuillan Approximating the partition function of
planar two-state spin systems . . . . . 330--358
Anonymous Contents . . . . . . . . . . . . . . . . obc--obc
Anonymous Editorial Board . . . . . . . . . . . . ifc--ifc
Daowen Qiu and
Lvzhou Li and
Paulo Mateus and
Amilcar Sernadas Exponentially more concise quantum
recognition of non-RMM regular languages 359--375
Xuechong Guan Two Cartesian closed categories of
information algebras . . . . . . . . . . 376--382
Alberto Lafuente and
Mikel Larrea and
Iratxe Soraluze and
Roberto Cortiñas Communication-optimal eventually perfect
failure detection in partially
synchronous systems . . . . . . . . . . 383--397
Minati De and
Subhas C. Nandy and
Sasanka Roy Prune-and-search with limited workspace 398--414
Ilkka Törmä A uniquely ergodic cellular automaton 415--442
Simone Bova and
Hubie Chen The complexity of equivalence,
entailment, and minimization in
existential positive logic . . . . . . . 443--457
Rafael Trapani Possignolo and
Cintia Borges Margi and
Paulo S. L. M. Barreto Quantum-assisted QD-CFS signatures . . . 458--467
Juha Honkala Products of matrices and recursively
enumerable sets . . . . . . . . . . . . 468--472
Petr Sosík and
Ludek Cienciala A limitation of cell division in tissue
P systems by PSPACE . . . . . . . . . . 473--484
Anonymous Editorial Board . . . . . . . . . . . . ifc--ifc
Quan Z. Sheng and
Elhadi M. Shakshuki Ambient and context-aware services . . . 485--486
Nabil Sahli and
Nafaa Jabeura and
Mohamad Badra Agent-based framework for
sensor-to-sensor personalization . . . . 487--495
Mohamed Amine Abid and
Abdelfettah Belghith and
Khalil Drira SARP: a dynamically readjustable period
size proactive routing protocol for
MANETs . . . . . . . . . . . . . . . . . 496--515
Tayseer Alkhdour and
Elhadi Shakshuki and
Uthman Baroudi and
Shokri Selim A cross layer optimization modeling for
a periodic WSN application . . . . . . . 516--532
Jian Yu and
Quan Z. Sheng and
Joshua K. Y. Swee and
Jun Han and
Chengfei Liu and
Talal H. Noor Model-driven development of adaptive web
service processes with aspects and rules 533--552
Tyler Gunn and
John Anderson Dynamic heterogeneous team formation for
robotic urban search and rescue . . . . 553--567
Luk Knapen and
Irith Ben-Arroyo Hartman and
Daniel Keren and
Ansar-Ul-Haque Yasar and
Sungjin Cho and
Tom Bellemans and
Davy Janssens and
Geert Wets Scalability issues in optimal assignment
for carpooling . . . . . . . . . . . . . 568--584
Yoann Lebrun and
Emmanuel Adam and
René Mandiau and
Christophe Kolski A model for managing interactions
between tangible and virtual agents on
an RFID interactive tabletop: Case study
in traffic simulation . . . . . . . . . 585--598
Liang Huai Yang and
Yanzhu Zhao and
Yulei Fan and
Yihua Zhu and
Jian Yu Peak power modeling for join algorithms
in DBMS . . . . . . . . . . . . . . . . 599--614
Anonymous Contents . . . . . . . . . . . . . . . . obc--obc
Anonymous Editorial Board . . . . . . . . . . . . ifc--ifc
Q. Shi and
N. Zhang and
M. Merabti Fair signature exchange via delegation
on ubiquitous networks . . . . . . . . . 615--631
Gábor Erdélyi and
Michael R. Fellows and
Jörg Rothe and
Lena Schend Control complexity in Bucklin and
fallback voting: A theoretical analysis 632--660
Gábor Erdélyi and
Michael R. Fellows and
Jörg Rothe and
Lena Schend Control complexity in Bucklin and
fallback voting: An experimental
analysis . . . . . . . . . . . . . . . . 661--670
Eric J. Schwabe and
Ian M. Sutherland Optimizing large data transfers in
parity-declustered data layouts . . . . 671--691
Noga Alon and
Hagit Attiya and
Shlomi Dolev and
Swan Dubois and
Maria Potop-Butucaru and
Sébastien Tixeuil Practically stabilizing SWMR atomic
memory in message-passing systems . . . 692--701
Mark Jerrum and
Kitty Meeks The parameterised complexity of counting
connected subgraphs and graph motifs . . 702--716
Xun Zhou and
Jing He and
Guangyan Huang and
Yanchun Zhang SVD-based incremental approaches for
recommender systems . . . . . . . . . . 717--733
Lijuan Wang and
Jun Shen and
Junzhou Luo Facilitating an ant colony algorithm for
multi-objective data-intensive service
provision . . . . . . . . . . . . . . . 734--746
Henning Fernau and
Pinar Heggernes and
Yngve Villanger A multi-parameter analysis of hard
problems on deterministic finite
automata . . . . . . . . . . . . . . . . 747--765
Robert Bredereck and
Jiehua Chen and
Sepp Hartung and
Christian Komusiewicz and
Rolf Niedermeier and
Ond\vrej Suchý On explaining integer vectors by few
homogeneous segments . . . . . . . . . . 766--782
Jianghua Zhong and
Dongdai Lin A new linearization method for nonlinear
feedback shift registers . . . . . . . . 783--796
Anonymous Editorial Board . . . . . . . . . . . . ifc--ifc
Dirk Pattinson and
Lutz Schröder From the Editors . . . . . . . . . . . . 797--798
Samson Abramsky and
Jonathan Zvesper From Lawvere to Brandenburger--Keisler:
Interactive forms of diagonalization and
self-reference . . . . . . . . . . . . . 799--812
Jirí Adámek and
Stefan Milius and
Lawrence S. Moss and
Henning Urbat On finitary functors and their
presentations . . . . . . . . . . . . . 813--833
Giorgio Bacci and
Marino Miculan Structural operational semantics for
continuous state stochastic transition
systems . . . . . . . . . . . . . . . . 834--858
Bart Jacobs and
Alexandra Silva and
Ana Sokolova Trace semantics via determinization . . 859--879
Johannes Marti and
Yde Venema Lax extensions of coalgebra functors and
their logic . . . . . . . . . . . . . . 880--900
Pawel Soboci\'nski Relational presheaves, change of base
and weak simulation . . . . . . . . . . 901--910
Joost Winter and
Marcello M. Bonsangue and
Jan J. M. M. Rutten Context-free coalgebras . . . . . . . . 911--939
Anonymous Editorial Board . . . . . . . . . . . . ifc--ifc
Anne James Optimisation, security, privacy and
trust in e-business systems . . . . . . 941--942
Goodhead Tomvie Abraham and
Anne James and
Norlaily Yaacob Priority-grouping method for parallel
multi-scheduling in Grid . . . . . . . . 943--957
Ahmad Al-Daraiseh and
Eyas El-Qawasmeh and
Nazaraf Shah Multi-agent system for energy
consumption optimisation in higher
education institutions . . . . . . . . . 958--965
Chen-Fang Tsai Dynamic grey platform for efficient
forecasting management . . . . . . . . . 966--980
Waleed Bul'ajoul and
Anne James and
Mandeep Pannu Improving network intrusion detection
system performance through quality of
service configuration and parallel
technology . . . . . . . . . . . . . . . 981--999
Fran Casino and
Josep Domingo-Ferrer and
Constantinos Patsakis and
Dom\`enec Puig and
Agusti Solanas A $k$-anonymous approach to privacy
preserving collaborative filtering . . . 1000--1011
Ping Wang and
Yu-Shih Wang Malware behavioural detection and
vaccine development by using a support
vector model classifier . . . . . . . . 1012--1026
Shan Chang and
Li Lu and
Xiaoqiang Liu and
Hui Song and
Qingsong Yao Vulnerability aware graphs for RFID
protocol security benchmarking . . . . . 1027--1041
Neeraj Kumar and
Rahat Iqbal and
Sudip Misra and
Joel J. P. C. Rodrigues An intelligent approach for building a
secure decentralized public key
infrastructure in VANET . . . . . . . . 1042--1058
Anonymous Contents . . . . . . . . . . . . . . . . obc--obc
Anonymous Editorial Board . . . . . . . . . . . . ifc--ifc
Javier Ignacio Almarza and
Santiago Figueira Normality in non-integer bases and
polynomial time randomness . . . . . . . 1059--1087
John Augustine and
Gopal Pandurangan and
Peter Robinson and
Eli Upfal Distributed agreement in dynamic
peer-to-peer networks . . . . . . . . . 1088--1109
Qusai Shambour and
Jie Lu An effective recommender system by
unifying user and item trust information
for B2B applications . . . . . . . . . . 1110--1126
David A. Cohen and
Martin C. Cooper and
Guillaume Escamocher and
Stanislav Zivný Variable and value elimination in binary
constraint satisfaction via forbidden
patterns . . . . . . . . . . . . . . . . 1127--1143
Lvzhou Li and
Yuan Feng On hybrid models of quantum finite
automata . . . . . . . . . . . . . . . . 1144--1158
Jhih-Hong Ye and
Biing-Feng Wang On the minmax regret path median problem
on trees . . . . . . . . . . . . . . . . 1159--1170
John Fearnley and
Doron Peled and
Sven Schewe Synthesis of succinct systems . . . . . 1171--1193
Susanne Albers and
Antonios Antoniadis and
Gero Greiner On multi-processor speed scaling with
migration . . . . . . . . . . . . . . . 1194--1209
Cristina G. Fernandes and
Maya Stein Geodesic stability for memoryless binary
long-lived consensus . . . . . . . . . . 1210--1220
Atle Refsdal and
Ragnhild Kobro Runde and
Ketil Stòlen Stepwise refinement of sequence diagrams
with soft real-time constraints . . . . 1221--1251
Sylvain Salvati MIX is a $2$-MCFL and the word problem
in $\mathbb{Z}^2$ is captured by the IO
and the OI hierarchies . . . . . . . . . 1252--1277
Leonid Libkin and
Tony Tan and
Domagoj Vrgoc Regular expressions for data words . . . 1278--1297
Florin Manea and
Mike Müller and
Dirk Nowotka Cubic patterns with permutations . . . . 1298--1310
Christer Bäckström and
Peter Jonsson and
Sebastian Ordyniak and
Stefan Szeider A complete parameterized complexity
analysis of bounded planning . . . . . . 1311--1332
Pierluigi Crescenzi and
Daniel Gildea and
Andrea Marino and
Gianluca Rossi and
Giorgio Satta Synchronous context-free grammars and
optimal linear parsing strategies . . . 1333--1356
Vilem Vychodil Monoidal functional dependencies . . . . 1357--1372
Gábor Ivanyos and
Marek Karpinski and
Youming Qiao and
Miklos Santha Generalized Wong sequences and their
applications to Edmonds' problems . . . 1373--1386
George Barmpalias and
Rod G. Downey and
Michael McInerney Integer valued betting strategies and
Turing degrees . . . . . . . . . . . . . 1387--1412
Tianrong Lin Corrigendum to ``Another approach to the
equivalence of measure-many one-way
quantum infinite automata and its
application'' [J. Comput. Syst. Sci. \bf
78 (3) (2012) 807--821] . . . . . . . . 1413--1413
Anonymous Contents . . . . . . . . . . . . . . . . obc--obc
Anonymous Editorial Board . . . . . . . . . . . . ifc--ifc
Tomoya Enokido and
Leonard Barolli and
Makoto Takizawa Journal of Computer and System Sciences
Special Issue on Reliability and
Optimization for Wireless Networking and
Cloud Computing . . . . . . . . . . . . 1415--1416
Fatos Xhafa and
Christian Sánchez and
Admir Barolli and
Makoto Takizawa Solving mesh router nodes placement
problem in Wireless Mesh Networks by
Tabu Search algorithm . . . . . . . . . 1417--1428
Marcelo Luiz Brocardo and
Issa Traore and
Isaac Woungang Authorship verification of e-mail and
tweet messages applied for continuous
authentication . . . . . . . . . . . . . 1429--1440
Shigenari Nakamura and
Dilawaer Duolikun and
Makoto Takizawa Read-abortion (RA) based synchronization
protocols to prevent illegal information
flow . . . . . . . . . . . . . . . . . . 1441--1451
José L. Hernández-Ramos and
M. Victoria Moreno and
Jorge Bernal Bernabé and
Dan García Carrillo and
Antonio F. Skarmeta SAFIR: Secure access framework for
IoT-enabled services on smart buildings 1452--1463
Arcangelo Castiglione and
Francesco Palmieri and
Ugo Fiore and
Aniello Castiglione and
Alfredo De Santis Modeling energy-efficient secure
communications in multi-mode wireless
mobile devices . . . . . . . . . . . . . 1464--1478
Amin M. Khan and
Ümit C. Büyüksahin and
Felix Freitag Incentive-based resource assignment and
regulation for collaborative cloud
services in community networks . . . . . 1479--1495
Admir Barolli and
Tetsuya Oda and
Makoto Ikeda and
Leonard Barolli and
Fatos Xhafa and
Vincenzo Loia Node placement for wireless mesh
networks: Analysis of WMN-GA system
simulation results for different
parameters and distributions . . . . . . 1496--1507
David Taniar and
Wenny Rahayu A taxonomy for region queries in spatial
databases . . . . . . . . . . . . . . . 1508--1531
Jin Li and
Xiaofeng Chen and
Fatos Xhafa and
Leonard Barolli Secure deduplication storage systems
supporting keyword search . . . . . . . 1532--1541
Ricardo Garibay-Martínez and
Geoffrey Nelissen and
Luis Lino Ferreira and
Luís Miguel Pinho Task partitioning and priority
assignment for distributed hard
real-time systems . . . . . . . . . . . 1542--1555
Laurent Bulteau and
Guillaume Fertin and
Irena Rusu Pancake Flipping is hard . . . . . . . . 1556--1574
Laurent Bienvenu and
Rod Downey and
André Nies and
Wolfgang Merkle Solovay functions and their applications
in algorithmic randomness . . . . . . . 1575--1591
Verónica Becher and
Olivier Carton and
Pablo Ariel Heiber Normality and automata . . . . . . . . . 1592--1613
Gábor Horváth and
Chrystopher L. Nehaniv Length of polynomials over finite groups 1614--1622
L. Boyer and
M. Delacourt and
V. Poupet and
M. Sablik and
G. Theyssier $ \mu $-Limit sets of cellular automata
from a computational complexity
perspective . . . . . . . . . . . . . . 1623--1647
Emmanuel Jeandel and
Pascal Vanier Hardness of conjugacy, embedding and
factorization of multidimensional
subshifts . . . . . . . . . . . . . . . 1648--1664
Marek Karpinski and
Michael Lampis and
Richard Schmied New inapproximability bounds for TSP . . 1665--1677
Radim Belohlavek and
Martin Trnecka From-below approximations in Boolean
matrix factorization: Geometry and new
algorithm . . . . . . . . . . . . . . . 1678--1697
Steven Fortune Equivalence and generalization in a
layered network model . . . . . . . . . 1698--1714
Dariusz Dereniowski and
Wieslaw Kubiak and
Yori Zwols The complexity of minimum-length path
decompositions . . . . . . . . . . . . . 1715--1747
Anonymous Contents . . . . . . . . . . . . . . . . obc--obc
Anonymous Editorial Board . . . . . . . . . . . . ifc--ifc
Federica Mandreoli and
Riccardo Martoglia and
Wilma Penzo Journal of Computer and System Sciences
Special Issue on Query Answering on
Graph-Structured Data . . . . . . . . . 1--2
Elena Vasilyeva and
Maik Thiele and
Christof Bornhövd and
Wolfgang Lehner Answering ``Why Empty?'' and ``Why So
Many?'' queries in graph databases . . . 3--22
Fang Wei-Kleiner Tree decomposition-based indexing for
efficient shortest path and nearest
neighbors query answering on graphs . . 23--44
Florian Holzschuher and
René Peinl Querying a graph database --- language
selection and performance considerations 45--68
Fabio Grandi Dynamic class hierarchy management for
multi-version ontology-based
personalization . . . . . . . . . . . . 69--90
Anonymous Contents . . . . . . . . . . . . . . . . obc--obc
Anonymous Editorial Board . . . . . . . . . . . . ifc--ifc
Yufeng Wang and
Qun Jin and
Athanasios V. Vasilakos Special Issue on Mobile Social
Networking and computing in Proximity
(MSNP) . . . . . . . . . . . . . . . . . 91--92
Feng Xia and
Hannan Bin Liaqat and
Ahmedin Mohammed Ahmed and
Li Liu and
Jianhua Ma and
Runhe Huang and
Amr Tolba User popularity-based packet scheduling
for congestion control in ad-hoc social
networks . . . . . . . . . . . . . . . . 93--112
Songling Fu and
Ligang He and
Xiangke Liao and
Chenlin Huang Developing the Cloud-integrated data
replication framework in decentralized
online social networks . . . . . . . . . 113--129
Shangguang Wang and
Lin Huang and
Ching-Hsien Hsu and
Fangchun Yang Collaboration reputation for trustworthy
Web service selection in social networks 130--143
Zhibin Jiang and
Ching-Hsien Hsu and
Daqiang Zhang and
Xiaolei Zou Evaluating rail transit timetable using
big passengers' data . . . . . . . . . . 144--155
Shaoyong Du and
Jingyu Hua and
Yue Gao and
Sheng Zhong EV-Linker: Mapping eavesdropped Wi-Fi
packets to individuals via electronic
and visual signal matching . . . . . . . 156--172
Anonymous Contents . . . . . . . . . . . . . . . . obc--obc
Anonymous Editorial Board . . . . . . . . . . . . ifc--ifc
Maurizio Palesi and
Mario Collotta and
Masoud Daneshtalab and
Pradip Bose Special issue on energy efficient
methods and systems in the emerging
cloud era . . . . . . . . . . . . . . . 173--173
Keqin Li Power and performance management for
parallel computations in clouds and data
centers . . . . . . . . . . . . . . . . 174--190
Mohan Raj Velayudhan Kumar and
Shriram Raghunathan Heterogeneity and thermal aware adaptive
heuristics for energy efficient
consolidation of virtual machines in
infrastructure clouds . . . . . . . . . 191--212
Konrad K. Dabrowski and
Petr A. Golovach and
Pim van 't Hof and
Daniël Paulusma Editing to Eulerian graphs . . . . . . . 213--228
George H. L. Fletcher and
Marc Gyssens and
Jan Paredaens and
Dirk Van Gucht and
Yuqing Wu Structural characterizations of the
navigational expressiveness of relation
algebras on a tree . . . . . . . . . . . 229--259
Zhao Liu and
Jianxi Fan and
Xiaohua Jia Complete binary trees embeddings in
Möbius cubes . . . . . . . . . . . . . . 260--281
Cengiz Karakoyunlu and
John A. Chandy Exploiting user metadata for
energy-aware node allocation in a cloud
storage system . . . . . . . . . . . . . 282--309
Danny Dolev and
Keijo Heljanko and
Matti Järvisalo and
Janne H. Korhonen and
Christoph Lenzen and
Joel Rybicki and
Jukka Suomela and
Siert Wieringa Synchronous counting and computational
algorithm design . . . . . . . . . . . . 310--332
Robert Ganian and
Friedrich Slivovsky and
Stefan Szeider Meta-kernelization with structural
parameters . . . . . . . . . . . . . . . 333--346
Andrei A. Bulatov Conservative constraint satisfaction
re-revisited . . . . . . . . . . . . . . 347--356
Radim Belohlavek and
Jan Konecny Bases of closure systems over residuated
lattices . . . . . . . . . . . . . . . . 357--365
Christophe Paul and
Anthony Perez and
Stéphan Thomassé Linear kernel for Rooted Triplet
Inconsistency and other problems based
on conflict packing technique . . . . . 366--379
Emil Jerábek Integer factoring and modular square
roots . . . . . . . . . . . . . . . . . 380--394
Anonymous Contents . . . . . . . . . . . . . . . . obc--obc
Anonymous Editorial Board . . . . . . . . . . . . ifc--ifc
Rada Chirkova Combined-semantics equivalence of
conjunctive queries: Decidability and
tractability results . . . . . . . . . . 395--465
Lingling Xu and
Fangguo Zhang and
Willy Susilo and
Yamin Wen Solutions to the anti-piracy problem in
oblivious transfer . . . . . . . . . . . 466--476
Golnaz Badkobeh and
Maxime Crochemore Computing maximal-exponent factors in an
overlap-free word . . . . . . . . . . . 477--487
Hadas Shachnai and
Meirav Zehavi Representative families: a unified
tradeoff-based approach . . . . . . . . 488--502
Faisal N. Abu-Khzam and
Cristina Bazgan and
Morgan Chopin and
Henning Fernau Data reductions and combinatorial bounds
for improved approximation algorithms 503--520
Vincent Froese and
René van Bevern and
Rolf Niedermeier and
Manuel Sorge Exploiting hidden structure in selecting
dimensions that distinguish vectors . . 521--535
Keith J. Edwards A faster polynomial-space algorithm for
Max 2-CSP . . . . . . . . . . . . . . . 536--550
Michael Codish and
Luís Cruz-Filipe and
Michael Frank and
Peter Schneider-Kamp Sorting nine inputs requires twenty-five
comparisons . . . . . . . . . . . . . . 551--563
Anonymous Contents . . . . . . . . . . . . . . . . obc--obc
Anonymous Editorial Board . . . . . . . . . . . . ifc--ifc
Chi-Hung Chi and
Can Wang and
Yu Zheng Special Issue on Trajectory-based
Behaviour Analytics . . . . . . . . . . 565--565
Alasdair Thomason and
Nathan Griffiths and
Victor Sanchez Identifying locations from geospatial
trajectories . . . . . . . . . . . . . . 566--581
Guangyan Huang and
Jing He and
Wanlei Zhou and
Guang-Li Huang and
Limin Guo and
Xiangmin Zhou and
Feiyi Tang Discovery of stop regions for
understanding repeat travel behaviors of
moving objects . . . . . . . . . . . . . 582--593
Victor W. Chu and
Raymond K. Wong and
Fang Chen and
Simon Fong and
Patrick C. K. Hung Self-regularized causal structure
discovery for trajectory-based networks 594--609
Hyun Jung La A conceptual framework for
trajectory-based medical analytics with
IoT contexts . . . . . . . . . . . . . . 610--626
Anonymous Contents . . . . . . . . . . . . . . . . obc--obc
Anonymous Editorial Board . . . . . . . . . . . . ifc--ifc
Susanne Albers and
Sonja Lauer On list update with locality of
reference . . . . . . . . . . . . . . . 627--653
Roberto Baldoni and
Silvia Bonomi and
Michel Raynal Implementing set objects in dynamic
distributed systems . . . . . . . . . . 654--689
Jin-Yi Cai and
Andreas Galanis and
Leslie Ann Goldberg and
Heng Guo and
Mark Jerrum and
Daniel \vStefankovi\vc and
Eric Vigoda #BIS-hardness for $2$-spin systems on
bipartite bounded degree graphs in the
tree non-uniqueness region . . . . . . . 690--711
Priyanka Chawla and
Inderveer Chana and
Ajay Rana Cloud-based automatic test data
generation framework . . . . . . . . . . 712--738
Erich Christian Teppan and
Gerhard Friedrich and
Georg Gottlob Tractability frontiers of the partner
units configuration problem . . . . . . 739--755
Damien Vergnaud Comment on ``A strong provably secure
IBE scheme without bilinear map'' by M.
Zheng, Y. Xiang and H. Zhou [J. Comput.
Syst. Sci. \bf 81 (2015) 125--131] . . . 756--757
Stefan Kratsch On polynomial kernels for sparse integer
linear programs . . . . . . . . . . . . 758--766
Chia-Wen Cheng and
Sun-Yuan Hsieh Edge-fault-tolerant pancyclicity and
bipancyclicity of Cartesian product
graphs with faulty edges . . . . . . . . 767--781
Biing-Feng Wang and
Jhih-Hong Ye and
Pei-Jung Chen Efficient algorithms for the round-trip
1-center and 1-median problems . . . . . 782--792
Magnus Find and
Mika Göös and
Matti Järvisalo and
Petteri Kaski and
Mikko Koivisto and
Janne H. Korhonen Separating OR, SUM, and XOR circuits . . 793--801
Dariusz Dereniowski and
Adrian Kosowski and
Dominik Pajak and
Przemyslaw Uzna\'nski Bounds on the cover time of parallel
rotor walks . . . . . . . . . . . . . . 802--816
Ioannis Papoutsakis On approximating tree spanners that are
breadth first search trees . . . . . . . 817--825
Claudia Carapelle and
Alexander Kartzow and
Markus Lohrey Satisfiability of ECTL$^\ast $ with
constraints . . . . . . . . . . . . . . 826--855
Miika Hannula and
Juha Kontinen and
Sebastian Link On the finite and general implication
problems of independence atoms and keys 856--877
Krishnendu Chatterjee and
Martin Chmelík and
Mathieu Tracol What is decidable about partially
observable Markov decision processes
with $ \omega $-regular objectives . . . 878--911
Peter Jonsson and
Johan Thapper Constraint satisfaction and semilinear
expansions of addition over the
rationals and the reals . . . . . . . . 912--928
Danny Dolev and
Matthias Függer and
Christoph Lenzen and
Martin Perner and
Ulrich Schmid HEX: Scaling honeycombs is easier than
scaling clock trees . . . . . . . . . . 929--956
Zhibin Jiang and
Ching-Hsien Hsu and
Daqiang Zhang and
Xiaolei Zou Corrigendum to ``Evaluating rail transit
timetable using big passengers' data''
[J. Comput. Syst. Sci. \bf 82 (1, Part
B) (2016) 144--155] . . . . . . . . . . 957--957
Anonymous Contents . . . . . . . . . . . . . . . . obc--obc
Anonymous Editorial Board . . . . . . . . . . . . ifc--ifc
Etienne Grandjean and
Frédéric Olive A logical approach to locality in
pictures languages . . . . . . . . . . . 959--1006
Artur Jez and
Alexander Okhotin Equations over sets of integers with
addition only . . . . . . . . . . . . . 1007--1019
Karl Bringmann and
Danny Hermelin and
Matthias Mnich and
Erik Jan van Leeuwen Parameterized complexity dichotomy for
Steiner Multicut . . . . . . . . . . . . 1020--1043
Mohammad Khairul Hasan and
Kyung-Yong Chwa Approximation algorithms for the
Weighted $t$-Uniform Sparsest Cut and
some other graph partitioning problems 1044--1063
Troy Lee and
Nikos Leonardos and
Michael Saks and
Fengming Wang Hellinger volume and
number-on-the-forehead communication
complexity . . . . . . . . . . . . . . . 1064--1074
Leo van Iersel and
Steven Kelk and
Celine Scornavacca Kernelizations for the hybridization
number problem on multiple nonbinary
trees . . . . . . . . . . . . . . . . . 1075--1089
Bosheng Song and
Mario J. Pérez-Jiménez and
Linqiang Pan An efficient time-free solution to SAT
problem by P systems with proteins on
membranes . . . . . . . . . . . . . . . 1090--1099
Vincent Froese and
André Nichterlein and
Rolf Niedermeier Win-win kernelization for degree
sequence completion problems . . . . . . 1100--1111
Dipali Pal and
Praveen Rao and
Vasil Slavov and
Anas Katib Fast processing of graph queries on a
large database of small and medium-sized
data graphs . . . . . . . . . . . . . . 1112--1143
Leslie Ann Goldberg and
Rob Gysel and
John Lapinskas Approximately counting locally-optimal
structures . . . . . . . . . . . . . . . 1144--1160
Anonymous Contents . . . . . . . . . . . . . . . . obc--obc
Anonymous Editorial Board . . . . . . . . . . . . ifc--ifc
L. Ferrucci and
L. Ricci and
M. Albano and
R. Baraglia and
M. Mordacchini Multidimensional range queries on
hierarchical Voronoi overlays . . . . . 1161--1179
Omer Reingold and
Shai Vardi New techniques and tighter bounds for
local computation algorithms . . . . . . 1180--1200
Zoltán Fülöp and
Andreas Maletti Linking theorems for tree transducers 1201--1222
Anonymous Contents . . . . . . . . . . . . . . . . obc--obc
Anonymous Editorial Board . . . . . . . . . . . . ifc--ifc
Martin Anthony and
Joel Ratsaby Multi-category classifiers and sample
width . . . . . . . . . . . . . . . . . 1223--1231
Jérémie Cabessa and
Alessandro E. P. Villa Expressive power of first-order
recurrent neural networks determined by
their attractor dynamics . . . . . . . . 1232--1250
Andrzej Czygrinow and
Michal Han\'ckowiak and
Edyta Szyma\'nska and
Wojciech Wawrzyniak On the distributed complexity of the
semi-matching problem . . . . . . . . . 1251--1267
Alexei Miasnikov and
Alexander Ushakov Generic case completeness . . . . . . . 1268--1282
George Barmpalias and
Nan Fang and
Andrew Lewis-Pye Optimal asymptotic bounds on the oracle
use in computations from Chaitin's Omega 1283--1299
Xiaocheng Hu and
Miao Qiao and
Yufei Tao I/O-efficient join dependency testing,
Loomis--Whitney join, and triangle
enumeration . . . . . . . . . . . . . . 1300--1315
Xuejiao Liu and
Yingjie Xia and
Wenzhi Chen and
Yang Xiang and
Mohammad Mehedi Hassan and
Abdulhameed Alelaiwi SEMD: Secure and efficient message
dissemination with policy enforcement in
VANET . . . . . . . . . . . . . . . . . 1316--1328
Tamar Aizikowitz and
Michael Kaminski LR (0) conjunctive grammars and
deterministic synchronized alternating
pushdown automata . . . . . . . . . . . 1329--1359
Christian Rosenke The exact complexity of projective image
matching . . . . . . . . . . . . . . . . 1360--1387
Anonymous Contents . . . . . . . . . . . . . . . . obc--obc
Anonymous Editorial Board . . . . . . . . . . . . ifc--ifc
Kim-Kwang Raymond Choo and
Jemal Abawajy and
Rafiqul Islam Special Issue on Cyber Security in the
Critical Infrastructure: Advances and
Future Directions . . . . . . . . . . . 1--2
G. Gonzalez-Granadillo and
J. Garcia-Alfaro and
H. Debar A polytope-based approach to measure the
impact of events against critical
infrastructures . . . . . . . . . . . . 3--21
Deepak Puthal and
Surya Nepal and
Rajiv Ranjan and
Jinjun Chen A dynamic prime number based efficient
security mechanism for big sensing data
streams . . . . . . . . . . . . . . . . 22--42
Martin Grill and
Tomás Pevný and
Martin Rehak Reducing false positives of network
anomaly detection by local adaptive
multivariate smoothing . . . . . . . . . 43--57
Adnan Anwar and
Abdun Naser Mahmood and
Mark Pickering Modeling and performance evaluation of
stealthy false data injection attacks on
smart grid in the presence of corrupted
measurements . . . . . . . . . . . . . . 58--72
Chao Lin and
Wei Wu and
Xinyi Huang and
Li Xu A new universal designated verifier
transitive signature scheme for big
graph data . . . . . . . . . . . . . . . 73--83
Vitaly Ford and
Ambareen Siraj and
Mohammad Ashiqur Rahman Secure and efficient protection of
consumer privacy in Advanced Metering
Infrastructure supporting fine-grained
data analysis . . . . . . . . . . . . . 84--100
Stefan Haar and
Serge Haddad and
Tarek Melliti and
Stefan Schwoon Optimal constructions for active
diagnosis . . . . . . . . . . . . . . . 101--120
Gregory Gutin and
Magnus Wahlström and
Anders Yeo Rural postman parameterized by the
number of components of required edges 121--131
Josep Diaz and
Olli Pottonen and
Maria Serna and
Erik Jan van Leeuwen Complexity of metric dimension on planar
graphs . . . . . . . . . . . . . . . . . 132--158
Le Hoang Son and
Pham Huy Thong Soft computing methods for WiMax Network
Planning on $3$D Geographical
Information Systems . . . . . . . . . . 159--179
Tomasz Gogacz and
Jerzy Marcinkowski Converging to the chase --- a tool for
finite controllability . . . . . . . . . 180--206
Shmuel Onn Huge tables and multicommodity flows are
fixed-parameter tractable via unimodular
integer Carathéodory . . . . . . . . . . 207--214
Anonymous Contents . . . . . . . . . . . . . . . . obc--obc
Anonymous Editorial Board . . . . . . . . . . . . ifc--ifc
Michael Etscheid and
Stefan Kratsch and
Matthias Mnich and
Heiko Röglin Polynomial kernels for weighted problems 1--10
Joel D. Day and
Daniel Reidenbach and
Markus L. Schmid Closure properties of pattern languages 11--31
A. Çivril Sparse approximation is provably hard
under coherent dictionaries . . . . . . 32--43
Ching-Lueh Chang A lower bound for metric 1-median
selection . . . . . . . . . . . . . . . 44--51
Peter Jonsson and
Victor Lagerkvist and
Gustav Nordh and
Bruno Zanuttini Strong partial clones and the time
complexity of SAT problems . . . . . . . 52--78
Leah Epstein and
Asaf Levin An AFPTAS for variable sized bin packing
with general activation costs . . . . . 79--96
Mingyu Xiao On a generalization of Nemhauser and
Trotter's local optimization theorem . . 97--106
Gregory Gutin and
Mark Jones and
Bin Sheng Parameterized complexity of the $k$-arc
Chinese Postman Problem . . . . . . . . 107--119
Fahad Panolan and
Geevarghese Philip and
Saket Saurabh On the parameterized complexity of
$b$-chromatic number . . . . . . . . . . 120--131
Dmitry V. Zakablukov On asymptotic gate complexity and depth
of reversible circuits without
additional memory . . . . . . . . . . . 132--143
Tomás Brázdil and
Krishnendu Chatterjee and
Vojtech Forejt and
Antonín Kucera Trading performance for stability in
Markov decision processes . . . . . . . 144--170
Guy Feigenblat and
Ely Porat and
Ariel Shiftan $d$-$k$-min-wise independent family of
hash functions . . . . . . . . . . . . . 171--184
Daniel Bundala and
Michael Codish and
Luís Cruz-Filipe and
Peter Schneider-Kamp and
Jakub Závodný Optimal-depth sorting networks . . . . . 185--204
T. Kociumaka and
J. Radoszewski and
W. Rytter Fast algorithms for Abelian periods in
words and greatest common divisor
queries . . . . . . . . . . . . . . . . 205--218
Jakub Gajarský and
Petr Hlin\vený and
Jan Obdr\vzálek and
Sebastian Ordyniak and
Felix Reidl and
Peter Rossmanith and
Fernando Sánchez Villaamil and
Somnath Sikdar Kernelization using structural
parameters on sparse graph classes . . . 219--242
Sven Schewe Solving parity games in big steps . . . 243--262
Lila Kari and
Steffen Kopecki Deciding whether a regular language is
generated by a splicing system . . . . . 263--287
Julien Cassaigne and
Nicolas Ollinger and
Rodrigo Torres-Avilés A small minimal aperiodic reversible
Turing machine . . . . . . . . . . . . . 288--301
Anonymous Contents . . . . . . . . . . . . . . . . obc--obc
Anonymous Editorial Board . . . . . . . . . . . . ifc--ifc
Sina Mahmoodi Khorandi and
Mohsen Sharifi Scheduling of online compute-intensive
synchronized jobs on high performance
virtual clusters . . . . . . . . . . . . 1--17
Bart M. P. Jansen Turing kernelization for finding long
paths and cycles in restricted graph
classes . . . . . . . . . . . . . . . . 18--37
Serge Gaspers and
Neeldhara Misra and
Sebastian Ordyniak and
Stefan Szeider and
Stanislav Zivný Backdoors into heterogeneous classes of
SAT and CSP . . . . . . . . . . . . . . 38--56
M. Benedikt and
J. Engelfriet and
S. Maneth Determinacy and rewriting of functional
top-down and MSO tree transformations 57--73
Fatemeh Zahra Saberifar and
Ali Mohades and
Mohammadreza Razzazi and
Jason M. O'Kane Combinatorial filter reduction: Special
cases, approximation, and
fixed-parameter tractability . . . . . . 74--92
Paolo Bottoni and
Anna Labella and
Victor Mitrana Networks of polarized multiset
processors . . . . . . . . . . . . . . . 93--103
Henning Koehler and
Sebastian Link Inclusion dependencies and their
interaction with functional dependencies
in SQL . . . . . . . . . . . . . . . . . 104--131
Florin Manea and
Mike Müller and
Dirk Nowotka and
Shinnosuke Seki The extended equation of Lyndon and
Schützenberger . . . . . . . . . . . . . 132--167
Konrad K. Dabrowski and
Petr A. Golovach and
Pim van 't Hof and
Daniël Paulusma and
Dimitrios M. Thilikos Editing to a planar graph of given
degrees . . . . . . . . . . . . . . . . 168--182
Anonymous Contents . . . . . . . . . . . . . . . . obc--obc
Anonymous Editorial Board . . . . . . . . . . . . ifc--ifc
Marek R. Ogiela and
Fatos Xhafa and
Leonard Barolli Optimization and Security Issues for
Next Generation Networks --- Editorial 1--2
Vishal Sharma and
Hsing-Chung Chen and
Rajesh Kumar Driver behaviour detection and vehicle
rating using multi-UAV coordinated
vehicular networks . . . . . . . . . . . 3--32
Agustinus Borgy Waluyo and
David Taniar and
Wenny Rahayu and
Bala Srinivasan Trustworthy data delivery in mobile P2P
network . . . . . . . . . . . . . . . . 33--48
Meixia Miao and
Jianfeng Wang and
Jianfeng Ma and
Willy Susilo Publicly verifiable databases with
efficient insertion/deletion operations 49--58
Joonghwan Lee and
Jae Woo Seo and
Hoon Ko and
Hyoungshick Kim TARD: Temporary Access Rights Delegation
for guest network devices . . . . . . . 59--69
Jurek Czyzowicz and
Dariusz Dereniowski and
Leszek G\kasieniec and
Ralf Klasing and
Adrian Kosowski and
Dominik Paj\kak Collision-free network exploration . . . 70--81
Adrien Koutsos and
Victor Vianu Process-centric views of data-driven
business artifacts . . . . . . . . . . . 82--107
Jacob Turner Tensors masquerading as matchgates:
Relaxing planarity restrictions on
Pfaffian circuits . . . . . . . . . . . 108--116
Bart Kuijpers and
Bart Moelans On the realisability of double-cross
matrices by polylines in the plane . . . 117--135
Moses Ganardi and
Danny Hucke and
Artur Jez and
Markus Lohrey and
Eric Noeth Constructing small tree grammars and
small circuits for formulas . . . . . . 136--158
Hans-Joachim Böckenhauer and
Dennis Komm and
Rastislav Královic and
Richard Královic On the advice complexity of the
$k$-server problem . . . . . . . . . . . 159--170
Philip Bille and
Inge Li Gòrtz and
Patrick Hagge Cording and
Benjamin Sach and
Hjalte Wedel Vildhòj and
Sòren Vind Fingerprints in compressed strings . . . 171--180
Adam Woryna On groups generated by bi-reversible
automata: The two-state case over a
changing alphabet . . . . . . . . . . . 181--190
Eun Jung Kim and
Christophe Paul and
Ignasi Sau and
Dimitrios M. Thilikos Parameterized algorithms for min-max
multiway cut and list digraph
homomorphism . . . . . . . . . . . . . . 191--206
Alexander Okhotin and
Kai Salomaa State complexity of operations on
input-driven pushdown automata . . . . . 207--228
Anonymous Contents . . . . . . . . . . . . . . . . obc--obc
Anonymous Editorial Board . . . . . . . . . . . . ifc--ifc
Hugo Férée Game semantics approach to higher-order
complexity . . . . . . . . . . . . . . . 1--15
Ronald de Haan and
Stefan Szeider Parameterized complexity classes beyond
para-NP . . . . . . . . . . . . . . . . 16--57
A. S. Murawski and
S. J. Ramsay and
N. Tzevelekos Reachability in pushdown register
automata . . . . . . . . . . . . . . . . 58--83
Stephan Holzer and
Thomas Locher and
Yvonne Anne Pignolet and
Roger Wattenhofer Deterministic multi-channel information
exchange . . . . . . . . . . . . . . . . 84--103
Peter Fulla and
Stanislav Zivný On planar valued CSPs . . . . . . . . . 104--118
Andreas Björklund and
Thore Husfeldt and
Petteri Kaski and
Mikko Koivisto Narrow sieves for parameterized paths
and packings . . . . . . . . . . . . . . 119--139
Anonymous Contents . . . . . . . . . . . . . . . . obc--obc
Anonymous Editorial Board . . . . . . . . . . . . ifc--ifc
Leonid Libkin and
Ulrich Kohlenbach and
Ruy J. G. B. de Queiroz 20th workshop on logic, language,
information and computation --- WoLLIC
2013 . . . . . . . . . . . . . . . . . . 1--2
Thomas Zeume and
Thomas Schwentick Dynamic conjunctive queries . . . . . . 3--26
Sardaouna Hamadou and
Catuscia Palamidessi and
Vladimiro Sassone Quantifying leakage in the presence of
unreliable sources of information . . . 27--52
Xavier Caicedo and
George Metcalfe and
Ricardo Rodríguez and
Jonas Rogger Decidability of order-based modal logics 53--74
Wojciech Czerwi\'nski and
Claire David and
Katja Losemann and
Wim Martens Deciding definability by deterministic
regular expressions . . . . . . . . . . 75--89
Fredrik Engström and
Juha Kontinen and
Jouko Väänänen Dependence logic with generalized
quantifiers: Axiomatizations . . . . . . 90--102
Johannes Ebbing and
Lauri Hella and
Peter Lohmann and
Jonni Virtema Boolean dependence logic and
partially-ordered connectives . . . . . 103--125
Natasha Alechina and
Brian Logan and
Hoang Nga Nguyen and
Franco Raimondi Model-checking for Resource-Bounded ATL
with production and consumption of
resources . . . . . . . . . . . . . . . 126--144
Julio Aracena and
Adrien Richard and
Lilian Salinas Fixed points in conjunctive networks and
maximal independent sets in graph
contractions . . . . . . . . . . . . . . 145--163
Pablo Barceló and
Gaëlle Fontaine On the data complexity of consistent
query answering over graph databases . . 164--194
Rajesh Chitnis and
Fedor V. Fomin and
Daniel Lokshtanov and
Pranabendu Misra and
M. S. Ramanujan and
Saket Saurabh Faster exact algorithms for some
terminal set problems . . . . . . . . . 195--207
Jin-Xin Zhou On $g$-extra connectivity of
hypercube-like networks . . . . . . . . 208--219
Kirill Kogan and
Alejandro López-Ortiz and
Sergey I. Nikolenko and
Alexander V. Sirotkin The impact of processing order on
performance: A taxonomy of semi-FIFO
policies . . . . . . . . . . . . . . . . 220--235
Krishnendu Chatterjee and
Yaron Velner Hyperplane separation technique for
multidimensional mean-payoff games . . . 236--259
Mingyu Xiao Linear kernels for separating a graph
into components of bounded size . . . . 260--270
Umair Siddique and
Sofi\`ene Tahar Formal verification of stability and
chaos in periodic optical systems . . . 271--289
Anonymous Contents . . . . . . . . . . . . . . . . obc--obc
Anonymous Editorial Board . . . . . . . . . . . . ifc--ifc
Anonymous Journal of Computer and System Sciences
Special Issue on Theoretical and
Algorithmic Foundation for Big Data . . 1--3
Dawei Sun and
Guangyan Zhang and
Chengwen Wu and
Keqin Li and
Weimin Zheng Building a fault tolerant framework with
deadline guarantee in big data stream
computing environments . . . . . . . . . 4--23
Alireza Khoshkbarforoushha and
Alireza Khosravian and
Rajiv Ranjan Elasticity management of Streaming Data
Analytics Flows on clouds . . . . . . . 24--40
Zhiwei Wang and
Cheng Cao and
Nianhua Yang and
Victor Chang ABE with improved auxiliary input for
big data security . . . . . . . . . . . 41--50
Cheng Huang and
Rongxing Lu and
Kim-Kwang Raymond Choo Secure and flexible cloud-assisted
association rule mining over
horizontally partitioned databases . . . 51--63
Wei Liang and
Chunhua Hu and
Min Wu and
Qun Jin A data intensive heuristic approach to
the two-stage streaming scheduling
problem . . . . . . . . . . . . . . . . 64--79
Tong Li and
Zheli Liu and
Jin Li and
Chunfu Jia and
Kuan-Ching Li CDPS: a cryptographic data publishing
system . . . . . . . . . . . . . . . . . 80--91
Guoqing Xiao and
Kenli Li and
Xu Zhou and
Keqin Li Efficient monochromatic and bichromatic
probabilistic reverse top- k query
processing for uncertain big data . . . 92--113
Aly Ahmed and
Alex Thomo Computing source-to-target shortest
paths for complex networks in RDBMS . . 114--129
Weijing Song and
Lizhe Wang and
Yang Xiang and
Albert Y. Zomaya Geographic spatiotemporal big data
correlation analysis via the
Hilbert-Huang transformation . . . . . . 130--141
Shi-Feng Sun and
Dawu Gu and
Udaya Parampalli and
Yu Yu and
Baodong Qin Public key encryption resilient to
leakage and tampering attacks . . . . . 142--156
Hadas Shachnai and
Meirav Zehavi A multivariate framework for weighted
FPT algorithms . . . . . . . . . . . . . 157--189
Xueqing Gong and
Chi Wan Sung Zigzag Decodable codes: Linear-time
erasure codes with applications to data
storage . . . . . . . . . . . . . . . . 190--208
Sergio Abriola and
María Emilia Descotte and
Raul Fervari and
Santiago Figueira Axiomatizations for downward XPath on
data trees . . . . . . . . . . . . . . . 209--245
Jung-Heum Park and
Hee-Chul Kim and
Hyeong-Seok Lim Disjoint path covers with path length
constraints in restricted hypercube-like
graphs . . . . . . . . . . . . . . . . . 246--269
Janusz A. Brzozowski and
Marek Szykula Complexity of suffix-free regular
languages . . . . . . . . . . . . . . . 270--287
Ville Salo Decidability and universality of
quasiminimal subshifts . . . . . . . . . 288--314
Nathann Cohen and
Daniel Gonçalves and
Eun Jung Kim and
Christophe Paul and
Ignasi Sau and
Dimitrios M. Thilikos and
Mathias Weller A polynomial-time algorithm for
Outerplanar Diameter Improvement . . . . 315--327
Iain A. Stewart On the combinatorial design of data
centre network topologies . . . . . . . 328--348
George Barmpalias and
Andrew Lewis-Pye Differences of halting probabilities . . 349--360
Yuan Feng and
Lijun Zhang Precisely deciding CSL formulas through
approximate model checking for CTMCs . . 361--371
B. Groz and
S. Maneth Efficient testing and matching of
deterministic regular expressions . . . 372--399
Kaibin Huang and
Raylin Tso and
Yu-Chi Chen Somewhat semantic secure public key
encryption with filtered-equality-test
in the standard model and its extension
to searchable encryption . . . . . . . . 400--409
Konrad K. Dabrowski and
François Dross and
Daniël Paulusma Colouring diamond-free graphs . . . . . 410--431
Yongjie Yang and
Jiong Guo The control complexity of $r$-Approval:
From the single-peaked case to the
general case . . . . . . . . . . . . . . 432--449
Yann Guermeur $ L_p $-norm Sauer--Shelah lemma for
margin multi-category classifiers . . . 450--473
Anonymous Editorial Board . . . . . . . . . . . . ifc--ifc
Yong Ding and
Zheng Xu and
Jun Ye and
Kim-Kwang Raymond Choo Secure outsourcing of modular
exponentiations under single untrusted
programme model . . . . . . . . . . . . 1--13
Hui Yin and
Zheng Qin and
Lu Ou and
Keqin Li A query privacy-enhanced and secure
search scheme over encrypted data in
cloud computing . . . . . . . . . . . . 14--27
Abdulatif Alabdulatif and
Heshan Kumarage and
Ibrahim Khalil and
Xun Yi Privacy-preserving anomaly detection in
cloud with lightweight homomorphic
encryption . . . . . . . . . . . . . . . 28--45
Man Ho Au and
Tsz Hon Yuen and
Joseph K. Liu and
Willy Susilo and
Xinyi Huang and
Yang Xiang and
Zoe L. Jiang A general framework for secure sharing
of personal health records in cloud
system . . . . . . . . . . . . . . . . . 46--62
Sankardeep Chakraborty and
Venkatesh Raman and
Srinivasa Rao Satti Biconnectivity, $ s t$-numbering and
other applications of DFS using $ O(n)$
bits . . . . . . . . . . . . . . . . . . 63--79
Paul W. Goldberg and
Stefano Turchetta Query complexity of approximate
equilibria in anonymous games . . . . . 80--98
Zuzana Bednárová and
Viliam Geffert and
Carlo Mereghetti and
Beatrice Palano Boolean language operations on
nondeterministic automata with a
pushdown of constant height . . . . . . 99--114
Alberto Leporati and
Luca Manzoni and
Giancarlo Mauri and
Antonio E. Porreca and
Claudio Zandron Characterising the complexity of tissue
P systems with fission rules . . . . . . 115--128
Anonymous Editorial Board . . . . . . . . . . . . ifc--ifc
Eric Goles and
Pedro Montealegre and
Kévin Perrot and
Guillaume Theyssier On the complexity of two-dimensional
signed majority cellular automata . . . 1--32
Balagopal Komarath and
Jayalal Sarma and
Saurabh Sawlani Pebbling meets coloring: Reversible
pebble game on trees . . . . . . . . . . 33--41
Anamitra Roy Choudhury and
Syamantak Das and
Naveen Garg and
Amit Kumar Rejecting jobs to minimize load and
maximum flow-time . . . . . . . . . . . 42--68
Quentin F. Stout Weighted $ L_\infty $ isotonic
regression . . . . . . . . . . . . . . . 69--81
Antonín Kucera and
Richard Mayr A generic framework for checking
semantic equivalences between pushdown
automata and finite-state automata . . . 82--103
Christoph Berkholz and
Oleg Verbitsky On the speed of constraint propagation
and the time complexity of arc
consistency testing . . . . . . . . . . 104--114
Anonymous Editorial Board . . . . . . . . . . . . ifc--ifc
George Barmpalias and
Andrew Lewis-Pye Optimal redundancy in computations from
random oracles . . . . . . . . . . . . . 1--8
Akanksha Agrawal and
Saket Saurabh and
Roohani Sharma and
Meirav Zehavi Kernels for deletion to classes of
acyclic digraphs . . . . . . . . . . . . 9--21
Iyad Kanj and
Christian Komusiewicz and
Manuel Sorge and
Erik Jan van Leeuwen Parameterized algorithms for recognizing
monopolar and $2$-subcolorable graphs 22--47
Gábor Ivanyos and
Raghav Kulkarni and
Youming Qiao and
Miklos Santha and
Aarthi Sundaram On the complexity of trial and error for
constraint satisfaction problems . . . . 48--64
Egor V. Kostylev and
Juan L. Reutter and
Domagoj Vrgoc Containment of queries for graphs with
data . . . . . . . . . . . . . . . . . . 65--91
Li-Hsuan Chen and
Dun-Wei Cheng and
Sun-Yuan Hsieh and
Ling-Ju Hung and
Ralf Klasing and
Chia-Wei Lee and
Bang Ye Wu Approximability and inapproximability of
the star $p$-hub center problem with
parameterized triangle inequality . . . 92--112
Daniel Gebler and
Simone Tini SOS specifications for uniformly
continuous operators . . . . . . . . . . 113--151
Wangdong Yang and
Kenli Li and
Keqin Li A parallel computing method using
blocked format with optimal partitioning
for SpMV on GPU . . . . . . . . . . . . 152--170
Édouard Bonnet and
Michael Lampis and
Vangelis Th. Paschos Time-approximation trade-offs for
inapproximable problems . . . . . . . . 171--180
Anonymous Editorial Board . . . . . . . . . . . . ifc--ifc
Anonymous Editorial Board . . . . . . . . . . . . ii--ii
Marcin Wrochna Reconfiguration in bounded bandwidth and
tree-depth . . . . . . . . . . . . . . . 1--10
Flavio Chierichetti and
Jon Kleinberg and
Sigal Oren On discrete preferences and coordination 11--29
Michael R. Fellows and
Ariel Kulik and
Frances Rosamond and
Hadas Shachnai Parameterized approximation via fidelity
preserving transformations . . . . . . . 30--40
A. Karim Abu-Affash and
Paz Carmi and
Anat Parush Tzur Dual power assignment via second
Hamiltonian cycle . . . . . . . . . . . 41--53
Anonymous Editorial Board . . . . . . . . . . . . ii--ii
Michael Segal Journal of Computer and System Science:
50 years of celebration. In memory of
Professor Edward Blum . . . . . . . . . 1--1
Michael Fellows and
Frances Rosamond A brief history of Edward K. Blum and
the Journal of Computer and System
Sciences . . . . . . . . . . . . . . . . 2--10
Georg Gottlob and
Gianluigi Greco and
Francesco Scarcello Tree projections and constraint
optimization problems: Fixed-parameter
tractability and parallel algorithms . . 11--40
William Lam and
Kalev Kask and
Javier Larrosa and
Rina Dechter Subproblem ordering heuristics for
AND/OR best-first search . . . . . . . . 41--62
Ran Canetti and
Ling Cheung and
Dilsun Kaynar and
Moses Liskov and
Nancy Lynch and
Olivier Pereira and
Roberto Segala Task-structured probabilistic I/O
automata . . . . . . . . . . . . . . . . 63--97
Foto N. Afrati and
Shantanu Sharma and
Jonathan R. Ullman and
Jeffrey D. Ullman Computing marginals using MapReduce . . 98--117
Pankaj K. Agarwal and
Nirman Kumar and
Stavros Sintos and
Subhash Suri Range-max queries on uncertain data . . 118--134
J. M. Buhmann and
A. Y. Gronskiy and
M. Mihalák and
T. Pröger and
R. \vSrámek and
P. Widmayer Robust optimization in the presence of
uncertainty: A generic approach . . . . 135--166
Paul W. Goldberg and
Christos H. Papadimitriou Towards a unified complexity theory of
total functions . . . . . . . . . . . . 167--192
Andrzej Pelc Use of information, memory and
randomization in asynchronous gathering 193--205
Anonymous Editorial Board . . . . . . . . . . . . ii--ii
Limei Lin and
Sun-Yuan Hsieh and
Li Xu and
Shuming Zhou and
Riqing Chen The relationship between extra
connectivity and conditional
diagnosability of regular graphs under
the PMC model . . . . . . . . . . . . . 1--18
Antonio-Javier Gallego and
Damián López and
Jorge Calera-Rubio Grammatical inference of directed
acyclic graph languages with polynomial
time complexity . . . . . . . . . . . . 19--34
Kristal K. Trejo and
Julio B. Clempner and
Alexander S. Poznyak Adapting attackers and defenders
patrolling strategies: a reinforcement
learning approach for Stackelberg
security games . . . . . . . . . . . . . 35--54
Ji Guan and
Yuan Feng and
Mingsheng Ying Decomposition of quantum Markov chains
and its applications . . . . . . . . . . 55--68
Gregory Gutin and
Felix Reidl and
Magnus Wahlström and
Meirav Zehavi Designing deterministic polynomial-space
algorithms by color-coding multivariate
polynomials . . . . . . . . . . . . . . 69--85
Gregory Gutin and
Felix Reidl and
Magnus Wahlström $k$-distinct in- and out-branchings in
digraphs . . . . . . . . . . . . . . . . 86--97
Laurent Bienvenu and
Santiago Figueira and
Benoit Monin and
Alexander Shen Algorithmic identification of
probabilities is hard . . . . . . . . . 98--108
Yuping Ke and
Yixin Cao and
Xiating Ouyang and
Wenjun Li and
Jianxin Wang Unit interval vertex deletion: Fewer
vertices are relevant . . . . . . . . . 109--121
Daniel Lokshtanov and
Amer E. Mouawad and
Fahad Panolan and
M. S. Ramanujan and
Saket Saurabh Reconfiguration on sparse graphs . . . . 122--131
Valentin E. Brimkov and
Reneta P. Barneva Discrete geometry and topology and their
applications to imaging sciences . . . . 132--133
Rocio Gonzalez-Diaz and
Maria-Jose Jimenez and
Belen Medrano Topological tracking of connected
components in image sequences . . . . . 134--142
Josef Slapal Categorical aspects of inducing closure
operators on graphs by sets of walks . . 143--150
Piyush Kanti Bhunre and
Partha Bhowmick Topological analysis of voxelized
objects by discrete geodesic Reeb graph 151--164
Sang-Eon Han Homotopic properties of an
MA-digitization of $2$D Euclidean spaces 165--176
Hayat Nasser and
Phuc Ngo and
Isabelle Debled-Rennesson Dominant point detection based on
discrete curve structure and
applications . . . . . . . . . . . . . . 177--192
Lo\"\ic Mazo and
Étienne Baudrier Object digitization up to a translation 193--203
Apurba Sarkar and
Arindam Biswas and
Mousumi Dutt and
Arnab Bhattacharya Finding a largest rectangle inside a
digital object and rectangularization 204--217
Rita Zrour and
Gaelle Largeteau-Skapin and
Eric Andres Optimal consensus set for digital Flake
hyperspheres in n D . . . . . . . . . . 218--231
Henning Fernau and
Meenakshi Paramasivan and
Markus L. Schmid and
Gnanaraj Thomas D. Simple picture processing based on
finite automata and regular grammars . . 232--258
Anonymous Editorial Board . . . . . . . . . . . . ii--ii
Lin Chen and
Klaus Jansen and
Guochuan Zhang On the optimality of exact and
approximation algorithms for scheduling
problems . . . . . . . . . . . . . . . . 1--32
György Dósa and
Leah Epstein The tight asymptotic approximation ratio
of First Fit for bin packing with
cardinality constraints . . . . . . . . 33--49
Shlomi Dolev and
Chryssis Georgiou and
Ioannis Marcoullis and
Elad M. Schiller Practically-self-stabilizing virtual
synchrony . . . . . . . . . . . . . . . 50--73
Salvador Lucas and
José Meseguer and
Raúl Gutiérrez The 2D Dependency Pair Framework for
conditional rewrite systems. Part I:
Definition and basic processors . . . . 74--106
Alexander Golovnev and
Edward A. Hirsch and
Alexander Knop and
Alexander S. Kulikov On the limits of gate elimination . . . 107--119
Anonymous Editorial Board . . . . . . . . . . . . ii--ii
Prachi Goyal and
Pranabendu Misra and
Fahad Panolan and
Geevarghese Philip and
Saket Saurabh Finding even subgraphs even faster . . . 1--13
Víctor Dalmau and
Andrei Krokhin and
Rajsekar Manokaran Towards a characterization of
constant-factor approximable
finite-valued CSPs . . . . . . . . . . . 14--27
Feng Shi and
Jianer Chen and
Qilong Feng and
Jianxin Wang A parameterized algorithm for the
Maximum Agreement Forest problem on
multiple rooted multifurcating trees . . 28--44
Mahdi Cheraghchi and
Elena Grigorescu and
Brendan Juba and
Karl Wimmer and
Ning Xie AC$^0$ $ \cdot $ MOD$_2$ lower bounds
for the Boolean inner product . . . . . 45--59
George B. Mertzios and
Paul G. Spirakis Strong bounds for evolution in networks 60--82
Guangya Cai and
Daowen Qiu Optimal separation in exact query
complexities for Simon's problem . . . . 83--93
Jhih-Hong Ye and
Chih-Yu Li and
Biing-Feng Wang An improved algorithm for the minmax
regret path centdian problem on trees 94--105
Alkida Balliu and
Gianlorenzo D'Angelo and
Pierre Fraigniaud and
Dennis Olivetti What can be verified locally? . . . . . 106--120
Eduard Eiben and
Robert Ganian and
O-joung Kwon A single-exponential fixed-parameter
algorithm for distance-hereditary vertex
deletion . . . . . . . . . . . . . . . . 121--146
Emmanuel Filiot and
Jean-François Raskin and
Pierre-Alain Reynier and
Frédéric Servais and
Jean-Marc Talbot Visibly pushdown transducers . . . . . . 147--181
Florent Becker and
Mathieu Chapelle and
Jérôme Durand-Lose and
Vincent Levorato and
Maxime Senot Abstract geometrical computation 8:
Small machines, accumulations and
rationality . . . . . . . . . . . . . . 182--198
Anonymous Editorial Board . . . . . . . . . . . . ii--ii
Xiao Liu and
Mianxiong Dong and
Kaoru Ota and
Laurence T. Yang and
Anfeng Liu Trace malicious source to guarantee
cyber security for mass monitor critical
infrastructure . . . . . . . . . . . . . 1--26
Deepak Tosh and
Shamik Sengupta and
Charles A. Kamhoua and
Kevin A. Kwiat Establishing evolutionary game models
for CYBer security information EXchange
(CYBEX) . . . . . . . . . . . . . . . . 27--52
Nachshon Cohen and
Zeev Nutov Approximating Steiner trees and forests
with minimum number of Steiner points 53--64
Anonymous Editorial Board . . . . . . . . . . . . ii--ii
Zheng Wang An elastic and resiliency defense
against DDoS attacks on the critical DNS
authoritative infrastructure . . . . . . 1--26
Lakshmi Anantharamu and
Bogdan S. Chlebus and
Dariusz R. Kowalski and
Mariusz A. Rokicki Packet latency of deterministic
broadcasting in adversarial multiple
access channels . . . . . . . . . . . . 27--52
Jakub Gajarský and
Petr Hlinený and
Martin Koutecký and
Shmuel Onn Parameterized shifted combinatorial
optimization . . . . . . . . . . . . . . 53--71
Walter Didimo and
Giuseppe Liotta and
Maurizio Patrignani HV-planarity: Algorithms and complexity 72--90
Leah Epstein and
Asaf Levin On the performance guarantee of First
Fit for sum coloring . . . . . . . . . . 91--105
Anonymous Editorial Board . . . . . . . . . . . . ii--ii
Filip Mazowiecki and
Cristian Riveros Copyless cost-register automata:
Structure, expressiveness, and closure
properties . . . . . . . . . . . . . . . 1--29
Igor Potapov and
Pavel Semukhin Vector and scalar reachability problems
in SL(2,Z) . . . . . . . . . . . . . . . 30--43
Douglas Burdick and
Ronald Fagin and
Phokion G. Kolaitis and
Lucian Popa and
Wang-Chiew Tan Expressive power of entity-linking
frameworks . . . . . . . . . . . . . . . 44--69
Yue Ben and
Rohit Chadha and
A. Prasad Sistla and
Mahesh Viswanathan Decidable and expressive classes of
probabilistic automata . . . . . . . . . 70--95
Laurent Doyen and
Thierry Massart and
Mahsa Shirmohammadi The complexity of synchronizing Markov
decision processes . . . . . . . . . . . 96--129
Anonymous Editorial Board . . . . . . . . . . . . ii--ii
Gregory Gutin and
M. S. Ramanujan and
Felix Reidl and
Magnus Wahlström Path-contractions, edge deletions and
connectivity preservation . . . . . . . 1--20
Benjamin Bergougnoux and
Florent Capelli and
Mamadou Moustapha Kanté Counting minimal transversals of $ \beta
$-acyclic hypergraphs . . . . . . . . . 21--30
Lane A. Hemaspaandra and
Daniel Rubery Recursion-theoretic ranking and
compression . . . . . . . . . . . . . . 31--41
Pawel Gawrychowski and
Florin Manea and
Robert Mercas and
Dirk Nowotka Hide and seek with repetitions . . . . . 42--67
Sanjay Jain and
Alexei Miasnikov and
Frank Stephan The complexity of verbal languages over
groups . . . . . . . . . . . . . . . . . 68--85
Jérémie Cabessa and
Olivier Finkel Computational capabilities of analog and
evolving neural networks over infinite
input streams . . . . . . . . . . . . . 86--99
Norikazu Takahashi and
Daiki Hirata and
Shuji Jimbo and
Hiroaki Yamamoto Band-restricted diagonally dominant
matrices: Computational complexity and
application . . . . . . . . . . . . . . 100--111
Anonymous Editorial Board . . . . . . . . . . . . ii--ii
János Balogh and
József Békési and
György Dósa and
Jirí Sgall and
Rob van Stee The optimal absolute ratio for online
bin packing . . . . . . . . . . . . . . 1--17
Anonymous Pages 1--86 (June 2019) . . . . . . . . 1--86
Othon Michail and
George Skretas and
Paul G. Spirakis On the transformation capability of
feasible mechanisms for programmable
matter . . . . . . . . . . . . . . . . . 18--39
Kim-Kwang Raymond Choo and
Jemal Abawajy and
Rafiqul Islam Special issue on cybersecurity in the
critical infrastructure: Advances and
future directions . . . . . . . . . . . 40--41
Cheng Luo and
Bo Zhang and
Yang Xiang and
Man Qi Gaussian-Gamma collaborative filtering:
a hierarchical Bayesian model for
recommender systems . . . . . . . . . . 42--56
Dariusz Dereniowski and
Andrzej Lingas and
Dorota Osula and
Mia Persson and
Pawe\l Zyli\'nski Clearing directed subgraphs by mobile
agents: Variations on covering with
paths . . . . . . . . . . . . . . . . . 57--68
Till Fluschnik and
Marco Morik and
Manuel Sorge The complexity of routing with collision
avoidance . . . . . . . . . . . . . . . 69--86
Anonymous Editorial Board . . . . . . . . . . . . ii--ii
Nicolás Álvarez and
Verónica Becher and
Olivier Carton Finite-state independence and normal
sequences . . . . . . . . . . . . . . . 1--17
Anonymous Pages 1--78 (August 2019) . . . . . . . 1--78
Nir Drucker and
Hsi-Ming Ho and
Joël Ouaknine and
Michal Penn and
Ofer Strichman Cyclic-routing of Unmanned Aerial
Vehicles . . . . . . . . . . . . . . . . 18--45
Eleni C. Akrida and
Jurek Czyzowicz and
Leszek Gasieniec and
Lukasz Kuszner and
Paul G. Spirakis Temporal flows in temporal networks . . 46--60
Matthias Bentert and
Till Fluschnik and
André Nichterlein and
Rolf Niedermeier Parameterized aspects of triangle
enumeration . . . . . . . . . . . . . . 61--77
Anonymous Editorial Board . . . . . . . . . . . . ii--ii
Adrian-Horia Dediu and
Carlos Martín-Vide and
Bianca Truthe Special issue: Selected papers of the
9th International Conference on Language
and Automata Theory and Applications,
LATA 2015 . . . . . . . . . . . . . . . 1--4
Eric Allender and
Ian Mertz Complexity of regular functions . . . . 5--16
Marco Autili and
Paola Inverardi and
Romina Spalazzese and
Massimo Tivoli and
Filippo Mignosi Automated synthesis of application-layer
connectors from automata-based
specifications . . . . . . . . . . . . . 17--40
Parvaneh Babari and
Manfred Droste A Nivat theorem for weighted picture
automata and weighted MSO logics . . . . 41--57
Raphaël Bailly and
Guillaume Rabusseau and
François Denis Recognizable series on graphs and
hypergraphs . . . . . . . . . . . . . . 58--81
Olaf Beyersdorff and
Leroy Chew and
Karteek Sreenivasaiah A game characterisation of tree-like
$Q$-Resolution size . . . . . . . . . . 82--101
S. Bilotta and
E. Pergola and
R. Pinzani and
S. Rinaldi Recurrence relations, succession rules
and the positivity problem . . . . . . . 102--118
Johanna Björklund and
Frank Drewes and
Niklas Zechner Efficient enumeration of weighted tree
languages over the tropical semiring . . 119--130
Yohan Boichut and
Jacques Chabin and
Pierre Réty Towards more precise rewriting
approximations . . . . . . . . . . . . . 131--148
Adrien Boiret and
Vincent Hugot and
Joachim Niehren and
Ralf Treinen Logics for unordered trees with data
constraints . . . . . . . . . . . . . . 149--164
Bastien Cazaux and
Thierry Lecroq and
Eric Rivals Linking indexing data structures to de
Bruijn graphs: Construction and update 165--183
Michael Codish and
Luís Cruz-Filipe and
Thorsten Ehlers and
Mike Müller and
Peter Schneider-Kamp Sorting networks: To the end and back
again . . . . . . . . . . . . . . . . . 184--201
Konrad K. Dabrowski and
Shenwei Huang and
Daniël Paulusma Bounding clique-width via perfect graphs 202--215
H. K. Dai and
Z. Wang Two parallel algorithms for finding all
minimal maximum subsequences . . . . . . 216--243
Joey Eremondi and
Oscar H. Ibarra and
Ian McQuillan Insertion operations on deterministic
reversal-bounded counter machines . . . 244--257
Guilhem Gamard and
Gwenaël Richomme Coverability and multi-scale
coverability on infinite pictures . . . 258--277
Florent Jacquemard and
Michael Rusinowitch One-variable context-free hedge automata 278--296
Ryszard Janicki and
Jetty Kleijn and
Maciej Koutny and
Lukasz Mikulski Classifying invariant structures of step
traces . . . . . . . . . . . . . . . . . 297--322
Martin Sulzmann and
Peter Thiemann Derivatives and partial derivatives for
regular shuffle expressions . . . . . . 323--341
Vojtech Vorel and
Adam Roman Complexity of road coloring with
prescribed reset words . . . . . . . . . 342--358
Ryo Yoshinaka Distributional learning of conjunctive
grammars and contextual binary feature
grammars . . . . . . . . . . . . . . . . 359--374
Anonymous Editorial Board . . . . . . . . . . . . ii--ii
Dominik D. Freydenberger and
Markus L. Schmid Deterministic regular expressions with
back-references . . . . . . . . . . . . 1--39
Anonymous Pages 1--242 (November 2019) . . . . . . 1--242
Vidhya Ramaswamy and
Jayalal Sarma and
K. S. Sunil Space complexity of reachability testing
in labelled graphs . . . . . . . . . . . 40--53
Marc Gyssens and
Jelle Hellings and
Jan Paredaens and
Dirk Van Gucht and
Jef Wijsen and
Yuqing Wu Calculi for symmetric queries . . . . . 54--86
Takayuki Sakai and
Kazuhisa Seto and
Suguru Tamaki and
Junichi Teruyama Bounded depth circuits with weighted
symmetric gates: Satisfiability, lower
bounds and compression . . . . . . . . . 87--103
Jung-Heum Park and
Hyeong-Seok Lim and
Hee-Chul Kim Fault-tolerant embedding of starlike
trees into restricted hypercube-like
graphs . . . . . . . . . . . . . . . . . 104--115
Yair Bartal and
Arnold Filtser and
Ofer Neiman On notions of distortion and an almost
minimum spanning tree with constant
average distortion . . . . . . . . . . . 116--129
Georg Bachmeier and
Felix Brandt and
Christian Geist and
Paul Harrenstein and
Keyvan Kardel and
Dominik Peters and
Hans Georg Seedig $k$-Majority digraphs and the hardness
of voting with a constant number of
voters . . . . . . . . . . . . . . . . . 130--157
Eduard Eiben and
Danny Hermelin and
M. S. Ramanujan On approximate preprocessing for
domination and hitting subgraphs with
connected deletion sets . . . . . . . . 158--170
Albert Atserias and
Phokion G. Kolaitis and
Simone Severini Generalized satisfiability problems via
operator assignments . . . . . . . . . . 171--198
Erik D. Demaine and
Felix Reidl and
Peter Rossmanith and
Fernando Sánchez Villaamil and
Somnath Sikdar and
Blair D. Sullivan Structural sparsity of complex networks:
Bounded expansion in random models and
real-world graphs . . . . . . . . . . . 199--241
Anonymous Editorial Board . . . . . . . . . . . . ii--ii
Emmanuel Filiot and
Nicolas Mazzocchi and
Jean-François Raskin Decidable weighted expressions with
Presburger combinators . . . . . . . . . 1--22
Anonymous Pages 1--144 (December 2019) . . . . . . 1--144
Till Fluschnik and
Stefan Kratsch and
Rolf Niedermeier and
Manuel Sorge The parameterized complexity of the
minimum shared edges problem . . . . . . 23--48
Ashley Farrugia and
Leszek Gasieniec and
Lukasz Kuszner and
Eduardo Pacheco Deterministic rendezvous with different
maps . . . . . . . . . . . . . . . . . . 49--59
Serge Gaspers and
Shenwei Huang and
Daniël Paulusma Colouring square-free graphs without
long induced paths . . . . . . . . . . . 60--79
Adrian Kosowski and
Dominik Pajak Does adding more agents make a
difference? A case study of cover time
for the rotor-router . . . . . . . . . . 80--93
Hitoshi Koyano and
Morihiro Hayashida and
Tatsuya Akutsu Optimal string clustering based on a
Laplace-like mixture and EM algorithm on
a set of strings . . . . . . . . . . . . 94--128
Maciej Li\'skiewicz and
Matthias Lutter and
Rüdiger Reischuk Proper learning of $k$-term DNF formulas
from satisfying assignments . . . . . . 129--144
Anonymous Editorial Board . . . . . . . . . . . . ii--ii
Heng Guo and
Tyson Williams The complexity of planar Boolean #CSP
with complex weights . . . . . . . . . . 1--27
Anonymous Pages 1--166 (February 2020) . . . . . . 1--166
Fabrizio Frati and
Maurizio Patrignani and
Vincenzo Roselli LR-drawings of ordered rooted binary
trees and near-linear area drawings of
outerplanar graphs . . . . . . . . . . . 28--53
Ernesto Jiménez and
José Luis López-Presa and
Javier Martín-Rueda Consensus using omega in asynchronous
systems with unknown membership and
degenerative Byzantine failures . . . . 54--71
Philipp Zschoche and
Till Fluschnik and
Hendrik Molter and
Rolf Niedermeier The complexity of finding small
separators in temporal graphs . . . . . 72--92
David Gajser Verifying whether one-tape Turing
machines run in linear time . . . . . . 93--107
Eleni C. Akrida and
George B. Mertzios and
Paul G. Spirakis and
Viktor Zamaraev Temporal vertex cover with a sliding
time window . . . . . . . . . . . . . . 108--123
R. Niskanen and
I. Potapov and
J. Reichert On decidability and complexity of
low-dimensional robot games . . . . . . 124--141
Juraj Hromkovic and
Peter Rossmanith What one has to know when attacking P
vs. NP . . . . . . . . . . . . . . . . . 142--155
Anurag Anshu and
Peter Hòyer and
Mehdi Mhalla and
Simon Perdrix Contextuality in multipartite
pseudo-telepathy graph games . . . . . . 156--165
Anonymous Editorial Board . . . . . . . . . . . . ii--ii
Chia-Wen Cheng and
Sun-Yuan Hsieh and
Ralf Klasing Vulnerability of super extra
edge-connected graphs . . . . . . . . . 1--9
Anonymous Pages 1--136 (March 2020) . . . . . . . 1--136
Alejandro Erickson and
Javier Navaridas and
Iain A. Stewart Relating the bisection width of
dual-port, server-centric datacenter
networks and the solution of edge
isoperimetric problems in graphs . . . . 10--28
Guillaume Bagan and
Angela Bonifati and
Benoit Groz A trichotomy for regular simple path
queries on graphs . . . . . . . . . . . 29--48
Laurent Bienvenu and
Rod Downey On low for speed oracles . . . . . . . . 49--63
Konrad K. Dabrowski and
Vadim V. Lozin and
Daniël Paulusma Clique-width and well-quasi-ordering of
triangle-free graph classes . . . . . . 64--91
James Aisenberg and
Maria Luisa Bonet and
Sam Buss $2$-D Tucker is PPA complete . . . . . . 92--103
Henning Bordihn and
Victor Mitrana On the degrees of non-regularity and
non-context-freeness . . . . . . . . . . 104--117
Jakub Michaliszyn and
Jan Otop Non-deterministic weighted automata
evaluated over Markov chains . . . . . . 118--136
Anonymous Pages 1--144 (May 2020) . . . . . . . . 1--144
Anonymous Editorial Board . . . . . . . . . . . . ii--ii
Florian Bridoux and
Alonso Castillo-Ramirez and
Maximilien Gadouleau Complete simulation of automata networks 1--21
Petr Jancar Deciding semantic finiteness of pushdown
processes and first-order grammars
w.r.t. bisimulation equivalence . . . . 22--44
Sudeshna Kolay and
Pranabendu Misra and
M. S. Ramanujan and
Saket Saurabh Faster Graph bipartization . . . . . . . 45--55
Julien Baste and
Ignasi Sau and
Dimitrios M. Thilikos Hitting minors on bounded treewidth
graphs. III. Lower bounds . . . . . . . 56--77
Hu Ding and
Jinhui Xu Learning the truth vector in high
dimensions . . . . . . . . . . . . . . . 78--94
Miriam Backens and
Andrei Bulatov and
Leslie Ann Goldberg and
Colin McQuillan and
Stanislav Zivný Boolean approximate counting CSPs with
weak conservativity, and implications
for ferromagnetic two-spin . . . . . . . 95--125
Karolina Okrasa and
Pawe\l Rzazewski Subexponential algorithms for variants
of the homomorphism problem in string
graphs . . . . . . . . . . . . . . . . . 126--144
Anonymous Pages 1--54 (June 2020) . . . . . . . . 1--54
Anonymous Editorial Board . . . . . . . . . . . . ii--ii
Eduard Eiben and
Robert Ganian and
Sebastian Ordyniak Using decomposition-parameters for QBF:
Mind the prefix! . . . . . . . . . . . . 1--21
Andrey Kupavskii and
Nikita Zhivotovskiy When are epsilon-nets small? . . . . . . 22--36
Christian Rosenke and
Ronny Tredup The complexity of synthesizing
elementary net systems relative to
natural parameters . . . . . . . . . . . 37--54
Anonymous Pages 1--84 (August 2020) . . . . . . . 1--84
Anonymous Editorial Board . . . . . . . . . . . . ii--ii
Bruno Loff and
Nelma Moreira and
Rogério Reis The computational power of parsing
expression grammars . . . . . . . . . . 1--21
Alexsander A. Melo and
Celina M. H. Figueiredo and
Uéverton S. Souza A multivariate analysis of the strict
terminal connection problem . . . . . . 22--41
Gianluca De Marco and
Tomasz Jurdzi\'nski and
Dariusz R. Kowalski and
Micha\l Róza\'nski and
Grzegorz Stachowiak Subquadratic non-adaptive threshold
group testing . . . . . . . . . . . . . 42--56
Qiyi Tang and
Franck van Breugel Deciding probabilistic bisimilarity
distance one for probabilistic automata 57--84
Anonymous Pages 1--96 (September 2020) . . . . . . 1--96
Anonymous Editorial Board . . . . . . . . . . . . ii--ii
Rodney Downey and
Matthew Harrison-Trainor and
Iskander Kalimullin and
Alexander Melnikov and
Daniel Turetsky Graphs are not universal for online
computability . . . . . . . . . . . . . 1--12
Dorothea Baumeister and
Gábor Erdélyi and
Olivia J. Erdélyi and
Jörg Rothe and
Ann-Kathrin Selker Complexity of control in judgment
aggregation for uniform premise-based
quota rules . . . . . . . . . . . . . . 13--33
János Balogh and
József Békési and
György Dósa and
Leah Epstein and
Asaf Levin Online bin packing with cardinality
constraints resolved . . . . . . . . . . 34--49
Feodor F. Dragan and
Heather M. Guarnera Eccentricity terrain of $ \delta
$-hyperbolic graphs . . . . . . . . . . 50--65
Sun-Yuan Hsieh and
Sin-Jie Huang and
Tai-Hsuan Ho Multilevel length-based classified index
table for IP lookups and updates . . . . 66--84
Keren Censor-Hillel and
Mikaël Rabie Distributed reconfiguration of maximal
independent sets . . . . . . . . . . . . 85--96
Anonymous Pages 1--178 (November 2020) . . . . . . 1--178
Anonymous Editorial Board . . . . . . . . . . . . ii--ii
P. Montealegre and
S. Perez-Salazar and
I. Rapaport and
I. Todinca Graph reconstruction in the congested
clique . . . . . . . . . . . . . . . . . 1--17
Stefano Crespi Reghizzi and
Matteo Pradella Beyond operator-precedence grammars and
languages . . . . . . . . . . . . . . . 18--41
Barnaby Martin and
Daniël Paulusma and
Erik Jan van Leeuwen Disconnected cuts in claw-free graphs 60--75
Jérémie Chalopin and
Victor Chepoi A counterexample to Thiagarajan's
conjecture on regular event structures 76--100
Petr A. Golovach and
Pinar Heggernes and
Paloma T. Lima and
Pedro Montealegre Finding connected secluded subgraphs . . 101--124
Neeldhara Misra and
Fahad Panolan and
Saket Saurabh Subexponential algorithm for $d$-cluster
edge deletion: Exception or rule? . . . 150--162
Lianrong Pu and
Daming Zhu and
Haitao Jiang A 1.375-approximation algorithm for
unsigned translocation sorting . . . . . 163--178
Amos Korman and
Yoav Rodeh Multi-round cooperative search games
with multiple players . . . . . . . . . 125--149
V. Arvind and
Frank Fuhlbrück and
Johannes Köbler and
Oleg Verbitsky On Weisfeiler--Leman invariance:
Subgraph counts and related graph
properties . . . . . . . . . . . . . . . 42--59
Anonymous Pages 1--146 (December 2020) . . . . . . 1--146
Anonymous Editorial Board . . . . . . . . . . . . ii--ii
John Fearnley and
Spencer Gordon and
Ruta Mehta and
Rahul Savani Unique end of potential line . . . . . . 1--35
Biing-Feng Wang and
Jhih-Hong Ye and
Chih-Yu Li An improved algorithm for the minmax
regret path center problem on trees . . 36--47
Bogdan S. Chlebus and
Vicent Cholvi and
Dariusz R. Kowalski Universal stability in multi-hop radio
networks . . . . . . . . . . . . . . . . 48--64
Gabriel Cardona and
Louxin Zhang Counting and enumerating tree-child
networks and their subclasses . . . . . 84--104
Keita Emura and
Katsuhiko Ito and
Toshihiro Ohigashi Secure-channel free searchable
encryption with multiple keywords: a
generic construction, an instantiation,
and its implementation . . . . . . . . . 107--125
Pavol Duris and
Rastislav Královic and
Dana Pardubská Tight hierarchy of data-independent
multi-head automata . . . . . . . . . . 126--136
Eleni C. Akrida and
George B. Mertzios and
Sotiris Nikoletseas and
Christoforos Raptopoulos and
Paul G. Spirakis and
Viktor Zamaraev How fast can we reach a target vertex in
stochastic temporal graphs? . . . . . . 65--83
Ralf Klasing and
Marc Zeitoun Selected papers of the 21st
International Symposium on Fundamentals
of Computation Theory, FCT 2017 . . . . 105--106
Bireswar Das and
Shivdutt Sharma and
P. R. Vaidyanathan Space efficient representations of
finite groups . . . . . . . . . . . . . 137--146
Anonymous Pages 1--264 (February 2021) . . . . . . 1--264
Anonymous Editorial Board . . . . . . . . . . . . ii--ii
Dariusz Dereniowski and
Lukasz Kuszner and
Robert Ostrowski Searching by heterogeneous agents . . . 1--21
Supachai Mukdasanit and
Sanpawat Kantabutra Attack and defense in the layered
cyber-security model and their $ (1 \pm
\epsilon)$-approximation schemes . . . . 54--63
Shuang Zhao and
Zongqing Chen and
Weihua Yang and
Jixiang Meng Edge fault-tolerance analysis of
maximally edge-connected graphs and
super edge-connected graphs . . . . . . 64--72
Petr Jancar Equivalence of pushdown automata via
first-order grammars . . . . . . . . . . 86--112
Bart Kuijpers Deciding the point-to-fixed-point
problem for skew tent maps on an
interval . . . . . . . . . . . . . . . . 113--120
William K. Moses, Jr. and
Shailesh Vaya Deterministic protocols in the SINR
model without knowledge of coordinates 121--145
Xiaotie Deng and
Jack R. Edmonds and
Zhe Feng and
Zhengyang Liu and
Qi Qi and
Zeying Xu Understanding PPA-completeness . . . . . 146--168
Jessica Enright and
Kitty Meeks and
Fiona Skerman Assigning times to minimise reachability
in temporal graphs . . . . . . . . . . . 169--186
Andreas Galanis and
Leslie Ann Goldberg and
Kuan Yang Approximating partition functions of
bounded-degree Boolean counting
Constraint Satisfaction Problems . . . . 187--213
Mikhail V. Berlinkov and
Robert Ferens and
Marek Szyku\la Preimage problems for deterministic
finite automata . . . . . . . . . . . . 214--234
Panagiotis Charalampopoulos and
Tomasz Kociumaka and
Solon P. Pissis and
Jakub Radoszewski and
Wojciech Rytter and
Juliusz Straszy\'nski and
Tomasz Wale\'n and
Wiktor Zuba Circular pattern matching with $k$
mismatches . . . . . . . . . . . . . . . 73--85
Markus Lohrey and
Sebastian Maneth Largest common prefix of a regular tree
language . . . . . . . . . . . . . . . . 235--245
Iago A. Carvalho and
Thomas Erlebach and
Kleitos Papadopoulos On the fast delivery problem with one or
two packages . . . . . . . . . . . . . . 246--263
Benedikt Bollig and
Marie Fortin and
Paul Gastin Communicating finite-state machines,
first-order logic, and star-free
propositional dynamic logic . . . . . . 22--53
Anonymous Pages 1--54 (March 2021) . . . . . . . . 1--54
Anonymous Editorial Board . . . . . . . . . . . . ii--ii
Qisheng Wang and
Junyi Liu and
Mingsheng Ying Equivalence checking of quantum
finite-state machines . . . . . . . . . 1--21
Abdul Rahman Taleb and
Damien Vergnaud Speeding-up verification of digital
signatures . . . . . . . . . . . . . . . 22--39
Arnaud Durand and
Anselm Haak and
Juha Kontinen and
Heribert Vollmer Descriptive complexity of #P functions:
a new perspective . . . . . . . . . . . 40--54
Anonymous Pages 1--242 (May 2021) . . . . . . . . 1--242
Anonymous Editorial Board . . . . . . . . . . . . ii--ii
Djamal Belazzougui and
Manuel Cáceres and
Travis Gagie and
Pawe\l Gawrychowski and
Juha KÃ\currency rkkÃ\currency inen and
Gonzalo Navarro and
Alberto Ordóñez and
Simon J. Puglisi and
Yasuo Tabei Block trees . . . . . . . . . . . . . . 1--22
Victor Lagerkvist and
Biman Roy Complexity of inverse constraint
problems and a dichotomy for the inverse
satisfiability problem . . . . . . . . . 23--39
Fedor V. Fomin and
Petr A. Golovach and
Kirill Simonov Parameterized $k$-Clustering:
Tractability island . . . . . . . . . . 50--74
Keqin Li On the profits of competing cloud
service providers: a game theoretic
approach . . . . . . . . . . . . . . . . 130--153
Ester Livshits and
Benny Kimelfeld and
Jef Wijsen Counting subset repairs with functional
dependencies . . . . . . . . . . . . . . 154--164
Mark Jones and
Steven Kelk and
Leen Stougie Maximum parsimony distance on
phylogenetic trees: a linear kernel and
constant factor approximation algorithm 165--181
Yasushi Kawase and
Tomomi Matsui and
Atsushi Miyauchi Additive approximation algorithms for
modularity maximization . . . . . . . . 182--201
Lorenzo Clemente and
S\lawomir Lasota Reachability relations of timed pushdown
automata . . . . . . . . . . . . . . . . 202--241
Ioannis Caragiannis and
Angelo Fanelli On approximate pure Nash equilibria in
weighted congestion games with
polynomial latencies . . . . . . . . . . 40--48
Paola Flocchini 46th International Colloquium on
Automata, Languages and Programming
(ICALP 2019) --- Track C: Foundations of
networks and multi-agent systems . . . . 49--49
Argyrios Deligkas and
John Fearnley and
Themistoklis Melissourgos and
Paul G. Spirakis Computing exact solutions of consensus
halving and the Borsuk--Ulam theorem . . 75--98
Radu Grigore and
Stefan Kiefer Selective monitoring . . . . . . . . . . 99--129
Anonymous Pages 1--140 (June 2021) . . . . . . . . 1--140
Anonymous Editorial Board . . . . . . . . . . . . ii--ii
Henrik Björklund and
Frank Drewes and
Petter Ericson and
Florian Starke Uniform parsing for hyperedge
replacement grammars . . . . . . . . . . 1--27
Huaiwen He and
Hong Shen Minimizing the operation cost of
distributed green data centers with
energy storage under carbon capping . . 28--52
Francisco Claude and
Gonzalo Navarro and
Alejandro Pacheco Grammar-compressed indexes with
logarithmic search time . . . . . . . . 53--74
Leszek Gasieniec and
Jesper Jansson and
Christos Levcopoulos and
Andrzej Lingas and
Mia Persson Pushing the Online Boolean Matrix-vector
Multiplication conjecture off-line and
identifying its easy cases . . . . . . . 108--118
Dekel Tsur Representation of ordered trees with a
given degree distribution . . . . . . . 119--130
Xingfu Li and
Daming Zhu and
Lusheng Wang A $ 43 $-approximation algorithm for the
Maximum Internal Spanning Tree Problem 131--140
Alexander Kozachinskiy and
Alexander Shen Automatic Kolmogorov complexity,
normality, and finite-state dimension
revisited . . . . . . . . . . . . . . . 75--107
Anonymous Pages 1--230 (August 2021) . . . . . . . 1--230
Anonymous Editorial Board . . . . . . . . . . . . ii--ii
Jessica Enright and
Kitty Meeks and
George B. Mertzios and
Viktor Zamaraev Deleting edges to restrict the size of
an epidemic in temporal networks . . . . 60--77
Laure Daviaud and
Marcin Jurdzi\'nski and
Ranko Lazi\'c and
Filip Mazowiecki and
Guillermo A. Pérez and
James Worrell When are emptiness and containment
decidable for probabilistic automata? 78--96
Pablo Barceló and
Alexander Baumgartner and
Victor Dalmau and
Benny Kimelfeld Regularizing conjunctive features for
classification . . . . . . . . . . . . . 97--124
Eduard Eiben and
Daniel Lokshtanov and
Amer E. Mouawad Bisection of bounded treewidth graphs by
convolutions . . . . . . . . . . . . . . 125--132
Flavio Ferrarotti and
Senén González and
José María Turull Torres and
Jan Van den Bussche and
Jonni Virtema Descriptive complexity of deterministic
polylogarithmic time and space . . . . . 145--163
Huib Donkers and
Bart M. P. Jansen A Turing kernelization dichotomy for
structural parameterizations of $
\mathcal {F} $ -Minor-Free Deletion . . 164--182
Gianluca De Marco and
Tomasz Jurdzi\'nski and
Dariusz R. Kowalski Optimal channel utilization with limited
feedback . . . . . . . . . . . . . . . . 21--33
Jesús Domínguez and
Maribel Fernández Nominal syntax with atom substitutions 34--59
Guy Avni and
Thomas A. Henzinger and
Dorde Zikeli\'c Bidding mechanisms in graph games . . . 133--144
Sebastian Junges and
Joost-Pieter Katoen and
Guillermo A. Pérez and
Tobias Winkler The complexity of reachability in
parametric Markov decision processes . . 183--210
Thomas Brihaye and
Véronique Bruy\`ere and
Aline Goeminne and
Nathan Thomasset On relevant equilibria in reachability
games . . . . . . . . . . . . . . . . . 211--230
Thomas Erlebach and
Michael Hoffmann and
Frank Kammer On temporal graph exploration . . . . . 1--18
Sven Schewe and
Lijun Zhang Editorial --- Special issue on
Concurrency Theory (CONCUR 2018) . . . . 19--20
Anonymous Pages 1--194 (September 2021) . . . . . 1--194
Anonymous Editorial Board . . . . . . . . . . . . ii--ii
Takashi Ishizuka The complexity of the parity argument
with potential . . . . . . . . . . . . . 14--41
Paloma T. Lima and
Vinicius F. dos Santos and
Ignasi Sau and
Uéverton S. Souza Reducing graph transversals via edge
contractions . . . . . . . . . . . . . . 62--74
Laurent Bulteau and
Niels Grüttemeier and
Christian Komusiewicz and
Manuel Sorge Your rugby mates don't need to know your
colleagues: Triadic closure with edge
colors . . . . . . . . . . . . . . . . . 75--96
George B. Mertzios and
Hendrik Molter and
Viktor Zamaraev Sliding window temporal graph coloring 97--115
Vincenzo Bonifaci and
Gianlorenzo D'Angelo and
Alberto Marchetti-Spaccamela Algorithms for hierarchical and
semi-partitioned parallel scheduling . . 116--136
Wenbin Chen and
Jin Li and
Zhengan Huang and
Chongzhi Gao and
Siuming Yiu and
Zoe L. Jiang Lattice-based unidirectional
infinite-use proxy re-signatures with
private re-signature key . . . . . . . . 137--148
Jackson Abascal and
Lane A. Hemaspaandra and
Shir Maimon and
Daniel Rubery Closure and nonclosure properties of the
classes of compressible and rankable
sets . . . . . . . . . . . . . . . . . . 162--176
Dominique Schmitt Bivariate B-splines from convex
configurations . . . . . . . . . . . . . 42--61
Leszek Gasieniec and
Jesper Jansson and
Christos Levcopoulos Foreword: Selected papers from the 22nd
International Symposium on Fundamentals
of Computation Theory (FCT 2019) . . . . 177--178
Vladimir Yu. Protasov Analytic methods for reachability
problems . . . . . . . . . . . . . . . . 1--13
Christopher Hampson On the termination and structural
termination problems for counter
machines with incrementing errors . . . 149--161
Eleni C. Akrida and
George B. Mertzios and
Paul G. Spirakis and
Christoforos Raptopoulos The temporal explorer who returns to the
base . . . . . . . . . . . . . . . . . . 179--193
Anonymous Pages 1--76 (November 2021) . . . . . . 1--76
Anonymous Editorial Board . . . . . . . . . . . . ii--ii
Yunhai Zheng and
Chengliang Tian and
Hanlin Zhang and
Jia Yu and
Fengjun Li Lattice-based weak-key analysis on
single-server outsourcing protocols of
modular exponentiations and basic
countermeasures . . . . . . . . . . . . 18--33
Rodrigo Torres-Avilés Undecidability of the speed positiveness
problem in reversible and complete
Turing machines . . . . . . . . . . . . 49--56
Eduard Eiben and
Robert Ganian and
Thekla Hamm and
O-joung Kwon Measuring what matters: a hybrid
approach to dynamic programming with
treewidth . . . . . . . . . . . . . . . 57--75
Arnaud Casteigts and
Joseph G. Peters and
Jason Schoeters Temporal cliques admit sparse spanners 1--17
James Aspnes Clocked population protocols . . . . . . 34--48
Anonymous Pages 1--126 (December 2021) . . . . . . 1--126
Anonymous Editorial Board . . . . . . . . . . . . ii--ii
Paul C. Bell and
Mika Hirvensalo On injectivity of quantum finite
automata . . . . . . . . . . . . . . . . 19--33
Paul W. Goldberg and
Alexandros Hollender The Hairy Ball problem is PPAD-complete 34--62
Alberto Dennunzio and
Enrico Formenti and
Darij Grinberg and
Luciano Margara An efficiently computable
characterization of stability and
instability for linear cellular automata 63--71
Tsuyoshi Gotoh and
Paola Flocchini and
Toshimitsu Masuzawa and
Nicola Santoro Exploration of dynamic networks: Tight
bounds on the number of agents . . . . . 1--18
Manisha Luthra and
Boris Koldehofe and
Niels Danger and
Pascal Weisenberger and
Guido Salvaneschi and
Ioannis Stavrakakis TCEP: Transitions in operator placement
to adapt to dynamic network environments 94--125
Andreas Emil Feldmann and
David Saulpic Polynomial time approximation schemes
for clustering in low highway dimension
graphs . . . . . . . . . . . . . . . . . 72--93
Anonymous Pages 1--202 (February 2022) . . . . . . 1--202
Anonymous Editorial Board . . . . . . . . . . . . ii--ii
Sankardeep Chakraborty and
Anish Mukherjee and
Venkatesh Raman and
Srinivasa Rao Satti Frameworks for designing in-place graph
algorithms . . . . . . . . . . . . . . . 1--19
Chi-Yeh Chen and
Sun-Yuan Hsieh An improved algorithm for the Steiner
tree problem with bounded edge-length 20--36
Zeev Nutov A $ 4 + \epsilon $ approximation for
$k$-connected subgraphs . . . . . . . . 64--75
Petr A. Golovach and
Christian Komusiewicz and
Dieter Kratsch and
Van Bang Le Refined notions of parameterized
enumeration kernels with applications to
matching cut enumeration . . . . . . . . 76--102
Fabian Frei and
Edith Hemaspaandra and
Jörg Rothe Complexity of stability . . . . . . . . 103--121
Artur Jez Word equations in non-deterministic
linear space . . . . . . . . . . . . . . 122--142
Andrea Marino and
Ana Silva Coloring temporal graphs . . . . . . . . 171--185
Priyanka Mukhopadhyay The Projection Games Conjecture and the
hardness of approximation of super-SAT
and related problems . . . . . . . . . . 186--201
Dariusz R. Kowalski and
Miguel A. Mosteiro Polynomial anonymous dynamic distributed
computing without a unique leader . . . 37--63
Silvia Bonomi and
Giuseppe A. Di Luna and
Othon Michail and
Leonardo Querzoni Special issue on Algorithmic Theory of
Dynamic Networks and Its Applications
--- Preface . . . . . . . . . . . . . . 157--158
Hanrui Zhang Improved prophet inequalities for
combinatorial welfare maximization with
(approximately) subadditive agents . . . 143--156
Hanlin Ren Improved distance sensitivity oracles
with subcubic preprocessing time . . . . 159--170
Anonymous Pages 1--234 (March 2022) . . . . . . . 1--234
Anonymous Editorial Board . . . . . . . . . . . . ii--ii
Pål Grònås Drange and
Markus Fanebust Dregi and
Daniel Lokshtanov and
Blair D. Sullivan On the threshold of intractability . . . 1--25
Louis Dublois and
Tesshu Hanaka and
Mehdi Khosravian Ghadikolaei and
Michael Lampis and
Nikolaos Melissinos (In)approximability of maximum minimal
FVS . . . . . . . . . . . . . . . . . . 26--40
Yufei Tao and
Ke Yi Intersection joins under updates . . . . 41--64
Klaus Ambos-Spies and
Wolfgang Merkle and
Sebastiaan A. Terwijn Normalized information distance and the
oscillation hierarchy . . . . . . . . . 65--76
Themistoklis Melissourgos and
Sotiris E. Nikoletseas and
Christoforos L. Raptopoulos and
Paul G. Spirakis An extension of the Moran process using
type-specific connection graphs . . . . 77--96
Akanksha Agrawal Fine-grained complexity of rainbow
coloring and its variants . . . . . . . 140--158
Petr A. Golovach and
Daniël Paulusma and
Erik Jan van Leeuwen Induced Disjoint Paths in AT-free graphs 170--191
Thomas Bläsius and
Tobias Friedrich and
Julius Lischeid and
Kitty Meeks and
Martin Schirneck Efficiently enumerating hitting sets of
hypergraphs arising in data profiling 192--213
Marco Kuhlmann and
Andreas Maletti and
Lena Katharina Schiffer The tree-generative capacity of
combinatory categorial grammars . . . . 214--233
Panagiotis Charalampopoulos and
Adam Karczmarz Single-source shortest paths and strong
connectivity in dynamic planar graphs 97--111
Lukasz Kowalik and
Shaohua Li and
Wojciech Nadara and
Marcin Smulewicz and
Magnus Wahlström Many-visits TSP revisited . . . . . . . 112--128
Friedrich Eisenbrand and
Moritz Venzin Approximate CVP$_p$ in time $ 2^{0.802
n}$ . . . . . . . . . . . . . . . . . . 129--139
Timothy M. Chan and
Qizheng He More on change-making and related
problems . . . . . . . . . . . . . . . . 159--169
Anonymous Pages 1--166 (May 2022) . . . . . . . . 1--166
Anonymous Editorial Board . . . . . . . . . . . . ii--ii
Ehud Cseresnyes and
Hannes Seiwert Regular expression length via arithmetic
formula complexity . . . . . . . . . . . 1--24
Karl Bringmann and
Ralph Keusch and
Johannes Lengler and
Yannic Maus and
Anisur R. Molla Greedy routing and the algorithmic
small-world phenomenon . . . . . . . . . 59--105
Argyrios Deligkas and
John Fearnley and
Themistoklis Melissourgos and
Paul G. Spirakis Approximating the existential theory of
the reals . . . . . . . . . . . . . . . 106--128
Emilio Di Giacomo and
Giuseppe Liotta and
Fabrizio Montecchiani Orthogonal planarity testing of bounded
treewidth graphs . . . . . . . . . . . . 129--148
Dániel Marx and
R. B. Sandeep Incompressibility of $H$-free edge
modification problems: Towards a
dichotomy . . . . . . . . . . . . . . . 25--58
Yaron Fairstein and
Ariel Kulik and
Joseph (Seffi) Naor and
Danny Raz and
Hadas Shachnai An almost optimal approximation
algorithm for monotone submodular
multiple knapsack . . . . . . . . . . . 149--165
Anonymous Pages 1--164 (June 2022) . . . . . . . . 1--164
Anonymous Editorial Board . . . . . . . . . . . . ii--ii
John Augustine and
Seth Gilbert and
Fabian Kuhn and
Peter Robinson and
Suman Sourav Latency, capacity, and distributed
minimum spanning trees . . . . . . . . . 1--20
Matthias Bentert and
Klaus Heeger and
Dusan Knop Length-bounded cuts: Proper interval
graphs and structural parameters . . . . 21--43
Bart M. P. Jansen and
Jari J. H. de Kroon Preprocessing vertex-deletion problems:
Characterizing graph properties by
low-rank adjacencies . . . . . . . . . . 59--79
Laurine Bénéteau and
Jérémie Chalopin and
Victor Chepoi and
Yann Vax\`es Medians in median graphs and their cube
complexes in linear time . . . . . . . . 80--105
Evripidis Bampis and
Bruno Escoffier and
Alexandre Teiller Multistage knapsack . . . . . . . . . . 106--118
Nitish Andola and
Sourabh Prakash and
Vijay Kumar Yadav and
Raghav and
S. Venkatesan and
Shekhar Verma A secure searchable encryption scheme
for cloud using hash-based indexing . . 119--137
Florian Bridoux and
Amélia Durbec and
Kevin Perrot and
Adrien Richard Complexity of fixed point counting
problems in Boolean networks . . . . . . 138--164
Zachary Friggstad and
Chaitanya Swamy A constant-factor approximation for
directed latency in quasi-polynomial
time . . . . . . . . . . . . . . . . . . 44--58
Anonymous Pages 1--146 (August 2022) . . . . . . . 1--146
Anonymous Editorial Board . . . . . . . . . . . . ii--ii
Jérémie Chalopin and
Victor Chepoi and
Shay Moran and
Manfred K. Warmuth Unlabeled sample compression schemes and
corner peelings for ample and maximum
classes . . . . . . . . . . . . . . . . 1--28
Amir Abboud and
Karl Bringmann and
Danny Hermelin and
Dvir Shabtay Scheduling lower bounds via AND subset
sum . . . . . . . . . . . . . . . . . . 29--40
Kilian Gebhardt and
Frédéric Meunier and
Sylvain Salvati $ O_n $ is an $n$-MCFL . . . . . . . . . 41--52
Paul C. Bell Polynomially ambiguous probabilistic
automata on restricted languages . . . . 53--65
Edith Hemaspaandra and
Lane A. Hemaspaandra and
Jörg Rothe The complexity of online bribery in
sequential elections . . . . . . . . . . 66--90
Marco Canini and
Iosif Salem and
Liron Schiff and
Elad M. Schiller and
Stefan Schmid \em Renaissance: a self-stabilizing
distributed SDN control plane using
in-band communications . . . . . . . . . 91--121
Adel Nabli and
Margarida Carvalho and
Pierre Hosteins Complexity of the multilevel critical
node problem . . . . . . . . . . . . . . 122--145
Anonymous Pages 1--134 (September 2022) . . . . . 1--134
Anonymous Editorial Board . . . . . . . . . . . . ii--ii
Simone Linz and
Charles Semple Non-essential arcs in phylogenetic
networks . . . . . . . . . . . . . . . . 1--17
Gennaro Cordasco and
Luisa Gargano and
Adele A. Rescigno Dual domination problems in graphs . . . 18--34
Ville Salo Cutting corners . . . . . . . . . . . . 35--70
Nick Brettell and
Matthew Johnson and
Daniël Paulusma Computing Weighted Subset Odd Cycle
Transversals in $H$-free graphs . . . . 71--85
Eric Borba and
Eduardo Tavares and
Paulo Maciel A modeling approach for estimating
performance and energy consumption of
storage systems . . . . . . . . . . . . 86--106
Julien Destombes and
Andrei Romashchenko Resource-bounded Kolmogorov complexity
provides an obstacle to soficness of
multidimensional shifts . . . . . . . . 107--134
Anonymous Pages 1--106 (November 2022) . . . . . . 1--106
Anonymous Editorial Board . . . . . . . . . . . . ii--ii
Krishnendu Chatterjee and
Laurent Doyen Graph planning with expected finite
horizon . . . . . . . . . . . . . . . . 1--21
Saket Saurabh and
Uéverton dos Santos Souza and
Prafullkumar Tale On the parameterized complexity of Grid
Contraction . . . . . . . . . . . . . . 22--38
Manuel Vilares Ferro and
Víctor M. Darriba Bilbao and
Jesús Vilares Ferro Absolute convergence and error
thresholds in non-active adaptive
sampling . . . . . . . . . . . . . . . . 39--61
Cornelius Brand Discriminantal subset convolution:
Refining exterior-algebraic methods for
parameterized algorithms . . . . . . . . 62--71
Mehdi Kadivar and
Neda Mohammadi A maximum clique based approximation
algorithm for wireless link scheduling
under SINR model . . . . . . . . . . . . 72--89
Stasys Jukna and
Andrzej Lingas Lower bounds for Boolean circuits of
bounded negation width . . . . . . . . . 90--105
Anonymous Pages 1--70 (December 2022) . . . . . . 1--70
Anonymous Editorial Board . . . . . . . . . . . . ii--ii
Jurek Czyzowicz and
Leszek G\kasieniec and
Adrian Kosowski and
Evangelos Kranakis and
Paul G. Spirakis and
Przemys\law Uzna\'nski On convergence and threshold properties
of discrete Lotka--Volterra population
protocols . . . . . . . . . . . . . . . 1--25
Yair Bartal and
Ora Nova Fandina and
Ofer Neiman Covering metric spaces by few trees . . 26--42
Shichuan Deng and
Jian Li and
Yuval Rabani Approximation algorithms for clustering
with dynamic points . . . . . . . . . . 43--70
Anonymous Pages 1--104 (February 2023) . . . . . . 1--104
Anonymous Editorial Board . . . . . . . . . . . . ii--ii
Sankardeep Chakraborty and
Roberto Grossi and
Kunihiko Sadakane and
Srinivasa Rao Satti Succinct representation for
(non)deterministic finite automata . . . 1--12
Qisheng Wang and
Mingsheng Ying Quantum random access stored-program
machines . . . . . . . . . . . . . . . . 13--63
Saket Saurabh and
Meirav Zehavi Parameterized complexity of multi-node
hubs . . . . . . . . . . . . . . . . . . 64--85
Guillermo de Bernardo and
Travis Gagie and
Susana Ladra and
Gonzalo Navarro and
Diego Seco Faster compressed quadtrees . . . . . . 86--104
Anonymous Pages 1--88 (March 2023) . . . . . . . . 1--88
Anonymous Editorial Board . . . . . . . . . . . . ii--ii
Artem Govorov and
Jin-Yi Cai and
Martin Dyer A dichotomy for bounded degree graph
homomorphisms with nonnegative weights 1--15
Ville Salo and
Ilkka Törmä A physically universal Turing machine 16--44
Tomohiro Koana and
Vincent Froese and
Rolf Niedermeier The complexity of binary matrix
completion under diameter constraints 45--67
Fedor V. Fomin and
Danil Sagunov and
Kirill Simonov Building large $k$-cores from sparse
graphs . . . . . . . . . . . . . . . . . 68--88
Anonymous Pages 1--56 (May 2023) . . . . . . . . . 1--56
Anonymous Editorial Board . . . . . . . . . . . . ii--ii
Gianluca De Marco and
Dariusz R. Kowalski and
Grzegorz Stachowiak Deterministic non-adaptive contention
resolution on a shared channel . . . . . 1--22
Carl Einarson and
Gregory Gutin and
Bart M. P. Jansen and
Diptapriyo Majumdar and
Magnus Wahlström $p$-Edge/vertex-connected vertex cover:
Parameterized and approximation
algorithms . . . . . . . . . . . . . . . 23--40
Yen-Heng Lin and
Sun-Yuan Hsieh Improved IP lookup technology for
trie-based data structures . . . . . . . 41--55
Anonymous Pages 1--86 (June 2023) . . . . . . . . 1--86
Anonymous Editorial Board . . . . . . . . . . . . ii--ii
Eduard Eiben and
Robert Ganian and
Iyad Kanj and
Sebastian Ordyniak and
Stefan Szeider On the parameterized complexity of
clustering problems for incomplete data 1--19
Sol\`ene J. Esnay and
Alonso Núñez and
Ilkka Törmä Arithmetical complexity of the language
of generic limit sets of cellular
automata . . . . . . . . . . . . . . . . 20--41
Sebastian Berndt and
Leah Epstein and
Klaus Jansen and
Asaf Levin and
Marten Maack and
Lars Rohwedder Online bin covering with limited
migration . . . . . . . . . . . . . . . 42--72
Ishay Haviv and
Michal Parnas On the binary and Boolean rank of
regular matrices . . . . . . . . . . . . 73--86
Anonymous Pages 1--174 (August 2023) . . . . . . . 1--174
Anonymous Editorial Board . . . . . . . . . . . . ii--ii
Palash Dey and
Neeldhara Misra On the exact amount of missing
information that makes finding possible
winners hard . . . . . . . . . . . . . . 32--54
Diksha Gupta and
Jared Saia and
Maxwell Young Bankrupting Sybil despite churn . . . . 89--124
Giuseppe Liotta and
Ignaz Rutter and
Alessandra Tappini Parameterized complexity of graph
planarity with restricted cyclic orders 125--144
Cristina G. Fernandes and
Carla N. Lintzmayer How heavy independent sets help to find
arborescences with many leaves in DAGs 158--174
Nicolas Maack and
Hendrik Molter and
Rolf Niedermeier and
Malte Renken On finding separators in temporal split
and permutation graphs . . . . . . . . . 1--14
Jin-Yi Cai and
Austen Z. Fan and
Yin Liu Bipartite $3$-regular counting problems
with mixed signs . . . . . . . . . . . . 15--31
Markus Lohrey Complexity of word problems for
HNN-extensions . . . . . . . . . . . . . 145--157
John Andrews and
Michele Ciampi and
Vassilis Zikas Etherless Ethereum tokens: Simulating
native tokens in Ethereum . . . . . . . 55--72
Thomas Erlebach and
Jakob T. Spooner Parameterised temporal exploration
problems . . . . . . . . . . . . . . . . 73--88
Anonymous Pages 1--326 (September 2023) . . . . . 1--326
Anonymous Editorial Board . . . . . . . . . . . . ii--ii
Siddharth Gupta and
Guy Sa'ar and
Meirav Zehavi Grid recognition: Classical and
parameterized computational perspectives 17--62
Paloma T. Lima and
Vinicius F. dos Santos and
Ignasi Sau and
Uéverton S. Souza and
Prafullkumar Tale Reducing the vertex cover number via
edge contractions . . . . . . . . . . . 63--87
Tomoyuki Yamakami The 2CNF Boolean formula satisfiability
problem and the linear space hypothesis 88--112
Christel Baier and
Stefan Kiefer and
Joachim Klein and
David Müller and
James Worrell Markov chains and unambiguous automata 113--134
Sanjay Jain and
Xiaodong Jia and
Ammar Fathin Sabili and
Frank Stephan Addition machines, automatic functions
and open problems of Floyd and Knuth . . 135--156
Fedor V. Fomin and
Petr A. Golovach and
Nidhi Purohit Parameterized complexity of categorical
clustering with size constraints . . . . 171--194
Miika Hannula and
Xinyi Li and
Sebastian Link Controlling entity integrity with key
sets . . . . . . . . . . . . . . . . . . 195--219
Valentin Bartier and
Nicolas Bousquet and
Amer E. Mouawad Galactic token sliding . . . . . . . . . 220--248
Julio Aracena and
Adrien Richard and
Lilian Salinas Synchronizing Boolean networks
asynchronously . . . . . . . . . . . . . 249--279
Lukas Behrendt and
Katrin Casel and
Tobias Friedrich and
J. A. Gregor Lagodzinski and
Alexander Löser and
Marcus Wilhelm From symmetry to asymmetry: Generalizing
TSP approximations by parametrization 157--170
Ashwin Jacob and
Diptapriyo Majumdar and
Venkatesh Raman Deletion to scattered graph classes II
--- improved FPT algorithms for deletion
to pairs of graph classes . . . . . . . 280--301
Bharat Adsul and
Saptarshi Sarkar and
A. V. Sreejith Algebraic characterizations and block
product decompositions for first order
logic and its infinitary quantifier
extensions over countable words . . . . 302--326
David Caballero and
Timothy Gomez and
Robert Schweller and
Tim Wylie Complexity of verification in
self-assembly with prebuilt assemblies 1--16
Anonymous Pages 1--86 (November 2023) . . . . . . 1--86
Anonymous Editorial Board . . . . . . . . . . . . ii--ii
George B. Mertzios and
Hendrik Molter and
Rolf Niedermeier and
Viktor Zamaraev and
Philipp Zschoche Computing maximum matchings in temporal
graphs . . . . . . . . . . . . . . . . . 1--19
Theodoros Papamakarios and
Alexander Razborov Space characterizations of complexity
measures and size-space trade-offs in
propositional proof systems . . . . . . 20--36
Arijit Bishnu and
Arijit Ghosh and
Sudeshna Kolay and
Gopinath Mishra and
Saket Saurabh Almost optimal query algorithm for
hitting set using a subset query . . . . 50--65
Fedor V. Fomin and
Petr A. Golovach and
William Lochet and
Danil Sagunov and
Saket Saurabh and
Kirill Simonov Detours in directed graphs . . . . . . . 66--86
Brett Hemenway Falk and
Rohit Nema and
Rafail Ostrovsky Linear-time $2$-party secure merge from
additively homomorphic encryption . . . 37--49
Spyros Angelopoulos and
Konstantinos Panagiotou Weighted online search . . . . . . . . . ??
Florian Bridoux and
Kévin Perrot and
Aymeric Picard Marchetto and
Adrien Richard Interaction graphs of isomorphic
automata networks I: Complete digraph
and minimum in-degree . . . . . . . . . ??
Catherine Greenhill and
Bernard Mans and
Ali Pourmiri Balanced allocation on hypergraphs . . . ??
Ashwin Jacob and
Jari J. H. de Kroon and
Diptapriyo Majumdar and
Venkatesh Raman Deletion to scattered graph classes I
--- Case of finite number of graph
classes . . . . . . . . . . . . . . . . ??
Huib Donkers and
Bart M. P. Jansen and
Jari J. H. de Kroon Finding $k$-secluded trees faster . . . ??
Robert M. Alaniz and
David Caballero and
Sonya C. Cirlos and
Timothy Gomez and
Elise Grizzell and
Andrew Rodriguez and
Robert Schweller and
Armando Tenorio and
Tim Wylie Building squares with optimal state
complexity in restricted active
self-assembly . . . . . . . . . . . . . ??
Elijah Hradovich and
Marek Klonowski and
Dariusz R. Kowalski Restrained medium access control on
adversarial shared channels . . . . . . ??
Dorothea Baumeister and
Marc Neveling and
Magnus Roos and
Jörg Rothe and
Lena Schend and
Robin Weishaupt and
Lirong Xia The possible winner with uncertain
weights problem . . . . . . . . . . . . ??
Anonymous Editorial Board . . . . . . . . . . . . ??
Anonymous December 2023 . . . . . . . . . . . . . ??
Carla Binucci and
Emilio Di Giacomo and
William J. Lenhart and
Giuseppe Liotta and
Fabrizio Montecchiani and
Martin Nöllenburg and
Antonios Symvonis On the complexity of the storyplan
problem . . . . . . . . . . . . . . . . ??
Allen Ibiapina and
Ana Silva Mengerian graphs: Characterization and
recognition . . . . . . . . . . . . . . ??
Francesco Betti Sorbelli and
Alfredo Navarra and
Lorenzo Palazzetti and
Cristina M. Pinotti and
Giuseppe Prencipe Wireless IoT sensors data collection
reward maximization by leveraging
multiple energy- and storage-constrained
UAVs . . . . . . . . . . . . . . . . . . ??
Leszek G\kasieniec and
Tomasz Jurdzi\'nski and
Ralf Klasing and
Christos Levcopoulos and
Andrzej Lingas and
Jie Min and
Tomasz Radzik Perpetual maintenance of machines with
different urgency requirements . . . . . ??
Miroslav Chodil and
Antonín Kucera The satisfiability problem for a
quantitative fragment of PCTL . . . . . ??
René van Bevern and
Artem M. Kirilin and
Daniel A. Skachkov and
Pavel V. Smirnov and
Oxana Yu. Tsidulko Serial and parallel kernelization of
Multiple Hitting Set parameterized by
the Dilworth number, implemented on the
GPU . . . . . . . . . . . . . . . . . . ??
Anonymous Editorial Board . . . . . . . . . . . . ??
Anonymous February 2024 . . . . . . . . . . . . . ??
Peter L. Bartlett and
Philip M. Long Corrigendum to ``Prediction, learning,
uniform convergence, and scale-sensitive
dimensions'' [J. Comput. Syst. Sci. \bf
56(2) (1998) 174--190] . . . . . . . . . ??
Elise Deen and
Leo van Iersel and
Remie Janssen and
Mark Jones and
Yukihiro Murakami and
Norbert Zeh A near-linear kernel for bounded-state
parsimony distance . . . . . . . . . . . ??
Katharina T. Huber and
Leo van Iersel and
Remie Janssen and
Mark Jones and
Vincent Moulton and
Yukihiro Murakami and
Charles Semple Orienting undirected phylogenetic
networks . . . . . . . . . . . . . . . . ??
Philipp Czerner and
Roland Guttenberg and
Martin Helfrich and
Javier Esparza Fast and succinct population protocols
for Presburger arithmetic . . . . . . . ??
Haoqiang Huang and
Zihe Wang and
Zhide Wei and
Jie Zhang Bounded incentives in manipulating the
probabilistic serial rule . . . . . . . ??
Keqin Li Performance modeling and analysis for
randomly walking mobile users with
Markov chains . . . . . . . . . . . . . ??
Flavia Bonomo-Braberman and
Nick Brettell and
Andrea Munaro and
Daniël Paulusma Solving problems on generalized convex
graphs via mim-width . . . . . . . . . . ??
Anonymous Editorial Board . . . . . . . . . . . . ??
Anonymous March 2024 . . . . . . . . . . . . . . . ??
Shenggen Zheng and
Yaqiao Li and
Minghua Pan and
Jozef Gruska and
Lvzhou Li Lifting query complexity to time-space
complexity for two-way finite automata ??
Davide Bil\`o and
Gianlorenzo D'Angelo and
Luciano Gual\`a and
Stefano Leucci and
Mirko Rossi Blackout-tolerant temporal spanners . . ??
Jinyan Su and
Jinhui Xu and
Di Wang PAC learning halfspaces in
non-interactive local differential
privacy model with public unlabeled data ??
James Aspnes and
Othon Michail Special Issue on the 1st Symposium on
Algorithmic Foundations of Dynamic
Networks (SAND 2022) . . . . . . . . . . ??
Anonymous Editorial Board . . . . . . . . . . . . ??
Anonymous May 2024 . . . . . . . . . . . . . . . . ??
Sayan Bandyapadhyay and
Fedor V. Fomin and
Kirill Simonov On coresets for fair clustering in
metric and Euclidean spaces and their
applications . . . . . . . . . . . . . . ??
Alexis Poindron The maximal coordination principle in
regulatory Boolean networks . . . . . . ??
Steven Kelk and
Simone Linz and
Ruben Meuwese Deep kernelization for the Tree
Bisection and Reconnection (TBR)
distance in phylogenetics . . . . . . . ??
Jan Dreier and
Sebastian Ordyniak and
Stefan Szeider SAT backdoors: Depth beats size . . . . ??
Anonymous Editorial Board . . . . . . . . . . . . ??
Anonymous June 2024 . . . . . . . . . . . . . . . ??
Chenxu Yang and
Gang Yang and
Sun-Yuan Hsieh and
Yaping Mao and
Ralf Klasing Monitoring the edges of a graph using
distances with given girth . . . . . . . ??
Marie-Pierre Béal and
Dominique Perrin and
Antonio Restivo Decidable problems in substitution
shifts . . . . . . . . . . . . . . . . . ??
Jasine Babu and
Ajay Saju Jacob and
R. Krithika and
Deepak Rajendraprasad Packing arc-disjoint cycles in oriented
graphs . . . . . . . . . . . . . . . . . ??
Anonymous Editorial Board . . . . . . . . . . . . ??
Anonymous August 2024 . . . . . . . . . . . . . . ??
Radovan Cervený and
Pratibha Choudhary and
Ondrej Suchý On kernels for $d$-path vertex cover . . ??
Huib Donkers and
Bart M. P. Jansen Preprocessing to reduce the search
space: Antler structures for feedback
vertex set . . . . . . . . . . . . . . . ??
Danny Hermelin and
Yuval Itzhaki and
Hendrik Molter and
Dvir Shabtay On the parameterized complexity of
interval scheduling with eligible
machine sets . . . . . . . . . . . . . . ??
Thomas Erlebach and
Nils Morawietz and
Jakob T. Spooner and
Petra Wolf A cop and robber game on edge-periodic
temporal graphs . . . . . . . . . . . . ??
Victor Chepoi and
Kolja Knauer and
Manon Philibert Labeled sample compression schemes for
complexes of oriented matroids . . . . . ??
Mahboubeh Samadi and
Fatemeh Ghassemi and
Ramtin Khosravi Decentralized deadlock-free enforcement
of message orderings in message-based
systems . . . . . . . . . . . . . . . . ??
Spyros Angelopoulos and
Christoph Dürr and
Shendan Jin and
Shahin Kamali and
Marc Renault Online computation with untrusted advice ??
Laurent Bulteau and
Louxin Zhang The tree-child network inference problem
for line trees and the shortest common
supersequence problem for permutation
strings . . . . . . . . . . . . . . . . ??
Sebastian Ordyniak and
Andre Schidler and
Stefan Szeider Backdoor DNFs . . . . . . . . . . . . . ??
Isnard Lopes Costa and
Raul Lopes and
Andrea Marino and
Ana Silva On computing large temporal (unilateral)
connected components . . . . . . . . . . ??
Hendrik Molter and
Malte Renken and
Philipp Zschoche Temporal reachability minimization:
Delaying vs. deleting . . . . . . . . . ??
Josep Díaz and
Öznur Yasar Diner and
Maria Serna and
Oriol Serra On minimum vertex bisection of random
$d$-regular graphs . . . . . . . . . . . ??
Cristiano Bocci and
Chiara Capresi and
Kitty Meeks and
John Sylvester A new temporal interpretation of cluster
editing . . . . . . . . . . . . . . . . ??
Anonymous Editorial Board . . . . . . . . . . . . ??
Anonymous September 2024 . . . . . . . . . . . . . ??
Zhao Wang and
Yaping Mao and
Sun-Yuan Hsieh and
Ralf Klasing and
Yuzhi Xiao The $g$-extra connectivity of graph
products . . . . . . . . . . . . . . . . ??
Anuj Dawar Corrigendum to ``Homomorphism
preservation on quasi-wide classes'' [J.
Comput. Syst. Sci. \bf 76 (5) (2010)
324-332] . . . . . . . . . . . . . . . . ??
Anonymous Editorial Board . . . . . . . . . . . . ??
Anonymous November 2024 . . . . . . . . . . . . . ??
Johanna Björklund The impact of state merging on
predictive accuracy in probabilistic
tree automata: Dietze's conjecture
revisited . . . . . . . . . . . . . . . ??
Nina Klobas and
George B. Mertzios and
Hendrik Molter and
Paul G. Spirakis The complexity of computing optimum
labelings for temporal connectivity . . ??
Guilherme C. M. Gomes and
Clément Legrand-Duchesne and
Reem Mahmoud and
Amer E. Mouawad and
Yoshio Okamoto and
Vinicius F. dos Santos and
Tom C. van der Zanden Minimum separator reconfiguration . . . ??
Arnaud Durand and
Juha Kontinen and
Jouko Väänänen Modular SAT-based techniques for
reasoning tasks in team semantics . . . ??
Lhouari Nourine and
Jean-Marc Petit and
Simon Vilmin Towards declarative comparabilities:
Application to functional dependencies ??
Anonymous Editorial Board . . . . . . . . . . . . ??
Anonymous December 2024 . . . . . . . . . . . . . ??
Dipayan Chakraborty and
Soumen Nandi and
Sagnik Sen and
D. K. Supraja A linear algorithm for radio
$k$-coloring of powers of paths having
small diameters . . . . . . . . . . . . ??
Akanksha Agrawal and
Soumita Hait and
Amer E. Mouawad On finding short reconfiguration
sequences between independent sets . . . ??
Niclas Boehmer and
Klaus Heeger Adapting stable matchings to forced and
forbidden pairs . . . . . . . . . . . . ??
Massimo Benerecetti and
Daniele Dell'Erba and
Fabio Mogavero and
Sven Schewe and
Dominik Wojtczak Priority Promotion with Parysian flair ??
George Mertzios and
Othon Michail and
George Skretas and
Paul G. Spirakis and
Michail Theofilatos The complexity of growing a graph . . . ??
Anonymous Editorial Board . . . . . . . . . . . . ??
Anonymous February 2025 . . . . . . . . . . . . . ??
Amotz Bar-Noy and
Toni Böhnlein and
David Peleg and
Yingli Ran and
Dror Rawitz Approximate realizations for
outerplanaric degree sequences . . . . . ??
Daniela Bubboloni and
Costanza Catalano and
Andrea Marino and
Ana Silva On computing optimal temporal branchings
and spanning subgraphs . . . . . . . . . ??
Bart M. P. Jansen and
Jari J. H. de Kroon and
Micha\l W\lodarczyk Single-exponential FPT algorithms for
enumerating secluded $ \mathcal {F}
$-free subgraphs and deleting to
scattered graph classes . . . . . . . . ??
Johannes Rauch and
Dieter Rautenbach and
Uéverton S. Souza Exact and parameterized algorithms for
the independent cutset problem . . . . . ??
Juhi Chaudhary and
Meirav Zehavi Parameterized results on acyclic
matchings with implications for related
problems . . . . . . . . . . . . . . . . ??
Jesper Nederlof and
Krisztina Szilágyi Algorithms and Turing kernels for
detecting and counting small patterns in
unit disk graphs . . . . . . . . . . . . ??
Chris Köcher and
Dietrich Kuske Backwards-reachability for cooperating
multi-pushdown systems . . . . . . . . . ??
Wen Li and
Ralf Klasing and
Yaping Mao and
Bo Ning Monitoring the edges of product networks
using distances . . . . . . . . . . . . ??
Zhiyi Tang Embedding hypercubes into torus and
Cartesian product of paths and/or cycles
for minimizing wirelength . . . . . . . ??
Andreas Emil Feldmann and
Anish Mukherjee and
Erik Jan van Leeuwen The parameterized complexity of the
survivable network design problem . . . ??
George Karakostas and
Stavros G. Kolliopoulos Time-sharing scheduling with tolerance
capacities . . . . . . . . . . . . . . . ??
Anonymous Editorial Board . . . . . . . . . . . . ??
Anonymous March 2025 . . . . . . . . . . . . . . . ??
Feodor F. Dragan and
Guillaume Ducoffe and
Heather M. Guarnera Fast deterministic algorithms for
computing all eccentricities in
(hyperbolic) Helly graphs . . . . . . . ??
Reijo Jaakkola and
Antti Kuusisto and
Miikka Vilander Relating description complexity to
entropy . . . . . . . . . . . . . . . . ??
Andreea-Teodora Nász The weighted HOM-problem over fields . . ??
Eun Jung Kim and
Euiwoong Lee and
Dimitrios M. Thilikos A constant-factor approximation for
weighted bond cover . . . . . . . . . . ??
Anonymous Editorial Board . . . . . . . . . . . . ??
Anonymous May 2025 . . . . . . . . . . . . . . . . ??
Ricardo A. Baeza-Yates A trivial algorithm whose analysis is
not: a continuation . . . . . . . . . . 378--394