Technical report column

And there are lots of other bibliographic resources available on the web: Networked Computer Science Technical Reference Library (www.ncstrl.org), the Los Alamos e-Print Archive (xxx.lanl.gov), the ACM Digital Library (www.acm.org/dl), and a newly formed Computer Science Research Repository (CoRR) accessible at xxx.lanl.gov/archive/cs. I am willing to accept recommendations fxom you on technical reports to include in this column. If you are an Algorithms or Computat ion Theory technical report writer, or if you are a curator of technical reports, please send me an e-mail and I will include your reports in the next column. This column lists papers from the following institutions: DIMACS, Electronic Colloquium on Computat ional Complexity, Max Planck Insti tute, and University of Rochester.

[1]  Pierre-Yves Schobbens,et al.  Axioms for Real-Time Logics , 1998, CONCUR.

[2]  Kurt Mehlhorn,et al.  A simple way to recognize a correct Voronoi diagram of line segments , 1999 .

[3]  A. Kennings,et al.  Analytical Placement of Hypergraphs | I , 1999 .

[4]  Karsten Weihe,et al.  How generic language extensions enable ''open-world'' design in Java , 1999 .

[5]  Jean-Francois Raskin,et al.  Proving a conjecture of Andreka on temporal logic , 1999 .

[6]  Marco Nissen.  Integration of graph iterators into LEDA , 1999 .

[7]  Edith Hemaspaandra,et al.  Almost-Everywhere Superiority for Quantum Computing , 1999, ArXiv.

[8]  Ioan I. Macarie,et al.  Amplification of slight probabilistic advantage at absolutely no cost in space , 1999, Inf. Process. Lett..

[9]  Kameshwar MunagalayStanford UniversityJuly.  Extending Greedy Multicast Routing to Delay Sensitive Applications , 1999 .

[10]  Anders Yeo,et al.  Strongly connected spanning subgraphs with the minimum number of arcs in semicomplete multipartite digraphs , 1999 .

[11]  David C. Wilkins,et al.  Efficient Bayesian Network Inference: Genetic Algorithms, Stochastic Local Search, and Abstraction , 1999 .

[12]  Jop F. Sibeyn,et al.  Ultimate Parallel List Ranking? , 1999, HiPC.

[13]  Edward A. Lee,et al.  A HIERARCHICAL MULTIPROCESSOR SCHEDULING FRAMEWORK FOR SYNCHRONOUS DATAFLOW GRAPHS , 1995 .

[14]  Seth Pettie,et al.  A Randomized Time-Work Optimal Parallel Algorithm for Finding a Minimum Spanning Forest , 1999, RANDOM-APPROX.

[15]  Pierre-Yves Schobbens,et al.  Fully decidable logics, automata and classical theories for defining regular real-time languages , 1999 .

[16]  O. Nevalainen,et al.  Heuristic Algorithms for The Euclidean Three-Matching Problem , 1999 .

[17]  Seth Pettie,et al.  An Optimal Minimum Spanning Tree Algorithm , 2000, ICALP.

[18]  U. Feige,et al.  Finding and certifying a large hidden clique in a semirandom graph , 2000 .

[19]  Pierre-Yves Schobbens,et al.  The logic of event clocks , 1999 .