CoRR, October 1999

• Jörg Flum, Martin Grohe:
  Fixed-parameter tractability, definability, and model checking. , (informal publication)
  [cs.CC/9910001]
• Edith Hemaspaandra, Lane A. Hemaspaandra, Harald Hempel:
  What's Up with Downward Collapse: Using the Easy-Hard Technique to Link Boolean and Polynomial Hierarchy Collapses. , (informal publication)
  [cs.CC/9910002]
• Edith Hemaspaandra, Lane A. Hemaspaandra, Harald Hempel:
  R_1-tt^SN(NP) Distinguishes Robust Many-One and Turing Completeness. , (informal publication)
  [cs.CC/9910003]
• Edith Hemaspaandra, Lane A. Hemaspaandra, Harald Hempel:
  An Introduction to Query Order. , (informal publication)
  [cs.CC/9910004]
• Edith Hemaspaandra, Lane A. Hemaspaandra, Harald Hempel:
  Query Order and the Polynomial Hierarchy. , (informal publication)
  [cs.CC/9910005]
• Lane A. Hemaspaandra, Harald Hempel, Gerd Wechsung:
  Self-Specifying Machines. , (informal publication)
  [cs.CC/9910006]
• Edith Hemaspaandra, Lane A. Hemaspaandra, Harald Hempel:
  A Downward Collapse within the Polynomial Hierarchy. , (informal publication)
  [cs.CC/9910007]
• Edith Hemaspaandra, Lane A. Hemaspaandra, Harald Hempel:
  Translating Equality Downwards. , (informal publication)
  [cs.CC/9910008]
• Therese C. Biedl, Erik D. Demaine, Martin L. Demaine, Sylvain Lazard, Anna Lubiw, Joseph O'Rourke, Mark H. Overmars, Steve Robbins, Ileana Streinu, Godfried T. Toussaint, Sue Whitesides:
  Locked and Unlocked Polygonal Chains in 3D. , (informal publication)
  [cs.CG/9910009]
• Harry Buhrman, Ronald de Wolf:
  Communication Complexity Lower Bounds by Polynomials. , (informal publication)
  [cs.CC/9910010]
• Anand Venkataraman:
  A statistical model for word discovery in child directed speech. , (informal publication)
  [cs.CL/9910011]
• M. Reynolds:
  The Complexity of Temporal Logic over the Reals. , (informal publication)
  [cs.LO/9910012]
• Zhi-Zhong Chen, Michelangelo Grigni, Christos H. Papadimitriou:
  Map Graphs. , (informal publication)
  [cs.DM/9910013]
• Randal E. Bryant, Steven M. German, Miroslav N. Velev:
  Processor Verification Using Efficient Reductions of the Logic of Uninterpreted Functions to Propositional Logic. , (informal publication)
  [cs.LO/9910014]
• Naren Ramakrishnan:
  PIPE: Personalizing Recommendations via Partial Evaluation. , (informal publication)
  [cs.IR/9910015]
• Jürgen Dix, Mirco Nanni, V. S. Subrahmanian:
  Probabilistic Agent Programs. , (informal publication)
  [cs.AI/9910016]
• Jeff Erickson:
  Finite-resolution hidden surface removal. , (informal publication)
  [cs.CG/9910017]
• S. Y. Wang:
  Decoupling Control from Data for TCP Congestion Control. , (informal publication)
  [cs.NI/9910018]
• Roberto Baldoni, Francesco Quaglia, Michel Raynal:
  Consistent Checkpointing in Distributed Databases: Towards a Formal Approach. , (informal publication)
  [cs.DB/9910019]
• Atsushi Fujii, Kentaro Inui, Takenobu Tokunaga, Hozumi Tanaka:
  Selective Sampling for Example-based Word Sense Disambiguation. , (informal publication)
  [cs.CL/9910020]
• Prasan Roy, S. Seshadri, S. Sudarshan, Siddhesh Bhobe:
  Efficient and Extensible Algorithms for Multi Query Optimization. , (informal publication)
  [cs.DB/9910021]
• Mark-Jan Nederhof:
  Practical experiments with regular approximation of context-free languages. , (informal publication)
  [cs.CL/9910022]
• Alessio Guglielmi:
  A System of Interaction and Structure. , (informal publication)
  [cs.LO/9910023]
• Therese C. Biedl, Erik D. Demaine, Martin L. Demaine, Sylvain Lazard, Anna Lubiw, Joseph O'Rourke, Steve Robbins, Ileana Streinu, Godfried T. Toussaint, Sue Whitesides:
  On Reconfiguring Tree Linkages: Trees can Lock. , (informal publication)
  [cs.CG/9910024]
• Ioannis Kontoyiannis:
  Efficient sphere-covering and converse measure concentration via generalized coding theorems. , (informal publication)
  [math.PR/9910062]
• José Ignacio Farrán:
  Rational points, genus and asymptotic behaviour in reduced algebraic curves over finite fields. , (informal publication)
  [math.AG/9910149]
• José Ignacio Farrán:
  Decoding Algebraic Geometry codes by a key equation. , (informal publication)
  [math.AG/9910151]
• Antonio Campillo, José Ignacio Farrán:
  Computing Weierstrass semigroups and the Feng-Rao distance from singular plane models. , (informal publication)
  [math.AG/9910155]
• Alexei E. Ashikhmin, Alexander Barg, Simon Litsyn:
  Polynomial method in coding and information theory. , (informal publication)
  [math.CO/9910175]
• Michael B. Dillencourt, David Eppstein, Daniel S. Hirschberg:
  Geometric Thickness of Complete Graphs. , (informal publication)
  [math.CO/9910185]
• Edith Hemaspaandra, Lane A. Hemaspaandra, Marius Zimand:
  Almost-Everywhere Superiority for Quantum Computing. , (informal publication)
  [quant-ph/9910033]