@article{Ajtai/02a,
AUTHOR = {Ajtai, Mikl{\'{o}}s},
TITLE = {Determinism verus nondeterminism for linear time RAMs with memory restrictions},
JOURNAL = {J. Comput.~Syst.~Sci.},
VOLUME = {65},
NUMBER = {1},
PAGES = {2-37},
YEAR = {2002},
PUBLISHER = {Academic Press},
ADDRESS = {San Diego-London},
}
@article{Beame-Fich/02,
AUTHOR = {Beame, Paul and Fich, Faith E.},
TITLE = {Optimal bounds for the predecessor problem and related problems},
JOURNAL = {J. Comput.~Syst.~Sci.},
VOLUME = {65},
NUMBER = {1},
PAGES = {38-72},
YEAR = {2002},
PUBLISHER = {Academic Press},
ADDRESS = {San Diego-London},
}
@article{Li-Ma-Wang/02a,
AUTHOR = {Li, Ming and Ma, Bin and Wang, Lusheng},
TITLE = {Finding similar regions in many sequences},
JOURNAL = {J. Comput.~Syst.~Sci.},
VOLUME = {65},
NUMBER = {1},
PAGES = {73-96},
YEAR = {2002},
PUBLISHER = {Academic Press},
ADDRESS = {San Diego-London},
}
@article{Raz-Reingold-Vadhan/02,
AUTHOR = {Raz, Ran and Reingold, Omer and Vadhan, Salil},
TITLE = {Extracting all the randomness and reducing the error in Trevisan's extractors},
JOURNAL = {J. Comput.~Syst.~Sci.},
VOLUME = {65},
NUMBER = {1},
PAGES = {97-128},
YEAR = {2002},
PUBLISHER = {Academic Press},
ADDRESS = {San Diego-London},
}
@article{Charikar-Guha-Tardos-Shmoys/02,
AUTHOR = {Charikar, Moses and Guha, Sudipto and Tardos, {\'{E}}va and Shmoys, David B.},
TITLE = {A constant-factor approximation algorithm for the $k$-median problem},
JOURNAL = {J. Comput.~Syst.~Sci.},
VOLUME = {65},
NUMBER = {1},
PAGES = {129-149},
YEAR = {2002},
PUBLISHER = {Academic Press},
ADDRESS = {San Diego-London},
}
@article{King-Sagert/02,
AUTHOR = {King, Valerie and Sagert, Garry},
TITLE = {A fully dynamic algorithm for maintaining the transitive closure},
JOURNAL = {J. Comput.~Syst.~Sci.},
VOLUME = {65},
NUMBER = {1},
PAGES = {150-167},
YEAR = {2002},
PUBLISHER = {Academic Press},
ADDRESS = {San Diego-London},
}
@article{Stewart/02,
AUTHOR = {Stewart, Charles},
TITLE = {Reducibility between classes of port graph grammar},
JOURNAL = {J. Comput.~Syst.~Sci.},
VOLUME = {65},
NUMBER = {2},
PAGES = {169-223},
YEAR = {2002},
PUBLISHER = {Academic Press},
ADDRESS = {San Diego-London},
}
@article{Nakamura-Abe/02,
AUTHOR = {Nakamura, Atsuyoshi and Abe, Naoki},
TITLE = {Online learning of binary and $n$-ary relations over clustered domains},
JOURNAL = {J. Comput.~Syst.~Sci.},
VOLUME = {65},
NUMBER = {2},
PAGES = {224-256},
YEAR = {2002},
PUBLISHER = {Academic Press},
ADDRESS = {San Diego-London},
}
@article{Arvind-Kobler/02,
AUTHOR = {Arvind, V. and K{\"o}bler, Johannes},
TITLE = {New lowness results for $ZPP^{NP}$ and other complexity classes},
JOURNAL = {J. Comput.~Syst.~Sci.},
VOLUME = {65},
NUMBER = {2},
PAGES = {257-277},
YEAR = {2002},
PUBLISHER = {Academic Press},
ADDRESS = {San Diego-London},
}
@article{Harju-Ibarra-Karhumaki-Salomaa/02,
AUTHOR = {Harju, Tero and Ibarra, Oscar and Karhum{\"a}ki, Juhani and Salomaa, Arto},
TITLE = {Some decision problems concerning semilinearity and commutation},
JOURNAL = {J. Comput.~Syst.~Sci.},
VOLUME = {65},
NUMBER = {2},
PAGES = {278-294},
YEAR = {2002},
PUBLISHER = {Academic Press},
ADDRESS = {San Diego-London},
}
@article{Willard/02,
AUTHOR = {Willard, Dan E.},
TITLE = {An algorithm for handling many relational calculus queries efficiently},
JOURNAL = {J. Comput.~Syst.~Sci.},
VOLUME = {65},
NUMBER = {2},
PAGES = {295-331},
YEAR = {2002},
PUBLISHER = {Academic Press},
ADDRESS = {San Diego-London},
}
@article{Berman-Karpinski-Larmore-Plandowski-Rytter/02,
AUTHOR = {Berman, Piotr and Karpinski, Marek and Larmore, Lawrence L. and Plandowski, Wojciech and Rytter, Wojciech},
TITLE = {On the complexity of pattern matching for highly compressed two-dimensional texts},
JOURNAL = {J. Comput.~Syst.~Sci.},
VOLUME = {65},
NUMBER = {2},
PAGES = {332-350},
YEAR = {2002},
PUBLISHER = {Academic Press},
ADDRESS = {San Diego-London},
}
@article{Skodinis-Wanke/02,
AUTHOR = {Skodinis, K. and Wanke, E.},
TITLE = {Node replacements in embedding normal form},
JOURNAL = {J. Comput.~Syst.~Sci.},
VOLUME = {65},
NUMBER = {2},
PAGES = {351-376},
YEAR = {2002},
PUBLISHER = {Academic Press},
ADDRESS = {San Diego-London},
}
@article{Honkala/02b,
AUTHOR = {Honkala, Juha},
TITLE = {The equivalence problem for DF0L languages and power series},
JOURNAL = {J. Comput.~Syst.~Sci.},
VOLUME = {65},
NUMBER = {2},
PAGES = {377-392},
YEAR = {2002},
PUBLISHER = {Academic Press},
ADDRESS = {San Diego-London},
}
@article{Pighizzini-Shallit-Wang/02,
AUTHOR = {Pighizzini, Giovanni and Shallit, Jeffrey and Wang, Ming-wei},
TITLE = {Unary context-free grammars and pushdown automata, descriptional complexity and auxiliary space lower bounds},
JOURNAL = {J. Comput.~Syst.~Sci.},
VOLUME = {65},
NUMBER = {2},
PAGES = {393-414},
YEAR = {2002},
PUBLISHER = {Academic Press},
ADDRESS = {San Diego-London},
}
@article{Mason-Bartlett-Golea/02,
AUTHOR = {Mason, Llew and Bartlett, Peter L. and Golea, Mostefa},
TITLE = {Generalization error of combined classifiers},
JOURNAL = {J. Comput.~Syst.~Sci.},
VOLUME = {65},
NUMBER = {2},
PAGES = {415-438},
YEAR = {2002},
PUBLISHER = {Academic Press},
ADDRESS = {San Diego-London},
}
@article{El-Mabrouk/02,
AUTHOR = {El-Mabrouk, Nadia},
TITLE = {Reconstructing an ancestral genome using minimum segments duplications and reversals},
JOURNAL = {J. Comput.~Syst.~Sci.},
VOLUME = {65},
NUMBER = {3},
PAGES = {442-464},
YEAR = {2002},
PUBLISHER = {Academic Press},
ADDRESS = {San Diego-London},
}
@article{Lin-Chen-Jiang-Wen/02,
AUTHOR = {Lin, Guohui and Chen, Zhi-Zhong and Jiang, Tao and Wen, Jianjun},
TITLE = {The longest common subsequence problem for sequences with nested arc annotations},
JOURNAL = {J. Comput.~Syst.~Sci.},
VOLUME = {65},
NUMBER = {3},
PAGES = {465-480},
YEAR = {2002},
PUBLISHER = {Academic Press},
ADDRESS = {San Diego-London},
}
@article{Lagergren/02,
AUTHOR = {Lagergren, J.},
TITLE = {Combining polynomial running time and fast convergence for the disk-covering method},
JOURNAL = {J. Comput.~Syst.~Sci.},
VOLUME = {65},
NUMBER = {3},
PAGES = {481-493},
YEAR = {2002},
PUBLISHER = {Academic Press},
ADDRESS = {San Diego-London},
}
@article{Jaitly-Kearney-Lin-Ma/02,
AUTHOR = {Jaitly, Deep and Kearney, Paul and Lin, Guohui and Ma, Bin},
TITLE = {Methods for reconstructing the history of tandem repeats and their application to the human genome},
JOURNAL = {J. Comput.~Syst.~Sci.},
VOLUME = {65},
NUMBER = {3},
PAGES = {494-507},
YEAR = {2002},
PUBLISHER = {Academic Press},
ADDRESS = {San Diego-London},
}
@article{Moret-Tang-Wang-Warnow/02,
AUTHOR = {Moret, Bernard M.E. and Tang, Jijun and Wang, Li-San and Warnow, Tandy},
TITLE = {Steps toward accurate reconstructions of phylogenies from gene-order data},
JOURNAL = {J. Comput.~Syst.~Sci.},
VOLUME = {65},
NUMBER = {3},
PAGES = {508-525},
YEAR = {2002},
PUBLISHER = {Academic Press},
ADDRESS = {San Diego-London},
}
@article{Pandurangan-Ramesh/02,
AUTHOR = {Pandurangan, Gopal and Ramesh, H.},
TITLE = {The restriction mapping problem revisited},
JOURNAL = {J. Comput.~Syst.~Sci.},
VOLUME = {65},
NUMBER = {3},
PAGES = {526-544},
YEAR = {2002},
PUBLISHER = {Academic Press},
ADDRESS = {San Diego-London},
}
@article{Lyngso-Pedersen/02,
AUTHOR = {Lyngs{\o}, Rune B. and Pedersen, Christian N.S.},
TITLE = {The consensus string problem and the complexity of comparing hidden Markov models},
JOURNAL = {J. Comput.~Syst.~Sci.},
VOLUME = {65},
NUMBER = {3},
PAGES = {545-569},
YEAR = {2002},
PUBLISHER = {Academic Press},
ADDRESS = {San Diego-London},
}
@article{Lin-Jiang-Chao/02,
AUTHOR = {Lin, Yaw-Ling and Jiang, Tao and Chao, Kun-Mao},
TITLE = {Efficient algorithms for locating the length-constrained heaviest segments with applications to biomolecular sequence analysis},
JOURNAL = {J. Comput.~Syst.~Sci.},
VOLUME = {65},
NUMBER = {3},
PAGES = {570-586},
YEAR = {2002},
PUBLISHER = {Academic Press},
ADDRESS = {San Diego-London},
}
@article{Tesler/02a,
AUTHOR = {Tesler, Glenn},
TITLE = {Efficient algorithms for multichromosomal genome rearrangements},
JOURNAL = {J. Comput.~Syst.~Sci.},
VOLUME = {65},
NUMBER = {3},
PAGES = {587-609},
YEAR = {2002},
PUBLISHER = {Academic Press},
ADDRESS = {San Diego-London},
}
@article{Forster/02,
AUTHOR = {Forster, J{\"u}rgen},
TITLE = {A linear lower bound on the unbounded error probabilistic communication complexity},
JOURNAL = {J. Comput.~Syst.~Sci.},
VOLUME = {65},
NUMBER = {4},
PAGES = {612-625},
YEAR = {2002},
PUBLISHER = {Academic Press},
ADDRESS = {San Diego-London},
}
@article{Atserias-Galesi-Pudlak/02,
AUTHOR = {Atserias, Albert and Galesi, Nicola and Pudl{\'{a}}k, Pavel},
TITLE = {Monotone simulations of non-monotone proofs},
JOURNAL = {J. Comput.~Syst.~Sci.},
VOLUME = {65},
NUMBER = {4},
PAGES = {626-638},
YEAR = {2002},
PUBLISHER = {Academic Press},
ADDRESS = {San Diego-London},
}
@article{Shpilka/02,
AUTHOR = {Shpilka, Amir},
TITLE = {Affine projections of symmetric polynomials},
JOURNAL = {J. Comput.~Syst.~Sci.},
VOLUME = {65},
NUMBER = {4},
PAGES = {639-659},
YEAR = {2002},
PUBLISHER = {Academic Press},
ADDRESS = {San Diego-London},
}
@article{Mossel-Umans/02,
AUTHOR = {Mossel, Elchanan and Umans, Christopher},
TITLE = {On the complexity of approximating the VC dimension},
JOURNAL = {J. Comput.~Syst.~Sci.},
VOLUME = {65},
NUMBER = {4},
PAGES = {660-671},
YEAR = {2002},
PUBLISHER = {Academic Press},
ADDRESS = {San Diego-London},
}
@article{Impagliazzo-Kabanets-Wigderson/02,
AUTHOR = {Impagliazzo, Russell and Kabanets, Valentine and Wigderson, Avi},
TITLE = {In search of an easy witness: Exponential time vs. probabilistic polynomial time},
JOURNAL = {J. Comput.~Syst.~Sci.},
VOLUME = {65},
NUMBER = {4},
PAGES = {672-694},
YEAR = {2002},
PUBLISHER = {Academic Press},
ADDRESS = {San Diego-London},
}
@article{Hesse-Allender-Barrington/02,
AUTHOR = {Hesse, William and Allender, Eric and Barrington, David A. Mix},
TITLE = {Uniform constant-depth threshold circuits for division and iterated multiplication},
JOURNAL = {J. Comput.~Syst.~Sci.},
VOLUME = {65},
NUMBER = {4},
PAGES = {695-716},
YEAR = {2002},
PUBLISHER = {Academic Press},
ADDRESS = {San Diego-London},
NOTE = {see Corrigendum in J. Comput.~Syst.~Sci., Vol. 80, 2014, No. 2, 496-497},
}
@article{Koucky/02,
AUTHOR = {Kouck{\'y}, Michal},
TITLE = {Universal traversal sequences with backtracking},
JOURNAL = {J. Comput.~Syst.~Sci.},
VOLUME = {65},
NUMBER = {4},
PAGES = {717-726},
YEAR = {2002},
PUBLISHER = {Academic Press},
ADDRESS = {San Diego-London},
}
@article{Balcazar-Castro-Guijarro/02,
AUTHOR = {Balc{\'{a}}zar, Jos{\'{e}} and Castro, Jorge and Guijarro, David},
TITLE = {A new abstract combinatorial dimension for exact learning via queries},
JOURNAL = {J. Comput.~Syst.~Sci.},
VOLUME = {64},
NUMBER = {1},
PAGES = {2-21},
YEAR = {2002},
PUBLISHER = {Academic Press},
ADDRESS = {San Diego-London},
}
@article{Ben-David-Eiron-Simon/02,
AUTHOR = {Ben-David, Shai and Eiron, Nadav and Simon, Hans Ulrich},
TITLE = {The computational complexity of densest region detection},
JOURNAL = {J. Comput.~Syst.~Sci.},
VOLUME = {64},
NUMBER = {1},
PAGES = {22-47},
YEAR = {2002},
PUBLISHER = {Academic Press},
ADDRESS = {San Diego-London},
}
@article{Auer-Cesa-Bianchi-Gentile/02,
AUTHOR = {Auer, Peter and Cesa-Bianchi, Nicol{\`{o}} and Gentile, Claudio},
TITLE = {Adaptive and self-confident on-line learning algorithms},
JOURNAL = {J. Comput.~Syst.~Sci.},
VOLUME = {64},
NUMBER = {1},
PAGES = {48-75},
YEAR = {2002},
PUBLISHER = {Academic Press},
ADDRESS = {San Diego-London},
}
@article{Forster-Warmuth/02,
AUTHOR = {Forster, J{\"u}rgen and Warmuth, Manfred K.},
TITLE = {Relative expected instantaneous loss bounds},
JOURNAL = {J. Comput.~Syst.~Sci.},
VOLUME = {64},
NUMBER = {1},
PAGES = {76-102},
YEAR = {2002},
PUBLISHER = {Academic Press},
ADDRESS = {San Diego-London},
}
@article{Mansour-McAllester/02,
AUTHOR = {Mansour, Yishay and McAllester, David},
TITLE = {Boosting using branching programs},
JOURNAL = {J. Comput.~Syst.~Sci.},
VOLUME = {64},
NUMBER = {1},
PAGES = {103-112},
YEAR = {2002},
PUBLISHER = {Academic Press},
ADDRESS = {San Diego-London},
}
@article{Freund-Opper/02,
AUTHOR = {Freund, Yoav and Opper, Manfred},
TITLE = {Drifting games and Brownian motion},
JOURNAL = {J. Comput.~Syst.~Sci.},
VOLUME = {64},
NUMBER = {1},
PAGES = {113-132},
YEAR = {2002},
PUBLISHER = {Academic Press},
ADDRESS = {San Diego-London},
}
@article{Bartlett-Baxter/02,
AUTHOR = {Bartlett, Peter L. and Baxter, Jonathan},
TITLE = {Estimation and approximation bounds for gradient-based reinforcement learning},
JOURNAL = {J. Comput.~Syst.~Sci.},
VOLUME = {64},
NUMBER = {1},
PAGES = {133-150},
YEAR = {2002},
PUBLISHER = {Academic Press},
ADDRESS = {San Diego-London},
}
@article{Fulk/02,
AUTHOR = {Fulk, Mark},
TITLE = {Inductive inference with additional information},
JOURNAL = {J. Comput.~Syst.~Sci.},
VOLUME = {64},
NUMBER = {2},
PAGES = {153-159},
YEAR = {2002},
PUBLISHER = {Academic Press},
ADDRESS = {San Diego-London},
}
@article{Bazgan-Santha-Tuza/02,
AUTHOR = {Bazgan, Cristina and Santha, Miklos and Tuza, Zsolt},
TITLE = {Efficient approximation algorithms for the Subset-Sums Equality problem},
JOURNAL = {J. Comput.~Syst.~Sci.},
VOLUME = {64},
NUMBER = {2},
PAGES = {160-170},
YEAR = {2002},
PUBLISHER = {Academic Press},
ADDRESS = {San Diego-London},
}
@article{Grosse-Rhode-Presicce-Simeoni/02,
AUTHOR = {Gro{\"ss}e-Rhode, Martin and Presicce, Francesco Parisi and Simeoni, Marta},
TITLE = {Formal software specification with refinements and modules of typed graph transformation systems},
JOURNAL = {J. Comput.~Syst.~Sci.},
VOLUME = {64},
NUMBER = {2},
PAGES = {171-218},
YEAR = {2002},
PUBLISHER = {Academic Press},
ADDRESS = {San Diego-London},
}
@article{Garofalakis-Ioannidis-Ozden-Silberschatz/02,
AUTHOR = {Garofalakis, Minos and Ioannidis, Yannis and {\"O}zden, Banu and Silberschatz, Avi},
TITLE = {Competitive on-line scheduling of continuous-media streams},
JOURNAL = {J. Comput.~Syst.~Sci.},
VOLUME = {64},
NUMBER = {2},
PAGES = {219-248},
YEAR = {2002},
PUBLISHER = {Academic Press},
ADDRESS = {San Diego-London},
}
@article{Drewes-Hoffmann-Plump/02,
AUTHOR = {Drewes, Frank and Hoffmann, Berthold and Plump, Detlef},
TITLE = {Hierarchical graph transformation},
JOURNAL = {J. Comput.~Syst.~Sci.},
VOLUME = {64},
NUMBER = {2},
PAGES = {249-283},
YEAR = {2002},
PUBLISHER = {Academic Press},
ADDRESS = {San Diego-London},
}
@article{Westerdale/02,
AUTHOR = {Westerdale, T.H.},
TITLE = {Minimality of an automaton cascade decomposition for learning system environments},
JOURNAL = {J. Comput.~Syst.~Sci.},
VOLUME = {64},
NUMBER = {2},
PAGES = {284-307},
YEAR = {2002},
PUBLISHER = {Academic Press},
ADDRESS = {San Diego-London},
}
@article{Bridson-Gilman/02,
AUTHOR = {Bridson, Martin R. and Gilman, Robert H.},
TITLE = {Context-free languages of sub-exponential growth},
JOURNAL = {J. Comput.~Syst.~Sci.},
VOLUME = {64},
NUMBER = {2},
PAGES = {308-310},
YEAR = {2002},
PUBLISHER = {Academic Press},
ADDRESS = {San Diego-London},
}
@article{Hemaspaandra-Ogihara-Wechsung/02,
AUTHOR = {Hemaspaandra, Lane A. and Ogihara, Mitsunori and Wechsung, Gerd},
TITLE = {Reducing the number of solutions of $NP$ functions},
JOURNAL = {J. Comput.~Syst.~Sci.},
VOLUME = {64},
NUMBER = {2},
PAGES = {311-328},
YEAR = {2002},
PUBLISHER = {Academic Press},
ADDRESS = {San Diego-London},
}
@article{Helary-Mostefaoui-Raynal/02,
AUTHOR = {H{\'{e}}lary, J.M. and Mostefaoui, A. and Raynal, M.},
TITLE = {Interval consistency of asynchronous distributed computations},
JOURNAL = {J. Comput.~Syst.~Sci.},
VOLUME = {64},
NUMBER = {2},
PAGES = {329-349},
YEAR = {2002},
PUBLISHER = {Academic Press},
ADDRESS = {San Diego-London},
}
@article{Engelfriet-Maneth/02,
AUTHOR = {Engelfriet, Joost and Maneth, Sebastian},
TITLE = {Output string languages of compositions of deterministic macro tree transducers},
JOURNAL = {J. Comput.~Syst.~Sci.},
VOLUME = {64},
NUMBER = {2},
PAGES = {350-395},
YEAR = {2002},
PUBLISHER = {Academic Press},
ADDRESS = {San Diego-London},
}
@article{Diekert-Gastin/02,
AUTHOR = {Diekert, Volker and Gastin, Paul},
TITLE = {LTL is expressively complete for Mazurkiewicz traces},
JOURNAL = {J. Comput.~Syst.~Sci.},
VOLUME = {64},
NUMBER = {2},
PAGES = {396-418},
YEAR = {2002},
PUBLISHER = {Academic Press},
ADDRESS = {San Diego-London},
}
@article{Sieling/02a,
AUTHOR = {Sieling, Detlef},
TITLE = {Lower bounds for linearly transformed OBDDs and FBDDs},
JOURNAL = {J. Comput.~Syst.~Sci.},
VOLUME = {64},
NUMBER = {2},
PAGES = {419-438},
YEAR = {2002},
PUBLISHER = {Academic Press},
ADDRESS = {San Diego-London},
}
@article{Calvanese-Giacomo-Lenzerini-Vardi/02,
AUTHOR = {Calvanese, Diego and Giacomo, Giuseppe de and Lenzerini, Maurizio and Vardi, Moshe Y.},
TITLE = {Rewriting of regular expressions and regular path queries},
JOURNAL = {J. Comput.~Syst.~Sci.},
VOLUME = {64},
NUMBER = {3},
PAGES = {443-465},
YEAR = {2002},
PUBLISHER = {Academic Press},
ADDRESS = {San Diego-London},
}
@article{Cosmadakis/02,
AUTHOR = {Cosmadakis, Stavros},
TITLE = {Inherent complexity of recursive queries},
JOURNAL = {J. Comput.~Syst.~Sci.},
VOLUME = {64},
NUMBER = {3},
PAGES = {466-495},
YEAR = {2002},
PUBLISHER = {Academic Press},
ADDRESS = {San Diego-London},
}
@article{Dawson-de_Capitani_di_Vimercati-Lincoln-Samarati/02,
AUTHOR = {Dawson, Steven and de Capitani di Vimercati, Sabrina and Lincoln, Patrick and Samarati, Pierangela},
TITLE = {Maximizing sharing of protected information},
JOURNAL = {J. Comput.~Syst.~Sci.},
VOLUME = {64},
NUMBER = {3},
PAGES = {496-541},
YEAR = {2002},
PUBLISHER = {Academic Press},
ADDRESS = {San Diego-London},
}
@article{Ganti-Gehrke-Ramakrishnan-Loh/02,
AUTHOR = {Ganti, Venkatesh and Gehrke, Johannes and Ramakrishnan, Raghu and Loh, Wei-Yin},
TITLE = {A framework for measuring differences in data characteristics},
JOURNAL = {J. Comput.~Syst.~Sci.},
VOLUME = {64},
NUMBER = {3},
PAGES = {542-578},
YEAR = {2002},
PUBLISHER = {Academic Press},
ADDRESS = {San Diego-London},
}
@article{Gottlob-Leone-Scarcello/02,
AUTHOR = {Gottlob, Georg and Leone, Nicola and Scarcello, Francesco},
TITLE = {Hypertree decompositions and tractable queries},
JOURNAL = {J. Comput.~Syst.~Sci.},
VOLUME = {64},
NUMBER = {3},
PAGES = {579-627},
YEAR = {2002},
PUBLISHER = {Academic Press},
ADDRESS = {San Diego-London},
}
@article{Benedikt-Libkin/02,
AUTHOR = {Benedikt, Michael and Libkin, Leonid},
TITLE = {Aggregate operators in constraint query languages},
JOURNAL = {J. Comput.~Syst.~Sci.},
VOLUME = {64},
NUMBER = {3},
PAGES = {628-654},
YEAR = {2002},
PUBLISHER = {Academic Press},
ADDRESS = {San Diego-London},
}
@article{Kanza-Nutt-Sagiv/02,
AUTHOR = {Kanza, Yaron and Nutt, Werner and Sagiv, Yehoshua},
TITLE = {Querying incomplete information in semistructured data},
JOURNAL = {J. Comput.~Syst.~Sci.},
VOLUME = {64},
NUMBER = {3},
PAGES = {655-693},
YEAR = {2002},
PUBLISHER = {Academic Press},
ADDRESS = {San Diego-London},
}
@article{Van_den_Bussche-Waller/02,
AUTHOR = {Van den Bussche, Jan and Waller, Emmanuel},
TITLE = {Polymorphic type inference for the relational algebra},
JOURNAL = {J. Comput.~Syst.~Sci.},
VOLUME = {64},
NUMBER = {3},
PAGES = {694-718},
YEAR = {2002},
PUBLISHER = {Academic Press},
ADDRESS = {San Diego-London},
}
@article{Alon-Gibbons-Matias-Szegedy/02,
AUTHOR = {Alon, Noga and Gibbons, Phillip B. and Matias, Yossi and Szegedy, Mario},
TITLE = {Tracking join and self-join sizes in limited storage},
JOURNAL = {J. Comput.~Syst.~Sci.},
VOLUME = {64},
NUMBER = {3},
PAGES = {719-747},
YEAR = {2002},
PUBLISHER = {Academic Press},
ADDRESS = {San Diego-London},
}
@article{Ambainis/02,
AUTHOR = {Ambainis, Andris},
TITLE = {Quantum lower bounds by quantum arguments},
JOURNAL = {J. Comput.~Syst.~Sci.},
VOLUME = {64},
NUMBER = {4},
PAGES = {750-767},
YEAR = {2002},
PUBLISHER = {Academic Press},
ADDRESS = {San Diego-London},
}
@article{Boneh/02,
AUTHOR = {Boneh, Dan},
TITLE = {Finding smooth integers in short intervals using CRT decoding},
JOURNAL = {J. Comput.~Syst.~Sci.},
VOLUME = {64},
NUMBER = {4},
PAGES = {768-784},
YEAR = {2002},
KEYWORDS = {`},
PUBLISHER = {Academic Press},
ADDRESS = {San Diego-London},
}
@article{Charikar-Fagin-Guruswami-Kleinberg-Raghavan-Sahai/02,
AUTHOR = {Charikar, Moses and Fagin, Ronald and Guruswami, Venkatesan and Kleinberg, Jon and Raghavan, Prabhakar and Sahai, Amit},
TITLE = {Query strategies for priced information},
JOURNAL = {J. Comput.~Syst.~Sci.},
VOLUME = {64},
NUMBER = {4},
PAGES = {785-819},
YEAR = {2002},
PUBLISHER = {Academic Press},
ADDRESS = {San Diego-London},
}
@article{Kempe-Kleinberg-Kumar/02,
AUTHOR = {Kempe, David and Kleinberg, Jon and Kumar, Amit},
TITLE = {Connectivity and inference problems for temporal networks},
JOURNAL = {J. Comput.~Syst.~Sci.},
VOLUME = {64},
NUMBER = {4},
PAGES = {820-842},
YEAR = {2002},
PUBLISHER = {Academic Press},
ADDRESS = {San Diego-London},
}
@article{Maciel-Pitassi-Woods/02,
AUTHOR = {Maciel, Alexis and Pitassi, Toniann and Woods, Alan R.},
TITLE = {A new proof of the weak pigeonhole principle},
JOURNAL = {J. Comput.~Syst.~Sci.},
VOLUME = {64},
NUMBER = {4},
PAGES = {843-872},
YEAR = {2002},
PUBLISHER = {Academic Press},
ADDRESS = {San Diego-London},
}
@article{Barkol-Rabani/02,
AUTHOR = {Barkol, Omer and Rabani, Yuval},
TITLE = {Tighter lower bounds for nearest neighbor search and related problems in the cell probe model},
JOURNAL = {J. Comput.~Syst.~Sci.},
VOLUME = {64},
NUMBER = {4},
PAGES = {873-896},
YEAR = {2002},
PUBLISHER = {Academic Press},
ADDRESS = {San Diego-London},
}