Browse

ftp://cs.uchicago.edu (133)

	ftp://cs.uchicago.edu/pub/publications/tech-reports/TR-91-27.ps, 19921210 Promising Directions in Active Vision Written by the attendees of the NSF Active Vision Workshop University of Chicago, August 5-7, 1991 Edited by Michael J. Swain and Markus Stricker Sponsored by the National Science Foundation, IBM and Hughes Research Laboratories University of Chicago Technical
	ftp://cs.uchicago.edu/pub/publications/tech-reports/TR-92-22.ps, 19921211 Color and Geometry as Cues for Indexing Markus A. Stricker The University of Chicago Department of Computer Science 1100 East 58th Street, RY 152 Chicago, IL 60637 (USA) email: stricker@cs.uchicago.edu Technical Report CS 92-22, November 23, 1992
	ftp://cs.uchicago.edu/pub/publications/tech-reports/TR-91-10.ps, 19921218 NON-DETERMINISTIC EXPONENTIAL TIME HAS TWO-PROVER INTERACTIVE PROTOCOLS L aszl o Babai, Lance Fortnow and Carsten Lund
	ftp://cs.uchicago.edu/pub/publications/tech-reports/TR-91-08.ps, 19921218 Checking Computations in Polylogarithmic Time L aszl o Babai 1 Univ. of Chicago 6 and E otv os Univ., Budapest Lance Fortnow 2 Dept. Comp. Sci. Univ. of Chicago 6 Leonid A. Levin 3 Dept. Comp. Sci. Boston University 4 Mario Szegedy 5 Dept. Comp. Sci. Univ. of Chicago
	ftp://cs.uchicago.edu/pub/publications/tech-reports/TR-90-22.ps, 19921218 ON THE RANDOM-SELF-REDUCIBILITY OF COMPLETE SETS JOAN FEIGENBAUMy AND LANCE FORTNOWz
	ftp://cs.uchicago.edu/pub/publications/tech-reports/TR-91-30.ps, 19921218 Gap-Definable Counting Classes Stephen A. Fenner Computer Science Department University of Southern Maine 96 Falmouth Street Portland, Maine 04103 Lance J. Fortnowy Stuart A. Kurtz Computer Science Department University of Chicago 1100 East Fifty-eighth Street Chicago, Illinois 60637 July 12, 1992 Work
	ftp://cs.uchicago.edu/pub/publications/tech-reports/TR-91-09.ps, 19921218 ARITHMETIZATION: A NEW METHOD IN STRUCTURAL COMPLEXITY THEORY L aszl o Babai and Lance Fortnow
	ftp://cs.uchicago.edu/pub/publications/tech-reports/TR-90-16.ps, 19921218 Algebraic Methods for Interactive Proof Systems Carsten Lund Lance Fortnowy Howard Karloffz University of Chicago Noam Nisanx Hebrew University
	ftp://cs.uchicago.edu/pub/publications/tech-reports/TR-90-32.ps, 19921218 Gap-Definable Counting Classes Stephen A. Fenner Computer Science Department University of Southern Maine 96 Falmouth Street Portland, Maine 04103 Lance J. Fortnowy Stuart A. Kurtz Computer Science Department University of Chicago 1100 East Fifty-eighth Street Chicago, Illinois 60637 July 12, 1992 Work
	ftp://cs.uchicago.edu/pub/publications/tech-reports/TR-92-13.ps, 19921218 Gap-Definability as a Closure Property Stephen Fenner1 , Lance Fortnow2 and Lide Li2y 1 University of Southern Maine, Computer Science Department, 96 Falmouth St., Portland, ME 04103, USA 2 University of Chicago, Department of Computer Science, 1100 E. 58th St., Chicago, IL 60637, USA
	ftp://cs.uchicago.edu/pub/publications/tech-reports/TR-90-30.ps, 19921218 PP is Closed Under Truth-Table Reductions Lance Fortnow Nick Reingoldy University of Chicago Yale University
	ftp://cs.uchicago.edu/pub/publications/tech-reports/TR-90-11.ps, 19921218 INTERACTIVE PROOF SYSTEMS AND ALTERNATING TIME-SPACE COMPLEXITY Lance Fortnow1 Carsten Lund2 University of Chicago Dept. of Computer Science 1100 E. 58th Street Chicago, IL 60637
	ftp://cs.uchicago.edu/pub/publications/tech-reports/TR-90-14.ps, 19921218 BPP HAS SUBEXPONENTIAL TIME SIMULATIONS UNLESS EXPT IME HAS PUBLISHABLE PROOFS L aszl o Babai, Lance Fortnow, Noam Nisan and Avi Wigderson
	ftp://cs.uchicago.edu/pub/publications/tech-reports/TR-92-08.ps, 19921218 The Isomorphism Conjecture Holds Relative to an Oracle Stephen Fenner Lance Fortnowy Stuart A. Kurtzz December 18, 1992
	ftp://cs.uchicago.edu/pub/publications/tech-reports/TR-92-25.ps, 19921222 Oracles, Proofs and Checking Lance Fortnow December 21, 1992
	ftp://cs.uchicago.edu/pub/publications/tech-reports/TR-92-26.ps, 19921222 An Oracle Builder's Toolkit Stephen Fenner, Lance Fortnow, Stuart A. Kurtz, and Lide Li University of Chicago Technical Report 92-026, December 21, 1992 For additional copies, write: Department of Computer Science University of Chicago 1100 E. 58th Street Chicago, Illinois 60637 U.S.A. An Oracle
	ftp://cs.uchicago.edu/pub/publications/tech-reports/TR-94-01.ps, 19940420 Optimality and Domination in Repeated Games with Bounded Players Lance Fortnow Duke Whangy Department of Computer Science The University of Chicago 1100 East 58th Street Chicago, Illinois 60637
	ftp://cs.uchicago.edu/pub/publications/tech-reports/TR-94-08.ps, 19940623 Two results on the Bit Extraction Problem (extended abstract) Shi-Chun Tsai Katalin Friedl tsai@cs.uchicago.edu friedl@cs.uchicago.edu University of Chicago Department of Computer Science 1100 E. 58th St., Chicago, IL 60637
	ftp://cs.uchicago.edu/pub/publications/tech-reports/TR-94-07.ps, 19940623 Transparent Proofs and Limits to Approximation L aszl o Babai E otv os University, Budapest, Hungary H-1088 and The University of Chicago, Chicago, IL 60637-1504 A good proof is one which makes us wiser. Yu. I. Manin
	ftp://cs.uchicago.edu/pub/publications/tech-reports/TR-94-09.ps, 19940630 Resource-Bounded Instance Complexity Lance Fortnow University of Chicago Martin Kummery Universit at Karlsruhe 1 Introduction Instance complexity was introduced by Ko, Orponen, Sch oning, and Watanabe (see also ) as a measure of the complexity of individual instances of a
	ftp://cs.uchicago.edu/pub/publications/tech-reports/TR-92-28.ps, 19940630 Lower Bounds on Representing Boolean Functions as Polynomials in Zm Shi-Chun Tsai y
	ftp://cs.uchicago.edu/pub/publications/tech-reports/TR-94-10.ps, 19940630 Automorphism groups, isomorphism, reconstruction (Chapter 27 of the Handbook of Combinatorics) L aszl o Babai E otv os University, Budapest, and The University of Chicago June 9, 1994 Contents Introduction 3 0.1 Graphs and groups : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : 3 0.2
	ftp://cs.uchicago.edu/pub/publications/tech-reports/TR-93-02.ps, 19940711 Low degree test Katalin Friedl Zsolt H ats agi Department of Computer Science Univeristy of Chicago April 29, 1993
	ftp://cs.uchicago.edu/pub/publications/tech-reports/TR-92-21.ps, 19940711 Reducing the Rank of Lower Triangular All-Ones Matrices Peter Kimmel Amber Settle November 6, 1992
	ftp://cs.uchicago.edu/pub/publications/tech-reports/TR-93-08.ps, 19940711 Generic Separations Lance Fortnow Tomoyuki Yamakamiy University of Chicago University of Toronto Department of Computer Science Department of Computer Science 1100 E. 58th St. Toronto, Ontario Chicago, IL 60637 Canada M5S 1A4 1 Introduction In 1987, Blum and Impagliazzo , using techniques of
	ftp://cs.uchicago.edu/pub/publications/tech-reports/TR-93-18.ps, 19940711 t-Particle Random Walks and Recycling Random Bits in Parallel Katalin Friedl Shi-Chun Tsai friedl@cs.uchicago.edu tsai@cs.uchicago.edu University of Chicago Department of Computer Science 1100 E. 58th St., Chicago, IL 60637
	ftp://cs.uchicago.edu/pub/publications/tech-reports/TR-93-14.ps, 19940714 Separability and One-way Functions Lance Fortnow John Rogersy Department of Computer Science The University of Chicago 1100 East 58th Street Chicago, Illinois 60637 November 19, 1993 1 Introduction In order to better understand the relationship between P and NP, it is useful to study the structure of
	ftp://cs.uchicago.edu/pub/publications/tech-reports/TR-93-09.ps, 19940714 A Note On Step Satisfiable Boolean Formulas Peter Kimmel July 21, 1993 Definition 1 Let n and k be positive integers. Let x1; : : : ; xn be boolean variables. A list of boolean formulas F1; : : : ; Fm is called -step satisfiable if each Fi is a function of k of the n variables and there exist truth
	ftp://cs.uchicago.edu/pub/publications/tech-reports/TR-93-16.ps, 19940715 Optimality and Domination in Repeated Games with Bounded Players Lance Fortnow Duke Whangy Department of Computer Science The University of Chicago 1100 East 58th Street Chicago, Illinois 60637
	ftp://cs.uchicago.edu/pub/publications/tech-reports/TR-91-01.ps, 19940719 THE UNIVERSITY OF CHICAGO THE POWER OF INTERACTION A DISSERTATION SUBMITTED TO THE FACULTY OF THE DIVISION OF THE PHYSICAL SCIENCES IN CANDIDACY FOR THE DEGREE OF DOCTOR OF PHILOSOPHY DEPARTMENT OF COMPUTER SCIENCE BY CARSTEN LUND CHICAGO, ILLINOIS MARCH, 1991 ACKNOWLEDGEMENTS First I could like to
	ftp://cs.uchicago.edu/pub/publications/tech-reports/TR-87-05.ps, 19940721 Lower bounds for the size of circuits of bounded depth in basis f^; g A.A. Razborov Moscow 1986 Preface The following is a translation of the preprint concerning the recent majority result by Razborov (to appear in Matematicheskie Zametki). It is my intent in this endeavor to be faithful to the original
	ftp://cs.uchicago.edu/pub/publications/tech-reports/TR-89-02.ps, 19940815 On the concrete complexity of zero-knowledge proofs Joan Boyar Computer Science Department University of Chicago Ren e Peraltay Computer Science Department University of Wisconsin - Milwaukee
	ftp://cs.uchicago.edu/pub/publications/tech-reports/TR-91-25.ps, 19940816 ALGEBRAIC ASPECTS OF COMPLEXITY FUNCTIONS Lide Li University of Chicago Dept. of Computer Science 1100 E. 58th , Chicago, IL60637 lilide@cs.uchicago.edu August 27, 1991
	ftp://cs.uchicago.edu/pub/publications/tech-reports/TR-94-02.ps, 19940816 Relatively Recursive Reals and Real Functions Chun-Kuen Ho Department of Computer Science The University of Chicago 1100, East 58th Street Chicago, Illinois 60637 email: chun@cs.uchicago.edu May 27, 1993 Revised Feb 18, 1994
	ftp://cs.uchicago.edu/pub/publications/tech-reports/TR-93-03.ps, 19940816 On PP-Low Classes Lide Li University of Chicago Department of Computer Science 1100 E. 58th St., Chicago, IL 60637
	ftp://cs.uchicago.edu/pub/publications/tech-reports/TR-93-12.ps, 19940816 ACKNOWLEDGEMENTS First I would like to thank my thesis advisor, Lance Fortnow, for his constant guidance, encouragement and support, and for the numerous discussions with him that provided the stimulation for this research. I would also like to thank my advisor Janos Simon. His influence on my research
	ftp://cs.uchicago.edu/pub/publications/tech-reports/TR-94-14.ps, 19940825 Beyond PNP = NEXP Stephen Fenner University of Southern Maine Computer Science Department 96 Falmouth St., Portland, ME 04103 Lance Fortnowy University of Chicago Department of Computer Science 1100 E. 58th St., Chicago, IL 60637 August 9, 1994 Classification: Computational Complexity
	ftp://cs.uchicago.edu/pub/publications/tech-reports/TR-94-06.ps, 19940826 Beyond Recursive Real Functions Chun-Kuen Hoy Department of Computer Science The University of Chicago 1100, East 58th Street Chicago, Illinois 60637 June 10, 1994
	ftp://cs.uchicago.edu/pub/publications/tech-reports/TR-94-03.ps, 19940826 A Kolmogorov Complexity proof of H astad's switching lemma An exposition Sophie Laplante June 20, 1994
	ftp://cs.uchicago.edu/pub/publications/tech-reports/TR-88-22.ps, 19940826 Practical Zero-Knowledge Proofs: Giving Hints and Using Deficiencies Joan Boyar, Katalin Friedl and Carsten Lund Computer Science Department University of Chicago August 4, 1994
	ftp://cs.uchicago.edu/pub/publications/tech-reports/TR-87-04.ps, 19941010 Survey of the Equational Logic Programming Project Michael J. O'Donnell The University of Chicago March, 1987
	ftp://cs.uchicago.edu/pub/publications/tech-reports/TR-87-03.ps, 19941010 Term-Rewriting Implementation of Equational Logic Programming Michael J. O'Donnell The University of Chicago 1987
	ftp://cs.uchicago.edu/pub/publications/tech-reports/TR-94-17.ps, 19941012 Intuitive Counterexamples for Constructive Fallacies James Lipton Wesleyan University Michael J. O'Donnell The University of Chicago Presented 25 August, 1994 This paper was presented at the Mathematical Foundations of Computer Science 1994 \| 19th International Symposium, MFCS '94, Ko>=sice, Slovakia,
	ftp://cs.uchicago.edu/pub/publications/tech-reports/TR-94-15.ps, 19941012 Introduction: Logic and Logic Programming Languages Michael J. O'Donnell Contents 1 Introduction : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : 2 1.1 Motivation : : : : : : : : : : : : : : : : : : : : : : : : : : : 2 1.2 A Notational Apology : : : : : : : : : : : : : : : : : : : : : 3 2
	ftp://cs.uchicago.edu/pub/publications/tech-reports/TR-94-16.ps, 19941012 Equational Logic Programming Michael J. O'Donnell Contents 1 Introduction : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : 2 1.1 Survey of Prerequisites : : : : : : : : : : : : : : : : : : : : : 2 1.2 Motivation for Programming with Equations : : : : : : : : 3 1.3 Outline of the Chapter : : :
	ftp://cs.uchicago.edu/pub/publications/tech-reports/TR-90-12.ps, 19941014 An Abstract Machine for Efficient Implementation of Term Rewriting David J. Sherman Robert I. Strandhy September 8, 1990
	ftp://cs.uchicago.edu/pub/publications/tech-reports/TR-90-19.ps, 19941014 Sharing Common Subexpressions in EM code Programs David J. Sherman University of Chicago Technical Report 90-019, May 27, 1990 For additional copies, write: Department of Computer Science University of Chicago 1100 E. 58th Street Chicago, Illinois 60637 U.S.A. Sharing Common Subexpressions in EM code
	ftp://cs.uchicago.edu/pub/publications/tech-reports/TR-90-13.ps, 19941014 Preliminary Notes on Version 4.1 of the Equational Compiler Linda Sellie and David J. Sherman University of Chicago Technical Report 90-013, January 9, 1990 For additional copies, write: Department of Computer Science University of Chicago 1100 E. 58th Street Chicago, Illinois 60637 U.S.A. Preliminary
	ftp://cs.uchicago.edu/pub/publications/tech-reports/TR-90-05.ps, 19941014 Developing an Interactive Interface for Equational Logic Programs Samuel A. Rebelsky David J. Sherman University of Chicago Technical Report 90-05, February 1990 For additional copies, write: Department of Computer Science University of Chicago 1100 E. 58th Street Chicago, Illinois 60637 U.S.A.
	ftp://cs.uchicago.edu/pub/publications/tech-reports/TR-90-28.ps, 19941017 Lazy Directed Congruence Closure David J. Sherman University of Chicago Technical Report 90-028, July 26, 1992 For additional copies, write: Department of Computer Science University of Chicago 1100 E. 58th Street Chicago, Illinois 60637 U.S.A. Lazy Directed Congruence Closure David J. Sherman July 26,
	ftp://cs.uchicago.edu/pub/publications/tech-reports/TR-93-11.ps, 19941103 Electronic Journals scholarly invariants in a changing medium M. J. O'Donnell The University of Chicago Revised July 1993 1 Introduction For several centuries, the printed journal has played a central and essential role in scholarly communication. In most scholarly disciplines, the accumulated contents
	ftp://cs.uchicago.edu/pub/publications/tech-reports/TR-94-18.ps, 19941103 Fault tolerant circuits and probabilistically checkable proofs Anna G al The University of Chicago Department of Computer Science 1100 E. 58th Street Chicago, IL 60637 panni@cs.uchicago.edu Mario Szegedy AT&T Bell Laboratories 600 Mountain Avenue Murray Hill NJ 07974 ms@research.att.com
	ftp://cs.uchicago.edu/pub/publications/tech-reports/TR-93-17.ps, 19941103 Fault tolerant circuits and probabilistically checkable proofs Anna G al The University of Chicago Department of Computer Science 1100 E. 58th Street Chicago, IL 60637 panni@cs.uchicago.edu Mario Szegedy AT&T Bell Laboratories 600 Mountain Avenue Murray Hill NJ 07974 ms@research.att.com
	ftp://cs.uchicago.edu/pub/publications/tech-reports/TR-92-07.ps, 19941103 Electronic Journals scholarly invariants in a changing medium M. J. O'Donnell The University of Chicago 1 Introduction For several centuries, the printed journal has played a central and essential role in scholarly communication. In most scholarly disciplines, the accumulated contents of some set of
	ftp://cs.uchicago.edu/pub/publications/tech-reports/TR-94-19.ps, 19941123 A note on adaptiveness and advice in coherence (Manuscript) Lance Fortnow fortnow@cs.uchicago.edu Sophie Laplante y sophie@cs.uchicago.edu University of Chicago Department of Computer Science 1100 East 58th Street Chicago, IL 60637 1 Preliminaries The concept of coherence for binary functions was
	ftp://cs.uchicago.edu/pub/publications/tech-reports/TR-94-20.ps, 19941128 The Isomorphism Conjecture Holds and One-way Functions Exist Relative to an Oracle John Rogers Department of Computer Science The University of Chicago 1100 East 58th Street Chicago, Illinois 60637 November 23, 1994
	ftp://cs.uchicago.edu/pub/publications/tech-reports/TR-94-21.ps, 19941201 Beating A Finite Automaton in the Big Match Lance Fortnow Peter Kimmely Department of Computer Science The University of Chicago 1100 East 58th Street Chicago, Illinois 60637 November 23, 1994
	ftp://cs.uchicago.edu/pub/publications/tech-reports/TR-94-23.ps, 19941201 Multiplicative equations over commuting matrices (Extended Abstract) L aszl o Babai1, Robert Beals2, Jin-yi Cai3, G abor Ivanyos4, Eugene M. Luks5 Mailing address: Robert Beals School of Mathematics Institute For Advanced Study Olden Lane Princeton, New Jersey, 08540 1Department of Computer Science,
	ftp://cs.uchicago.edu/pub/publications/tech-reports/TR-94-24.ps, 19941205 UNIVERSITY OF CHICAGO APPROXIMATION AND ONLINE ALGORITHMS FOR GRAPH PROBLEMS A DISSERTATION SUBMITTED TO THE FACULTY OF THE DIVISION OF THE PHYSICAL SCIENCES IN CANDIDACY FOR THE DEGREE OF DOCTOR OF PHILOSOPHY DEPARTMENT OF COMPUTER SCIENCE BY BARUN CHANDRA CHICAGO, ILLINOIS AUGUST 1994 ACKNOWLEDGEMENTS
	ftp://cs.uchicago.edu/pub/publications/tech-reports/TR-94-22.ps, 19941205 Simultaneous Messages vs. Communication L aszl o Babai Peter G. Kimmel Satyanarayana V. Lokam Department of Computer Science The University of Chicago 1100 East 58th Street Chicago, Illinois 60637
	ftp://cs.uchicago.edu/pub/publications/tech-reports/TR-95-01.ps, 19950119 Measure, Category and Learning Theory Lance Fortnow Department of Computer Science University of Chicago 1100 E. 58th St. Chicago, IL 60637 USA fortnow@cs.uchicago.edu R usi n<=s Freivaldsy Institute of Mathematics and Computer Science University of Latvia Rai na bulv aris 29 LV-1459, Riga, Latvia
	ftp://cs.uchicago.edu/pub/publications/tech-reports/TR-94-11.ps, 19950215 THE UNIVERSITY OF CHICAGO DECOMPOSITION OF MATRIX GROUPS AND ALGEBRAS A DISSERTATION SUBMITTED TO THE FACULTY OF THE DIVISION OF PHYSICAL SCIENCES IN CANDIDACY FOR THE DEGREE OF DOCTOR OF PHILOSOPHY DEPARTMENT OF COMPUTER SCIENCE BY KATALIN FRIEDL CHICAGO, ILLINOIS JUNE 1994 ACKNOWLEDGMENTS Foremost I
	ftp://cs.uchicago.edu/pub/publications/tech-reports/TR-94-12.ps, 19950308 Semi-unbounded fan-in circuits: Boolean vs. arithmetic Anna G al The University of Chicago Department of Computer Science 1100 E. 58th Street Chicago, IL 60637 panni@cs.uchicago.edu
	ftp://cs.uchicago.edu/pub/publications/tech-reports/TR-94-04.ps, 19950309 Simultaneous Messages vs. Communication L aszl o Babai Peter Kimmely Department of Computer Science The University of Chicago 1100 East 58th Street Chicago, Illinois 60637 DRAFT, March 11, 1994
	ftp://cs.uchicago.edu/pub/publications/tech-reports/TR-95-03.ps, 19950505 Spectral Methods for Matrix Rigidity with Applications to Size-Depth Tradeoffs and Communication Complexity Satyanarayana V. Lokam The University of Chicago April 25, 1995
	ftp://cs.uchicago.edu/pub/publications/tech-reports/TR-95-05.ps, 19950608 On Inverting Onto Functions Stephen A. Fenner 1 Lance Fortnow 2 Ashish V. Naik 3 John D. Rogers 4 June 8, 1995 1Department of Computer Science, University of Southern Maine, Portland, ME 04103. Research supported in part by NSF grant 92-09833. Email: fenner@usm.maine.edu 2Computer Science Department,
	ftp://cs.uchicago.edu/pub/publications/tech-reports/TR-95-04.ps, 19950608 Using Autoreducibility to Separate Complexity Classes Harry Buhrman Lance Fortnowy Leen Torenvlietz April 26, 1995
	ftp://cs.uchicago.edu/pub/publications/cjtcs/articles/1995/1/cj95-01.ps, 19950630 Chicago Journal of Theoretical Computer Science MIT Press Volume 1995, Article 1 30 June, 1995 ISSN 1073>=0486. MIT Press Journals, 55 Hayward St., Cambridge, MA 02142; (617)253-2889; journals-orders@mit.edu, journals-info@mit.edu. Published one article at a time in LATEX source form on the Internet.
	ftp://cs.uchicago.edu/pub/publications/tech-reports/TR-94-05.ps, 19950706 The Capacity and the Sensitivity of Color Histogram Indexing Markus Stricker Communications Technology Lab, ETH-Zentrum Gloriastr. 35 CH-8092 Zurich, Switzerland email: stricker@vision.ethz.ch Michael Swain Department of Computer Science, The University of Chicago 1100 East 58th Street Chicago, IL 60637
	ftp://cs.uchicago.edu/pub/publications/tech-reports/TR-96-02.ps, 19950710 THE UNIVERSITY OF CHICAGO HIELP, A FAST INTERACTIVE LAZY FUNCTIONAL LANGUAGE SYSTEM A DISSERTATION SUBMITTED TO THE FACULTY OF THE DIVISION OF PHYSICAL SCIENCES IN CANDIDACY FOR THE DEGREE OF DOCTOR OF PHILOSOPHY DEPARTMENT OF COMPUTER SCIENCE BY STEPHEN WILSON BAILEY CHICAGO, ILLINOIS JUNE 1995
	ftp://cs.uchicago.edu/pub/publications/cjtcs/articles/1995/2/cj95-02.ps, 19950721 Chicago Journal of Theoretical Computer Science MIT Press Volume 1995, Article 2 21 July, 1995 ISSN 1073>=0486. MIT Press Journals, 55 Hayward St., Cambridge, MA 02142; (617)253-2889; journals-orders@mit.edu, journals-info@mit.edu. Published one article at a time in LATEX source form on the Internet.
	ftp://cs.uchicago.edu/pub/publications/tech-reports/TR-95-06.ps, 19950807 On Reductions of P Sets to Sparse Sets Dieter van Melkebeek The University of Chicago June 18, 1995
	ftp://cs.uchicago.edu/pub/publications/tech-reports/TR-92-11.ps, 19950818 Short Presentations for Finite Groups L. Babai University of Chicago and E otv os University, Budapest A. J. Goodman University of Missouri-Rolla W. M. Kantor University of Oregon E. M. Luks University of Oregon P. P. P alfyy Mathematical Institute of the Hungarian Academy of Science, Budapest June 28,
	ftp://cs.uchicago.edu/pub/publications/tech-reports/TR-95-07.ps, 19950821 Easy Sets Without Easy Small Subsets Lance Fortnow Computer Science Department University of Chicago 1100 E. 58th Street Chicago, Illinois 60637 Classification: Computational Complexity
	ftp://cs.uchicago.edu/pub/publications/tech-reports/TR-95-08.ps, 19950831 THE UNIVERSITY OF CHICAGO COMBINATORIAL METHODS IN BOOLEAN FUNCTION COMPLEXITY A DISSERTATION SUBMITTED TO THE FACULTY OF THE DIVISION OF THE PHYSICAL SCIENCES IN CANDIDACY FOR THE DEGREE OF DOCTOR OF PHILOSOPHY DEPARTMENT OF COMPUTER SCIENCE BY ANNA G AL CHICAGO, ILLINOIS AUGUST 1995 ACKNOWLEDGEMENTS
	ftp://cs.uchicago.edu/pub/publications/cjtcs/articles/1995/3/cj95-03.ps, 19950920 Chicago Journal of Theoretical Computer Science The MIT Press Volume 1995, Article 3 20 September 1995 ISSN 1073>=0486. MIT Press Journals, 55 Hayward St., Cambridge, MA 02142 USA; (617)253-2889; journals-orders@mit.edu, journals-info@mit.edu. Published one article at a time in LATEX source form on the
	ftp://cs.uchicago.edu/pub/publications/cjtcs/articles/1995/4/cj95-04.ps, 19951019 Chicago Journal of Theoretical Computer Science The MIT Press Volume 1995, Article 4 19 October 1995 ISSN 1073>=0486. MIT Press Journals, 55 Hayward St., Cambridge, MA 02142 USA; (617)253-2889; journals-orders@mit.edu, journals-info@mit.edu. Published one article at a time in LATEX source form on the
	ftp://cs.uchicago.edu/pub/publications/tech-reports/TR-95-10.ps, 19951020 Deciding the Vapnik- ervonenkis dimension is p 3-complete Marcus Sch fer Department of Computer Science University of Chicago 1100 East 58th Street Chicago, Illinois 60637, USA schaefer@cs.uchicago.edu
	ftp://cs.uchicago.edu/pub/publications/tech-reports/TR-95-11.ps, 19951108 Distinguishing Complexity and Symmetry of Information Harry Buhrman CWI PO Box 94079 1090 GB Amsterdam The Netherlands Lance Fortnowy University of Chicago Department of Computer Science 1100 E. 58th St. Chicago, IL 60637 November 6, 1995
	ftp://cs.uchicago.edu/pub/publications/tech-reports/TR-96-01.ps, 19960119 gridIt 1.0 User Manual Bruce P. Ayati
	ftp://cs.uchicago.edu/pub/publications/cjtcs/articles/1995/cjtoc95.ps, 19960121 Chicago Journal of Theoretical Computer Science The MIT Press Volume 1995, Contents 31 December 1995 ISSN 1073>=0486. MIT Press Journals, 55 Hayward St., Cambridge, MA 02142; (617)253-2889; journals-orders@mit.edu, journals-info@mit.edu. Published one article at a time in LATEX source form on the
	ftp://cs.uchicago.edu/pub/publications/cjtcs/articles/1995/cjabs95.ps, 19960121 Chicago Journal of Theoretical Computer Science The MIT Press Volume 1995, Abstracts 31 December 1995 ISSN 1073>=0486. MIT Press Journals, 55 Hayward St., Cambridge, MA 02142; (617)253-2889; journals-orders@mit.edu, journals-info@mit.edu. Published one article at a time in LATEX source form on the
	ftp://cs.uchicago.edu/pub/publications/cjtcs/articles/1996/1/cj96-01.ps, 19960209 Chicago Journal of Theoretical Computer Science The MIT Press Volume 1996, Article 1 9 February 1996 ISSN 1073>=0486. MIT Press Journals, 55 Hayward St., Cambridge, MA 02142 USA; (617)253-2889; journals-orders@mit.edu, journals-info@mit.edu. Published one article at a time in LATEX source form on the
	ftp://cs.uchicago.edu/pub/publications/tech-reports/TR-96-04.ps, 19960221 Real-time Gesture Recognition with the Perseus System Roger E. Kahn, Michael J. Swain, Peter N. Prokopowicz, and R. James Firby kahn@cs.uchicago.edu, swain@cs.uchicago.edu, peterp@cs.uchicago.edu, and rby@cs.uchicago.edu The University of Chicago Computer Science Department 1100 East 58th Street
	ftp://cs.uchicago.edu/pub/publications/tech-reports/TR-96-05.ps, 19960222 Real-Time Case-Based Reasoning in a Complex World Mark J. Fasciano The University of Chicago Computer Science Department 1100 East 58th Street Chicago, Illinois 60637 Technical Report TR-96-05
	ftp://cs.uchicago.edu/pub/publications/tech-reports/TR-96-07.ps, 19960222 Everyday-world Plan Use Mark Fasciano The University of Chicago Computer Science Department 1100 East 58th Street Chicago, Illinois 60637 Technical Report TR-96-07
	ftp://cs.uchicago.edu/pub/publications/tech-reports/TR-96-06.ps, 19960222 Actualized Intelligence: Case-based Agency in Practice Kristian J. Hammond, Mark J. Fasciano, Daniel D. Fu, and Timothy Converse The University of Chicago Computer Science Department 1100 East 58th Street Chicago, Illinois 60637 Technical Report TR-96-06
	ftp://cs.uchicago.edu/pub/publications/tech-reports/TR-96-03.ps, 19960308 Navigation for everyday life Daniel D. Fu, Kristian J. Hammond, and Michael J. Swain The University of Chicago Computer Science Department 1100 East 58th Street Chicago, Illinois 60637 Technical Report TR-96-03 February 1996
	ftp://cs.uchicago.edu/pub/publications/tech-reports/TR-96-08.ps, 19960315 Interest-Focused Tutoring: A Tractable Approach to Modeling in Intelligent Tutoring Systems Robin Burke The University of Chicago, Computer Science Department 1100 East 58th Street, Chicago, Illinois 60637 burke@cs.uchicago.edu Alex Kass Institute for the Learning Sciences, Northwestern University, 1890
	ftp://cs.uchicago.edu/pub/publications/tech-reports/TR-96-09.ps, 19960319 Uniform Provability in Classical Logicy Gopalan Nadathur Department of Computer Science University of Chicago Ryerson Hall 1100 E 58th Street Chicago, IL 60637 Phone Number: (312)-702-3497 Fax Number: (312)-702-8487 Email: gopalan@cs.uchicago.edu
	ftp://cs.uchicago.edu/pub/publications/cjtcs/articles/1996/2/cj96-02.ps, 19960327 Chicago Journal of Theoretical Computer Science The MIT Press Volume 1996, Article 2 27 March 1996 ISSN 1073{0486. MIT Press Journals, 55 Hayward St., Cambridge, MA 02142 USA; (617)253-2889; journals-orders@mit.edu, journals-info@mit.edu. Published one article at a time in LATEX source form on the
	ftp://cs.uchicago.edu/pub/publications/tech-reports/TR-96-11.ps, 19960430 A Six Lecture Primer on Parallel Computing Sauro Succi1 Bruce P. Ayati2 A. E. Hosoi3 1IBM European Center for Science and Engineering Computing, Rome, Italy. Present address: Institute for Computing Applications, National Research Council, Rome, Italy 2Computational and Applied Mathematics Program, The
	ftp://cs.uchicago.edu/pub/publications/tech-reports/TR-96-10.ps, 19960501 Randomized Simultaneous Messages L aszl o Babai Peter G. Kimmely Department of Computer Science The University of Chicago 1100 East 58th Street Chicago, Illinois 60637 April 30, 1996
	ftp://cs.uchicago.edu/pub/publications/tech-reports/TR-96-12.ps, 19960510 Uniformly Hard Languages Rod Downey Department of Mathematics Victoria University P. O. Box 600, Wellington New Zealand Lance Fortnowy Department of Computer Science University of Chicago 1100 E. 58th St. Chicago, IL 60637 U. S. A. May 7, 1996
	ftp://cs.uchicago.edu/pub/publications/tech-reports/TR-96-13.ps, 19960611 A Fine-Grained Notation for Lambda Terms and Its Use in Intensional Operations Gopalan Nadathur Department of Computer Science University of Chicago Ryerson Hall, 1100 E. 58th Street Chicago, IL 60637 Tel: 312-702-3497 Fax: 312-702-8487 (gopalan@cs.uchicago.edu)
	ftp://cs.uchicago.edu/pub/publications/tech-reports/TR-96-15.ps, 19960724 Layer Formation in Monodispersive Suspensions and Colloids A. E. Hosoi Todd F. Duponty July 16, 1996
	ftp://cs.uchicago.edu/pub/publications/tech-reports/TR-96-14.ps, 19960805 WebSeer: An Image Search Engine for the World Wide Web1 Charles Frankel, Michael J. Swain, and Vassilis Athitsos The University of Chicago Computer Science Department 1100 East 58th Street Chicago, Illinois 60637 Technical Report 96-14 August 1, 1996
	ftp://cs.uchicago.edu/pub/publications/tech-reports/TR-96-17.ps, 19960905 ECHO: An Information Gathering Agent Xiaobin Fu Kristian J. Hammond Robin Burke The University of Chicago Computer Science Department 1100 East 58th Street Chicago, Illinois 60637 Technical Report TR-96-18 July 1996
	ftp://cs.uchicago.edu/pub/publications/tech-reports/TR-96-18.ps, 19960910 BuGS 1.0 User Guide Bruce P. Ayati
	ftp://cs.uchicago.edu/pub/publications/tech-reports/TR-96-16.ps, 19960927 Two Results on Resource-Bounded Measure Harry Buhrman Centrum voor Wiskunde en Informatica Stephen Fenner University of Southern Mainey Lance Fortnow Centrum voor Wiskunde en Informaticaz University of Chicagox
	ftp://cs.uchicago.edu/pub/publications/tech-reports/TR-96-20.ps, 19960927 Two Queries Harry Buhrman CWI PO Box 94079 1090 GB Amsterdam The Netherlands Lance Fortnowy CWI & University of Chicago Department of Computer Science 1100 E. 58th St. Chicago, IL 60637 September 25, 1996 1 Introduction Hemaspaandra, Hemaspaandra and Hempel showed that for k > 2, if P pk tt =
	ftp://cs.uchicago.edu/pub/publications/cjtcs/articles/1996/3/cj96-03.ps, 19961031 Chicago Journal of Theoretical Computer Science The MIT Press Volume 1996, Article 3 31 October 1996 ISSN 1073>=0486. MIT Press Journals, 55 Hayward St., Cambridge, MA 02142 USA; (617)253-2889; journals-orders@mit.edu, journals-info@mit.edu. Published one article at a time in LATEX source form on the
	ftp://cs.uchicago.edu/pub/publications/cjtcs/articles/1996/4/cj96-04.ps, 19961112 Chicago Journal of Theoretical Computer Science The MIT Press Volume 1996, Article 4 13 November 1996 ISSN 1073>=0486. MIT Press Journals, 55 Hayward St., Cambridge, MA 02142 USA; (617)253-2889; journals-orders@mit.edu, journals-info@mit.edu. Published one article at a time in LATEX source form on the
	ftp://cs.uchicago.edu/pub/publications/tech-reports/TR-96-23.ps, 19961112 Simultaneous Messages vs. Communication L aszl o Babaiy Anna G al z Peter G. Kimmelx Satyanarayana V. Lokam { Department of Computer Science The University of Chicago 1100 East 58th Street Chicago, Illinois 60637 November 12, 1996
	ftp://cs.uchicago.edu/pub/publications/tech-reports/TR-96-19.ps, 19961114 Combined Execution and Monitoring for Control of Autonomous Agents Charles Earl and R. James Firby University of Chicago Technical Report TR-96-19 November 1996 For additional copies, write to: Department of Computer Science University of Chicago 1100 E. 58th Street Chicago, Illinois 60637-1504 U.S.A.
	ftp://cs.uchicago.edu/pub/publications/tech-reports/TR-95-09.ps, 19961121 Anna G al The University of Chicago Department of Computer Science 1100 E. 58th Street Chicago, IL 60637 panni@cs.uchicago.edu
	ftp://cs.uchicago.edu/pub/publications/cjtcs/articles/1996/5/cj96-05.ps, 19961205 Chicago Journal of Theoretical Computer Science The MIT Press Volume 1996, Article 5 5 December 1996 ISSN 1073>=0486. MIT Press Journals, 55 Hayward St., Cambridge, MA 02142 USA; (617)253-2889; journals-orders@mit.edu, journals-info@mit.edu. Published one article at a time in LATEX source form on the
	ftp://cs.uchicago.edu/pub/publications/cjtcs/articles/1996/5/hoover.ps, 19961205 Hoover, Rudnicki Uniform Self-Stabilizing Orientation (Info) 1. ffl Printed name: H. James Hoover ffl Name for alphabetical collation: Hoover, H. James ffl Institution: University of Alberta ffl Department: Department of Computing Science ffl Address: , Edmonton Alberta, Canada T6G 2H1 ffl Email:
	ftp://cs.uchicago.edu/pub/publications/tech-reports/TR-96-26.ps, 19961212 Indistinguishability Sophie Laplante University of Chicago John Rogersy DePaul University December 4, 1996
	ftp://cs.uchicago.edu/pub/publications/tech-reports/TR-96-25.ps, 19961212 Extractors for Kolmogorov Complexity Lance Fortnow CWI & The University of Chicago Sophie Laplantey University of Chicago December 4, 1996
	ftp://cs.uchicago.edu/pub/publications/tech-reports/TR-96-24.ps, 19961216 Nondeterministic Polynomial Time versus Nondeterministic Logarithmic Space Lance Fortnow University of Chicago & CWI Dept. AA1 P.O. Box 94079 NL-1090 GB Amsterdam The Netherlands December 4, 1996
	ftp://cs.uchicago.edu/pub/publications/cjtcs/articles/1996/6/cj96-06.ps, 19961230 Chicago Journal of Theoretical Computer Science The MIT Press Volume 1996, Article 6 30 December 1996 ISSN 1073>=0486. MIT Press Journals, 55 Hayward St., Cambridge, MA 02142 USA; (617)253-2889; journals-orders@mit.edu, journals-info@mit.edu. Published one article at a time in LATEX source form on the
	ftp://cs.uchicago.edu/pub/publications/cjtcs/information/readerinfo/instruct-readers.ps, 19970103 Instructions for Readers The Chicago Journal of Theoretical Computer Science The MIT Press Michael J. O'Donnell The University of Chicago odonnell@cs.uchicago.edu Revised 1 January 1997 The Chicago Journal of Theoretical Computer Science is a peer-reviewed scholarly journal in theoretical computer
	ftp://cs.uchicago.edu/pub/publications/cjtcs/information/description.ps, 19970103 The Chicago Journal of Theoretical Computer Science A scholarly journal published on the Internet in LATEX format by The MIT Press Michael J. O'Donnell The University of Chicago odonnell@cs.uchicago.edu Revised 1 January 1997 The Chicago Journal of Theoretical Computer Science is a peer-reviewed
	ftp://cs.uchicago.edu/pub/publications/cjtcs/information/authorinfo/instruct-authors.ps, 19970103 Instructions for Authors The Chicago Journal of Theoretical Computer Science The MIT Press Michael J. O'Donnell The University of Chicago odonnell@cs.uchicago.edu 25 June, 1994 The Chicago Journal of Theoretical Computer Science is a peer-reviewed scholarly journal in theoretical computer science.
	ftp://cs.uchicago.edu/pub/publications/cjtcs/information/call-papers.ps, 19970103 CALL FOR PAPERS CALL FOR PAPERS (revised 1 January 1997) The Chicago Journal of Theoretical Computer Science The MIT Press The Chicago Journal of Theoretical Computer Science is a peer-reviewed scholarly journal in theoretical computer science. The journal is committed to providing a forum for
	ftp://cs.uchicago.edu/pub/publications/cjtcs/articles/1996/cjtoc96.ps, 19970107 Chicago Journal of Theoretical Computer Science The MIT Press Volume 1996, Contents 31 December 1996 ISSN 1073>=0486. MIT Press Journals, 55 Hayward St., Cambridge, MA 02142; (617)253-2889; journals-orders@mit.edu, journals-info@mit.edu. Published one article at a time in LATEX source form on the
	ftp://cs.uchicago.edu/pub/publications/cjtcs/articles/1996/cjabs96.ps, 19970107 Chicago Journal of Theoretical Computer Science The MIT Press Volume 1996, Abstracts 31 December 1996 ISSN 1073>=0486. MIT Press Journals, 55 Hayward St., Cambridge, MA 02142; (617)253-2889; journals-orders@mit.edu, journals-info@mit.edu. Published one article at a time in LATEX source form on the
	ftp://cs.uchicago.edu/pub/publications/tech-reports/TR-97-01.ps, 19970122 A Notation for Lambda Terms: A Generalization of Environments* Gopalan Nadathur Debra Sue Wilson Department of Computer Science IBM Corporation Ryerson Hall, 1100 E 58th Street TCJA/B631 D106 University of Chicago 4102 S. Miami Blvd. Chicago, IL 60637 Research Triangle Park, NC 27706
	ftp://cs.uchicago.edu/pub/publications/cjtcs/articles/1997/1/cj97-01.ps, 19970313 Chicago Journal of Theoretical Computer Science The MIT Press Volume 1997, Article 1 12 March 1997 ISSN 1073>=0486. MIT Press Journals, 55 Hayward St., Cambridge, MA 02142 USA; (617)253-2889; journals-orders@mit.edu, journals-info@mit.edu. Published one article at a time in LATEX source form on the
	ftp://cs.uchicago.edu/pub/publications/tech-reports/TR-97-02.ps, 19970501 NP Might Not Be As Easy As Detecting Unique Solutions Richard Beigel Yale University and U. Maryland Harry Buhrmanx CWI Lance Fortnow{ CWI and U. Chicago April 28, 1997
	ftp://cs.uchicago.edu/pub/publications/tech-reports/TR-97-03.ps, 19970505 A Symmetric Nine-State Automaton for the Generalized Firing Synchronization Problem Amber Settle settle@cs.uchicago.edu University of Chicago Department of Computer Science 1100 East 58th Street Chicago, IL 60637 May 2, 1997
	ftp://cs.uchicago.edu/pub/publications/cjtcs/articles/1997/2/cj97-02.ps, 19970602 Chicago Journal of Theoretical Computer Science The MIT Press Volume 1997, Article 2 3 June 1997 ISSN 1073>=0486. MIT Press Journals, Five Cambridge Center, Cambridge, MA 02142-1493 USA; (617)253-2889; journals-orders@mit.edu, journals-info@mit.edu. Published one article at a time in LATEX source form
	ftp://cs.uchicago.edu/pub/publications/tech-reports/TR-97-06.ps, 19970710 Simplicity and Strong Reductions Preliminary Draft Marcus Schaefer Department of Computer Science University of Southern Maine 96 Falmouth Street Portland, Maine 04103, USA schaefer@cs.uchicago.edu Stephen Fennery Department of Computer Science University of Southern Maine 96 Falmouth Street Portland,
	ftp://cs.uchicago.edu/pub/publications/tech-reports/TR-97-07.ps, 19970808 Realizing Modularity in >=Prolog Gopalan Nadathur and Guanshan Tong Department of Computer Science The University of Chicago Chicago, IL 60637 (773)702-3497, 2575 {gopalan, guanshan}@cs.uchicago.edu August 1997
	ftp://cs.uchicago.edu/pub/publications/tech-reports/TR-97-04.ps, 19970829 Complete Sets under Non-Adaptive Reductions are Scarce Harry Buhrman CWI Dieter van Melkebeeky CWI & The University of Chicago
	ftp://cs.uchicago.edu/pub/publications/tech-reports/TR-97-08.ps, 19970829 Non-Minimal Time Solutions for the Firing Synchronization Problem Amber Settle University of Chicago Janos Simon University of Chicagoy August 25, 1997
	ftp://cs.uchicago.edu/pub/publications/tech-reports/TR-97-09.ps, 19970917 Simple sets are not btt-cuppable Marcus Schaefer Department of Computer Science University of Chicago 1100 East 58th Street Chicago, Il 60637, USA schaefer@cs.uchicago.edu September 17, 1997
	ftp://cs.uchicago.edu/pub/publications/tech-reports/TR-97-11.ps, 19970929 Nonrelativizing Separations Harry Buhrman CWI PO Box 94079 1090 GB Amsterdam The Netherlands Lance Fortnowy CWI & University of Chicago Department of Computer Science 1100 E. 58th St. Chicago, IL 60637 Thomas Thieraufz Abt. Theoretische Informatik Universit at Ulm 89069 Ulm, Germany September 29, 1997
	ftp://cs.uchicago.edu/pub/publications/tech-reports/TR-97-10.ps, 19970929 A VARIABLE TIME STEP METHOD FOR AN AGE-DEPENDENT POPULATION MODEL WITH NONLINEAR DIFFUSION BRUCE P. AYATI
	ftp://cs.uchicago.edu/pub/publications/cjtcs/articles/1997/3/cj97-03.ps, 19971105 Chicago Journal of Theoretical Computer Science The MIT Press Volume 1997, Article 3 4 November 1997 ISSN 1073{0486. MIT Press Journals, Five Cambridge Center, Cambridge, MA 02142-1493 USA; (617)253-2889; journals-orders@mit.edu, journals-info@mit.edu. Published one article at a time in LATEX source
	ftp://cs.uchicago.edu/pub/publications/cjtcs/articles/1997/4/cj97-04.ps, 19971218 Chicago Journal of Theoretical Computer Science The MIT Press Volume 1997, Article 4 19 December 1997 ISSN 1073{0486. MIT Press Journals, Five Cambridge Center, Cambridge, MA 02142-1493 USA; (617)253-2889; journals-orders@mit.edu, journals-info@mit.edu. Published one article at a time in LATEX source
	ftp://cs.uchicago.edu/pub/publications/cjtcs/articles/1997/5/cj97-05.ps, 19971231 Chicago Journal of Theoretical Computer Science The MIT Press Volume 1997, Article 5 31 December 1997 ISSN 1073{0486. MIT Press Journals, Five Cambridge Center, Cambridge, MA 02142-1493 USA; (617)253-2889; journals-orders@mit.edu, journals-info@mit.edu. Published one article at a time in LATEX source