@article{Aumann-Bender-Zhang/97,
AUTHOR = {Aumann, Yonatan and Bender, Michael A. and Zhang, Lisa},
TITLE = {Efficient execution of nondeterministic parallel programs on asynchronous systems},
JOURNAL = {Inf.~Comput.},
VOLUME = {139},
NUMBER = {1},
PAGES = {1-16},
YEAR = {1997},
PUBLISHER = {Academic Press},
ADDRESS = {New York-San Francisco-London-San Diego},
}
@article{Frougny/97,
AUTHOR = {Frougny, Christiane},
TITLE = {On the sequentiality of the successor function},
JOURNAL = {Inf.~Comput.},
VOLUME = {139},
NUMBER = {1},
PAGES = {17-38},
YEAR = {1997},
PUBLISHER = {Academic Press},
ADDRESS = {New York-San Francisco-London-San Diego},
}
@article{Ghelli/97,
AUTHOR = {Ghelli, Giorgio},
TITLE = {Termination of system $F$-bounded: A complete proof},
JOURNAL = {Inf.~Comput.},
VOLUME = {139},
NUMBER = {1},
PAGES = {39-56},
YEAR = {1997},
PUBLISHER = {Academic Press},
ADDRESS = {New York-San Francisco-London-San Diego},
}
@article{Barbanera-Berardi/97,
AUTHOR = {Barbanera, Franco and Berardi, Stefano},
TITLE = {The simply typed theory of $\beta$-conversion has no maximum extension},
JOURNAL = {Inf.~Comput.},
VOLUME = {139},
NUMBER = {1},
PAGES = {57-61},
YEAR = {1997},
PUBLISHER = {Academic Press},
ADDRESS = {New York-San Francisco-London-San Diego},
}
@article{Bloom-Esik/97,
AUTHOR = {Bloom, Stephen L. and {\'E}sik, Zolt{\'a}n},
TITLE = {Axiomatizing shuffle and concatenation in languages},
JOURNAL = {Inf.~Comput.},
VOLUME = {139},
NUMBER = {1},
PAGES = {62-91},
YEAR = {1997},
PUBLISHER = {Academic Press},
ADDRESS = {New York-San Francisco-London-San Diego},
}
@article{Bodlaender-Leeuwen-Tan-Thilikos/97,
AUTHOR = {Bodlaender, Hans L. and Leeuwen, Jan van and Tan, Richard and Thilikos, Dimitrios M.},
TITLE = {On interval routing schemes and treewidth},
JOURNAL = {Inf.~Comput.},
VOLUME = {139},
NUMBER = {1},
PAGES = {92-109},
YEAR = {1997},
PUBLISHER = {Academic Press},
ADDRESS = {New York-San Francisco-London-San Diego},
}
@article{Rabinovich/97a,
AUTHOR = {Rabinovich, Alexander},
TITLE = {Complexity of equivalence problems for concurrent systems of finite agents},
JOURNAL = {Inf.~Comput.},
VOLUME = {139},
NUMBER = {2},
PAGES = {111-129},
YEAR = {1997},
PUBLISHER = {Academic Press},
ADDRESS = {New York-San Francisco-London-San Diego},
}
@article{Bozapalidis/97,
AUTHOR = {Bozapalidis, Symeon},
TITLE = {Positive tree representations and applications to tree automata},
JOURNAL = {Inf.~Comput.},
VOLUME = {139},
NUMBER = {2},
PAGES = {130-153},
YEAR = {1997},
PUBLISHER = {Academic Press},
ADDRESS = {New York-San Francisco-London-San Diego},
}
@article{Ariola-Klop/97,
AUTHOR = {Ariola, Zena M. and Klop, Jan Willem},
TITLE = {Lambda calculus with explicit recursion},
JOURNAL = {Inf.~Comput.},
VOLUME = {139},
NUMBER = {2},
PAGES = {154-233},
YEAR = {1997},
PUBLISHER = {Academic Press},
ADDRESS = {New York-San Francisco-London-San Diego},
}
@article{Hinrichs-Wechsung/97a,
AUTHOR = {Hinrichs, Maren and Wechsung, Gerd},
TITLE = {Time bounded frequency computations},
JOURNAL = {Inf.~Comput.},
VOLUME = {139},
NUMBER = {2},
PAGES = {234-257},
YEAR = {1997},
PUBLISHER = {Academic Press},
ADDRESS = {New York-San Francisco-London-San Diego},
}
@article{de_Agostino-Silvestri/97,
AUTHOR = {de Agostino, Sergio and Silvestri, Riccardo},
TITLE = {A worst-case analysis of the LZ2 compression algorithm},
JOURNAL = {Inf.~Comput.},
VOLUME = {139},
NUMBER = {2},
PAGES = {258-268},
YEAR = {1997},
PUBLISHER = {Academic Press},
ADDRESS = {New York-San Francisco-London-San Diego},
}
@article{Chaudhuri-Radhakrishnan/97,
AUTHOR = {Chaudhuri, Shiva P. and Radhakrishnan, Jaikumar},
TITLE = {The complexity of parallel prefix problems on small domains},
JOURNAL = {Inf.~Comput.},
VOLUME = {138},
NUMBER = {1},
PAGES = {1-22},
YEAR = {1997},
PUBLISHER = {Academic Press},
ADDRESS = {New York-San Francisco-London-San Diego},
}
@article{Freund-Kearns-Ron-Rubinfeld-Schapire/97,
AUTHOR = {Freund, Yoav and Kearns, Michael and Ron, Dana and Rubinfeld, Ronitt and Schapire, Robert E.},
TITLE = {Efficient learning of typical finite automata from random walks},
JOURNAL = {Inf.~Comput.},
VOLUME = {138},
NUMBER = {1},
PAGES = {23-48},
YEAR = {1997},
PUBLISHER = {Academic Press},
ADDRESS = {New York-San Francisco-London-San Diego},
}
@article{Rabinovich/97,
AUTHOR = {Rabinovich, Alexander},
TITLE = {On schematological equivalence of partially interpreted dataflow networks},
JOURNAL = {Inf.~Comput.},
VOLUME = {138},
NUMBER = {1},
PAGES = {49-87},
YEAR = {1997},
PUBLISHER = {Academic Press},
ADDRESS = {New York-San Francisco-London-San Diego},
}
@article{Beame-Fich-Sinha/97,
AUTHOR = {Beame, Paul and Fich, Faith E. and Sinha, Rakesh K.},
TITLE = {Separating the power of EREW and CREW PRAMs with small communication width},
JOURNAL = {Inf.~Comput.},
VOLUME = {138},
NUMBER = {1},
PAGES = {89-99},
YEAR = {1997},
PUBLISHER = {Academic Press},
ADDRESS = {New York-San Francisco-London-San Diego},
}
@article{Kuper/97,
AUTHOR = {Kuper, Jan},
TITLE = {On the Jacopini technique},
JOURNAL = {Inf.~Comput.},
VOLUME = {138},
NUMBER = {2},
PAGES = {101-123},
YEAR = {1997},
PUBLISHER = {Academic Press},
ADDRESS = {New York-San Francisco-London-San Diego},
}
@article{Bremond-Gregoire-Choi-Lee/97,
AUTHOR = {Br{\'e}mond-Gr{\'e}goire, Patrice and Choi, Jin-Young and Lee, Insup},
TITLE = {A complete axiomatization of finite-state ACSR processes},
JOURNAL = {Inf.~Comput.},
VOLUME = {138},
NUMBER = {2},
PAGES = {124-159},
YEAR = {1997},
PUBLISHER = {Academic Press},
ADDRESS = {New York-San Francisco-London-San Diego},
}
@article{Latteux-Simplot/97,
AUTHOR = {Latteux, M. and Simplot, D.},
TITLE = {Context-sensitive string languages and recognizable picture languages},
JOURNAL = {Inf.~Comput.},
VOLUME = {138},
NUMBER = {2},
PAGES = {160-169},
YEAR = {1997},
PUBLISHER = {Academic Press},
ADDRESS = {New York-San Francisco-London-San Diego},
}
@article{Barve-Long/97,
AUTHOR = {Barve, Rakesh D. and Long, Philip M.},
TITLE = {On the complexity of learning from drifting distributions},
JOURNAL = {Inf.~Comput.},
VOLUME = {138},
NUMBER = {2},
PAGES = {170-193},
YEAR = {1997},
PUBLISHER = {Academic Press},
ADDRESS = {New York-San Francisco-London-San Diego},
}
@article{Segala/97,
AUTHOR = {Segala, Roberto},
TITLE = {Quiescence, fairness, testing, and the notion of implementation},
JOURNAL = {Inf.~Comput.},
VOLUME = {138},
NUMBER = {2},
PAGES = {194-210},
YEAR = {1997},
PUBLISHER = {Academic Press},
ADDRESS = {New York-San Francisco-London-San Diego},
}
@article{Fairtlough-Mendler/97,
AUTHOR = {Fairtlough, Matt and Mendler, Michael},
TITLE = {Propositional lax logic},
JOURNAL = {Inf.~Comput.},
VOLUME = {137},
NUMBER = {1},
PAGES = {1-33},
YEAR = {1997},
PUBLISHER = {Academic Press},
ADDRESS = {New York-San Francisco-London-San Diego},
}
@article{Intrigila/97,
AUTHOR = {Intrigila, Benedetto},
TITLE = {Non-existent Statman's double fixed point combinator does not exist, indeed},
JOURNAL = {Inf.~Comput.},
VOLUME = {137},
NUMBER = {1},
PAGES = {35-40},
YEAR = {1997},
PUBLISHER = {Academic Press},
ADDRESS = {New York-San Francisco-London-San Diego},
}
@article{Falaschi-Gabbrielli-Marriott-Palamidessi/97,
AUTHOR = {Falaschi, Moreno and Gabbrielli, Maurizio and Marriott, Kim and Palamidessi, Catuscia},
TITLE = {Constraint logic programming with dynamic scheduling: A semantics based on closure operators},
JOURNAL = {Inf.~Comput.},
VOLUME = {137},
NUMBER = {1},
PAGES = {41-67},
YEAR = {1997},
PUBLISHER = {Academic Press},
ADDRESS = {New York-San Francisco-London-San Diego},
}
@article{Lafont/97,
AUTHOR = {Lafont, Yves},
TITLE = {Interaction combinators},
JOURNAL = {Inf.~Comput.},
VOLUME = {137},
NUMBER = {1},
PAGES = {69-101},
YEAR = {1997},
PUBLISHER = {Academic Press},
ADDRESS = {New York-San Francisco-London-San Diego},
NOTE = {see Erratum in Inf.~Comput.\ 142, 237},
}
@article{Czumaj-Meyer_auf_der_Heide-Stemann/97,
AUTHOR = {Czumaj, Artur and Meyer auf der Heide, Friedhelm and Stemann, Volker},
TITLE = {Simulating shared memory in real time: On the computation power of reconfigurable architectures},
JOURNAL = {Inf.~Comput.},
VOLUME = {137},
NUMBER = {2},
PAGES = {103-120},
YEAR = {1997},
PUBLISHER = {Academic Press},
ADDRESS = {New York-San Francisco-London-San Diego},
}
@article{Aceto-Fokkink/97,
AUTHOR = {Aceto, Luca and Fokkink, Wan},
TITLE = {An equational axiomatization for multi-exit iteration},
JOURNAL = {Inf.~Comput.},
VOLUME = {137},
NUMBER = {2},
PAGES = {121-158},
YEAR = {1997},
PUBLISHER = {Academic Press},
ADDRESS = {New York-San Francisco-London-San Diego},
}
@article{Cook-Impagliazzo-Yamakami/97,
AUTHOR = {Cook, Stephen and Impagliazzo, Russell and Yamakami, Tomoyuki},
TITLE = {A tight relationship between generic oracles and type-2 complexity theory},
JOURNAL = {Inf.~Comput.},
VOLUME = {137},
NUMBER = {2},
PAGES = {159-170},
YEAR = {1997},
PUBLISHER = {Academic Press},
ADDRESS = {New York-San Francisco-London-San Diego},
}
@article{Strauss/97,
AUTHOR = {Strauss, Martin},
TITLE = {Measure on P: Strength of the notion},
JOURNAL = {Inf.~Comput.},
VOLUME = {136},
NUMBER = {1},
PAGES = {1-23},
YEAR = {1997},
PUBLISHER = {Academic Press},
ADDRESS = {New York-San Francisco-London-San Diego},
}
@article{Albers-Hagerup/97,
AUTHOR = {Albers, Susanne and Hagerup, Torben},
TITLE = {Improved parallel integer sorting without concurrent writing},
JOURNAL = {Inf.~Comput.},
VOLUME = {136},
NUMBER = {1},
PAGES = {25-51},
YEAR = {1997},
PUBLISHER = {Academic Press},
ADDRESS = {New York-San Francisco-London-San Diego},
}
@article{Kfoury-Stolboushkin/97,
AUTHOR = {Kfoury, A.J. and Stolboushkin, A.P.},
TITLE = {An infinite pebble game and applications},
JOURNAL = {Inf.~Comput.},
VOLUME = {136},
NUMBER = {1},
PAGES = {53-66},
YEAR = {1997},
PUBLISHER = {Academic Press},
ADDRESS = {New York-San Francisco-London-San Diego},
}
@article{Levene-Loizou/97a,
AUTHOR = {Levene, Mark and Loizou, George},
TITLE = {Null inclusion dependencies in relational databases},
JOURNAL = {Inf.~Comput.},
VOLUME = {136},
NUMBER = {2},
PAGES = {67-108},
YEAR = {1997},
PUBLISHER = {Academic Press},
ADDRESS = {New York-San Francisco-London-San Diego},
}
@article{van_Glabbeek-Vaandrager/97,
AUTHOR = {van Glabbeek, Rob and Vaandrager, Frits},
TITLE = {The difference between splitting in $n$ and $n+1$},
JOURNAL = {Inf.~Comput.},
VOLUME = {136},
NUMBER = {2},
PAGES = {109-142},
YEAR = {1997},
PUBLISHER = {Academic Press},
ADDRESS = {New York-San Francisco-London-San Diego},
}
@article{Venkatesan-Rotics-Madanlal-Makowsky-Pandu_Rangan/97,
AUTHOR = {Venkatesan, G. and Rotics, U. and Madanlal, M.S. and Makowsky, J.A. and Pandu Rangan, C.},
TITLE = {Restrictions of minimum spanner problems},
JOURNAL = {Inf.~Comput.},
VOLUME = {136},
NUMBER = {2},
PAGES = {143-164},
YEAR = {1997},
PUBLISHER = {Academic Press},
ADDRESS = {New York-San Francisco-London-San Diego},
}
@article{Kant-Bodlaender/97,
AUTHOR = {Kant, Goos and Bodlaender, Hans L.},
TITLE = {Triangulating planar graphs while minimizing the maximum degree},
JOURNAL = {Inf.~Comput.},
VOLUME = {135},
NUMBER = {1},
PAGES = {1-14},
YEAR = {1997},
PUBLISHER = {Academic Press},
ADDRESS = {New York-San Francisco-London-San Diego},
}
@article{Skodinis-Wanke/97,
AUTHOR = {Skodinis, Konstantin and Wanke, Egon},
TITLE = {The bounded degree problem for eNCE graph grammars},
JOURNAL = {Inf.~Comput.},
VOLUME = {135},
NUMBER = {1},
PAGES = {15-35},
YEAR = {1997},
PUBLISHER = {Academic Press},
ADDRESS = {New York-San Francisco-London-San Diego},
}
@article{Ahlswede-Cai/97a,
AUTHOR = {Ahlswede, Rudolf and Cai, Ning},
TITLE = {Models of multi-user write-efficient memories and general diametric theorems},
JOURNAL = {Inf.~Comput.},
VOLUME = {135},
NUMBER = {1},
PAGES = {37-67},
YEAR = {1997},
PUBLISHER = {Academic Press},
ADDRESS = {New York-San Francisco-London-San Diego},
}
@article{Leone-Rullo-Scarcello/97,
AUTHOR = {Leone, Nicola and Rullo, Pasquale and Scarcello, Francesco},
TITLE = {Disjunctive stable models: Unfounded sets, fixpoint semantics, and computation},
JOURNAL = {Inf.~Comput.},
VOLUME = {135},
NUMBER = {2},
PAGES = {69-112},
YEAR = {1997},
PUBLISHER = {Academic Press},
ADDRESS = {New York-San Francisco-London-San Diego},
}
@article{Tyszkiewicz/97b,
AUTHOR = {Tyszkiewicz, Jerzy},
TITLE = {The Kolmogorov expression complexity of logics},
JOURNAL = {Inf.~Comput.},
VOLUME = {135},
NUMBER = {2},
PAGES = {113-135},
YEAR = {1997},
PUBLISHER = {Academic Press},
ADDRESS = {New York-San Francisco-London-San Diego},
}
@article{Donini-Lenzerini-Nardi-Nutt/97,
AUTHOR = {Donini, Francesco M. and Lenzerini, Maurizio and Nardi, Daniele and Nutt, Werner},
TITLE = {The complexity of concept languages},
JOURNAL = {Inf.~Comput.},
VOLUME = {134},
NUMBER = {1},
PAGES = {1-58},
YEAR = {1997},
PUBLISHER = {Academic Press},
ADDRESS = {New York-San Francisco-London-San Diego},
}
@article{Gore-Jerrum-Kannan-Sweedyk-Mahaney/97,
AUTHOR = {Gore, Vivek and Jerrum, Mark and Kannan, Sampath and Sweedyk, Z. and Mahaney, Steve},
TITLE = {A quasi-polynomial-time algorithm for sampling words from a context-free language},
JOURNAL = {Inf.~Comput.},
VOLUME = {134},
NUMBER = {1},
PAGES = {59-74},
YEAR = {1997},
PUBLISHER = {Academic Press},
ADDRESS = {New York-San Francisco-London-San Diego},
}
@article{Larsen-Wang/97,
AUTHOR = {Larsen, Kim G. and Wang, Yi},
TITLE = {Time-abstracted bisimulation: Implicit specifications and decidability},
JOURNAL = {Inf.~Comput.},
VOLUME = {134},
NUMBER = {2},
PAGES = {75-101},
YEAR = {1997},
PUBLISHER = {Academic Press},
ADDRESS = {New York-San Francisco-London-San Diego},
}
@article{Galil-Margalit/97a,
AUTHOR = {Galil, Zvi and Margalit, Oded},
TITLE = {All pairs shortest distances for graphs with small integer length edges},
JOURNAL = {Inf.~Comput.},
VOLUME = {134},
NUMBER = {2},
PAGES = {103-139},
YEAR = {1997},
PUBLISHER = {Academic Press},
ADDRESS = {New York-San Francisco-London-San Diego},
}
@article{Hromkovic-Klasing-Unger-Wagener/97,
AUTHOR = {Hromkovi{\v{c}}, Juraj and Klasing, Ralf and Unger, Walter and Wagener, Hubert},
TITLE = {Optimal algorithms for broadcast and gossip in the edge-disjoint path modes},
JOURNAL = {Inf.~Comput.},
VOLUME = {133},
NUMBER = {1},
PAGES = {1-33},
YEAR = {1997},
PUBLISHER = {Academic Press},
ADDRESS = {New York-San Francisco-London-San Diego},
}
@article{Sorensen/97,
AUTHOR = {S{\o}rensen, Morten Heine},
TITLE = {Strong normalization from weak normalization in typed $\lambda$-calculi},
JOURNAL = {Inf.~Comput.},
VOLUME = {133},
NUMBER = {1},
PAGES = {35-71},
YEAR = {1997},
PUBLISHER = {Academic Press},
ADDRESS = {New York-San Francisco-London-San Diego},
}
@article{van_Bakel-Fernandez/97,
AUTHOR = {van Bakel, Steffen and Fern{\'a}ndez, Maribel},
TITLE = {Normalization results for typeable rewrite systems},
JOURNAL = {Inf.~Comput.},
VOLUME = {133},
NUMBER = {2},
PAGES = {73-116},
YEAR = {1997},
PUBLISHER = {Academic Press},
ADDRESS = {New York-San Francisco-London-San Diego},
}
@article{Jutla/97,
AUTHOR = {Jutla, Charanjit S.},
TITLE = {Determinization and memoryless winning strategies},
JOURNAL = {Inf.~Comput.},
VOLUME = {133},
NUMBER = {2},
PAGES = {117-134},
YEAR = {1997},
PUBLISHER = {Academic Press},
ADDRESS = {New York-San Francisco-London-San Diego},
}
@article{Kivinen-Warmuth/97,
AUTHOR = {Kivinen, Jyrki and Warmuth, Manfred K.},
TITLE = {Exponentiated gradient versus gradient descent for linear predictors},
JOURNAL = {Inf.~Comput.},
VOLUME = {132},
NUMBER = {1},
PAGES = {1-63},
YEAR = {1997},
PUBLISHER = {Academic Press},
ADDRESS = {New York-San Francisco-London-San Diego},
}
@article{Jain-Sharma/97,
AUTHOR = {Jain, Sanjay and Sharma, Arun},
TITLE = {Elementary formal systems, intrinsic complexity, and procrastination},
JOURNAL = {Inf.~Comput.},
VOLUME = {132},
NUMBER = {1},
PAGES = {65-84},
YEAR = {1997},
PUBLISHER = {Academic Press},
ADDRESS = {New York-San Francisco-London-San Diego},
}
@article{Jansen-Ohring/97,
AUTHOR = {Jansen, Klaus and {\"O}hring, Sabine},
TITLE = {Approximation algorithms for time constrained scheduling},
JOURNAL = {Inf.~Comput.},
VOLUME = {132},
NUMBER = {2},
PAGES = {85-108},
YEAR = {1997},
PUBLISHER = {Academic Press},
ADDRESS = {New York-San Francisco-London-San Diego},
}
@article{Tofte-Talpin/97,
AUTHOR = {Tofte, Mads and Talpin, Jean-Pierre},
TITLE = {Region-based memory management},
JOURNAL = {Inf.~Comput.},
VOLUME = {132},
NUMBER = {2},
PAGES = {109-176},
YEAR = {1997},
PUBLISHER = {Academic Press},
ADDRESS = {New York-San Francisco-London-San Diego},
}