@article{Ibarra-Su/99,
AUTHOR = {Ibarra, Oscar H. and Su, Jianwen},
TITLE = {A technique for proving decidability of containment and equivalence of linear constraint queries},
JOURNAL = {J. Comput.~Syst.~Sci.},
VOLUME = {59},
NUMBER = {1},
PAGES = {1-28},
YEAR = {1999},
PUBLISHER = {Academic Press},
}
@article{Breitbart-Korth/99,
AUTHOR = {Breitbart, Yuri and Korth, Henry F.},
TITLE = {Replication and consistency in a distributed environment},
JOURNAL = {J. Comput.~Syst.~Sci.},
VOLUME = {59},
NUMBER = {1},
PAGES = {29-69},
YEAR = {1999},
PUBLISHER = {Academic Press},
}
@article{Chen-Ameur/99,
AUTHOR = {Chen, Zhixiang and Ameur, Foued},
TITLE = {The learnability of unions of two rectangles in the two-dimensional discretized space},
JOURNAL = {J. Comput.~Syst.~Sci.},
VOLUME = {59},
NUMBER = {1},
PAGES = {70-83},
YEAR = {1999},
PUBLISHER = {Academic Press},
}
@article{Chaudhuri/99,
AUTHOR = {Chaudhuri, Pranay},
TITLE = {A self-stabilizing algorithm for detecting fundamental cycles in a graph},
JOURNAL = {J. Comput.~Syst.~Sci.},
VOLUME = {59},
NUMBER = {1},
PAGES = {84-93},
YEAR = {1999},
PUBLISHER = {Academic Press},
}
@article{Baudinet-Chomicki-Wolper/99,
AUTHOR = {Baudinet, Marianne and Chomicki, Jan and Wolper, Pierre},
TITLE = {Constraint-generating dependencies},
JOURNAL = {J. Comput.~Syst.~Sci.},
VOLUME = {59},
NUMBER = {1},
PAGES = {94-115},
YEAR = {1999},
PUBLISHER = {Academic Press},
}
@article{Grahne-Nykanen-Ukkonen/99,
AUTHOR = {Grahne, G{\"o}sta and Nyk{\"a}nen, Matti and Ukkonen, Esko},
TITLE = {Reasoning about strings in databases},
JOURNAL = {J. Comput.~Syst.~Sci.},
VOLUME = {59},
NUMBER = {1},
PAGES = {116-162},
YEAR = {1999},
PUBLISHER = {Academic Press},
}
@article{Allender-Reinhardt-Zhou/99,
AUTHOR = {Allender, Eric and Reinhardt, Klaus and Zhou, Shiyu},
TITLE = {Isolation, matching, and counting uniform and nonuniform upper bounds},
JOURNAL = {J. Comput.~Syst.~Sci.},
VOLUME = {59},
NUMBER = {2},
PAGES = {164-181},
YEAR = {1999},
PUBLISHER = {Academic Press},
}
@article{Buhrman-Fortnow/99,
AUTHOR = {Buhrman, Harry and Fortnow, Lance},
TITLE = {Two queries},
JOURNAL = {J. Comput.~Syst.~Sci.},
VOLUME = {59},
NUMBER = {2},
PAGES = {182-194},
YEAR = {1999},
PUBLISHER = {Academic Press},
}
@article{Beimel-Gal/99,
AUTHOR = {Beimel, Amos and G{\'{a}}l, Anna},
TITLE = {On arithmetic branching programs},
JOURNAL = {J. Comput.~Syst.~Sci.},
VOLUME = {59},
NUMBER = {2},
PAGES = {195-220},
YEAR = {1999},
PUBLISHER = {Academic Press},
}
@article{Cai-Nerurkar/99,
AUTHOR = {Cai, Jin-Yi and Nerurkar, Ajay},
TITLE = {Approximating the SVP to within a factor $(1+1/dim^\varepsilon$ is $NP$-hard under randomized reductions},
JOURNAL = {J. Comput.~Syst.~Sci.},
VOLUME = {59},
NUMBER = {2},
PAGES = {221-239},
YEAR = {1999},
PUBLISHER = {Academic Press},
}
@article{Fortnow-Rogers/99,
AUTHOR = {Fortnow, Lance and Rogers, John},
TITLE = {Complexity limitations on quantum computation},
JOURNAL = {J. Comput.~Syst.~Sci.},
VOLUME = {59},
NUMBER = {2},
PAGES = {240-252},
YEAR = {1999},
PUBLISHER = {Academic Press},
}
@article{Goldreich-Sudan/99,
AUTHOR = {Goldreich, Oded and Sudan, Madhu},
TITLE = {Computational indistinguishability: A sample hierarchy},
JOURNAL = {J. Comput.~Syst.~Sci.},
VOLUME = {59},
NUMBER = {2},
PAGES = {253-269},
YEAR = {1999},
PUBLISHER = {Academic Press},
}
@article{Sivakumar/99,
AUTHOR = {Sivakumar, D.},
TITLE = {On membership comparable sets},
JOURNAL = {J. Comput.~Syst.~Sci.},
VOLUME = {59},
NUMBER = {2},
PAGES = {270-280},
YEAR = {1999},
PUBLISHER = {Academic Press},
}
@article{Watrous/99a,
AUTHOR = {Watrous, John},
TITLE = {Space-bounded quantum complexity},
JOURNAL = {J. Comput.~Syst.~Sci.},
VOLUME = {59},
NUMBER = {2},
PAGES = {281-326},
YEAR = {1999},
PUBLISHER = {Academic Press},
}
@article{Buhrman-Melkebeek/99,
AUTHOR = {Buhrman, Harry and Melkebeek, Dieter van},
TITLE = {Hard sets are hard to find},
JOURNAL = {J. Comput.~Syst.~Sci.},
VOLUME = {59},
NUMBER = {2},
PAGES = {327-345},
YEAR = {1999},
PUBLISHER = {Academic Press},
}
@article{Raz-Tardos-Verbitsky-Vereshchagin/99,
AUTHOR = {Raz, Ran and Tardos, G{\'{a}}bor and Verbitsky, Oleg and Vereshchagin, Nikolai},
TITLE = {Arthur-Merlin games in Boolean decision trees},
JOURNAL = {J. Comput.~Syst.~Sci.},
VOLUME = {59},
NUMBER = {2},
PAGES = {346-372},
YEAR = {1999},
PUBLISHER = {Academic Press},
}
@article{Gaubert-Giua/99,
AUTHOR = {Gaubert, St{\'e}phane and Giua, Alessandro},
TITLE = {Petri net languages and infinite subsets of $N^m$},
JOURNAL = {J. Comput.~Syst.~Sci.},
VOLUME = {59},
NUMBER = {3},
PAGES = {373-391},
YEAR = {1999},
PUBLISHER = {Academic Press},
}
@article{Cesa-Bianchi/99,
AUTHOR = {Cesa-Bianchi, Nicol{\`{o}}},
TITLE = {Analysis of two gradient-based algorithms for on-line regression},
JOURNAL = {J. Comput.~Syst.~Sci.},
VOLUME = {59},
NUMBER = {3},
PAGES = {392-411},
YEAR = {1999},
PUBLISHER = {Academic Press},
}
@article{Corradini-Nicola-Labella/99,
AUTHOR = {Corradini, Flavio and Nicola, Rocco de and Labella, Anna},
TITLE = {Models of nondeterministic regular expressions},
JOURNAL = {J. Comput.~Syst.~Sci.},
VOLUME = {59},
NUMBER = {3},
PAGES = {412-449},
YEAR = {1999},
PUBLISHER = {Academic Press},
}
@article{Chen/99a,
AUTHOR = {Chen, Lin},
TITLE = {Graph isomorphism and identification matrices: Sequential algorithms},
JOURNAL = {J. Comput.~Syst.~Sci.},
VOLUME = {59},
NUMBER = {3},
PAGES = {450-475},
YEAR = {1999},
PUBLISHER = {Academic Press},
}
@article{Jancar-Esparza-Moller/99,
AUTHOR = {Jan{\v{c}}ar, Petr and Esparza, Javier and Moller, Faron},
TITLE = {Petri nets and regular processes},
JOURNAL = {J. Comput.~Syst.~Sci.},
VOLUME = {59},
NUMBER = {3},
PAGES = {476-503},
YEAR = {1999},
PUBLISHER = {Academic Press},
}
@article{Weems/99,
AUTHOR = {Weems, B.P.},
TITLE = {Bistable versions of the marriages and roommates problems},
JOURNAL = {J. Comput.~Syst.~Sci.},
VOLUME = {59},
NUMBER = {3},
PAGES = {504-520},
YEAR = {1999},
PUBLISHER = {Academic Press},
}
@article{Liberti/99,
AUTHOR = {Liberti, Leo},
TITLE = {Structure of the invertible CA transformations group},
JOURNAL = {J. Comput.~Syst.~Sci.},
VOLUME = {59},
NUMBER = {3},
PAGES = {521-536},
YEAR = {1999},
PUBLISHER = {Academic Press},
}
@article{Barbuti-Francesco-Santone-Vaglini/99a,
AUTHOR = {Barbuti, Roberto and Francesco, Nicoletta de and Santone, Antonella and Vaglini, Gigliola},
TITLE = {Selective Mu-Calculus and formula-based equivalence of transition systems},
JOURNAL = {J. Comput.~Syst.~Sci.},
VOLUME = {59},
NUMBER = {3},
PAGES = {537-556},
YEAR = {1999},
PUBLISHER = {Academic Press},
}
@article{Fukuda-Morimoto-Morishita-Tokuyama/99,
AUTHOR = {Fukuda, Takeshi and Morimoto, Yasuhiko and Morishita, Shinichi and Tokuyama, Takeshi},
TITLE = {Mining optimized association rules for numeric attributes},
JOURNAL = {J. Comput.~Syst.~Sci.},
VOLUME = {58},
NUMBER = {1},
PAGES = {1-12},
YEAR = {1999},
PUBLISHER = {Academic Press},
ADDRESS = {San Diego-London},
}
@article{Jagadish-Mendelzon-Mumick/99,
AUTHOR = {Jagadish, H.V. and Mendelzon, Alberto O. and Mumick, Inderpal Singh},
TITLE = {Managing conflicts between rules},
JOURNAL = {J. Comput.~Syst.~Sci.},
VOLUME = {58},
NUMBER = {1},
PAGES = {13-28},
YEAR = {1999},
PUBLISHER = {Academic Press},
ADDRESS = {San Diego-London},
}
@article{Papadimitriou-Suciu-Vianu/99,
AUTHOR = {Papadimitriou, C.H. and Suciu, D. and Vianu, V.},
TITLE = {Topological queries in spatial databases},
JOURNAL = {J. Comput.~Syst.~Sci.},
VOLUME = {58},
NUMBER = {1},
PAGES = {29-53},
YEAR = {1999},
PUBLISHER = {Academic Press},
ADDRESS = {San Diego-London},
}
@article{Abiteboul-Herr-Bussche/99,
AUTHOR = {Abiteboul, Serge and Herr, Laurent and Bussche, Jan van den},
TITLE = {Temporal connectives versus explicit timestamps to query temporal databases},
JOURNAL = {J. Comput.~Syst.~Sci.},
VOLUME = {58},
NUMBER = {1},
PAGES = {54-68},
YEAR = {1999},
PUBLISHER = {Academic Press},
ADDRESS = {San Diego-London},
}
@article{Levy-Rajaraman-Ullman/99,
AUTHOR = {Levy, Alon Y. and Rajaraman, Anand and Ullman, Jeffrey D.},
TITLE = {Answering queries using limited external query processors},
JOURNAL = {J. Comput.~Syst.~Sci.},
VOLUME = {58},
NUMBER = {1},
PAGES = {69-82},
YEAR = {1999},
PUBLISHER = {Academic Press},
ADDRESS = {San Diego-London},
}
@article{Fagin/99,
AUTHOR = {Fagin, Ronald},
TITLE = {Combining fuzzy information from multiple systems},
JOURNAL = {J. Comput.~Syst.~Sci.},
VOLUME = {58},
NUMBER = {1},
PAGES = {83-99},
YEAR = {1999},
PUBLISHER = {Academic Press},
ADDRESS = {San Diego-London},
}
@article{Blum-Ravi-Vempala/99,
AUTHOR = {Blum, Avrim and Ravi, R. and Vempala, Santosh},
TITLE = {A constant-factor approximation algorithm for the $k$-MST problem},
JOURNAL = {J. Comput.~Syst.~Sci.},
VOLUME = {58},
NUMBER = {1},
PAGES = {101-108},
YEAR = {1999},
PUBLISHER = {Academic Press},
ADDRESS = {San Diego-London},
}
@article{Kearns-Mansour/99,
AUTHOR = {Kearns, Michael and Mansour, Yishay},
TITLE = {On the boosting ability of top-down decision tree learning algorithms},
JOURNAL = {J. Comput.~Syst.~Sci.},
VOLUME = {58},
NUMBER = {1},
PAGES = {109-128},
YEAR = {1999},
PUBLISHER = {Academic Press},
ADDRESS = {San Diego-London},
}
@article{Kushilevitz-Ostrovsky-Rosen/99,
AUTHOR = {Kushilevitz, Eyal and Ostrovsky, Rafail and Ros{\'{e}}n, Adi},
TITLE = {Characterizing linear size circuits in terms of privacy},
JOURNAL = {J. Comput.~Syst.~Sci.},
VOLUME = {58},
NUMBER = {1},
PAGES = {129-136},
YEAR = {1999},
PUBLISHER = {Academic Press},
ADDRESS = {San Diego-London},
}
@article{Alon-Matias-Szegedy/99,
AUTHOR = {Alon, Noga and Matias, Yossi and Szegedy, Mario},
TITLE = {The space complexity of approximating the frequency moments},
JOURNAL = {J. Comput.~Syst.~Sci.},
VOLUME = {58},
NUMBER = {1},
PAGES = {137-147},
YEAR = {1999},
PUBLISHER = {Academic Press},
ADDRESS = {San Diego-London},
}
@article{Nisan-Ta-Shma/99,
AUTHOR = {Nisan, Noam and Ta-Shma, Amnon},
TITLE = {Extracting randomness: A survey and new constructions},
JOURNAL = {J. Comput.~Syst.~Sci.},
VOLUME = {58},
NUMBER = {1},
PAGES = {148-173},
YEAR = {1999},
PUBLISHER = {Academic Press},
ADDRESS = {San Diego-London},
}
@article{Ben-Dor-Karlin-Linial-Rabinovich/99,
AUTHOR = {Ben-Dor, Amir and Karlin, Anna and Linial, Nathan and Rabinovich, Yuri},
TITLE = {A note on the influence of an $\epsilon$-biased random source},
JOURNAL = {J. Comput.~Syst.~Sci.},
VOLUME = {58},
NUMBER = {1},
PAGES = {174-176},
YEAR = {1999},
PUBLISHER = {Academic Press},
ADDRESS = {San Diego-London},
}
@article{Schaefer/99a,
AUTHOR = {Schaefer, Marcus},
TITLE = {Deciding the Vapnik-{\v{C}}ervonenkis dimension is $\Sigma^p_3$-complete},
JOURNAL = {J. Comput.~Syst.~Sci.},
VOLUME = {58},
NUMBER = {1},
PAGES = {177-182},
YEAR = {1999},
PUBLISHER = {Academic Press},
ADDRESS = {San Diego-London},
}
@article{Ratsaby-Maiorov/99,
AUTHOR = {Ratsaby, Joel and Maiorov, Vitaly},
TITLE = {On the learnability of rich function classes},
JOURNAL = {J. Comput.~Syst.~Sci.},
VOLUME = {58},
NUMBER = {1},
PAGES = {183-192},
YEAR = {1999},
PUBLISHER = {Academic Press},
ADDRESS = {San Diego-London},
}
@article{Arora-Karger-Karpinski/99,
AUTHOR = {Arora, Sanjeev and Karger, David and Karpinski, Marek},
TITLE = {Polynomial time approximation schemes for dense instances of $NP$-hard problems},
JOURNAL = {J. Comput.~Syst.~Sci.},
VOLUME = {58},
NUMBER = {1},
PAGES = {193-210},
YEAR = {1999},
PUBLISHER = {Academic Press},
ADDRESS = {San Diego-London},
}
@article{Case-Fulk/99,
AUTHOR = {Case, John and Fulk, Mark A.},
TITLE = {Maximal machine learnable classes},
JOURNAL = {J. Comput.~Syst.~Sci.},
VOLUME = {58},
NUMBER = {1},
PAGES = {211-214},
YEAR = {1999},
PUBLISHER = {Academic Press},
ADDRESS = {San Diego-London},
}
@article{Antonoiu-Srimani/99,
AUTHOR = {Antonoiu, Gheorghe and Srimani, Pradip K.},
TITLE = {A self-stabilizing distributed algorithm to find the median of a tree graph},
JOURNAL = {J. Comput.~Syst.~Sci.},
VOLUME = {58},
NUMBER = {1},
PAGES = {215-221},
YEAR = {1999},
PUBLISHER = {Academic Press},
ADDRESS = {San Diego-London},
}
@article{Lund-Phillips-Reingold/99,
AUTHOR = {Lund, Carsten and Phillips, Steven and Reingold, Nick},
TITLE = {Paging against a distribution and IP networking},
JOURNAL = {J. Comput.~Syst.~Sci.},
VOLUME = {58},
NUMBER = {1},
PAGES = {222-231},
YEAR = {1999},
PUBLISHER = {Academic Press},
ADDRESS = {San Diego-London},
}
@article{Goldberg-MacKenzie/99,
AUTHOR = {Goldberg, Leslie Ann and MacKenzie, Philip D.},
TITLE = {Analysis of practical backoff protocols for contention resolution with multiple servers},
JOURNAL = {J. Comput.~Syst.~Sci.},
VOLUME = {58},
NUMBER = {1},
PAGES = {232-258},
YEAR = {1999},
PUBLISHER = {Academic Press},
ADDRESS = {San Diego-London},
}
@article{Beals/99,
AUTHOR = {Beals, Robert},
TITLE = {Algorithms for matrix groups and the Tits alternative},
JOURNAL = {J. Comput.~Syst.~Sci.},
VOLUME = {58},
NUMBER = {2},
PAGES = {260-279},
YEAR = {1999},
PUBLISHER = {Academic Press},
ADDRESS = {San Diego-London},
}
@article{Cai-Sivakumar/99,
AUTHOR = {Cai, Jin-Yi and Sivakumar, D.},
TITLE = {Sparse hard sets for $P$: Resolution of a conjecture of Hartmanis},
JOURNAL = {J. Comput.~Syst.~Sci.},
VOLUME = {58},
NUMBER = {2},
PAGES = {280-296},
YEAR = {1999},
PUBLISHER = {Academic Press},
ADDRESS = {San Diego-London},
}
@article{Dey-Guha/99,
AUTHOR = {Dey, Tamal K. and Guha, Sumanta},
TITLE = {Transforming curves on surfaces},
JOURNAL = {J. Comput.~Syst.~Sci.},
VOLUME = {58},
NUMBER = {2},
PAGES = {297-325},
YEAR = {1999},
PUBLISHER = {Academic Press},
ADDRESS = {San Diego-London},
}
@article{Haken-Cook/99,
AUTHOR = {Haken, Armin and Cook, Stephen A.},
TITLE = {An exponential lower bound for the size of monotone real circuits},
JOURNAL = {J. Comput.~Syst.~Sci.},
VOLUME = {58},
NUMBER = {2},
PAGES = {326-335},
YEAR = {1999},
PUBLISHER = {Academic Press},
ADDRESS = {San Diego-London},
}
@article{Naor-Reingold/99,
AUTHOR = {Naor, Moni and Reingold, Omer},
TITLE = {Synthesizers and their application to the parallel construction of pseudo-random functions},
JOURNAL = {J. Comput.~Syst.~Sci.},
VOLUME = {58},
NUMBER = {2},
PAGES = {336-375},
YEAR = {1999},
PUBLISHER = {Academic Press},
ADDRESS = {San Diego-London},
}
@article{Saks-Zhou/99,
AUTHOR = {Saks, Michael and Zhou, Shiyu},
TITLE = {$BP_{H}SPACE(S)\subseteq DSPACE(S^{3/2})$},
JOURNAL = {J. Comput.~Syst.~Sci.},
VOLUME = {58},
NUMBER = {2},
PAGES = {376-403},
YEAR = {1999},
PUBLISHER = {Academic Press},
ADDRESS = {San Diego-London},
}
@article{Papadimitriou-Yannakakis/99,
AUTHOR = {Papadimitriou, Christos H. and Yannakakis, Mihalis},
TITLE = {On the complexity of databases queries},
JOURNAL = {J. Comput.~Syst.~Sci.},
VOLUME = {58},
NUMBER = {3},
PAGES = {407-427},
YEAR = {1999},
PUBLISHER = {Academic Press},
ADDRESS = {San Diego-London},
}
@article{Abiteboul-Vianu/99,
AUTHOR = {Abiteboul, Serge and Vianu, Victor},
TITLE = {Regular path queries with constraints},
JOURNAL = {J. Comput.~Syst.~Sci.},
VOLUME = {58},
NUMBER = {2},
PAGES = {428-452},
YEAR = {1999},
PUBLISHER = {Academic Press},
ADDRESS = {San Diego-London},
}
@article{Mecca-Atzeni/99,
AUTHOR = {Mecca, Giansalvatore and Atzeni, Paolo},
TITLE = {Cut and paste},
JOURNAL = {J. Comput.~Syst.~Sci.},
VOLUME = {58},
NUMBER = {3},
PAGES = {453-482},
YEAR = {1999},
PUBLISHER = {Academic Press},
ADDRESS = {San Diego-London},
}
@article{Gyssens-Bussche-Gucht/99,
AUTHOR = {Gyssens, Marc and Bussche, Jan van den and Gucht, Dirk van},
TITLE = {Complete geometric query languages},
JOURNAL = {J. Comput.~Syst.~Sci.},
VOLUME = {58},
NUMBER = {3},
PAGES = {483-511},
YEAR = {1999},
PUBLISHER = {Academic Press},
ADDRESS = {San Diego-London},
}
@article{Albert-Ioannidis-Ramakrishnan/99,
AUTHOR = {Albert, Joseph and Ioannidis, Yannis and Ramakrishnan, Raghu},
TITLE = {Equivalence of keyed relational schemas by conjunctive queries},
JOURNAL = {J. Comput.~Syst.~Sci.},
VOLUME = {58},
NUMBER = {3},
PAGES = {512-534},
YEAR = {1999},
PUBLISHER = {Academic Press},
ADDRESS = {San Diego-London},
}
@article{Dumortier-Gyssens-Vandeurzen-Gucht/99,
AUTHOR = {Dumortier, Freddy and Gyssens, Marc and Vandeurzen, Luc and Gucht, Dirk van},
TITLE = {On the decidability of semilinearity for semialgebraic sets and its implications for spatial databases},
JOURNAL = {J. Comput.~Syst.~Sci.},
VOLUME = {58},
NUMBER = {3},
PAGES = {535-571},
YEAR = {1999},
PUBLISHER = {Academic Press},
ADDRESS = {San Diego-London},
}
@article{Buss-Frandsen-Shallit/99,
AUTHOR = {Buss, Jonathan F. and Frandsen, Gudmund S. and Shallit, Jeffrey O.},
TITLE = {The computational complexity of some problems of linear algebra},
JOURNAL = {J. Comput.~Syst.~Sci.},
VOLUME = {58},
NUMBER = {3},
PAGES = {572-596},
YEAR = {1999},
PUBLISHER = {Academic Press},
ADDRESS = {San Diego-London},
}
@article{Manzini-Margara/99,
AUTHOR = {Manzini, Giovanni and Margara, Luciano},
TITLE = {Attractors of linear cellular automata},
JOURNAL = {J. Comput.~Syst.~Sci.},
VOLUME = {58},
NUMBER = {3},
PAGES = {597-610},
YEAR = {1999},
PUBLISHER = {Academic Press},
ADDRESS = {San Diego-London},
}
@article{Dassow-Mitrana/99,
AUTHOR = {Dassow, J{\"u}rgen and Mitrana, Victor},
TITLE = {Stack cooperation in multistack pushdown automata},
JOURNAL = {J. Comput.~Syst.~Sci.},
VOLUME = {58},
NUMBER = {3},
PAGES = {611-621},
YEAR = {1999},
PUBLISHER = {Academic Press},
ADDRESS = {San Diego-London},
}
@article{Chen-Friesen-Zheng/99,
AUTHOR = {Chen, Jianer and Friesen, Donald K. and Zheng, Hao},
TITLE = {Tight bound on Johnson's algorithm for maximum satisfiability},
JOURNAL = {J. Comput.~Syst.~Sci.},
VOLUME = {58},
NUMBER = {3},
PAGES = {622-640},
YEAR = {1999},
PUBLISHER = {Academic Press},
ADDRESS = {San Diego-London},
}
@article{Krawczyk/99,
AUTHOR = {Krawczyk, Adam},
TITLE = {The complexity of finding a second Hamiltonian cycle in cubic graphs},
JOURNAL = {J. Comput.~Syst.~Sci.},
VOLUME = {58},
NUMBER = {3},
PAGES = {641-647},
YEAR = {1999},
PUBLISHER = {Academic Press},
ADDRESS = {San Diego-London},
}
@article{Hemaspaandra-Rothe/99,
AUTHOR = {Hemaspaandra, Lane A. and Rothe, J{\"o}rg},
TITLE = {Creating strong, total, commutative, associative one-way functions from any one-way function in complexity theory},
JOURNAL = {J. Comput.~Syst.~Sci.},
VOLUME = {58},
NUMBER = {3},
PAGES = {648-659},
YEAR = {1999},
PUBLISHER = {Academic Press},
ADDRESS = {San Diego-London},
}