Browse

ftp://ftp.cs.rochester.edu (297)

	ftp://ftp.cs.rochester.edu/pub/papers/systems/91.ASPLOS.Contention-Free_Sync.ps.Z, 19910607 ing synchronization mechanisms in hardware. Recent work on weakly-consistent shared memory has suggested the need for synchronization fences" that provide clean points for memory semantics. Combining networks, likewise, may improve the performance of memory with bursty access patterns
	ftp://ftp.cs.rochester.edu/pub/papers/systems/91.TOCS.Scalable_Sync.ps.Z, 19910607 Algorithms for Scalable Synchronization on Shared-Memory Multiprocessors John M. Mellor-Crummey Michael L. Scotty January 1991
	ftp://ftp.cs.rochester.edu/pub/papers/systems/90.Comp_Sys.Psyche_Impl.ps.Z, 19910608 Implementation Issues for the Psyche Multiprocessor Operating System Michael L. Scott, Thomas J. LeBlanc, Brian D. Marsh, Timothy G. Becker, Cezary Dubnicki, Evangelos P. Markatos, and Neil G. Smithline University of Rochester Department of Computer Science Rochester, NY 14627
	ftp://ftp.cs.rochester.edu/pub/papers/systems/89.SOSP.ACE_NUMA.ps.Z, 19910608 R. Rashid, A. Tevanian, M. Young, D. Golub, R. Baron, D. Black, W. Bolosky, and J. Chew. Machine-Independent Virtual Memory Management for Paged Uniprocessor and Multiprocessor Architectures. IEEE Transactions on Computers, 37(8):89608, August 1988. J. Stone and A. Norton. The VM/EPEX FOR-
	ftp://ftp.cs.rochester.edu/pub/papers/systems/91.ASPLOS.NUMA_Policies.ps.Z, 19910608 page should be allowed to grow inconsistent, for example in sorbyc. Our experience strongly suggests, however, that the largest improvements in NUMA management will come from changes in program behavior to increase memory reference locality. References Mike Accetta, Robert Baron, William Bolosky,
	ftp://ftp.cs.rochester.edu/pub/papers/systems/88.ICPP.Psyche_Rationale.ps.Z, 19910608 Design Rationale for Psyche, a General-Purpose Multiprocessor Operating System Michael L. Scott, Thomas J. LeBlanc, and Brian D. Marsh University of Rochester Department of Computer Science Rochester, NY 14627
	ftp://ftp.cs.rochester.edu/pub/papers/systems/89.WWOS.Psyche_Open_System.ps.Z, 19910608 A Multi-User, Multi-Language Open Operating System (extended abstract) Michael L. Scott Thomas J. LeBlanc Brian D. Marsh University of Rochester Department of Computer Science Rochester, NY 14627 April 1989
	ftp://ftp.cs.rochester.edu/pub/papers/systems/90.PPOPP.Multi_Model_Psyche.ps.Z, 19910608 MULTI-MODEL PARALLEL PROGRAMMING IN PSYCHE Michael L. Scott, Thomas J. LeBlanc, and Brian D. Marsh Computer Science Department University of Rochester Rochester, New York 14627 {scott,leblanc,marsh}@cs.rochester.edu
	ftp://ftp.cs.rochester.edu/pub/papers/systems/89.CAN.Bridge.ps.Z, 19910610 Beyond Striping: The Bridge Multiprocessor File System Peter C. Dibble and Michael L. Scott Computer Science Department University of Rochester June 9, 1991
	ftp://ftp.cs.rochester.edu/pub/papers/systems/91.Comp_Lang.Lynx.ps.Z, 19910610 The Lynx Distributed Programming Language: Motivation, Design, and Experience Michael L. Scott University of Rochester Department of Computer Science Rochester, NY 14627 August 1990
	ftp://ftp.cs.rochester.edu/pub/papers/systems/90.TR.Bridge.ps.Z, 19910610 The Parallel Interleaved File System: A Solution to the Multiprocessor I/O Bottleneck Peter C. Dibble Michael L. Scott Computer Science Department University of Rochester April 1990
	ftp://ftp.cs.rochester.edu/pub/papers/systems/89.TR311.Psyche_VM.ps.Z, 19910613 MEMORY MANAGEMENT FOR LARGE-SCALE NUMA MULTIPROCESSORS Thomas J. LeBlanc Brian D. Marsh Michael L. Scott Computer Science Department University of Rochester Rochester, New York 14627 leblanc@cs.rochester.edu marsh@cs.rochester.edu scott@cs.rochester.edu March 1989
	ftp://ftp.cs.rochester.edu/pub/papers/systems/91.SOSP.Psyche_First_Class_Threads.ps.Z, 19910726 First-Class User-Level Threads Brian D. Marsh Michael L. Scott Thomas J. LeBlanc Evangelos P. Markatos Computer Science Department University of Rochester Rochester, NY 14627-0226 {marsh,scott,leblanc,markatos}@cs.rochester.edu
	ftp://ftp.cs.rochester.edu/pub/papers/systems/91.TR381.Crowl_thesis.ps.Z, 19910730 Architectural Adaptability in Parallel Programming by Lawrence Alan Crowl Submitted in Partial Fulfillment of the Requirements for the Degree Doctor of Philosophy Supervised by Thomas J. LeBlanc Department of Computer Science University of Rochester Rochester, New York May 1991 c 1991, Lawrence Alan
	ftp://ftp.cs.rochester.edu/pub/papers/systems/91.TR359.Control_Abstraction.ps.Z, 19910730 Architectural Adaptability in Parallel Programming via Control Abstraction Lawrence A. Crowl Thomas J. LeBlanc The University of Rochester Computer Science Department Rochester, New York 14627 Technical Report 359 January 1991
	ftp://ftp.cs.rochester.edu/pub/papers/systems/90.RTOSS.Adaptable_Real_Time.ps.Z, 19910731 Operating System Support for Adaptable Real-Time Systems Thomas J. LeBlanc Evangelos P. Markatos Computer Science Department University of Rochester Rochester, New York 14627 (716) 275-9491 {leblanc,markatos}@cs.rochester.edu
	ftp://ftp.cs.rochester.edu/pub/papers/systems/91.TR385.Multiprogramming_Multiprocessors.ps.Z, 19910731 Multiprogramming on Multiprocessors Mark Crovella Prakash Das Czarek Dubnicki Thomas LeBlanc Evangelos Markatos The University of Rochester Computer Science Department Rochester, New York 14627 Technical Report 385 February 1991 (revised May 1991)
	ftp://ftp.cs.rochester.edu/pub/papers/systems/91.RTOSS.Priority_Spinlocks.ps.Z, 19910731 can be used in multiprocessors with and without coherent caches. 7 Acknowledgments I would like to thank Tom LeBlanc, Michael Scott and John Mellor-Crummey for valuable discussions and suggestions in earlier drafts of this paper. The material in this paper is based upon work supported by the National
	ftp://ftp.cs.rochester.edu/pub/papers/systems/91.TR380.Barrier_Multiprogramming.ps.Z, 19910801 The value of R determines how quickly the application runs. The application always acheives R barriers every 2R 1 quanta. For shorthand we will use L for 2R 1. The complete solution to the recurrence is then: tn = n L R+ ( nmodL 2 + 1 if n mod L even (nmodL)+1 2 Q if n mod L odd In this expression, the
	ftp://ftp.cs.rochester.edu/pub/papers/systems/91.TR403.Optimal_Analysis.ps.Z, 19911220 Evaluation of Multiprocessor Memory Systems Using Off-Line Optimal Behavior William J. Bolosky and Michael L. Scott Computer Science Department University of Rochester Rochester, NY 14627-0226 fbolosky,scottg@cs.rochester.edu September 1991 This work was supported in part by a DARPA/NASA Research
	ftp://ftp.cs.rochester.edu/pub/papers/systems/92.Computer.Psyche_Animate_Vision.ps.Z, 19920114 Multi-Model Parallel Programming for Animate Vision 1 By Brian Marsh, Chris Brown, Thomas LeBlanc, Michael Scott, Tim Becker, Cesar Quiroz, Prakash Das, and Jonas Karlsson 1 Introduction Vision can be viewed as a passive, observation-oriented activity, or as one intimately related to action (e.g.,
	ftp://ftp.cs.rochester.edu/pub/papers/systems/92.Memory-Conscious_Scheduling.ps.Z, 19920114 Memory-Conscious Scheduling in Shared-Memory Multiprocessors Evangelos P. Markatos Thomas J. LeBlanc markatos@cs.rochester.edu leblanc@cs.rochester.edu Computer Science Department University of Rochester Rochester, NY 14627
	ftp://ftp.cs.rochester.edu/pub/papers/systems/92.TR399.locality_vs_load_balancing.ps.Z, 19920114 Load Balancing vs. Locality Management in Shared-Memory Multiprocessors Evangelos P. Markatos Thomas J. LeBlanc markatos@cs.rochester.edu leblanc@cs.rochester.edu The University of Rochester Computer Science Department Rochester, New York 14627 Technical Report 399 October 1991
	ftp://ftp.cs.rochester.edu/pub/papers/systems/92.JPDC.Psyche_Checkers.ps.Z, 19920114 M. L. Scott, T. J. LeBlanc, and B. D. Marsh. Multi-Model Parallel Programming in Psyche. In Proc. of the Second ACM/SIGPLAN Symp. on Principles and Practice of Parallel Programming, pages 70-78, Seattle, WA, March 1990. M. L. Scott. The Lynx Distributed Programming Language: Motivation,
	ftp://ftp.cs.rochester.edu/pub/papers/systems/92.SEDMS.PLAT_Exceptions.ps.Z, 19920117 Supporting User-Level Exception Handling on a Multiprocessor Micro-Kernel: Experiences with PLATINUM Robert J. Fowler and Leonidas I. Kontothanassis Department of Computer Science University of Rochester Rochester, New York 14627 fowler@cs.rochester.edu, kthanasi@cs.rochester.edu
	ftp://ftp.cs.rochester.edu/pub/papers/systems/92.ISCA.adjust_caches.ps.Z, 19920312 Adjustable Block Size Coherent Caches Czarek Dubnicki Thomas J. LeBlanc Department of Computer Science University of Rochester Rochester, New York 14627-0226
	ftp://ftp.cs.rochester.edu/pub/papers/systems/92.WWOS.commonplace_shared_memory.ps.Z, 19920319 Position Paper: Shared Memory Ought to be Commonplace Michael L. Scott William Garrett University of Rochester Computer Science Department Rochester, NY 14627-0226 {scott,garrett}@cs.rochester.edu Shared memory as a programming abstraction is widely used within parallel applications. It is not widely
	ftp://ftp.cs.rochester.edu/pub/papers/systems/92.TR418.sharing.ps.Z, 19920501 Dynamic Sharing and Backward Compatibility on 64-Bit Machines William E. Garrett, Ricardo Bianchini, Leonidas Kontothanassis, R. Andrew McCallum, Jeffery Thomas, Robert Wisniewski, and Michael L. Scott TR 418 April 1992 University of Rochester Computer Science Department Rochester, NY 14627-0226
	ftp://ftp.cs.rochester.edu/pub/papers/systems/92.shared_memory_vs_message_passing.ps.Z, 19920508 Shared Memory vs. Message Passing in Shared-Memory Multiprocessors Thomas J. LeBlanc Evangelos P. Markatos leblanc@cs.rochester.edu markatos@cs.rochester.edu Computer Science Department University of Rochester Rochester, NY 14627 April 30, 1992
	ftp://ftp.cs.rochester.edu/pub/papers/systems/92.TR420_interaction_architecture_parallel.ps.Z, 19920513 C. D. Polychronopoulos and D. J. Kuck. Guided Self-Scheduling: A Practical Scheduling Scheme for Parallel Supercomputers". IEEE Transactions on Computers, C-36(12), December 1987. Randall Rettberg and Robert Thomas. Contention is no Obstacle to Shared-Memory Multiprocessing". Communications
	ftp://ftp.cs.rochester.edu/pub/papers/systems/92.TR414.Perf.Eval.Hybrid.Protocols.ps.Z, 19920514 James M. Ortega and Robert G. Voigt. Solution of Partial Differential Equations on Vector an d Parallel Computers. SIAM Review, 27(2):14940, June 1985. J. P. Singh, W.-D. Weber, and A. Gupta. SPLASH: Stanford Parallel Applications for Shared-Memory. Available by anonymous FTP, April 1991.
	ftp://ftp.cs.rochester.edu/pub/papers/robotics/92.tr416.context_dep_control_strategies.ps.Z, 19920519 Contextually Dependent Control Strategies for Manipulation Polly K. Pook and Dana H. Ballard TR 416 Department of Computer Science University of Rochester Rochester, New York 14627 E-mail: pook@cs.rochester.edu or dana@cs.rochester.edu Keywords: Dexterous Manipulation, Grasping, Utah/MIT hand
	ftp://ftp.cs.rochester.edu/pub/papers/systems/92.tr413.multi_model_parallel_programming.ps.Z, 19920519 Multi{Model Parallel Programming by Brian D. Marsh Submitted in Partial Fulfillment of the Requirements for the Degree Doctor of Philosophy Supervised by Thomas J. LeBlanc Department of Computer Science University of Rochester Rochester, New York January 1992 This work was supported by the University of
	ftp://ftp.cs.rochester.edu/pub/papers/theory/92.tr417.reductions_sets_low_inf.ps.Z, 19920521 Reductions to Sets of Low Information Content V. Arvind y Y. Hanz L. Hemachandraz J. Kobler x A. Lozano{ M. Mundhenk x M. Ogiwara == U. Schoning x R. Silvestri T. Thierauf yy April 13, 1992 Some of these results will be presented at the 19th International Colloquium on Automata, Languages, and
	ftp://ftp.cs.rochester.edu/pub/papers/ai/92.tr407.set_based_bayesianism.ps.Z, 19920521 SET-BASED BAYESIANISM Henry E. Kyburg, Jr. Michael Pittarelli - 2 - SET-BASED BAYESIANISM
	ftp://ftp.cs.rochester.edu/pub/papers/theory/92.tr419.access_unambig_computation.ps.Z, 19920521 Promise Problems and Access to Unambiguous Computation Jin-yi Cai1 Department of Computer Science Princeton University Princeton, NY 08544 Lane A. Hemachandra2 and Jozef Vysko<=c3 Department of Computer Science University of Rochester Rochester, NY 14627 April 24, 1992 1Research supported in part by the
	ftp://ftp.cs.rochester.edu/pub/papers/theory/92.tr422.probabilistic_commun_complexity.ps.Z, 19920604 Lower Bounds for One-way Probabilistic Communication Complexity Farid Ablayev Department of Theoretical Cybernetics Kazan University Kazan 420008, Russia May 29, 1992 We prove three different types of complexity lower bounds for the one-way unboundederror and bounded-error error probabilistic
	ftp://ftp.cs.rochester.edu/pub/papers/theory/92.tr423.probabilistic_space_complexity.ps.Z, 19920605 Lower Bounds for Probabilistic Space Complexity: Automata Approach (Extended Abstract) Farid Ablayev Department of Theoretical Cybernetics Kazan University Kazan 420008, Russia May 29, 1992 1 Preliminaries The purpose of this paper is to examine the two domains of probabilistic and deterministic
	ftp://ftp.cs.rochester.edu/pub/papers/ai/92.poesio.SALT92.ps.Z, 19920605 On Telescoping Massimo Poesio University of Rochester Alessandro Zucchi Stanford University 1 The Problem The phenomenon we discuss is illustrated by the contrast in (1)-(8) (we use coindexing to indicate intuitive binding): (1) Every dogi came in. Iti lay down under the table. (2) *If every cati purrs,
	ftp://ftp.cs.rochester.edu/pub/papers/ai/92.tr425.conversation_acts.ps.Z, 19920609 Conversation Acts in Task-Oriented Spoken Dialogue David R. Traumy Elizabeth A. Hinkelmanz Computer Science Department DFKI University of Rochester Stuhlsatzenhausweg 3 Rochester, New York 14627 D-W-6600 Saarbruecken 11, USA Germany traum@cs.rochester.edu hinkelman@dfki.uni-sb.de Technical Report 425
	ftp://ftp.cs.rochester.edu/pub/papers/systems/92.tr400.adjustable_block_size_caches.ps.Z, 19920610 Reconciling Sharing and Spatial Locality Using Adjustable Block Size Coherent Caches Cezary Dubnicki and Thomas J. LeBlanc The University of Rochester Computer Science Department Rochester, New York 14627 Technical Report 400 November 1991 (revised February 1992)
	ftp://ftp.cs.rochester.edu/pub/papers/theory/92.tr409.heap_construction.ps.Z, 19920610 N. S. V. Rao and W. Zhang. Building heaps in parallel. Info. Proc. Lett., 37:35558, 1991. Rudiger Reischuk. Probabilistic parallel algorithms for sorting and selection. SIAM J. On Computing, 14(2):39609, May 1985. Leslie G. Valiant. Parallelism in comparison problems. SIAM J. On
	ftp://ftp.cs.rochester.edu/pub/papers/robotics/92.tr427.Polhemus_coordinates.ps.Z, 19920611 Polhemus Coordinates and Polhemus-Puma Conversion Man-Wai Chu The University of Rochester Computer Science Department Rochester, New York 14627 Technical Report 427 June 1992
	ftp://ftp.cs.rochester.edu/pub/papers/ai/92.tr428.assumption_based_plan_rsng.ps.Z, 19920611 Explicit Representation of Events, Actions, and Plans for Assumption-Based Plan Reasoning George Ferguson The University of Rochester Computer Science Department Rochester, New York 14627 Technical Report 428 June 1992
	ftp://ftp.cs.rochester.edu/pub/papers/robotics/92.tr415.real_time_gaze_holding_nofigures.ps.Z, 19920612 Real-time Gaze Holding in Binocular Robot Vision by David John Coombs Submitted in Partial Fulfillment of the Requirements for the Degree Doctor of Philosophy Supervised by Christopher M. Brown Department of Computer Science University of Rochester Rochester, New York June 1992 Acknowledgments I would
	ftp://ftp.cs.rochester.edu/pub/papers/ai/92.tr405.moving_light_displays.ps.Z, 19920612 The Perception of Articulated Motion: Recognizing Moving Light Displays by Nigel H. Goddard Submitted in Partial Fulfillment of the Requirements for the Degree DOCTOR OF PHILOSOPHY Supervised by Jerome A. Feldman Department of Computer Science University of Rochester Rochester, New York April 1992
	ftp://ftp.cs.rochester.edu/pub/papers/robotics/92.tr415.real_time_gaze_holding.ps.Z, 19920612 Real-time Gaze Holding in Binocular Robot Vision by David John Coombs Submitted in Partial Fulfillment of the Requirements for the Degree Doctor of Philosophy Supervised by Christopher M. Brown Department of Computer Science University of Rochester Rochester, New York June 1992 Acknowledgments I would
	ftp://ftp.cs.rochester.edu/pub/papers/theory/92.tr430.defying_upward_downward_separation.ps.Z, 19920619 Defying Upward and Downward Separation Lane A. Hemachandrayand Sudhir K. Jhaz Department of Computer Science University of Rochester Rochester, NY 14627 June 18, 1992
	ftp://ftp.cs.rochester.edu/pub/papers/systems/92.tr411.processor_cache_locality.ps.Z, 19920619 Carl Hewitt. Viewing control structures as patterns of passing messages. Artificial Intelligence, 8:32364, 1977. T. J. LeBlanc. Shared memory versus message passing in a tightly-coupled multiprocessor: A case study. In Proceedings of the 1986 International Conference on Parallel
	ftp://ftp.cs.rochester.edu/pub/papers/systems/92.TR410.loop_scheduling.ps.Z, 19920624 T.G. Lewis and H. El-Rewini, Introduction to Parallel Computing, Prentice Hall, Englewood Cliffs, NJ, 1992. Steven Lucco, A Dynamic Scheduling Method for Irregular Parallel Programs," In ACM SIG- PLAN '92 Conference on Programming Language Design and
	ftp://ftp.cs.rochester.edu/pub/papers/theory/91.tr386.lower_bound_closest_pair_problem.ps.Z, 19920630 A Lower Bound for the Closest Pair Problem Catherine Chronaki Evangelos Markatos The University of Rochester Computer Science Department Rochester, New York 14627 Technical Report 386 August 1991
	ftp://ftp.cs.rochester.edu/pub/papers/theory/92.tr433.selection_sorting_routing_mesh_connected_processor_arrays.ps.Z, 19920723 1 Selection, Sorting, and Routing on Mesh-Connected Processor Arrays by Lata Narayanan Submitted in Partial Fulfillment of the Requirements for the Degree Doctor of Philosophy Supervised by Danny Krizanc Department of Computer Science University of Rochester Rochester, New York May
	ftp://ftp.cs.rochester.edu/pub/papers/systems/92.tr432.trace_based_comparison of shared_memory_multiprocessors.ps.Z, 19920727 1 2 5 Page or Line Size 32 64 128 256 512 1K 2K 4K 8K ffl ffl ffl ffl ffl ffl ffl ffl ffl ffl ffl ffl ffl ffl ffl ffl ffl ffl ffl ffl ffl ffl ffl ffl ffl ffl ffl DSM ffl ffl DSM+ ffl ffl NUMA CC ffl ffl CC+ Figure 20: water 10 100
	ftp://ftp.cs.rochester.edu/pub/papers/systems/90.tr356.interprocessor_invoc_on_a_NUMA_multiprocessor.ps.Z, 19920902 Interprocessor Invocation on a NUMA Multiprocessor Alan L. Cox Robert J. Fowler Jack E. Veenstra The University of Rochester Computer Science Department Rochester, New York 14627 Technical Report 356 September 1992
	ftp://ftp.cs.rochester.edu/pub/papers/systems/92.SPDP.shared_memory_vs_message_passing.ps.Z, 19920908 scheduling the threads of a shared-memory program using the same principles of locality employed in the message-passing model, it is possible to both exploit locality and balance the load. Programs based on this new model perform well on a wide range of architectures, regardless of the degree of load
	ftp://ftp.cs.rochester.edu/pub/papers/robotics/92.tr437.robot_skill_learning_and_basis_function_choice.ps.Z, 19920914 S. Kawamura, F. Miyazaki, and S. Arimoto, Realization of Robot Motion Based on a Learning Method," IEEE Transactions on Systems, Man, and Cybernetics, 18(1), 1988. J. Lloyd and V. Hayward, Real-Time Trajectory Generation Using Blend Functions," In
	ftp://ftp.cs.rochester.edu/pub/papers/ai/92.tr438.believing_on_the_basis of the_evidence.ps.Z, 19920917 1 Believing on the Basis of the Evidence* Henry E. Kyburg, Jr. 1. Introduction Do you believe that the temperature is between 64 F and 66 F when your well calibrated thermometer reads 65.1 F Do you believe that it will rain tomorrow when the newspaper forecasts rain Many of us would reply affirmatively
	ftp://ftp.cs.rochester.edu/pub/papers/systems/92.tr429.fast_contention_free_combining_tree_barriers.ps.Z, 19921001 Fast, Contention-Free Combining Tree Barriers Michael L. Scott Computer Science Department University of Rochester Rochester, NY 14627-0226 scott@cs.rochester.edu John M. Mellor-Crummey Computer Science Department Rice University, P.O. Box 1892 Houston, TX 77251 johnmc@cs.rice.edu June 1992
	ftp://ftp.cs.rochester.edu/pub/papers/ai/90.tr363.Rhet_programmers_guide.ps.Z, 19921006 INDEX 91 (Typea:Set-RType-Relation), 65 (Typea:Utype), 33 (UI-Indexify), 28 (UI:Builtin-Trigger-Exception-List), 14 (UI:Make-Rhet-Readtable-Global), 77 (UI:Cons-Rhet-Axiom), 27 (UI:Cons-Rhet-Form), 23, 27 (UI:Grab-Context), 27 (UI:Grab-Key), 27 (UI:Real-Rhet-Object), 27 (UI:Truncate-Keywords), 28
	ftp://ftp.cs.rochester.edu/pub/papers/ai/90.tr326.Rhet_ref_manual.ps.Z, 19921006 116 INDEX (Type-Supertype), 63 , 28 (Typecompat), 62 (Types), 63 UContext, 46 (UContext), 37, 47, 95 (UContext-P), 46, 47 (UContexts), 47 unbound, 73 unification, 15, 16, 63 unifier, 15, 16, 47, 52 (Unify), 47 , 28 unify, 12, 24, 28, 38, 52, 94, 95 union, 57 , 33, 67
	ftp://ftp.cs.rochester.edu/pub/papers/ai/90.tr298.Rhet_plan_recognition_system.ps.Z, 19921006 The RHET Plan Recognition System Version 1.0 Bradford W. Miller The University of Rochester Computer Science Department Rochester, New York 14627 Technical Report 298 October 1992
	ftp://ftp.cs.rochester.edu/pub/papers/ai/91.tr325.Rhet_tutorial.ps.Z, 19921006 The RHET System: A Sequence of Self-Guided Tutorials James F. Allen and Bradford W. Miller The University of Rochester Computer Science Department Rochester, New York 14627 Technical Report 325 July 1991
	ftp://ftp.cs.rochester.edu/pub/papers/systems/91.PPOPP.Read_Write_Sync.ps.Z, 19921008 References A. Agarwal and M. Cherian. Adaptive backoff synchronization techniques. In Proceedings of the International Symposium on Computer Architecture, pages 39606, May 1989. T. E. Anderson. The performance of spin lock alternatives for shared-memory multiprocessors. IEEE Transactions on
	ftp://ftp.cs.rochester.edu/pub/papers/systems/89.TR309.Psyche_Evolution.ps.Z, 19921008 Evolution of an Operating System for Large-Scale Shared-Memory Multiprocessors Michael L. Scott Thomas J. LeBlanc Brian D. Marsh University of Rochester Department of Computer Science Rochester, NY 14627 scott@cs.rochester.edu leblanc@cs.rochester.edu marsh@cs.rochester.edu March 1989
	ftp://ftp.cs.rochester.edu/pub/papers/theory/92.tr439.eliminating_amortization.ps.Z, 19921026 Eliminating Amortization: On Data Structures with Guaranteed Response Time by Rajeev Raman Submitted in Partial Fulfillment of the Requirements for the Degree Doctor of Philosophy Supervised by Paul F. Dietz Department of Computer Science College of Arts and Science University of Rochester Rochester,
	ftp://ftp.cs.rochester.edu/pub/papers/robotics/92.tr442.head-centered_orientation_strategies_in_animate_vision.ps.Z, 19921026 Head-Centered Orientation Strategies in Animate Vision Enrico Grosso and Dana H. Ballard The University of Rochester Computer Science Department Rochester, New York 14627 Technical Report 442 October 1992
	ftp://ftp.cs.rochester.edu/pub/papers/theory/92.tr443.threshold_computation_crypt_security.ps.Z, 19921116 Threshold Computation and Cryptographic Security1 Yenjo Han and Lane A. Hemachandra Department of Computer Science University of Rochester Rochester, NY 14627 USA Thomas Thierauf 2 Abteilung fur Theoretische Informatik Universitat Ulm 7900 Ulm, Germany Nov. 12, 1992 1Research supported in part by the
	ftp://ftp.cs.rochester.edu/pub/papers/robotics/92.tr434.exploiting_world_structure.ps.Z, 19921123 Exploiting World Structure to Efficiently Search for Objects Lambert E. Wixson wixson@cs.rochester.edu The University of Rochester Computer Science Department Rochester, New York 14627 Technical Report 434 July 1992
	ftp://ftp.cs.rochester.edu/pub/papers/theory/92.tr445.closure_properties of #P.ps.Z, 19921210 On Closure Properties of #P in the Context of PF ffi #P Mitsunori Ogiwara Dept. Computer Science Univ. Electro-Communications (ogiwara@cs.uec.ac.jp) Thomas Thierauf Fakultat fur Informatik Universtat Ulm (thierauf@informatik.uni-ulm.de) Seinosuke Toda Dept. Computer Science Univ.
	ftp://ftp.cs.rochester.edu/pub/papers/ai/92.tr446.utile_distinction_memory_for_reinforcement_learning.ps.Z, 19921214 Steven Whitehead. Reinforcement Learning for the Adaptive Control of Perception and Action. PhD thesis, Department of Computer Science, University of Rochester, 1992. Richard Yee. Abstraction in control learning. Technical Report 92-16, COINS, University of Massachusetts,
	ftp://ftp.cs.rochester.edu/pub/papers/ai/92.tr391.evidence_combination_methods.ps.Z, 19930119 Investigation of Evidence Combination Methods in Evidential Probability Bulent Murtezao>=glu mucit@cs.rochester.edu May 1991 (Revised December 1992)
	ftp://ftp.cs.rochester.edu/pub/papers/systems/93.USENIX.Linking_shared_segments.ps.Z, 19930119 Linking Shared Segments W. E. Garrett, M. L. Scott, R. Bianchini, L. I. Kontothanassis, R. A. McCallum, J. A. Thomas, R. Wisniewski and S. Luk University of Rochester
	ftp://ftp.cs.rochester.edu/pub/papers/systems/92.supercomputing.loop_scheduling.ps.Z, 19930222 percentage of an application's execution time; scheduling methods that reduce both communication and synchronization overhead are going to have an even greater impact in the future. ffl Affinity scheduling simultaneously balances overhead due to synchronization, communication, and load imbalance.
	ftp://ftp.cs.rochester.edu/pub/papers/ai/93.tr421.computational_theory of lexical_relatedness.ps.Z, 19930311 A Computational Theory of Lexical Relatedness Marc Light The University of Rochester Computer Science Department Rochester, New York 14627 Technical Report 421 February 1993
	ftp://ftp.cs.rochester.edu/pub/papers/systems/92.ICPP.locality_vs_load_balancing.ps.Z, 19930319 Uniform Execution Times Geometric Execution Times 10 20 30 40 50 60 70 2 4 6 8 10 Time remote to local access cost LB:AM 3 333 3 3 3 3 MCS:AM + MCS:NM 2 222 2 2 2 2 MCS:BM Figure 5: Locality Model 1. 20 40 60 80 100 2 4 6 8 10 Time remote to local access cost LB:AM 3 333 3 3 3 3 MCS:AM +
	ftp://ftp.cs.rochester.edu/pub/papers/systems/93.tr449.alleviating_memory_contention.ps.Z, 19930402 Alleviating Memory Contention in Matrix Computations on Large-Scale Shared-Memory Multiprocessors Ricardo Bianchini, Mark E. Crovella, Leonidas Kontothanassis and Thomas J. LeBlanc fricardo,crovella,kthanasi,leblancg@cs.rochester.edu The University of Rochester Computer Science Department Rochester, New
	ftp://ftp.cs.rochester.edu/pub/papers/theory/93.tr450.fault_tolerance_and_complexity.ps.Z, 19930402 Fault-Tolerance and Complexity Lane A. Hemachandray Department of Computer Science University of Rochester Rochester, NY 14627 April 2, 1993
	ftp://ftp.cs.rochester.edu/pub/papers/theory/93.tr441.closure_properties of stochastic_languages.ps.Z, 19930407 Closure Properties of Stochastic Languages Ioan Macarie The University of Rochester Computer Science Department Rochester, New York 14627 Technical Report 441 March 1993
	ftp://ftp.cs.rochester.edu/pub/papers/theory/93.tr447.promises_and_fault_tolerant_database_access.ps.Z, 19930409 46 REFERENCES G. Tardos. Query complexity, or why is it difficult to separate NPA T coNPA from PA by random oracles A. Combinatorica, 9:38592, 1989. L. Valiant. The relative complexity of checking and evaluating. Information Processing Letters, 5:203, 1976. K. Wagner. Bounded
	ftp://ftp.cs.rochester.edu/pub/papers/systems/93.WPDD.performance_predicates.ps.Z, 19930422 Performance Debugging using Parallel Performance Predicates Mark E. Crovella and Thomas J. LeBlanc Department of Computer Science University of Rochester Rochester, New York 14627 fcrovella,leblancg@cs.rochester.edu
	ftp://ftp.cs.rochester.edu/pub/papers/systems/93.tr451.beyond_data_parallelism.ps.Z, 19930422 BEYOND DATA PARALLELISM: The Advantages of Multiple Parallelizations in Combinatorial Search Lawrence A. Crowl Mark E. Crovella Thomas J. LeBlanc Michael L. Scott The University of Rochester Computer Science Department Rochester, New York 14627 Technical Report 451y April 1993
	ftp://ftp.cs.rochester.edu/pub/papers/systems/93.tr456.software_coherence_in_multiprocessor_memory_systems.ps.Z, 19930507 Software Coherence in Multiprocessor Memory Systems by William Joseph Bolosky Submitted in Partial Fulfillment of the Requirements for the Degree Doctor of Philosophy Supervised by Professor Michael L. Scott Department of Computer Science College of Arts and Science University of Rochester Rochester,
	ftp://ftp.cs.rochester.edu/pub/papers/ai/93.tr436.parallel_genetic_algorithms.ps.Z, 19930514 Parallel Genetic Algorithms on Distributed-Memory Architectures Ricardo Bianchini and Christopher Brown The University of Rochester Computer Science Department Rochester, New York 14627 Technical Report 436 (Revised Version) May 1993
	ftp://ftp.cs.rochester.edu/pub/papers/ai/93.tn1.performance of temporal_reasoning_systems.ps.Z, 19930514 Performance of Temporal Reasoning Systems Ed Yampratoom James F. Allen The University of Rochester Computer Science Department Rochester, New York 14627 TRAINS Technical Note 93-1 May 1993
	ftp://ftp.cs.rochester.edu/pub/papers/systems/93.tr457.scheduling_for_locality_in_shared_memory_multiprocessors.ps.Z, 19930521 Scheduling for Locality in Shared-Memory Multiprocessors by Evangelos Markatos Submitted in Partial Fulfillment of the Requirements for the Degree Doctor of Philosophy Supervised by Thomas J. LeBlanc Department of Computer Science College of Arts and Science University of Rochester Rochester, New York
	ftp://ftp.cs.rochester.edu/pub/papers/theory/93.tr455.beta_k_complete_problems_and_greediness.ps.Z, 19930524 k-Complete Problems and Greediness Robert Szelepcs enyi Department of Computer Science University of Rochester Rochester, NY 14627, USA
	ftp://ftp.cs.rochester.edu/pub/papers/systems/93.tr448.memory_contention_in_scalable_cache_coherent_multiprocessors.ps.Z, 19930602 Memory Contention in Scalable Cache-Coherent Multiprocessors Ricardo Bianchini, Mark E. Crovella, Leonidas Kontothanassis and Thomas J. LeBlanc fricardo,crovella,kthanasi,leblancg@cs.rochester.edu The University of Rochester Computer Science Department Rochester, New York 14627 Technical Report 448
	ftp://ftp.cs.rochester.edu/pub/papers/systems/93.tr460.fast_mutual_exclusion_even_with_contention.ps.Z, 19930624 Fast Mutual Exclusion, Even With Contention Maged M. Michael Michael L. Scott Computer Science Department University of Rochester Rochester, NY 14627-0226 fmichael,scottg@cs.rochester.edu June 1993
	ftp://ftp.cs.rochester.edu/pub/papers/theory/93.tr461.threshold_computation_and_cryptographic_security.ps.Z, 19930701 Threshold Computation and Cryptographic Security Yenjo Han and Lane A. Hemaspaandra Department of Computer Science University of Rochester Rochester, NY 14627 USA Thomas Thierauf y Abteilung fur Theoretische Informatik Universitat Ulm 7900 Ulm, Germany June 25, 1993
	ftp://ftp.cs.rochester.edu/pub/papers/ai/92.tn1.trains_91_dialogues.ps.Z, 19930702 The Trains 91 Dialogues Derek Gross James F. Allen David R. Traum derek@psych.rochester.edu james@cs.rochester.edu traum@cs.rochester.edu The University of Rochester Computer Science Department Rochester, New York 14627 TRAINS Technical Note 92-1 July 1993
	ftp://ftp.cs.rochester.edu/pub/papers/systems/93.SEDMS.prospects_for_parallel_programs_on_distributed_systems.ps.Z, 19930719 The Prospects for Parallel Programs on Distributed Systems Position Paper Michael L. Scott University of Rochester scott@cs.rochester.edu
	ftp://ftp.cs.rochester.edu/pub/papers/systems/93.SEDMS.false_sharing.ps.Z, 19930727 False Sharing and its Effect on Shared Memory Performance William J. Bolosky bolosky@microsoft.com Microsoft Research Laboratory One Microsoft Way, 9S/1049 Redmond, WA 98052-6399 Michael L. Scott scott@cs.rochester.edu Computer Science Department University of Rochester Rochester, NY 14627-0226
	ftp://ftp.cs.rochester.edu/pub/papers/ai/93.ferguson-allen.generic-plan-recognition.ps.Z, 19930806 Proc. ARPA Workshop on Human Language Technology, Princeton, NJ, 21--23 March 1993. Generic Plan Recognition for Dialogue Systems George Ferguson, James F. Allen University of Rochester Rochester, NY, 14627-0226
	ftp://ftp.cs.rochester.edu/pub/papers/systems/93.tr462.effects of block_size_on_coherent_caches.ps.Z, 19930809 The Effects of Block Size on the Performance of Coherent Caches in Shared-Memory Multiprocessors by Cezary Dubnicki Submitted in Partial Fulfillment of the Requirements for the Degree Doctor of Philosophy Supervised by Thomas J. LeBlanc Department of Computer Science College of Arts and Science
	ftp://ftp.cs.rochester.edu/pub/papers/robotics/93.tr466.goal_oriented_dynamic_vision.ps.Z, 19930810 Goal-Oriented Dynamic Vision Peter A. von Kaenel, Christopher M. Brown, and Raymond D. Rimey The University of Rochester Computer Science Department Rochester, New York 14627 Technical Report 466 August 1993
	ftp://ftp.cs.rochester.edu/pub/papers/theory/93.tr469.selectivity_reductions_nondeterminism_function_classes.ps.Z, 19930810 Selectivity: Reductions, Nondeterminism, and Function Classes1 Lane A. Hemaspaandra2 Albrecht Hoene3 Ashish V. Naik4 Mitsunori Ogiwara5 Alan L. Selman6 Thomas Thierauf7 Jie Wang8 August 1993 Key words: Complexity theory, semi-decision algorithms, membership testing, selector functions, lowness,
	ftp://ftp.cs.rochester.edu/pub/papers/theory/93.tr467.computing_solutions_uniquely_collapses_polynomial_hierarchy.ps.Z, 19930812 Computing Solutions Uniquely Collapses the Polynomial Hierarchy Lane A. Hemaspaandra Dept. of Computer Science University of Rochester Rochester, NY 14627, USA Ashish V. Naiky Dept. of Computer Science SUNY{Buffalo Buffalo, NY 14260, USA Mitsunori Ogiwaraz Dept. of Comp. Sci. & Inf. Math. University of
	ftp://ftp.cs.rochester.edu/pub/papers/ai/93.ferguson-allen.cooperative-plan-reasoning.ps.Z, 19930820 AAAI Fall Symposium on Human-Computer Collaboration, Raleigh NC, 22-24 Oct, 1993 Cooperative Plan Reasoning for Dialogue Systems George Ferguson and James F. Allen University of Rochester Rochester, NY, 14627-0226 fferguson,jamesg@cs.rochester.edu 1 Introduction For several years, we have been studying
	ftp://ftp.cs.rochester.edu/pub/papers/systems/93.tr465.Mercury_users_manual.ps.Z, 19930824 The Mercury User's Manual Leonidas Kontothanassis The University of Rochester Computer Science Department Rochester, New York 14627 Technical Report 465 August 1993
	ftp://ftp.cs.rochester.edu/pub/papers/systems/93.PARCO93.Architecture_infuence_on_Scheduling.ps.Z, 19930830 1 How Architecure Evolution influences the Scheduling Discipline used in Shared-Memory Multiprocessors Evangelos P. Markatosa a Institute of Computer Sci., FORTH P.O.Box 1385, Heraklio, Crete GR-711-10 GREECE markatos@csi.forth.gr To appear in Parallel Computing 93. 1. Introduction Parallel applications
	ftp://ftp.cs.rochester.edu/pub/papers/systems/93.tr429rev.fast_contention_free_combining_tree_barriers.ps.Z, 19930915 Fast, Contention-Free Combining Tree Barriers for Shared-Memory Multiprocessors Michael L. Scott Computer Science Department University of Rochester Rochester, NY 14627-0226 scott@cs.rochester.edu John M. Mellor-Crummey Computer Science Department Rice University, P.O. Box 1892 Houston, TX 77251
	ftp://ftp.cs.rochester.edu/pub/papers/systems/93.tr454.scalable_spin_locks.ps.Z, 19930915 Scalable Spin Locks for Multiprogrammed Systems Robert W. Wisniewski, Leonidas Kontothanassis, and Michael L. Scott Computer Science Department University of Rochester Rochester, NY 14627-0226 The University of Rochester Computer Science Department Rochester, New York 14627 September 1993
	ftp://ftp.cs.rochester.edu/pub/papers/systems/93.PDRTS.Ephor_runtime_environment_for_parallel_intelligent_apps.ps.Z, 19930920 Ephor A Run-Time Environment for Parallel Intelligent Applications Robert W. Wisniewski and Christopher M. Brown The University of Rochester Computer Science Department Rochester, New York 14627
	ftp://ftp.cs.rochester.edu/pub/papers/ai/93.heeman.ISSD.ps.Z, 19930924 REPAIRING CONVERSATIONAL MISUNDERSTANDINGS AND NON-UNDERSTANDINGS Graeme Hirst, Susan McRoy,y Peter Heeman,z Philip Edmonds, and Diane Horton Department of Computer Science University of Toronto Toronto, Ontario M5S 1A4 Canada
	ftp://ftp.cs.rochester.edu/pub/papers/ai/93.tn2.prosody_and_discourse_structure_in_cooperative_dialogues_figs.ps.Z, 19931001 Figure 1 City A City B City C City D City E City F City G City H City I Banana Source/Warehouse Hop Source/Warehouse OJ Factory Orange Source/Warehouse Malt Source/Warehouse OJ Factory Beer Factory Banana Source/Warehouse Hop Source/Warehouse Orange Source/ Warehouse Beer Factory OJ Factory Figure 2i a.
	ftp://ftp.cs.rochester.edu/pub/papers/theory/93.tr471.complexity of the_optimal_spanning_hypertree_problem.ps.Z, 19931001 The Complexity of the Optimal Spanning Hypertree Problem Marius Zimand University of Rochester Computer Science Department October 1, 1993
	ftp://ftp.cs.rochester.edu/pub/papers/ai/93.tn2.prosody_and_discourse_structure_in_cooperative_dialogues_text.ps.Z, 19931001 A Study on Prosody and Discourse Structure in Cooperative Dialogues Short title: Prosody and Discourse Structure Shin'ya Nakajima Speech and Acoustics Laboratory, NTT Human Interface Labs., Japan James F. Allen Computer Science Dept., University of Rochester, NY, USA
	ftp://ftp.cs.rochester.edu/pub/papers/theory/93.tr475.NP_set_with_no_co-DP_sparse_subset.ps.Z, 19931027 An NP Set With No co-DP Sparse Subset1 Osamu Watanabe (watanabe@cs.titech.ac.jp) Dept. of Computer Science, Tokyo Institute of Technology Meguro-ku, Ookayama, Tokyo 152, JAPAN
	ftp://ftp.cs.rochester.edu/pub/papers/theory/93.tr470.advice_from_nonadaptive_queries_to_NP.ps.Z, 19931028 Advice from Nonadaptive Queries to NP Yenjo Han Department of Computer Science University of Rochester Rochester, NY 14627 USA Thomas Thierauf y Abteilung Theoretische Informatik Universitat Ulm 89069 Ulm, Germany Oct. 1993
	ftp://ftp.cs.rochester.edu/pub/papers/robotics/93.mccallum-ml.ps.Z, 19931108 Overcoming Incomplete Perception with Utile Distinction Memory R. Andrew McCallum Department of Computer Science University of Rochester Rochester, NY 14627 mccallum@cs.rochester.edu
	ftp://ftp.cs.rochester.edu/pub/papers/ai/93.tr474.statistical_probabilities_for_planning.ps.Z, 19931116 Statistical Probabilities for Planning Nathaniel G. Martin and James F. Allen Department of Computer Science University of Rochester 14627 fmartin,jamesg@cs.rochester.edu The University of Rochester Computer Science Department Rochester, New York 14627 Technical Report 474
	ftp://ftp.cs.rochester.edu/pub/papers/ai/93.tr473.classification_in_feature_based_default_inheritance_hierarchies.ps.Z, 19931117 Classification in Feature-based Default Inheritance Hierarchies Marc Light The University of Rochester Computer Science Department Rochester, New York 14627 Technical Report 473 November 1993
	ftp://ftp.cs.rochester.edu/pub/papers/systems/93.tr479.the_search_for_lost_cycles.ps.Z, 19931208 The Search for Lost Cycles: A New Approach to Parallel Program Performance Evaluation Mark E. Crovella and Thomas J. LeBlanc fcrovella,leblancg@cs.rochester.edu The University of Rochester Computer Science Department Rochester, New York 14627 Technical Report 479 December 1993
	ftp://ftp.cs.rochester.edu/pub/papers/theory/93.tr431rev.easily_checked_generalized_self-reducibility.ps.Z, 19931228 Easily Checked Generalized Self-Reducibility Lane A. Hemaspaandra Department of Computer Science University of Rochester Rochester, NY 14627, USA Riccardo Silvestri y Department of Computer Science University of Rome 00198 Rome, Italy UR-DCS Technical Report 431; July 20, 1992 (Revised December 20,
	ftp://ftp.cs.rochester.edu/pub/papers/theory/94.tr482.P_selectivity_Intersections_and_indices.ps.Z, 19940110 P-Selectivity: Intersections and Indices Lane A. Hemaspaandra and Zhigen Jiangy Department of Computer Science University of Rochester Rochester, NY 14627 January 3, 1994
	ftp://ftp.cs.rochester.edu/pub/papers/theory/93.tr481.Density_control_and_online_labeling_problems.ps.Z, 19940113 Density Control and On-Line Labeling Problems by Ju Zhang Submitted in Partial Fulfillment of the Requirements for the Degree Doctor of Philosophy Supervised by Professor Joel Seiferas Department of Computer Science College of Arts and Science University of Rochester Rochester, New York 1993 ii
	ftp://ftp.cs.rochester.edu/pub/papers/systems/94.locality_based_scheduling.ps.Z, 19940121 Locality-Based Scheduling for Shared-Memory Multiprocessors Evangelos P. Markatos and Thomas J. LeBlanc Computer Science Department University of Rochester Rochester, NY 14627 USA
	ftp://ftp.cs.rochester.edu/pub/papers/theory/94.tr483rev.Boolean_hierarchies_and_sparse_turing_complete_sets.ps.Z, 19940125 Unambiguous Computation: Boolean Hierarchies and Sparse Turing-Complete Sets1 Lane A. Hemaspaandra and Jorg Rothe2 Department of Computer Science University of Rochester Rochester, NY 14627 January 19, 1994 1Research supported in part by grants NSF-CCR-8957604 and NSF-INT-9116781/JSPS-ENGR- 207, by a
	ftp://ftp.cs.rochester.edu/pub/papers/systems/94.Scalable_spin_locks_for_multiprogrammed_systems.ps.Z, 19940208 Scalable Spin Locks for Multiprogrammed Systems Robert W. Wisniewski, Leonidas Kontothanassis, and Michael L. Scott bob, kthanasi, and scott@cs.rochester.edu Department of Computer Science University of Rochester Rochester, NY 14627-0226
	ftp://ftp.cs.rochester.edu/pub/papers/robotics/94.tr487.Seeing_behind_occlusions.somefigs.ps.Z, 19940210 Seeing Behind Occlusions Dana H. Ballard and Rajesh P.N. Rao The University of Rochester Computer Science Department Rochester, New York 14627 Technical Report 487 February 1994
	ftp://ftp.cs.rochester.edu/pub/papers/theory/94.tr476.Connections_among_space_bounded_and_multihead_prob_automata.ps.Z, 19940214 Connections among space-bounded and multihead probabilistic automata Ioan I. Macarie The University of Rochester Computer Science Department Rochester, New York 14627 Technical Report 476 January 1994
	ftp://ftp.cs.rochester.edu/pub/papers/systems/91.TR351.Systematic_detection of parallelism_in_ordinary_programs.ps.Z, 19940217 Technical Report 351 Systematic Detection of Parallelism in Ordinary Programs Ce sar Augusto Quiroz Gonza lez Department of Computer Science University of Rochester Rochester, NY 14627 quiroz@cs.rochester.edu This TR contains a dissertation submitted in partial fulfillment of the requirements for the
	ftp://ftp.cs.rochester.edu/pub/papers/robotics/94.tr489.Genetic_programming_with_adaptive_representations.ps.Z, 19940222 Genetic Programming with Adaptive Representations Justinian P. Rosca, Dana H. Ballard The University of Rochester Computer Science Department Rochester, New York 14627 Technical Report 489 February 1994
	ftp://ftp.cs.rochester.edu/pub/papers/systems/94.tr485.Eager_combining_coherency_protocol.ps.Z, 19940301 Eager Combining: A Coherency Protocol for Increasing Effective Network and Memory Bandwidth in Shared-Memory Multiprocessors Ricardo Bianchini and Thomas J. LeBlanc ricardo@cs.rochester.edu, leblanc@cs.rochester.edu The University of Rochester Computer Science Department Rochester, New York 14627
	ftp://ftp.cs.rochester.edu/pub/papers/systems/94.tr486.Can_high_bandwidth_and_latency_justify_large_cache_blocks.ps.Z, 19940301 Can High Bandwidth and Latency Justify Large Cache Blocks in Scalable Multiprocessors Ricardo Bianchini and Thomas J. LeBlanc ricardo@cs.rochester.edu, leblanc@cs.rochester.edu The University of Rochester Computer Science Department Rochester, New York 14627 Technical Report 486 January 1994 An
	ftp://ftp.cs.rochester.edu/pub/papers/ai/94.traum-et-al.aaai-spring-94.integrating-nlu-trains.ps.Z, 19940308 Integrating Natural Language Understanding and Plan Reasoning in the TRAINS-93 Conversation System D. R. Traumy, J. F. Alleny, G. Fergusony, P. A. Heemany, C. H. Hwangy, T. Katoz, N. Martiny, M. Poesiox and L. K. Schuberty
	ftp://ftp.cs.rochester.edu/pub/papers/theory/93.tr463.Space_efficient_deterministic_simulation of prob_automata.ps.Z, 19940308 Space-efficient deterministic simulation of probabilistic automata Ioan I. Macarie The University of Rochester Computer Science Department Rochester, New York 14627 Technical Report 463 December 1993
	ftp://ftp.cs.rochester.edu/pub/papers/robotics/94.mccallum-aaai-ss.ps.Z, 19940314 Short-Term Memory in Visual Routines for Off-Road Car Chasing" R. Andrew McCallum Department of Computer Science University of Rochester Rochester, NY 14627-0226 mccallum@cs.rochester.edu
	ftp://ftp.cs.rochester.edu/pub/papers/systems/94.RTOSS.An_argument_for_a_runtime_layer_in_sparta_design.ps.Z, 19940315 An Argument for a Runtime Layer in SPARTA Design Robert W. Wisniewski and Christopher M. Brown bob and brown@cs.rochester.edu Department of Computer Science University of Rochester Rochester, NY 14627-0226
	ftp://ftp.cs.rochester.edu/pub/papers/systems/94.tr490.Prospects_for_online_hybrid_coherency_protocols.ps.Z, 19940316 The Prospects for On-Line Hybrid Coherency Protocols on Bus-Based Multiprocessors Jack E. Veenstra Department of Computer Science University of Rochester Robert J. Fowler DIKU (Department of Computer Science) University of Copenhagen The University of Rochester Computer Science Department Rochester, New
	ftp://ftp.cs.rochester.edu/pub/papers/theory/94.tr488.Upward_separation_for_FewP_and_related_classes.ps.Z, 19940317 Upward Separation for FewP and Related Classes Rajesh P. N. Rao 1 Department of Computer Science University of Rochester Rochester, NY 14627, USA Jorg Rothe 2 Fakultat fur Mathematik und Informatik Friedrich-Schiller-Universitat Jena 07743 Jena, Germany Osamu Watanabe 3 Department of Computer
	ftp://ftp.cs.rochester.edu/pub/papers/robotics/93.tr453.Learning_with_incomplete_selective_perception.ps.Z, 19940317 Learning with Incomplete Selective Perception R. Andrew McCallum Department of Computer Science University of Rochester Rochester, NY 14627 mccallum@cs.rochester.edu THESIS PROPOSAL March 29, 1993 This material is based on work supported by NSF research grant no. IRI-8903582, NIH/PHS research grant no.
	ftp://ftp.cs.rochester.edu/pub/papers/theory/94.tr493.Two_heads_are_better_than_two_tapes.ps.Z, 19940321 Two Heads are Better than Two Tapes Tao Jiang, Joel I. Seiferas, and Paul M. B. Vit anyi McMaster University University of Rochester CWI and Universiteit van Amsterdam March 10, 1994
	ftp://ftp.cs.rochester.edu/pub/papers/ai/94.ferguson-allen.aips94.arguing-about-plans.ps.gz, 19940324 Proceedings, Second Intl. Conf. on AI Planning Systems, Chicago, IL, 13-15 June 1994 Arguing About Plans: Plan Representation and Reasoning for Mixed-Initiative Planning George Ferguson James F. Allen Department of Computer Science University of Rochester, Rochester, NY fferguson,jamesg@cs.rochester.edu
	ftp://ftp.cs.rochester.edu/pub/papers/robotics/93.tr468.Control of selective_perception.somefigs.ps.Z, 19940328 Control of Selective Perception Using Bayes Nets and Decision Theory Raymond Dean Rimey The University of Rochester Computer Science Department Rochester, New York 14627 Technical Report 468 December 1993 This material is based upon work supported by the National Science Foundation under Grants numbered
	ftp://ftp.cs.rochester.edu/pub/papers/ai/94.tr495.Computing_minimal_labels_in_time_point_algebra_networks.ps.Z, 19940412 To appear in Computational Intelligence Journal On Computing the Minimal Labels in Time Point Algebra Networks Alfonso Gerevini1;2 and Lenhart Schubert2 1 IRST { Istituto per la Ricerca Scientifica e Tecnologica I-38050 Povo, Trento Italy E-mail: gerevini@irst.it 2 Computer Science Department,
	ftp://ftp.cs.rochester.edu/pub/papers/ai/94.tr497.On_point_based_temporal_disjointness.ps.Z, 19940412 On Point-based Temporal Disjointness Alfonso Gerevini1;2 and Lenhart Schubert2 1 IRST { Istituto per la Ricerca Scientifica e Tecnologica I-38050 Povo, Trento Italy E-mail: gerevini@irst.it 2 Computer Science Department, University of Rochester Rochester, NY 14627, USA E-mail:
	ftp://ftp.cs.rochester.edu/pub/papers/ai/94.heeman.ARPA_HLT.ps.Z, 19940414 Tagging Speech Repairs Peter A. Heeman and James Allen Department of Computer Science University of Rochester Rochester, New York, 14627 fheeman,jamesg@cs.rochester.edu
	ftp://ftp.cs.rochester.edu/pub/papers/theory/94.tr499.On_P-selectivity_and_closeness.ps.Z, 19940428 On P-selectivity and Closeness Rajesh P.N. Rao Department of Computer Science University of Rochester Rochester, NY 14627, USA
	ftp://ftp.cs.rochester.edu/pub/papers/theory/94.tr478rev.Tight_lower_bound_for_on-line_monotonic_list_labeling.ps.Z, 19940429 A Tight Lower Bound for On-line Monotonic List Labeling Paul F. Dietz, Joel I. Seiferas, and Ju Zhang November 16, 1993; revised: April 21, 1994
	ftp://ftp.cs.rochester.edu/pub/papers/theory/94.tr500.General_method_to_construct_oracles.ps.Z, 19940429 A General Method to Construct Oracles Realizing Given Relationships between Complexity Classes Andrei A. Muchnik y amuchnik@int.glas.apc.org Nikolai K. Vereshchagin yz ver@math.imu.msk.su
	ftp://ftp.cs.rochester.edu/pub/papers/theory/94.tr498.Lower_bounds_for_perceptrons_solving_some_separation_problems.ps.Z, 19940429 Lower Bounds for Perceptrons Solving some Separation Problems and Oracle Separation of AM from PP Nikolai K.Vereshchaginy Moscow Institute of New Technologies in Education 11 Kirovogradskaja Street, Moscow, Russia 113587 E-mail: ver@math.imu.msk.su April 29, 1994
	ftp://ftp.cs.rochester.edu/pub/papers/theory/94.tr503.General_method_to_determine_invariants.ps.Z, 19940429 A General Method to Determine Invariants Irene Rothe1 Klaus Voss Herbert Susse Jorg Rothe1 Fakultat fur Mathematik und Informatik Friedrich-Schiller-Universitat Jena 07743 Jena Germany April 27, 1994 1Research supported in part by a grant from the DAAD and by NSF grant CCR-8957604. Work done in
	ftp://ftp.cs.rochester.edu/pub/papers/theory/94.tr501.NP-sets_are_Co-NP-immune_relative_to_a_random_oracle.ps.Z, 19940429 NP-sets are Co-NP-immune Relative to a Random Oracle Nikolai K. Vereshchagin The Institute of New Technologies 11 Kirovogradskaja Street, Moscow 113587, Russia E-mail: ver@math.imu.msk.su
	ftp://ftp.cs.rochester.edu/pub/papers/systems/94.tr504.Compiler_optimizations_for_cache_locality_and_coherence.ps.Z, 19940429 Compiler Optimizations for Cache Locality and Coherence Wei Li Technical Report 504 Department of Computer Science University of Rochester Rochester, NY 14627 wei@cs.rochester.edu April 1994
	ftp://ftp.cs.rochester.edu/pub/papers/theory/94.tr508.On_accessing_and_hiding_information.ps.Z, 19940505 On Accessing and Hiding Information by Yenjo Han Submitted in Partial Fulfillment of the Requirements for the Degree Doctor of Philosophy Supervised by Lane A. Hemaspaandra Department of Computer Science College of Arts and Science University of Rochester Rochester, New York 1994 ii Curriculum Vitae
	ftp://ftp.cs.rochester.edu/pub/papers/theory/94.tr507.Pseudorandom_generators_and_the_frequency of simplicity.ps.Z, 19940506 Pseudorandom Generators and the Frequency of Simplicity Yenjo Han and Lane A. Hemaspaandra Department of Computer Science University of Rochester Rochester, NY 14627 USA UR-DCS-TR-94-507 May 3, 1994
	ftp://ftp.cs.rochester.edu/pub/papers/ai/94.tr492rev.Vision_learning_and_development.somefigs.ps.Z, 19940509 Vision, Learning, and Development Christopher M. Brown The University of Rochester Computer Science Department Rochester, New York 14627 Technical Report 492 May 1994
	ftp://ftp.cs.rochester.edu/pub/papers/theory/94.tr505.Decreasing_the_bandwidth of a_transition_matrix.ps.Z, 19940512 Decreasing the Bandwidth of a Transition Matrix Ioan I. Macarie The University of Rochester Computer Science Department Rochester, New York 14627 Technical Report 505 April 1994
	ftp://ftp.cs.rochester.edu/pub/papers/theory/94.tr484.A_promise_class.ps.Z, 19940519 A Promise Class at Least as Hard as the Polynomial Hierarchy Jorg Rothe Fakultat fur Mathematik und Informatik Friedrich-Schiller-Universitat Jena Germany January 14, 1994 Research supported in part by a grant from the DAAD and by NSF grant CCR-8957604. Current address: Department of Computer
	ftp://ftp.cs.rochester.edu/pub/papers/ai/94.tr509.i_speech.ps.Z, 19940520 i-speech: Experiments with a Single Level Feedback Paradigm Ramesh R. Sarukkai, Dana H. Ballard The University of Rochester Computer Science Department Rochester, New York 14627 Technical Report 509 May 1994
	ftp://ftp.cs.rochester.edu/pub/papers/ai/94.tr496.Efficient_algorithms_for_qualitative_reasoning_about_time.ps.Z, 19940524 To appear in Artificial Intelligence Journal Efficient Algorithms for Qualitative Reasoning about Time Alfonso Gerevini IRST { Istituto per la Ricerca Scientifica e Tecnologica I-38050 Povo Trento, Italy. Tel.: +39-461-814-333 E-mail: gerevini@irst.it Lenhart Schubert Computer Science Department,
	ftp://ftp.cs.rochester.edu/pub/papers/ai/94.tr494rev.Temporal_reasoning_systems_TimeGraph_I-II.ps.Z, 19940524 The Temporal Reasoning Systems TimeGraph I-II Alfonso Gerevini1;2 Lenhart Schubert2 Stephanie Schaeffer3 1 IRST - Istituto per la Ricerca Scientifica e Tecnologica, 38050 Povo TN, Italy E-mail:gerevini@irst.it Phone:+39 461 814333 Fax:+39 461 302040 2 Computer Science Department University of Rochester,
	ftp://ftp.cs.rochester.edu/pub/papers/ai/94.heeman.ACL.ps.Z, 19940602 Detecting and Correcting Speech Repairs Peter Heeman and James Allen Department of Computer Science University of Rochester Rochester, New York, 14627 fheeman,jamesg@cs.rochester.edu
	ftp://ftp.cs.rochester.edu/pub/papers/theory/94.tr464rev.Bits_and_relative_order_from_residues.ps.Z, 19940602 Bits and Relative Order from Residues, Space Efficiently Paul F. Dietz, Ioan I. Macarie, and Joel I. Seiferas June 1, 1994
	ftp://ftp.cs.rochester.edu/pub/papers/robotics/94.tr512.Gaze_selection_for_visual_search.ps.Z, 19940613 Gaze Selection for Visual Search by Lambert Ernest Wixson Submitted in Partial Fulfillment of the Requirements for the Degree Doctor of Philosophy Supervised by Professor Dana Ballard Department of Computer Science College of Arts and Science University of Rochester Rochester, New York 1994 ii
	ftp://ftp.cs.rochester.edu/pub/papers/systems/94.tr515.Prelim_eval of cache-miss-initiated_prefetching_techniques.ps.Z, 19940614 A Preliminary Evaluation of Cache-Miss-Initiated Prefetching Techniques in Scalable Multiprocessors Ricardo Bianchini and Thomas J. LeBlanc ricardo@cs.rochester.edu, leblanc@cs.rochester.edu The University of Rochester Computer Science Department Rochester, New York 14627 Technical Report 515 May 1994
	ftp://ftp.cs.rochester.edu/pub/papers/robotics/94.mccallum-ml.ps.Z, 19940614 Reduced Training Time for Reinforcement Learning with Hidden State R. Andrew McCallum Department of Computer Science University of Rochester Rochester, NY 14627-0226 mccallum@cs.rochester.edu
	ftp://ftp.cs.rochester.edu/pub/papers/systems/94.toplas.Control_Abstraction.ps.Z, 19940616 Parallel Programming with Control Abstraction Lawrence A. Crowl Oregon State University and Thomas J. LeBlanc University of Rochester Parallel programming involves finding the potential parallelism in an application and mapping it to the architecture at hand. Since a typical application has more
	ftp://ftp.cs.rochester.edu/pub/papers/systems/94.tr511.Lambda_loop_transformation_toolkit.ps.Z, 19940617 The Lambda Loop Transformation Toolkit (User's Reference Manual) Wei Li Department of Computer Science University of Rochester Keshav Pingali Department of Computer Science Cornell University May 1994 University of Rochester Technical Report 511 Cornell University Technical Report 94-1431
	ftp://ftp.cs.rochester.edu/pub/papers/ai/94.tr518.Discourse_interp_and_the_scope of operators.halfsize.ps.Z, 19940620 Discourse Interpretation and the Scope of Operators by Massimo Poesio Submitted in Partial Fulfillment of the Requirements for the Degree DOCTOR OF PHILOSOPHY Supervised by Professor Lenhart K. Schubert Department of Computer Science College of Arts and Science University of Rochester Rochester, New
	ftp://ftp.cs.rochester.edu/pub/papers/ai/94.tr518.Discourse_interp_and_the_scope of operators.ps.Z, 19940620 Discourse Interpretation and the Scope of Operators by Massimo Poesio Submitted in Partial Fulfillment of the Requirements for the Degree DOCTOR OF PHILOSOPHY Supervised by Professor Lenhart K. Schubert Department of Computer Science College of Arts and Science University of Rochester Rochester, New
	ftp://ftp.cs.rochester.edu/pub/papers/theory/94.tr519.On_serializable_languages.ps.Z, 19940622 On Serializable Languages Mitsunori Ogihara1 Department of Computer Science University of Rochester Rochester, NY 14627 Technical Report 519 June, 1994 1Supported in part by the NSF and the JSPS under grant NSF-INT-9116781/JSPS-ENG-207.
	ftp://ftp.cs.rochester.edu/pub/papers/systems/88.ICDCS.Bridge.ps.Z, 19940627 Bridge: A High-Performance File System for Parallel Processors Peter C. Dibble Michael L. Scott Department of Computer Science University of Rochester Rochester, NY 14627 Carla Schlatter Ellis Department of Computer Science Duke University Durham, NC 27706
	ftp://ftp.cs.rochester.edu/pub/papers/systems/94.PARLE.Mercury.ps.Z, 19940627 1 Mercury: Object-Affinity Scheduling and Continuation Passing on Multiprocessors Robert J. Fowlery and Leonidas I. Kontothanassisz y DIKU, University of Copenhagen, DK-2100 Copenhagen, Denmark z Computer Science Department, University of Rochester, Rochester, NY 14627 USA
	ftp://ftp.cs.rochester.edu/pub/papers/systems/94.Multiprogrammed_Synchronization.ps.Z, 19940627 High Performance Synchronization Algorithms for Multiprogrammed Multiprocessors (Extended Abstract) Robert W. Wisniewski, Leonidas Kontothanassis, and Michael L. Scott Department of Computer Science University of Rochester Rochester, NY 14627-0226 fbob,kthanasi,scottg@cs.rochester.edu June 1994
	ftp://ftp.cs.rochester.edu/pub/papers/robotics/94.tr502.Instance_based_state_identification_for_reinforcement_learning.ps.Z, 19940706 First Results with Instance-Based State Identification for Reinforcement Learning R. Andrew McCallum Department of Computer Science University of Rochester Rochester, NY 14627-0226 mccallum@cs.rochester.edu Technical Report 502 April 1994 1
	ftp://ftp.cs.rochester.edu/pub/papers/ai/94.tr521.Actions_and_events_in_interval_temporal_logic.ps.Z, 19940706 Actions and Events in Interval Temporal Logic James F. Allen George Ferguson The University of Rochester Computer Science Department Rochester, New York 14627 Technical Report 521 July 1994
	ftp://ftp.cs.rochester.edu/pub/papers/ai/93.traum.AAAI_spring_93.ps.Z, 19940714 Mental State in the TRAINS-92 Dialogue Manager David R. Traum Computer Science Department University of Rochester Rochester, New York 14627-0226 USA traum@cs.rochester.edu
	ftp://ftp.cs.rochester.edu/pub/papers/ai/93.traum.ACL93-SIG.ps.Z, 19940714 Rhetorical Relations, Action and Intentionality in Conversation David R. Traum Computer Science Department University of Rochester Rochester, New York 14627-0226 USA traum@cs.rochester.edu
	ftp://ftp.cs.rochester.edu/pub/papers/ai/92.traum-allen.ICSLP92.ps.Z, 19940714 A SPEECH ACTS" APPROACH TO GROUNDING IN CONVERSATION David R. Traum and James F. Allen Computer Science Department University of Rochester Rochester, New York 14627-0226 USA ftraum, jamesg@cs.rochester.edu
	ftp://ftp.cs.rochester.edu/pub/papers/ai/91.traum-allen.decentralized_AI.ps.Z, 19940714 CAUSATIVE FORCES IN MULTI-AGENT PLANNING1 David R. TRAUM and James F. ALLEN Computer Science Department University of Rochester Rochester, NY 14627 USA A general purpose reasoning agent may come in contact with many types of external forces which have differing types of effects on the world. Different
	ftp://ftp.cs.rochester.edu/pub/papers/ai/94.traum-allen.ACL.ps.Z, 19940715 Appears in Proceedings ACL '94 Discourse Obligations in Dialogue Processing David R. Traum and James F. Allen Department of Computer Science University of Rochester Rochester, NY 14627-0226 traum@cs.rochester.edu and james@cs.rochester.edu
	ftp://ftp.cs.rochester.edu/pub/papers/theory/94.tr524.Reducibility_classes of P-selective_sets.ps.Z, 19940718 Reducibility Classes of P-selective Sets Lane A. Hemaspaandray Albrecht Hoenez Mitsunori Ogiharax July 18, 1994 Key words: Complexity theory, semi-decision algorithms, membership testing, selector functions Abstract A set is P-selective if there is a polynomial-time semi-decision algorithm for
	ftp://ftp.cs.rochester.edu/pub/papers/ai/94.tr523.Spoken_dialogue_understanding_and_local_context.ps.Z, 19940720 Spoken Dialogue Understanding and Local Context Peter A. Heeman The University of Rochester Computer Science Department Rochester, New York 14627 Technical Report 523 July 1994
	ftp://ftp.cs.rochester.edu/pub/papers/ai/94.tr440rev.Explanation_closure.ps.Z, 19940721 Explanation Closure, Action Closure, and the Sandewall Test Suite for Reasoning about Change Lenhart K. Schubert Department of Computer Science, University of Rochester Rochester, NY 14627, U. S. A.
	ftp://ftp.cs.rochester.edu/pub/papers/theory/94.tr506.Structure of log_space_probabilistic_complexity_classes.ps.Z, 19940722 On the structure of log-space probabilistic complexity classes Ioan I. Macarie The University of Rochester Computer Science Department Rochester, New York 14627 Technical Report 506 July 1994
	ftp://ftp.cs.rochester.edu/pub/papers/theory/94.tr526.Semi_membership_algorithms.ps.Z, 19940725 Semi-Membership Algorithms: Some Recent Advances Derek Denny-Browny Yenjo Hany Lane A. Hemaspaandray;z Leen Torenvliet x July 1994
	ftp://ftp.cs.rochester.edu/pub/papers/systems/94.tr528.Scalability of atomic_primitives.ps.Z, 19940729 Scalability of Atomic Primitives on Distributed Shared Memory Multiprocessors Maged M. Michael Michael L. Scott Computer Science Department University of Rochester Rochester, NY 14627-0226 fmichael,scottg@cs.rochester.edu July 1994
	ftp://ftp.cs.rochester.edu/pub/papers/theory/94.tr527.Optimal_advice.ps.Z, 19940802 Optimal Advice Lane A. Hemaspaandra Department of Computer Science University of Rochester Rochester, NY 14627 Leen Torenvliety Dept. of Math. and Comp. Sci. University of Amsterdam Plantage Muidergracht 24 1018 TV Amsterdam July 1994
	ftp://ftp.cs.rochester.edu/pub/papers/theory/94.tr529.Category_and_measure_in_abstract_complexity_theory.ps.Z, 19940802 Effective Category and Measure in Abstract Complexity Theory Cristian Caludey and Marius Zimandz August 1, 1994
	ftp://ftp.cs.rochester.edu/pub/papers/robotics/94.tr530.Real_world_shepherding_combining_vision_manipulation_planning.ps.Z, 19940808 Real-World Shepherding - Combining Vision, Manipulation, and Planning in Real Time Peter von Kaenel and Robert W. Wisniewski vonk,bob@cs.rochester.edu The University of Rochester Computer Science Department Rochester, New York 14627 Technical Report 530 August 1994
	ftp://ftp.cs.rochester.edu/pub/papers/robotics/93.tr458.high_dimension_action_spaces_in_robot_skill_learning.ps.Z, 19940808 High Dimension Action Spaces in Robot Skill Learning Jeff G. Schneider The University of Rochester Computer Science Department Rochester, New York 14627 Technical Report 458 August 1994
	ftp://ftp.cs.rochester.edu/pub/papers/theory/94.tr477rev.Properties of multihead_two_way_prob_finite_automata.ps.Z, 19940809 Properties of multihead two-way probabilistic finite automata Ioan I. Macarie The University of Rochester Computer Science Department Rochester, New York 14627 Technical Report 477 Revised July 1994
	ftp://ftp.cs.rochester.edu/pub/papers/ai/93.hwang.AAAI.93.ps.Z, 19940811 EL: A Formal, Yet Natural, Comprehensive Knowledge Representation Chung Hee Hwang & Lenhart K. Schubert Department of Computer Science, University of Rochester Rochester, New York 14627-0226 fhwang,schubertg@cs.rochester.edu
	ftp://ftp.cs.rochester.edu/pub/papers/ai/93.hwang.IJCAI.93.ps.Z, 19940811 Meeting the interlocking needs of LF-computation, deindexing, and inference: An organic approach to general NLU Chung Hee Hwang & Lenhart K. Schubert Department of Computer Science, University of Rochester Rochester, New York 14627, U. S. A.
	ftp://ftp.cs.rochester.edu/pub/papers/ai/92.hwang.ACL92.ps.Z, 19940811 ONR/DARPA research contract no. N00014-82-K-0193, and the Boeing Co. under Purchase Contract W-288104. A preliminary version of this paper was presented at the AAAI Fall Symposium on Discourse Structure in Natural Language Understanding and Generation, Pacific Grove, CA, November 1991. References
	ftp://ftp.cs.rochester.edu/pub/papers/systems/93.PPoPP.Using_scheduler_information_barrier_synchr_performance.ps.Z, 19940822 Using Scheduler Information to Achieve Optimal Barrier Synchronization Performance Leonidas Kontothanassis and Robert W. Wisniewski
	ftp://ftp.cs.rochester.edu/pub/papers/systems/94.SUPERCOMPUTING.performance_prediction.ps.Z, 19940830 Parallel Performance Prediction Using Lost Cycles Analysis Mark E. Crovella and Thomas J. LeBlanc Department of Computer Science University of Rochester Rochester, New York 14627 (716) 275-5671 fcrovella,leblancg@cs.rochester.edu
	ftp://ftp.cs.rochester.edu/pub/papers/ai/94.poesio-et-al.aaai-fall-94.kr-in-trains.ps.gz, 19940902 Knowledge Representation in the TRAINS System M. Poesio , G. Fergusony, P. Heemany, C. H. Hwangy, D. R. Traumy, J. F. Alleny, N. Martiny, L. K. Schuberty
	ftp://ftp.cs.rochester.edu/pub/papers/ai/94.tr531.Using_simulation_based_projection_to_plan.ps.Z, 19940907 Using Simulation-based Projection to Plan in an Uncertain and Temporally Complex World Ed Yampratoom The University of Rochester Computer Science Department Rochester, New York 14627 Technical Report 531 September 1994
	ftp://ftp.cs.rochester.edu/pub/papers/ai/94.tn3.The_TRAINS_Project.ps.gz, 19940913 The TRAINS Project: A case study in building a conversational planning agent James F. Allen, Lenhart K. Schubert, George Ferguson, Peter Heeman, Chung Hee Hwang, Tsuneaki Kato,1 Marc Light, Nathaniel G. Martin, Bradford W. Miller, Massimo Poesio,2 David R. Traum The University of Rochester Computer
	ftp://ftp.cs.rochester.edu/pub/papers/systems/94.SUPERCOMPUTING.Cache_performance_in_vector_supercomputers.ps.Z, 19940916 Cache Performance in Vector Supercomputers L. I. Kontothanassisy R. A. Sugumarz G. J. Faanesz J. E. Smithx M. L. Scotty y Computer Science Dept. z Cray Research Inc. x Dept. of Electrical & Computer Engg. University of Rochester 900 Lowater Rd. University of Wisconsin-Madison Rochester, NY 14627-0226
	ftp://ftp.cs.rochester.edu/pub/papers/systems/94.tr535.Using_simplepage placement_policies.ps.Z, 19940921 Using Simple Page Placement Policies to Reduce the Cost of Cache Fills in Coherent Shared-Memory Systems Michael Marchetti, Leonidas Kontothanassis, Ricardo Bianchini, and Michael L. Scott Department of Computer Science University of Rochester Rochester, NY 14627-0226
	ftp://ftp.cs.rochester.edu/pub/papers/ai/93.heeman.AAAI_spring_93.ps.Z, 19940930 Speech Actions and Mental States in Task-Oriented Dialogues Peter Heeman Department of Computer Science University of Rochester Rochester, New York, 14627 heeman@cs.rochester.edu
	ftp://ftp.cs.rochester.edu/pub/papers/systems/94.High_performance_software_coherence.ps.Z, 19941004 High Performance Software Coherence for Current and Future Architectures Leonidas I. Kontothanassis and Michael L. Scott Department of Computer Science University of Rochester Rochester, NY 14627-0226 fkthanasi,scottg@cs.rochester.edu September 1994 This work was supported in part by NSF Institutional
	ftp://ftp.cs.rochester.edu/pub/papers/theory/fast-heap.ps, 19941025 Very Fast Optimal Parallel Algorithms for Heap Construction Paul F. Dietz Department of Computer Science University of Rochester Rochester, NY 14627 Rajeev Ramany Institute for Advanced Computer Studies (UMIACS) University of Maryland College Park, MD 20742 July 20, 1994 Author's current address:
	ftp://ftp.cs.rochester.edu/pub/papers/systems/94.tr540.Loop_scheduling_for_heterogeneity.ps.Z, 19941027 Loop Scheduling for Heterogeneity Micha l Cierniak Wei Li Mohammed Javeed Zaki Technical Report 540 Department of Computer Science University of Rochester Rochester, NY 14627 fcierniak,wei,zakig@cs.rochester.edu October 1994
	ftp://ftp.cs.rochester.edu/pub/papers/systems/94.IPPS.Scalable_spin_locks_for_multiprogrammed_systems.ps.Z, 19941101 Scalable Spin Locks for Multiprogrammed Systems Robert W. Wisniewski, Leonidas Kontothanassis, and Michael L. Scott bob, kthanasi, and scott@cs.rochester.edu Department of Computer Science University of Rochester Rochester, NY 14627-0226
	ftp://ftp.cs.rochester.edu/pub/papers/robotics/94.pook.sign_language_for_telemanipulation.ps.Z, 19941107 A Sign Language for Telemanipulation Polly K. Pook and Dana H. Ballard Computer Science Department University of Rochester Rochester, NY 14627-0226 USA pook\|dana@cs.rochester.edu
	ftp://ftp.cs.rochester.edu/pub/papers/robotics/94.pook.deictic_teleassistance.ps.Z, 19941107 Deictic Teleassistance Polly K. Pook and Dana H. Ballard Computer Science Department University of Rochester Rochester, NY 14627-0226 USA pook\|dana@cs.rochester.edu
	ftp://ftp.cs.rochester.edu/pub/papers/ai/94.tr510rev.Supervised_learning_without_output_labels.ps.Z, 19941107 Supervised Learning Without Output Labels Ramesh R. Sarukkai e-mail: sarukkai@cs.rochester.edu The University of Rochester Computer Science Department Rochester, New York 14627 Technical Report 510 This material is based upon work supported by the National Science Foundation under Grant number
	ftp://ftp.cs.rochester.edu/pub/papers/robotics/93.pook.recognizing_teleoperated_manipulations.ps.Z, 19941107 Recognizing Teleoperated Manipulations Polly K. Pook and Dana H. Ballard Computer Science Department University of Rochester Rochester, NY 14627-0226, USA
	ftp://ftp.cs.rochester.edu/pub/papers/ai/94.tr538.Phonetic_set_hashing.ps.Z, 19941107 Phonetic Set Hashing: A Novel Scheme For Transforming Phone Sequences To Words Ramesh R. Sarukkai & Dana H. Ballard The University of Rochester Computer Science Department Rochester, New York 14627 Technical Report 538 November 1994 This material is based upon work supported by the National Science
	ftp://ftp.cs.rochester.edu/pub/papers/systems/94.tr539.Eliminating_useless_messages_in_write_update_protocols.ps.Z, 19941108 Eliminating Useless Messages in Write-Update Protocols on Scalable Multiprocessors Ricardo Bianchini, Thomas J. LeBlanc, and Jack Veenstra fricardo,leblanc,veenstrag@cs.rochester.edu Department of Computer Science University of Rochester Rochester, New York 14627 (716) 275-5426 Technical Report 539
	ftp://ftp.cs.rochester.edu/pub/papers/systems/tr542.Unifying_data_and_control_transformations.ps.Z, 19941114 Unifying Data and Control Transformations for Distributed Shared Memory Machines Micha Cierniak Wei Li Technical Report 542 Department of Computer Science University of Rochester fcierniak,weig@cs.rochester.edu November 1994
	ftp://ftp.cs.rochester.edu/pub/papers/theory/94.tr541.Martin_Loef_tests_can_help_too.ps.Z, 19941114 Martin-Lof Tests Can Help Too Marius Zimand Department of Computer Science University of Rochester Rochester, NY 14627 USA
	ftp://ftp.cs.rochester.edu/pub/papers/theory/94.tr543.Teaching_computational_complexity.ps.Z, 19941115 Teaching Computational Complexity: Resources to Treasure Lane A. Hemaspaandra Department of Computer Science University of Rochester Rochester, NY 14627 lane@cs.rochester.edu November 14, 1994
	ftp://ftp.cs.rochester.edu/pub/papers/ai/94.tr536.Unsupervised_classification_learning.ps.Z, 19941116 Unsupervised Classification Learning from Cross-Modal Environmental Structure by Virginia Ruth de Sa Submitted in Partial Fulfillment of the Requirements for the Degree Doctor of Philosophy Supervised by Professor Dana H. Ballard Department of Computer Science College of Arts and Science University of
	ftp://ftp.cs.rochester.edu/pub/papers/systems/94.OS_provided_coherence_can_work_almost_as_well_as_hardware.ps.gz, 19941206 OS-Provided Coherence Can Work Almost as Well as Hardware (Position Paper) Michael L. Scott Michael W. Marchetti Leonidas I. Kontothanassis Alexandros Poulos Department of Computer Science University of Rochester Rochester, NY 14627-0226 fscott,kthanasi,mwm,poulosg@cs.rochester.edu November 1994
	ftp://ftp.cs.rochester.edu/pub/papers/ai/94.tr545.Computational_theory of grounding_in_NL_conversation.ps.gz, 19941208 A Computational Theory of Grounding in Natural Language Conversation by David R. Traum Submitted in Partial Fulfillment of the Requirements for the Degree Doctor of Philosophy Supervised by Professor James F. Allen Department of Computer Science College of Arts and Science University of Rochester
	ftp://ftp.cs.rochester.edu/pub/papers/systems/94.tr547.Lazy_release_consistency_for_hardware_coherent_multiproc.ps.gz, 19941209 Lazy Release Consistency for Hardware-Coherent Multiprocessors Leonidas I. Kontothanassis, Michael L. Scott, and Ricardo Bianchini Department of Computer Science University of Rochester Rochester, NY 14627-0226 fkthanasi,scott,ricardog@cs.rochester.edu December 1994
	ftp://ftp.cs.rochester.edu/pub/papers/theory/94.tr552.Polynomial_time_membership_comparable_sets.ps.gz, 19941215 Polynomial-Time Membership Comparable Sets Mitsunori Ogihara1 Department of Computer Science University of Rochester Rochester, NY 14627 Technical Report 552 December, 1994 1Previously known as Mitsunori Ogiwara. Supported in part by the NSF and the JSPS under grant NSF-INT-9116781/JSPS-ENG-207.
	ftp://ftp.cs.rochester.edu/pub/papers/theory/94.tr553.On_helping_by_parity_like_languages.ps.gz, 19941215 On Helping by Parity-like Languages Mitsunori Ogihara1 Deptartment of Computer Science University of Rochester Rochester, NY 14627 Technical Report 553 December, 1994 1Supported in part by the JSPS under grant NSF-INT-9116781/JSPS-ENG-207. Previously known as Mitsunori Ogiwara. 1 Introduction A
	ftp://ftp.cs.rochester.edu/pub/papers/robotics/94.tr546.Vision_based_planning_and_execution of precision_grasps.ps.gz, 19941215 Vision-based Planning and Execution of Precision Grasps Olac Fuentes Hilcea F. Marengoni Randal C. Nelson The University of Rochester Computer Science Department Rochester, New York 14627 Technical Report 546 December 1994
	ftp://ftp.cs.rochester.edu/pub/papers/theory/94.tr554.Properties of probabilistic_pushdown_automata.ps.gz, 19941215 Properties of Probabilistic Pushdown Automata Ioan I. Macarie and Mitsunori Ogihara Department of Computer Science University of Rochester Rochester, NY 14627 Technical Report 554 December, 1994
	ftp://ftp.cs.rochester.edu/pub/papers/robotics/94.tr551.Morphing_hands_and_virtual_tools.ps.gz, 19941219 Morphing Hands and Virtual Tools (or what good is an extra degree of freedom) Olac Fuentes Randal C. Nelson The University of Rochester Computer Science Department Rochester, New York 14627 Technical Report 551 December 1994
	ftp://ftp.cs.rochester.edu/pub/papers/ai/94.tr555.Reevaluation of the_significance of sequence_information.ps.gz, 19941219 Reevaluation of the Significance of Sequence Information for Speech Recognition Ramesh R. Sarukkai & Dana H. Ballard e-mail: f sarukkai,dana g @cs.rochester.edu The University of Rochester Computer Science Department Rochester, New York 14627 Technical Report 555 This material is based upon work
	ftp://ftp.cs.rochester.edu/pub/papers/ai/95.NRLTR1.Deictic_codes_for_the_embodiment of cognition.ps.gz, 19941220 Deictic Codes for the Embodiment of Cognition Dana H. Ballard, Mary M. Hayhoe, and Polly K. Pook Computer Science Department University of Rochester Rochester, NY 14627, USA (dana@cs.rochester.edu, mary@cvs.rochester.edu, pook@cs.rochester.edu) Short Abstract To describe phenomena that occur at
	ftp://ftp.cs.rochester.edu/pub/papers/systems/94.High_performance_synchronization_algorithms.ps.gz, 19941220 High Performance Synchronization Algorithms for Multiprogrammed Multiprocessors Robert W. Wisniewski, Leonidas I. Kontothanassis, and Michael L. Scott Department of Computer Science University of Rochester Rochester, NY 14627-0226 fbob,kthanasi,scottg@cs.rochester.edu December 1994
	ftp://ftp.cs.rochester.edu/pub/papers/theory/94.tr561.Counting_classes_beyond_sharpP.ps.gz, 19941221 The Satanic Notations: Counting Classes Beyond #P and Other Definitional Adventures Lane A. Hemaspaandra Department of Computer Science University of Rochester Rochester, NY 14627 Heribert Vollmery Department of Mathematics University of California, Santa Barbara, CA 93106 December 20, 1994
	ftp://ftp.cs.rochester.edu/pub/papers/systems/94.tr550.Scheduler_conscious_synchronization.ps.gz, 19941228 Scheduler-Conscious Synchronization Leonidas I. Kontothanassis, Robert W. Wisniewski, and Michael L. Scott Department of Computer Science University of Rochester Rochester, NY 14627-0226 fkthanasi,bob,scottg@cs.rochester.edu December 1994
	ftp://ftp.cs.rochester.edu/pub/papers/theory/94.tr520rev.Universally_serializable_computation.ps.gz, 19941228 UNIVERSALLY SERIALIZABLE COMPUTATION LANE A. HEMASPAANDRA AND MITSUNORI OGIHARAy
	ftp://ftp.cs.rochester.edu/pub/papers/ai/94.tr537.Ploxoma_testbed_for_uncertain_inference.ps.gz, 19941229 Ploxoma: Testbed for Uncertain Inference Hannah Blau Henry E. Kyburg, Jr. fblau,kyburgg@cs.rochester.edu The University of Rochester Computer Science Department Rochester, New York 14627-0226 Technical Report 537 December 1994
	ftp://ftp.cs.rochester.edu/pub/papers/systems/95.HPCA.Software_cache_coherence_for_large_scale_multiprocessors.ps.gz, 19941229 Software Cache Coherence for Large Scale Multiprocessors Leonidas I. Kontothanassis and Michael L. Scott Department of Computer Science, University of Rochester, Rochester, NY 14627-0226 fkthanasi,scottg@cs.rochester.edu
	ftp://ftp.cs.rochester.edu/pub/papers/systems/94.tr513rev.Software_cache_coherence_for_large_scale_multiprocessors.ps.Z, 19941229 Software Cache Coherence for Large Scale Multiprocessors Leonidas I. Kontothanassis and Michael L. Scott Department of Computer Science University of Rochester Rochester, NY 14627-0226 fkthanasi,scottg@cs.rochester.edu July 1994
	ftp://ftp.cs.rochester.edu/pub/papers/systems/94.tr560.Efficient_algorithm_for_concurrent_priority_queue_heaps.ps.gz, 19950106 An Efficient Algorithm for Concurrent Priority Queue Heaps Galen C. Hunt Maged M. Michael Srinivasan Parthasarathy Michael L. Scott Department of Computer Science, University of Rochester, Rochester, NY 14627-0226 fgchunt,michael,srini,scottg@cs.rochester.edu December 1994
	ftp://ftp.cs.rochester.edu/pub/papers/robotics/95.tr567.Robot_skill_learning_through_intelligent_experimentation.ps.gz, 19950113 Robot Skill Learning Through Intelligent Experimentation by Jeff G. Schneider Submitted in Partial Fulfillment of the Requirements for the Degree Doctor of Philosophy Supervised by Professor Christopher M. Brown Department of Computer Science The College Arts and Sciences University of Rochester
	ftp://ftp.cs.rochester.edu/pub/papers/ai/95.tr562.Knowledge_rep_and_reasoning_for_mixed_initiative_planning.ps.gz, 19950117 Knowledge Representation and Reasoning for Mixed-Initiative Planning by George Montague Ferguson Submitted in Partial Fulfillment of the Requirements for the Degree Doctor of Philosophy Supervised by Professor James F. Allen Department of Computer Science The College Arts and Sciences University of
	ftp://ftp.cs.rochester.edu/pub/papers/ai/95.tr563.Combinatorial_semantics.ps.gz, 19950119 1 COMBINATORIAL SEMANTICS* Henry E. Kyburg, Jr. Computer Science and Philosophy University of Rochester Rochester, New York, 14627 kyburg@cs.rochester.edu * Research on which this paper is based was supported by the National Science Foundation, Grant IRI-9002659. Grateful acknowledgement is also made to
	ftp://ftp.cs.rochester.edu/pub/papers/theory/95.tr568.Multi_selectivity_and_complexity_lowering_joins.ps.gz, 19950123 Multi-Selectivity and Complexity-Lowering Joins Lane A. Hemaspaandra 1 Dept. of Computer Science University of Rochester Rochester, NY 14627, USA Zhigen Jiang 2 Institute of Software Chinese Academy of Sciences Beijing 100080, China J org Rothe 3 Fak. f. Mathematik u. Informatik
	ftp://ftp.cs.rochester.edu/pub/papers/theory/95.tr569.Sparse_hard_sets_for_P_yield_space_efficient_algorithms.ps.gz, 19950126 Sparse Hard Sets for P Yield Space-Efficient Algorithms Mitsunori Ogihara1 Department of Computer Science University of Rochester Rochester, NY 14627 Technical Report 569 January, 1995 1A.k.a Mitsunori Ogiwara.
	ftp://ftp.cs.rochester.edu/pub/papers/theory/95.tr572.Characterization of realizable_space_complexities.ps.gz, 19950202 Characterization of Realizable Space Complexities Joel I. Seiferas and Albert R. Meyer December 27, 1994
	ftp://ftp.cs.rochester.edu/pub/papers/systems/95.tr533rev.Categorizing_multiprocessor_communication.ps.gz, 19950203 Algorithms for Categorizing Multiprocessor Communication Under Invalidate and Update-Based Coherence Protocols Ricardo Bianchini and Leonidas Kontothanassis Department of Computer Science University of Rochester Rochester, NY 14627-0226 fricardo,kthanasig@cs.rochester.edu Technical Report 533 { Revised
	ftp://ftp.cs.rochester.edu/pub/papers/systems/95.tr573.Performance_prediction_and_tuning of parallel_programs.ps.gz, 19950214 Performance Prediction and Tuning of Parallel Programs by Mark Edward Crovella Submitted in Partial Fulfillment of the Requirements for the Degree Doctor of Philosophy Supervised by Professor Thomas J. LeBlanc Department of Computer Science College of Arts and Science University of Rochester Rochester,
	ftp://ftp.cs.rochester.edu/pub/papers/robotics/94.mccallum-nips.ps.gz, 19950215 Instance-Based State Identification for Reinforcement Learning R. Andrew McCallum Department of Computer Science University of Rochester Rochester, NY 14627-0226 mccallum@cs.rochester.edu
	ftp://ftp.cs.rochester.edu/pub/papers/robotics/94.tr525.Temporal_texture_and_activity_recognition.ps.gz, 19950223 Temporal Texture and Activity Recognition by Ramprasad B. Polana Submitted in Partial Fulfillment of the Requirements for the Degree Doctor of Philosophy Supervised by Professor Randal Nelson Department of Computer Science College of Arts and Science University of Rochester Rochester, New York 1994 ii
	ftp://ftp.cs.rochester.edu/pub/papers/systems/95.tr574.Performance_impact of processor_and_memory_heterogeneity.ps.gz, 19950309 Performance Impact of Processor and Memory Heterogeneity in a Network of Machines Mohammed Javeed Zaki Wei Li Micha l Cierniak Technical Report 574 Department of Computer Science University of Rochester fzaki,wei,cierniakg@cs.rochester.edu March 1995
	ftp://ftp.cs.rochester.edu/pub/papers/robotics/95.tr575.Nonparametric_recognition of nonrigid_motion.ps.gz, 19950313 Nonparametric Recognition of Nonrigid Motion Ramprasad Polana and Randal Nelson Department of Computer Science University of Rochester Rochester, New York 14627 Email: polana@cs.rochester.edu and nelson@cs.rochester.edu
	ftp://ftp.cs.rochester.edu/pub/papers/robotics/95.tr576.Virtual_tools_for_sensory_motor_control.ps.gz, 19950317 Virtual Tools: A Framework for Simplifying Sensory-Motor Control in Complex Robotic Systems Randal C. Nelson, Martin Jagersand and Olac Fuentes Department of Computer Science University of Rochester Rochester, New York 14627 March 15, 1995
	ftp://ftp.cs.rochester.edu/pub/papers/ai/94.tn1.rev.Dialogue_transcription_tools.ps.gz, 19950324 Dialogue Transcription Tools Peter A. Heeman and James Allen The University of Rochester Computer Science Department Rochester, New York 14627 TRAINS Technical Note 94-1 March 1995 Revised
	ftp://ftp.cs.rochester.edu/pub/papers/systems/95.tr578.Distributed_shared_memory_for_new_generation_networks.ps.gz, 19950327 Distributed Shared Memory for New Generation Networks Leonidas I. Kontothanassis and Michael L. Scott Department of Computer Science University of Rochester Rochester, NY 14627-0226 fkthanasi,scottg@cs.rochester.edu Technical Report 578 March 27, 1995
	ftp://ftp.cs.rochester.edu/pub/papers/systems/95.RTAS.A_model_and_tools_for_supporting_rt_aps_in_unix.ps.gz, 19950329 A Model and Tools for Supporting Parallel Real-Time Applications in Unix Environments Robert W. Wisniewskiy Luis F. Stevensz y Dept of Computer Science z Silicon Graphics Inc. University of Rochester 2011 N. Shoreline Boulevard Rochester, NY 14627-0226 Mountain View, CA 94043 fbobg@cs.rochester.edu
	ftp://ftp.cs.rochester.edu/pub/papers/robotics/94.tr579.Adaptive_differential_visual_feedback.ps.gz, 19950330 Adaptive Differential Visual Feedback for Uncalibrated Hand-Eye Coordination and Motor Control Martin Jagersand, Randal Nelson Department of Computer Science, University of Rochester, Rochester, NY 14627 fjag,nelsong@cs.rochester.edu http://www.cs.rochester.edu/u/fjag,nelsong/ December 14, 1994
	ftp://ftp.cs.rochester.edu/pub/papers/robotics/95.tr548rev.Active_vision_architecture_based_on_iconic_representations.ps.gz, 19950403 An Active Vision Architecture based on Iconic Representations Rajesh P.N. Rao and Dana H. Ballard Department of Computer Science University of Rochester Rochester, NY 14627, USA
	ftp://ftp.cs.rochester.edu/pub/papers/ai/95.tr435rev.Collaborating_on_referring_expressions.ps.gz, 19950405 Collaborating on Referring Expressions Peter A. Heeman Graeme Hirst Department of Computer Science Department of Computer Science University of Rochestery University of Toronto Rochester, New York Toronto, Canada 14627 M5S 1A4 heeman@cs.rochester.edu gh@cs.toronto.edu Technical Report 435 Department of
	ftp://ftp.cs.rochester.edu/pub/papers/ai/95.tr566.Analysis of hierarchical_genetic_programming.ps.gz, 19950411 An Analysis of Hierarchical Genetic Programming Justinian P. Rosca rosca@cs.rochester.edu The University of Rochester Computer Science Department Rochester, New York 14627 Technical Report 566 March 1995
	ftp://ftp.cs.rochester.edu/pub/papers/ai/95.tr565.3d_recognition_via_2stage_associative_memory.ps.gz, 19950414 3-D recognition via 2-stage associative memory Randal C. Nelson Department of Computer Science University of Rochester January 16, 1995
	ftp://ftp.cs.rochester.edu/pub/papers/systems/95.tr577.Parallel_real_time_applications_in_Unix_environments.ps.gz, 19950417 A Model and Tools for Supporting Parallel Real-Time Applications in Unix Environments Robert W. Wisniewskiy Luis F. Stevensz y Dept of Computer Science z Silicon Graphics Inc. University of Rochester 2011 N. Shoreline Boulevard Rochester, NY 14627-0226 Mountain View, CA 94043 fbobg@cs.rochester.edu
	ftp://ftp.cs.rochester.edu/pub/papers/systems/95.IJCAI.Adaptable_planner_primitives_for_real_world_ai_applications.ps.gz, 19950418 Adaptable Planner Primitives for Real-World Robotic Applications Robert W. Wisniewski and Christopher M. Brown Department of Computer Science University of Rochester Rochester, NY 14627-0226 voice: 716-275-0469 fax: 716-461-2018 fbob and browng@cs.rochester.edu
	ftp://ftp.cs.rochester.edu/pub/papers/systems/95.tr582.thesis.Exploiting_bandwidth_to_reduce_memory_access_time.ps.gz, 19950419 Exploiting Bandwidth to Reduce Average Memory Access Time in Scalable Multiprocessors by Ricardo Bianchini Submitted in Partial Fulfillment of the Requirements for the Degree Doctor of Philosophy Supervised by Professor Thomas J. LeBlanc Department of Computer Science The College Arts and Sciences
	ftp://ftp.cs.rochester.edu/pub/papers/ai/94.tn2.Trains_93_dialogues.ps.gz, 19950421 The Trains 93 Dialogues Peter A. Heeman and James Allen The University of Rochester Computer Science Department Rochester, New York 14627 TRAINS Technical Note 94-2 March 1995
	ftp://ftp.cs.rochester.edu/pub/papers/ai/95.tr570rev.Accelerating_partial_order_planners.ps.gz, 19950424 Accelerating Partial Order Planners by Improving Plan and Goal Choices Lenhart Schubert1 and Alfonso Gerevini2 1 Dept. of Computer Science, University of Rochester Rochester, NY 14627-0226, USA email: schubert@cs.rochester.edu tel.: 716-275-8845 fax: 716-461-2018 2 IRST, 38050 Povo, Trento, Italy email:
	ftp://ftp.cs.rochester.edu/pub/papers/systems/95.tr583.Functions_computable_with_limited_access_to_NP.ps.gz, 19950425 Functions Computable with Limited Access to NP Mitsunori Ogihara Department of Computer Science University of Rochester Rochester, NY 14627 Technical Report 583 April, 1995
	ftp://ftp.cs.rochester.edu/pub/papers/robotics/95.mccallum-ml.ps.Z, 19950426 Instance-Based Utile Distinctions for Reinforcement Learning with Hidden State R. Andrew McCallum Department of Computer Science University of Rochester Rochester, NY 14627-0226 mccallum@cs.rochester.edu
	ftp://ftp.cs.rochester.edu/pub/papers/theory/95.tr585.Easy_sets_and_hard_certificate_schemes.ps.gz, 19950522 Easy Sets and Hard Certificate Schemes1 Lane A. Hemaspaandra2 Department of Computer Science University of Rochester Rochester, NY 14627 lane@cs.rochester.edu J org Rothe Institut f ur Informatik Friedrich-Schiller-Universit at Jena 07743 Jena, Germany rothe@mipool.uni-jena.de Gerd Wechsung Institut f
	ftp://ftp.cs.rochester.edu/pub/papers/systems/95.PPoPP.High_Perf_Synch_Alg_for_Multiprogrammed_Multiprocessors.ps.gz, 19950602 High Performance Synchronization Algorithms for Multiprogrammed Multiprocessors Robert W. Wisniewski, Leonidas I. Kontothanassis, and Michael L. Scott Department of Computer Science University of Rochester Rochester, NY 14627-0226 fbob,kthanasi,scottg@cs.rochester.edu
	ftp://ftp.cs.rochester.edu/pub/papers/theory/95.tr557rev.Size of Classes_with_weak_membership_properties.ps.gz, 19950606 On the Size of Classes with Weak Membership Properties Marius Zimand Department of Computer Science University of Rochester Rochester, NY 14627 e-mail: zimand@cs.rochester.edu
	ftp://ftp.cs.rochester.edu/pub/papers/theory/95.tr480rev.Strong_self-reducibility_precludes_strong_immunity.ps.gz, 19950606 Strong Self-Reducibility Precludes Strong Immunity Lane A. Hemaspaandra and Marius Zimand Department of Computer Science University of Rochester Rochester, NY 14627 January 19, 1995 Classification: 68Q15. Key words: Structural Complexity Theory, Balanced Immunity, Bi-Immunity, Generic Oracles,
	ftp://ftp.cs.rochester.edu/pub/papers/theory/95.tr516rev.Weighted_NP_optimization_problems.ps.gz, 19950606 Weighted NP Optimization Problems: Logical Definability and Approximation Properties Marius Zimand Department of Computer Science University of Rochester Rochester, NY 14627 USA 1 Introduction Recent years have acknowledged considerable progress in the understanding of the approximation properties of NP
	ftp://ftp.cs.rochester.edu/pub/papers/theory/95.tr459rev.Topological_size of p-m-complete_degrees.ps.gz, 19950606 On The Topological Size of p-m-Complete Degrees Marius Zimand University of Rochester Computer Science Department
	ftp://ftp.cs.rochester.edu/pub/papers/theory/95.tr587.PL_hierarchy_collapses.ps.gz, 19950609 The PL Hierarchy Collapses Mitsunori Ogihara Department of Computer Science University of Rochester Rochester, NY 14627 Technical Report 587 June, 1995
	ftp://ftp.cs.rochester.edu/pub/papers/systems/95.tr589.Modeling_performance of parallel_programs.ps.gz, 19950619 Modeling Performance of Parallel Programs Wagner Meira, Jr. meira@cs.rochester.edu The University of Rochester Computer Science Department Rochester, New York 14627 Technical Report 589 June 1995
	ftp://ftp.cs.rochester.edu/pub/papers/robotics/95.tr534rev.Tutorial_on_filtering_restoration_and_state_estimation.ps.gz, 19950619 Tutorial on Filtering, Restoration, and State Estimation Edited by Christopher Brown The University of Rochester Computer Science Department Rochester, New York 14627 Technical Report 534 June 1995
	ftp://ftp.cs.rochester.edu/pub/papers/robotics/95.tr590.Datacube_MV200_and_ImageFlow_Users_Guide.ps.gz, 19950627 Datacube MV200 and ImageFlow User's Guide Jim Vallino University of Rochester Department of Computer Science June 1995 DATACUBE MV200 USER'S GUIDE - 1 - JUNE 1995 Table of Contents Introduction . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 2 What this report will try to tell you
	ftp://ftp.cs.rochester.edu/pub/papers/robotics/95.tr588.Mobile_robotics_1994.ps.gz, 19950628 Mobile Robotics 1994 Graduate Students: O. Fuentes, J. Karlsson, W. Meira, R. Rao T. Riopka, J. Rosca, R. Sarukkai M. Van Wie, M. Zaki Staff: T. Becker, R. Frank, B. Miller Prof. C. M. Brown The University of Rochester Computer Science Department Rochester, New York 14627 Technical Report 588 June 1995
	ftp://ftp.cs.rochester.edu/pub/papers/theory/95.tr544rev.Logspace_reducibility_Models_and_equivalences.ps.gz, 19950630 Logspace Reducibility: Models and Equivalences Lane A. Hemaspaandra Dept. of Computer Science University of Rochester Rochester, NY 14627, USA Zhigen Jiangy Institute of Software Chinese Academy of Sciences Beijing 100080, China June 28, 1995
	ftp://ftp.cs.rochester.edu/pub/papers/systems/95.tr580.Performance_measurement_and_modeling_with_lost_cycles_toolkit.ps.gz, 19950630 Performance Measurement and Modeling with the Lost Cycles Toolkit Mark E. Crovella Thomas J. LeBlanc Wagner Meira, Jr. fcrovella,leblanc,meirag@cs.rochester.edu The University of Rochester Computer Science Department Rochester, New York 14627 Technical Report 580 May 1995
	ftp://ftp.cs.rochester.edu/pub/papers/systems/95.LCPC.Recovering_logical_data_and_code_structures.ps.Z, 19950727 Recovering Logical Structures of Data Micha Cierniak and Wei Li fcierniak,weig@cs.rochester.edu Department of Computer Science, University of Rochester, Rochester, NY 14627
	ftp://ftp.cs.rochester.edu/pub/papers/systems/95.ICS.Compiler_cache_optimizations_for_banded_matrix_problems.ps.Z, 19950727 Compiler Cache Optimizations for Banded Matrix Problems Wei Li Department of Computer Science University of Rochester Rochester, NY 14627 U.S.A. wei@cs.rochester.edu
	ftp://ftp.cs.rochester.edu/pub/papers/systems/95.HPDC.Loop_scheduling_for_heterogeneity.ps.Z, 19950727 1 In Proceedings of the Fourth International Symposium on High Performance Distributed Computing, August 1995 Loop Scheduling for Heterogeneity Micha Cierniak, Wei Li, Mohammed Javeed Zaki Computer Science Department, University of Rochester, Rochester, NY 14627
	ftp://ftp.cs.rochester.edu/pub/papers/systems/95.HCW.Processor_and_Memory_Heterogeneity_in_a_Network of Machines.ps.Z, 19950727 Performance Impact of Processor and Memory Heterogeneity in a Network of Machines Mohammed Javeed Zaki, Wei Li, Micha l Cierniak Department of Computer Science University of Rochester
	ftp://ftp.cs.rochester.edu/pub/papers/systems/95.PLDI.Unifying_data_and_control_transformations.ps.Z, 19950727 Unifying Data and Control Transformations for Distributed Shared-Memory Machines Micha Cierniak Wei Li Department of Computer Science University of Rochester Rochester, NY 14627 fcierniak,weig@cs.rochester.edu
	ftp://ftp.cs.rochester.edu/pub/papers/ai/95.Ballard.Computational_model of human_vision.ps.gz, 19950728 A Computational Model of Human Vision Based on Visual Routines Dana H. Ballard and Rajesh Rao Computer Science Department University of Rochester Rochester, NY, USA 14627
	ftp://ftp.cs.rochester.edu/pub/papers/robotics/tr559.Object_indexing_using_iconic_sparse_distributed_memory.ps.gz, 19950810 Object Indexing using an Iconic Sparse Distributed Memory Rajesh P.N. Rao and Dana H. Ballard The University of Rochester Computer Science Department Rochester, New York 14627 Technical Report 559 July 1995
	ftp://ftp.cs.rochester.edu/pub/papers/ai/95.tn1.TRAINS_95_parsing_system_users_manual.ps.gz, 19950914 The TRAINS-95 Parsing System: A User s Manual1 James F. Allen Dept. of Computer Science University of Rochester Rochester, NY 14627 james@cs.rochester.edu
	ftp://ftp.cs.rochester.edu/pub/papers/systems/95.tr591.Recovering_logical_data_and_code_structures.ps.gz, 19950919 Recovering Logical Data and Code Structures Micha Cierniak Wei Li Technical Report 591 Department of Computer Science University of Rochester fcierniak,weig@cs.rochester.edu July 1995
	ftp://ftp.cs.rochester.edu/pub/papers/ai/95.tn2.Trains_world_simulator_users_manual.ps.gz, 19950922 Trains World Simulator: User's Manual Nathaniel G. Martin and Gregory J. Mitchell Department of Computer Science University of Rochester 14627 martin@cs.rochester.edu The University of Rochester Computer Science Department Rochester, New York 14627 TRAINS Technical Note 95-2 September 1995
	ftp://ftp.cs.rochester.edu/pub/papers/robotics/95.tr594thesis.Teleassistance_Deictic_gestures_control_robot_action.ps.gz, 19950928 Teleassistance: Using Deictic Gestures to Control Robot Action by Polly K. Pook Submitted in Partial Fulfillment of the Requirements for the Degree Doctor of Philosophy Supervised by Professor Dana H. Ballard Department of Computer Science The College Arts and Sciences University of Rochester Rochester,
	ftp://ftp.cs.rochester.edu/pub/papers/theory/95.tr596.Query_order_and_self_specifying_machines.ps.gz, 19951027 Query Order and Self-Specifying Machines Lane A. Hemaspaandray Department of Computer Science University of Rochester Rochester, NY 14627, USA Harald Hempel Fak. fur Math. und Informatik Friedrich-Schiller-Universitat Jena 07743 Jena, Germany Gerd Wechsung Fak. fur Math. und Informatik
	ftp://ftp.cs.rochester.edu/pub/papers/theory/95.tr597.Worlds_to_die_for.ps.gz, 19951108 Worlds To Die For Lane A. Hemaspaandra, Ajit Ramachandran, and Marius Zimand Department of Computer Science University of Rochester Rochester, NY 14627 November 1, 1995
	ftp://ftp.cs.rochester.edu/pub/papers/theory/95.tr586rev.On_randomized_cryptographic_primitives.ps.gz, 19951117 On randomized cryptographic primitives Marius Zimand Department of Computer Science University of Rochester Rochester, NY 14627 e-mail: zimand@cs.rochester.edu
	ftp://ftp.cs.rochester.edu/pub/papers/systems/95.tr598.Compile_time_inter_query_dependence_analysis.ps.gz, 19951129 Compile-time Inter-query Dependence Analysis Srinivasan Parthasarathy, Wei Li, Micha l Cierniak, Mohammed Javeed Zaki Department of Computer Science, University of Rochester, Rochester, NY 14627-0226 fsrini,wei,cierniak,zakig@cs.rochester.edu The University of Rochester Computer Science Department
	ftp://ftp.cs.rochester.edu/pub/papers/systems/95.tr602.Customized_dynamic_load_balancing.ps.gz, 19951218 Customized Dynamic Load Balancing for a Network of Workstations Mohammed Javeed Zaki, Wei Li, Srinivasan Parthasarathy fzaki,wei,srinig@cs.rochester.edu The University of Rochester Computer Science Department Rochester, New York 14627 Technical Report 602 December 1995
	ftp://ftp.cs.rochester.edu/pub/papers/systems/95.tr600.Nonblocking_and_blocking_concurrent_queue_algorithms.ps.gz, 19951218 Simple, Fast, and Practical Non-Blocking and Blocking Concurrent Queue Algorithms Maged M. Michael Michael L. Scott Department of Computer Science University of Rochester Rochester, NY 14627-0226 fmichael,scottg@cs.rochester.edu December 1995
	ftp://ftp.cs.rochester.edu/pub/papers/robotics/95.NRLTR4.rev.Dynamic_model of visual_memory.ps.gz, 19951219 Dynamic Model of Visual Memory Predicts Neural Response Properties in the Visual Cortex Rajesh P.N. Rao and Dana H. Ballard Department of Computer Science University of Rochester, Rochester, NY 14627-0226, USA Technical Report 95.4 National Resource Laboratory for the study of Brain and Behavior
	ftp://ftp.cs.rochester.edu/pub/papers/systems/96.tr604.Adaptive_scheduling_mechanisms_for_SPARTAs.ps.gz, 19960109 Adaptive Scheduling Mechanisms for SPARTAs Robert W. Wisniewski and Christopher M. Brown bob,brown@cs.rochester.edu The University of Rochester Computer Science Department Rochester, New York 14627 Technical Report 604 January 1996
	ftp://ftp.cs.rochester.edu/pub/papers/systems/96.tr605.Topological_barrier.ps.gz, 19960110 The Topological Barrier: A Synchronization Abstraction for Regularly-Structured Parallel Applications Michael L. Scott and Maged M. Michael Department of Computer Science University of Rochester Rochester, NY 14627-0226 fscott,michaelg@cs.rochester.edu keywords: barriers, synchronization, abstraction,
	ftp://ftp.cs.rochester.edu/pub/papers/robotics/96.tr581.Affine_surface_reconstruction_by_purposive_viewpoint_control.ps.gz, 19960130 Af ne Surface Reconstruction By Purposive Viewpoint Control Kiriakos N. Kutulakos kyros@cs.rochester.edu Department of Computer Sciences University of Rochester Rochester, NY 14627 0226 USA
	ftp://ftp.cs.rochester.edu/pub/papers/ai/95.heeman.IEICE.ps.gz, 19960212 Using Structural Information to Detect Speech Repairs Peter A. Heeman and Kyung-ho Loken-Kim ATR Interpreting Telecommunications Research Laboratories 2-2 Hikaridai, Seika-cho, Soraku-gun, Kyoto, 619-02 JAPAN fheeman,kyunghog@itl.atr.co.jp
	ftp://ftp.cs.rochester.edu/pub/papers/theory/96.tr584rev.Polynomial-time_semi-rankable_sets.ps.gz, 19960215 Polynomial-Time Semi-Rankable Sets Lane A. Hemaspaandra Mohammed J. Zakiy Marius Zimand Department of Computer Science University of Rochester Rochester, NY 14627
	ftp://ftp.cs.rochester.edu/pub/papers/robotics/96.tr606.Dextrous_manipulation_without_prior_object_models.ps.gz, 19960223 Experiments on Dextrous Manipulation without Prior Object Models Olac Fuentes Randal C. Nelson The University of Rochester Computer Science Department Rochester, New York 14627 Technical Report 606 February 1996
	ftp://ftp.cs.rochester.edu/pub/papers/systems/95.tr599.Memory_management_for_lock-free_data_structures.ps.gz, 19960227 Correction of a Memory Management Method for Lock-Free Data Structures Maged M. Michael Michael L. Scott Department of Computer Science University of Rochester Rochester, NY 14627-0226 fmichael,scottg@cs.rochester.edu December 1995
	ftp://ftp.cs.rochester.edu/pub/papers/systems/95.HPCA.Atomic_primitives_on_distr_shared_memory_multiprocessors.ps.gz, 19960301 Implementation of Atomic Primitives on Distributed Shared Memory Multiprocessors Maged M. Michael and Michael L. Scott Department of Computer Science, University of Rochester, Rochester, NY 14627-0226 fmichael,scottg@cs.rochester.edu
	ftp://ftp.cs.rochester.edu/pub/papers/systems/96.PODC.Non-blocking_and_blocking_concurrent_queue_algorithms.ps.gz, 19960301 Simple, Fast, and Practical Non-Blocking and Blocking Concurrent Queue Algorithms Maged M. Michael Michael L. Scott Department of Computer Science University of Rochester Rochester, NY 14627-0226 fmichael,scottg@cs.rochester.edu
	ftp://ftp.cs.rochester.edu/pub/papers/theory/96.tr616.How_to_privatize_random_bits.ps.gz, 19960429 How to Privatize Random Bits Marius Zimand The University of Rochester Computer Science Department Rochester, New York 14627 Technical Report 616
	ftp://ftp.cs.rochester.edu/pub/papers/theory/96.tr619.Witness-isomorphic_reductions_and_local_search.ps.gz, 19960507 Witness-Isomorphic Reductions and Local Search Sophie Fischer Lane Hemaspaandray Leen Torenvlietz May 6, 1996