CoRR, November 1999
- Michel Rigo: Numeration systems on a regular language: Arithmetic operations Recognizability and Formal power series.
- David Eppstein: Subgraph Isomorphism in Planar Graphs and Related Problems.
- Wolfgang Slany: Graph Ramsey games.
- Jim Gray: What Next? A Dozen Information-Technology Research Goals.
- Masaki Murata, Masao Utiyama, Hitoshi Isahara: Question Answering System Using Syntactic Information.
- Alina Beygelzimer, Lane A. Hemaspaandra, Christopher M. Homan, Jörg Rothe: One-Way Functions in Worst-Case Cryptography: Algebraic and Security Properties.
- John Watrous: On quantum and classical space-bounded processes with algebraic transition amplitudes.
- Michael J. O'Donnell: The Sources of Certainty in Computation and Formal Systems.
- Markus Walther: One-Level Prosodic Morphology.
- Joseph Y. Halpern: Cox's Theorem Revisited.
- Joseph O'Rourke, Beenish Chaudry, Sorina Chircu, Elizabeth F. Churchill, Sasha Fedorova, Judy A. Franklin, Biliana Kaneva, Halley Miller, Anton Okmianski, Irena Pashchenko, Ileana Streinu, Geetika Tewari, Dominique Thiébaut, Elif Tosun: PushPush is NP-hard in 3D.
- Edith Hemaspaandra: The Complexity of Poor Man's Logic.
- Antonio Campillo, José Ignacio Farrán, Carlos Munuera: On the parameters of Algebraic Geometry codes related to Arf semigroups.
- Christopher Ronnewinkel, Claus O. Wilke, Thomas Martinetz: Genetic Algorithms in Time-Dependent Environments.
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-06-18T211851 by the dblp team