@article{Nieuwenhuis/98,
AUTHOR = {Nieuwenhuis, Robert},
TITLE = {Decidability and complexity analysis by basic paramodulation},
JOURNAL = {Inf.~Comput.},
VOLUME = {147},
NUMBER = {1},
PAGES = {1-21},
YEAR = {1998},
PUBLISHER = {Academic Press},
ADDRESS = {New York-San Francisco-London-San Diego},
}
@article{Cabibbo/98,
AUTHOR = {Cabibbo, Luca},
TITLE = {The expressive power of stratified logic programs with value invention},
JOURNAL = {Inf.~Comput.},
VOLUME = {147},
NUMBER = {1},
PAGES = {22-56},
YEAR = {1998},
PUBLISHER = {Academic Press},
ADDRESS = {New York-San Francisco-London-San Diego},
}
@article{Benedikt-Griffin-Libkin/98,
AUTHOR = {Benedikt, Michael and Griffin, Timothy and Libkin, Leonid},
TITLE = {Verifiable properties of database transactions},
JOURNAL = {Inf.~Comput.},
VOLUME = {147},
NUMBER = {1},
PAGES = {57-88},
YEAR = {1998},
PUBLISHER = {Academic Press},
ADDRESS = {New York-San Francisco-London-San Diego},
}
@article{Bshouty-Goldman-Mathias/98,
AUTHOR = {Bshouty, Nader H. and Goldman, Sally A. and Mathias, H. David},
TITLE = {Noise-tolerant parallel learning of geometric concepts},
JOURNAL = {Inf.~Comput.},
VOLUME = {147},
NUMBER = {1},
PAGES = {89-110},
YEAR = {1998},
KEYWORDS = {computational learning theory, geometric concepts, parallel computation},
PUBLISHER = {Academic Press},
ADDRESS = {New York-San Francisco-London-San Diego},
}
@article{Maneth/98,
AUTHOR = {Maneth, Sebastian},
TITLE = {The generating power of total deterministic tree transducers},
JOURNAL = {Inf.~Comput.},
VOLUME = {147},
NUMBER = {2},
PAGES = {111-144},
YEAR = {1998},
PUBLISHER = {Academic Press},
ADDRESS = {New York-San Francisco-London-San Diego},
}
@article{Lautemann-Schwentick-Stewart/98,
AUTHOR = {Lautemann, C. and Schwentick, T. and Stewart, I.A.},
TITLE = {Positive versions of polynomial time},
JOURNAL = {Inf.~Comput.},
VOLUME = {147},
NUMBER = {2},
PAGES = {145-170},
YEAR = {1998},
PUBLISHER = {Academic Press},
ADDRESS = {New York-San Francisco-London-San Diego},
}
@article{Bonacina-Hsiang/98,
AUTHOR = {Bonacina, Maria Paola and Hsiang, Jieh},
TITLE = {On the modelling of search in theorem proving---Towards a theory of strategy analysis},
JOURNAL = {Inf.~Comput.},
VOLUME = {147},
NUMBER = {2},
PAGES = {171-208},
YEAR = {1998},
PUBLISHER = {Academic Press},
ADDRESS = {New York-San Francisco-London-San Diego},
}
@article{Ponzio/98,
AUTHOR = {Ponzio, Stephen},
TITLE = {The combinatorics of effective resistances and resistive inverses},
JOURNAL = {Inf.~Comput.},
VOLUME = {147},
NUMBER = {2},
PAGES = {209-223},
YEAR = {1998},
PUBLISHER = {Academic Press},
ADDRESS = {New York-San Francisco-London-San Diego},
}
@article{Blundo-Santis-Herzberg-Kutten-Vaccaro-Yung/98,
AUTHOR = {Blundo, Carlo and Santis, Alfredo de and Herzberg, Amir and Kutten, Shay and Vaccaro, Ugo and Yung, Moti},
TITLE = {Perfectly secure key distribution for dynamic conferences},
JOURNAL = {Inf.~Comput.},
VOLUME = {146},
NUMBER = {1},
PAGES = {1-23},
YEAR = {1998},
PUBLISHER = {Academic Press},
ADDRESS = {New York-San Francisco-London-San Diego},
}
@article{Fokkink-Verhoef/98,
AUTHOR = {Fokkink, Wan and Verhoef, Chris},
TITLE = {A conservative look at operational semantics with variable binding},
JOURNAL = {Inf.~Comput.},
VOLUME = {146},
NUMBER = {1},
PAGES = {24-54},
YEAR = {1998},
PUBLISHER = {Academic Press},
ADDRESS = {New York-San Francisco-London-San Diego},
}
@article{Maciel-Therien/98,
AUTHOR = {Maciel, Alexis and Th{\'e}rien, Denis},
TITLE = {Threshold circuits of small majority-depth},
JOURNAL = {Inf.~Comput.},
VOLUME = {146},
NUMBER = {1},
PAGES = {55-83},
YEAR = {1998},
PUBLISHER = {Academic Press},
ADDRESS = {New York-San Francisco-London-San Diego},
}
@article{Ferragina-Luccio/98,
AUTHOR = {Ferragina, Paolo and Luccio, Fabrizio},
TITLE = {Dynamic dictionary matching in external memory},
JOURNAL = {Inf.~Comput.},
VOLUME = {146},
NUMBER = {2},
PAGES = {85-99},
YEAR = {1998},
PUBLISHER = {Academic Press},
ADDRESS = {New York-San Francisco-London-San Diego},
}
@article{Hamilton/98,
AUTHOR = {Hamilton, G.W.},
TITLE = {Usage counting analysis for lazy functional languages},
JOURNAL = {Inf.~Comput.},
VOLUME = {146},
NUMBER = {2},
PAGES = {100-137},
YEAR = {1998},
PUBLISHER = {Academic Press},
ADDRESS = {New York-San Francisco-London-San Diego},
}
@article{Nystrom-Jonsson/98,
AUTHOR = {Nystr{\"o}m, Sven-Olof and Jonsson, Bengt},
TITLE = {A fully abstract semantics for concurrent constraint programming},
JOURNAL = {Inf.~Comput.},
VOLUME = {146},
NUMBER = {2},
PAGES = {138-180},
YEAR = {1998},
PUBLISHER = {Academic Press},
ADDRESS = {New York-San Francisco-London-San Diego},
}
@article{Drewes-Engelfriet/98,
AUTHOR = {Drewes, Frank and Engelfriet, Joost},
TITLE = {Decidability of the finiteness of ranges of tree transductions},
JOURNAL = {Inf.~Comput.},
VOLUME = {145},
NUMBER = {1},
PAGES = {1-50},
YEAR = {1998},
PUBLISHER = {Academic Press},
ADDRESS = {New York-San Francisco-London-San Diego},
}
@article{Honkala/98a,
AUTHOR = {Honkala, Juha},
TITLE = {On number systems with finite degree of ambiguity},
JOURNAL = {Inf.~Comput.},
VOLUME = {145},
NUMBER = {1},
PAGES = {51-63},
YEAR = {1998},
PUBLISHER = {Academic Press},
ADDRESS = {New York-San Francisco-London-San Diego},
}
@article{Hartonas-Hennessy/98,
AUTHOR = {Hartonas, Chrysafis and Hennessy, Matthew},
TITLE = {Full abstractness for a functional/concurrent language with higher-order value-passing},
JOURNAL = {Inf.~Comput.},
VOLUME = {145},
NUMBER = {1},
PAGES = {64-106},
YEAR = {1998},
PUBLISHER = {Academic Press},
ADDRESS = {New York-San Francisco-London-San Diego},
}
@article{Hermida-Jacobs/98,
AUTHOR = {Hermida, Claudio and Jacobs, Bart},
TITLE = {Structural induction and coinduction in a fibrational setting},
JOURNAL = {Inf.~Comput.},
VOLUME = {145},
NUMBER = {2},
PAGES = {107-152},
YEAR = {1998},
PUBLISHER = {Academic Press},
ADDRESS = {New York-San Francisco-London-San Diego},
}
@article{Giacobazzi-Ranzato/98,
AUTHOR = {Giacobazzi, Roberto and Ranzato, Francesco},
TITLE = {Uniform closures: Order-theoretically reconstructing logic program semantics and abstract domain refinements},
JOURNAL = {Inf.~Comput.},
VOLUME = {145},
NUMBER = {2},
PAGES = {153-190},
YEAR = {1998},
KEYWORDS = {uniform closure, abstract interpretation, logic program semantics, abstract domain refinement},
PUBLISHER = {Academic Press},
ADDRESS = {New York-San Francisco-London-San Diego},
}
@article{Corradini/98,
AUTHOR = {Corradini, Flavio},
TITLE = {On performance congruences for process algebras},
JOURNAL = {Inf.~Comput.},
VOLUME = {145},
NUMBER = {2},
PAGES = {191-230},
YEAR = {1998},
PUBLISHER = {Academic Press},
ADDRESS = {New York-San Francisco-London-San Diego},
}
@article{Amir-Benson-Farach-Colton/98,
AUTHOR = {Amir, Amihood and Benson, Gary and Farach-Colton, Martin},
TITLE = {Optimal parallel two dimensional text searching on a CREW PRAM},
JOURNAL = {Inf.~Comput.},
VOLUME = {144},
NUMBER = {1},
PAGES = {1-17},
YEAR = {1998},
KEYWORDS = {analysis of algorithms, multidimensional matching, period, parallel algorithms, string},
PUBLISHER = {Academic Press},
ADDRESS = {New York-San Francisco-London-San Diego},
}
@article{Hoepman/98,
AUTHOR = {Hoepman, Jaap-Henk},
TITLE = {Self-stabilizing ring orientation using constant space},
JOURNAL = {Inf.~Comput.},
VOLUME = {144},
NUMBER = {1},
PAGES = {18-39},
YEAR = {1998},
PUBLISHER = {Academic Press},
ADDRESS = {New York-San Francisco-London-San Diego},
}
@article{Gire-Hoang/98,
AUTHOR = {Gire, F. and Hoang, H.K.},
TITLE = {An extension of fixpoint logic with a symmetry-based choice construct},
JOURNAL = {Inf.~Comput.},
VOLUME = {144},
NUMBER = {1},
PAGES = {40-65},
YEAR = {1998},
PUBLISHER = {Academic Press},
ADDRESS = {New York-San Francisco-London-San Diego},
}
@article{Frances-Litman/98,
AUTHOR = {Frances, Moti and Litman, Ami},
TITLE = {Optimal mistake bound learning is hard},
JOURNAL = {Inf.~Comput.},
VOLUME = {144},
NUMBER = {1},
PAGES = {66-82},
YEAR = {1998},
PUBLISHER = {Academic Press},
ADDRESS = {New York-San Francisco-London-San Diego},
}
@article{Bernardo-Donatiello-Gorrieri/98,
AUTHOR = {Bernardo, Marco and Donatiello, Lorenzo and Gorrieri, Roberto},
TITLE = {A formal approach to the integration of performance aspects in the modeling and analysis of concurrent systems},
JOURNAL = {Inf.~Comput.},
VOLUME = {144},
NUMBER = {2},
PAGES = {83-154},
YEAR = {1998},
PUBLISHER = {Academic Press},
ADDRESS = {New York-San Francisco-London-San Diego},
}
@article{Eiter-Ibaraki-Makino/98b,
AUTHOR = {Eiter, Thomas and Ibaraki, Toshihide and Makino, Kazuhisa},
TITLE = {Double Horn functions},
JOURNAL = {Inf.~Comput.},
VOLUME = {144},
NUMBER = {2},
PAGES = {155-190},
YEAR = {1998},
PUBLISHER = {Academic Press},
ADDRESS = {New York-San Francisco-London-San Diego},
}
@article{Severi/98,
AUTHOR = {Severi, Paula},
TITLE = {Type inference for pure type systems},
JOURNAL = {Inf.~Comput.},
VOLUME = {143},
NUMBER = {1},
PAGES = {1-23},
YEAR = {1998},
PUBLISHER = {Academic Press},
ADDRESS = {New York-San Francisco-London-San Diego},
}
@article{Bollig-Wegener/98a,
AUTHOR = {Bollig, Beate and Wegener, Ingo},
TITLE = {Completeness and non-completeness results with respect to read-once projections},
JOURNAL = {Inf.~Comput.},
VOLUME = {143},
NUMBER = {1},
PAGES = {24-33},
YEAR = {1998},
PUBLISHER = {Academic Press},
ADDRESS = {New York-San Francisco-London-San Diego},
}
@article{Sangiorgi/98,
AUTHOR = {Sangiorgi, Davide},
TITLE = {An interpretation of typed objects into typed $\pi$-calculus},
JOURNAL = {Inf.~Comput.},
VOLUME = {143},
NUMBER = {1},
PAGES = {34-73},
YEAR = {1998},
PUBLISHER = {Academic Press},
ADDRESS = {New York-San Francisco-London-San Diego},
}
@article{Montagna/98,
AUTHOR = {Montagna, Franco},
TITLE = {Investigations on measure-one identification of classes of languages},
JOURNAL = {Inf.~Comput.},
VOLUME = {143},
NUMBER = {1},
PAGES = {74-107},
YEAR = {1998},
PUBLISHER = {Academic Press},
ADDRESS = {New York-San Francisco-London-San Diego},
}
@article{Abiteboul-Papadimitriou-Vianu/98,
AUTHOR = {Abiteboul, Serge and Papadimitriou, Christos H. and Vianu, V.},
TITLE = {Reflective relational machines},
JOURNAL = {Inf.~Comput.},
VOLUME = {143},
NUMBER = {2},
PAGES = {110-136},
YEAR = {1998},
PUBLISHER = {Academic Press},
ADDRESS = {New York-San Francisco-London-San Diego},
}
@article{Constable/98,
AUTHOR = {Constable, Robert L.},
TITLE = {A note on complexity measures for inductive classes in constructive type theory},
JOURNAL = {Inf.~Comput.},
VOLUME = {143},
NUMBER = {2},
PAGES = {137-153},
YEAR = {1998},
PUBLISHER = {Academic Press},
ADDRESS = {New York-San Francisco-London-San Diego},
}
@article{Dawar/98,
AUTHOR = {Dawar, Anuj},
TITLE = {A restricted second order logic for finite structures},
JOURNAL = {Inf.~Comput.},
VOLUME = {143},
NUMBER = {2},
PAGES = {154-174},
YEAR = {1998},
PUBLISHER = {Academic Press},
ADDRESS = {New York-San Francisco-London-San Diego},
}
@article{Girard/98,
AUTHOR = {Girard, Jean-Yves},
TITLE = {Light linear logic},
JOURNAL = {Inf.~Comput.},
VOLUME = {143},
NUMBER = {2},
PAGES = {175-204},
YEAR = {1998},
PUBLISHER = {Academic Press},
ADDRESS = {New York-San Francisco-London-San Diego},
}
@article{Ishihara-Khoussainov-Nerode/98,
AUTHOR = {Ishihara, Hajime and Khoussainov, Bakhadyr and Nerode, Anil},
TITLE = {Computable Kripke models and intermediate logics},
JOURNAL = {Inf.~Comput.},
VOLUME = {143},
NUMBER = {2},
PAGES = {205-230},
YEAR = {1998},
PUBLISHER = {Academic Press},
ADDRESS = {New York-San Francisco-London-San Diego},
}
@article{Lindell/98,
AUTHOR = {Lindell, Steven},
TITLE = {A constant-space sequential model of computation for first-order logic},
JOURNAL = {Inf.~Comput.},
VOLUME = {143},
NUMBER = {2},
PAGES = {231-250},
YEAR = {1998},
PUBLISHER = {Academic Press},
ADDRESS = {New York-San Francisco-London-San Diego},
}
@article{Kozen/98,
AUTHOR = {Kozen, Dexter},
TITLE = {Set constraints and logic programming},
JOURNAL = {Inf.~Comput.},
VOLUME = {142},
NUMBER = {1},
PAGES = {2-25},
YEAR = {1998},
PUBLISHER = {Academic Press},
ADDRESS = {New York-San Francisco-London-San Diego},
}
@article{Michaylov/98,
AUTHOR = {Michaylov, Spiro},
TITLE = {Repeated redundant inequalities in constraint logic programming},
JOURNAL = {Inf.~Comput.},
VOLUME = {142},
NUMBER = {1},
PAGES = {26-39},
YEAR = {1998},
PUBLISHER = {Academic Press},
ADDRESS = {New York-San Francisco-London-San Diego},
}
@article{Charatonik/98a,
AUTHOR = {Charatonik, Witold},
TITLE = {Set constraints in some equational theories},
JOURNAL = {Inf.~Comput.},
VOLUME = {142},
NUMBER = {1},
PAGES = {40-75},
YEAR = {1998},
PUBLISHER = {Academic Press},
ADDRESS = {New York-San Francisco-London-San Diego},
}
@article{Backofen-Treinen/98,
AUTHOR = {Backofen, Rolf and Treinen, Ralf},
TITLE = {How to win a game with features},
JOURNAL = {Inf.~Comput.},
VOLUME = {142},
NUMBER = {1},
PAGES = {76-101},
YEAR = {1998},
PUBLISHER = {Academic Press},
ADDRESS = {New York-San Francisco-London-San Diego},
}
@article{Lynch/98,
AUTHOR = {Lynch, Christopher},
TITLE = {Local simplification},
JOURNAL = {Inf.~Comput.},
VOLUME = {142},
NUMBER = {1},
PAGES = {102-126},
YEAR = {1998},
PUBLISHER = {Academic Press},
ADDRESS = {New York-San Francisco-London-San Diego},
}
@article{Geffert/98,
AUTHOR = {Geffert, Viliam},
TITLE = {Bridging across the $\log(n)$ space frontier},
JOURNAL = {Inf.~Comput.},
VOLUME = {142},
NUMBER = {2},
PAGES = {127-158},
YEAR = {1998},
KEYWORDS = {Turing machines, structural complexity, space complexity},
PUBLISHER = {Academic Press},
ADDRESS = {New York-San Francisco-London-San Diego},
}
@article{Thorup/98b,
AUTHOR = {Thorup, Mikkel},
TITLE = {All structured programs have small tree width and good register allocation},
JOURNAL = {Inf.~Comput.},
VOLUME = {142},
NUMBER = {2},
PAGES = {159-181},
YEAR = {1998},
PUBLISHER = {Academic Press},
ADDRESS = {New York-San Francisco-London-San Diego},
}
@article{Bruggemann-Klein-Wood/98a,
AUTHOR = {Br{\"u}ggemann-Klein, Anne and Wood, Derick},
TITLE = {One-unambiguous regular languages},
JOURNAL = {Inf.~Comput.},
VOLUME = {142},
NUMBER = {2},
PAGES = {182-206},
YEAR = {1998},
PUBLISHER = {Academic Press},
ADDRESS = {New York-San Francisco-London-San Diego},
}
@article{Veith/98a,
AUTHOR = {Veith, Helmut},
TITLE = {Succinct representation, leaf languages, and projection reductions},
JOURNAL = {Inf.~Comput.},
VOLUME = {142},
NUMBER = {2},
PAGES = {207-236},
YEAR = {1998},
PUBLISHER = {Academic Press},
ADDRESS = {New York-San Francisco-London-San Diego},
}
@article{Buntrock-Otto/98,
AUTHOR = {Buntrock, Gerhard and Otto, Friedrich},
TITLE = {Growing context-sensitive languages and Church-Rosser languages},
JOURNAL = {Inf.~Comput.},
VOLUME = {141},
NUMBER = {1},
PAGES = {1-36},
YEAR = {1998},
PUBLISHER = {Academic Press},
ADDRESS = {New York-San Francisco-London-San Diego},
}
@article{Iwama-Iwamoto/98a,
AUTHOR = {Iwama, Kazuo and Iwamoto, Chuzo},
TITLE = {A canonical form of vector machines},
JOURNAL = {Inf.~Comput.},
VOLUME = {141},
NUMBER = {1},
PAGES = {37-65},
YEAR = {1998},
PUBLISHER = {Academic Press},
ADDRESS = {New York-San Francisco-London-San Diego},
}
@article{Maass-Warmuth/98,
AUTHOR = {Maass, Wolfgang and Warmuth, Manfred K.},
TITLE = {Efficient learning with virtual threshold gates},
JOURNAL = {Inf.~Comput.},
VOLUME = {141},
NUMBER = {1},
PAGES = {66-83},
YEAR = {1998},
PUBLISHER = {Academic Press},
ADDRESS = {New York-San Francisco-London-San Diego},
}
@article{Aslam-Decatur/98a,
AUTHOR = {Aslam, Javed A. and Decatur, Scott E.},
TITLE = {General bounds on statistical query learning and PAC learning with noise via hypothesis boosting},
JOURNAL = {Inf.~Comput.},
VOLUME = {141},
NUMBER = {2},
PAGES = {85-118},
YEAR = {1998},
PUBLISHER = {Academic Press},
ADDRESS = {New York-San Francisco-London-San Diego},
}
@article{Segala-Gawlick-Sogaard-Andersen-Lynch/98,
AUTHOR = {Segala, Roberto and Gawlick, Rainer and S{\o}gaard-Andersen, J{\o}rgen and Lynch, Nancy},
TITLE = {Liveness in times and untimed systems},
JOURNAL = {Inf.~Comput.},
VOLUME = {141},
NUMBER = {2},
PAGES = {119-171},
YEAR = {1998},
KEYWORDS = {automata, timed automata, I/O automata, liveness, receptiveness, formal verification, simulation techniques},
PUBLISHER = {Academic Press},
ADDRESS = {New York-San Francisco-London-San Diego},
}
@article{Bezem-Klop-Oostrom/98,
AUTHOR = {Bezem, Marc and Klop, Jan Willem and Oostrom, Vincent van},
TITLE = {Diagram techniques for confluence},
JOURNAL = {Inf.~Comput.},
VOLUME = {141},
NUMBER = {2},
PAGES = {172-204},
YEAR = {1998},
PUBLISHER = {Academic Press},
ADDRESS = {New York-San Francisco-London-San Diego},
}
@article{Cenzer-Remmel/98,
AUTHOR = {Cenzer, Douglas and Remmel, Jeffrey B.},
TITLE = {Complexity and categoricity},
JOURNAL = {Inf.~Comput.},
VOLUME = {140},
NUMBER = {1},
PAGES = {2-25},
YEAR = {1998},
PUBLISHER = {Academic Press},
ADDRESS = {New York-San Francisco-London-San Diego},
}
@article{Gradel-Gurevich/98,
AUTHOR = {Gr{\"a}del, Erich and Gurevich, Yuri},
TITLE = {Metafinite model theory},
JOURNAL = {Inf.~Comput.},
VOLUME = {140},
NUMBER = {1},
PAGES = {26-81},
YEAR = {1998},
PUBLISHER = {Academic Press},
ADDRESS = {New York-San Francisco-London-San Diego},
}
@article{Krajicek-Pudlak/98,
AUTHOR = {Kraj{\'i}{\v{c}}ek, Jan and Pudl{\'a}k, Pavel},
TITLE = {Some consequences of cryptographical conjectures for $S_2^1$ and EF},
JOURNAL = {Inf.~Comput.},
VOLUME = {140},
NUMBER = {1},
PAGES = {82-94},
YEAR = {1998},
PUBLISHER = {Academic Press},
ADDRESS = {New York-San Francisco-London-San Diego},
}
@article{Dam/98,
AUTHOR = {Dam, Mads},
TITLE = {Proving properties of dynamic process networks},
JOURNAL = {Inf.~Comput.},
VOLUME = {140},
NUMBER = {2},
PAGES = {95-114},
YEAR = {1998},
PUBLISHER = {Academic Press},
ADDRESS = {New York-San Francisco-London-San Diego},
}
@article{van_der_Meyden/98,
AUTHOR = {van der Meyden, Ron},
TITLE = {Common knowledge and update in finite environments},
JOURNAL = {Inf.~Comput.},
VOLUME = {140},
NUMBER = {2},
PAGES = {115-157},
YEAR = {1998},
PUBLISHER = {Academic Press},
ADDRESS = {New York-San Francisco-London-San Diego},
}
@article{Low-Maxemchuk/98,
AUTHOR = {Low, Steven H. and Maxemchuk, Nicholas F.},
TITLE = {A collusion problem and its solution},
JOURNAL = {Inf.~Comput.},
VOLUME = {140},
NUMBER = {2},
PAGES = {158-182},
YEAR = {1998},
PUBLISHER = {Academic Press},
ADDRESS = {New York-San Francisco-London-San Diego},
}
@article{Bar-Noy-Bellare-Halldorsson-Shachnai-Tamir/98,
AUTHOR = {Bar-Noy, Amotz and Bellare, Mihir and Halld{\'o}rsson, Magn{\'u}s and Shachnai, Hadas and Tamir, Tami},
TITLE = {On chromatic sums and distributed resource allocation},
JOURNAL = {Inf.~Comput.},
VOLUME = {140},
NUMBER = {2},
PAGES = {183-202},
YEAR = {1998},
PUBLISHER = {Academic Press},
ADDRESS = {New York-San Francisco-London-San Diego},
}
@article{Feigelson-Hellerstein/98,
AUTHOR = {Feigelson, Aaron and Hellerstein, Lisa},
TITLE = {Conjunctions of unate DNF formulas: Learning and structure},
JOURNAL = {Inf.~Comput.},
VOLUME = {140},
NUMBER = {2},
PAGES = {203-228},
YEAR = {1998},
PUBLISHER = {Academic Press},
ADDRESS = {New York-San Francisco-London-San Diego},
}
@article{Bruggemann-Klein-Wood/98,
AUTHOR = {Br{\"u}ggemann-Klein, Anne and Wood, Derick},
TITLE = {One-unambiguous regular languages},
JOURNAL = {Inf.~Comput.},
VOLUME = {140},
NUMBER = {2},
PAGES = {229-253},
YEAR = {1998},
PUBLISHER = {Academic Press},
ADDRESS = {New York-San Francisco-London-San Diego},
}
@article{Boros-Ibaraki-Makino/98,
AUTHOR = {Boros, Endre and Ibaraki, Toshihide and Makino, Kazuhisa},
TITLE = {Error-free and best-fit extensions of partially defined boolean functions},
JOURNAL = {Inf.~Comput.},
VOLUME = {140},
NUMBER = {2},
PAGES = {254-283},
YEAR = {1998},
PUBLISHER = {Academic Press},
ADDRESS = {New York-San Francisco-London-San Diego},
}