Faculty members may submit a techreport, by logging in and clicking "Post Tech Report".

A listing of technical reports prior to 1995 can be found here. These papers are not available in electronic format.

Technical Reports

Year: Identifier:
Author: Sponsor:
Title:  
TR-2014-14
A Case for Runtime Coordination of Accuracy-aware Applications and Power-aware Systems. Henry Hoffmann. 16 October, 2014. Communicated by Henry Hoffmann.
TR-2014-13
Global View Resilience (GVR) Documentation, Release 1.0. Andrew Chien. 5 October, 2014. Communicated by Andrew Chien.
TR-2014-12
CoAdapt: Predictable Behavior for Accuracy-Aware Applications Running on Power-Aware Systems. Henry Hoffmann. 29 May, 2014. Communicated by Henry Hoffmann.
TR-2014-11
A Quantitative Evaluation of the RAPL Power Control System. Huazhe Zhang; Henry Hoffmann. 21 May, 2014. Communicated by Henry Hoffmann.
TR-2014-10
Racing and Pacing to Idle: Minimizing Energy Under Performance Constraints. David H. K. Kim; Henry Hoffmann. 21 May, 2014. Communicated by Henry Hoffmann.
TR-2014-09
Data Decomposition in Monte Carlo Neutron Transport Simulations using Global View Arrays. Nan Dun; Hajime Fujita; John R. Tramm; Andrew A. Chien; Andrew R. Siegel. 21 May, 2014. Communicated by Andrew Chien.
TR-2014-08
Log-Structured Global Array for Efficient Multi-Version Snapshots. Hajime Fujita; Nan Dun; Zachary Rubenstein; Andrew A. Chien. 16 May, 2014. Communicated by Andrew Chien.
TR-2014-07
Automatic morphological alignment and clustering. Jackson L. Lee. 2 May, 2014. Communicated by John Goldsmith.
TR-2014-06
How Applications use GVR: Use Cases. Andrew A. Chien; The GVR Team. 28 April, 2014. Communicated by Andrew Chien.
TR-2014-05
Global View Resilience, API Documentation R0.8.1-rc0. Andrew A. Chien; The GVR Team. 28 April, 2014. Communicated by Andrew Chien.
TR-2014-04
Applying GVR to Molecular Dynamics: Enabling Resilience for Scientific Computations. Aiman Fang; Andrew A. Chien. 24 April, 2014. Communicated by Andrew Chien.
TR-2014-03
Generalized Pattern Matching Micro-Engine. Yuanwei Fang; Raihan Rasool; Dilip Vasudevan; Andrew A. Chien. 25 March, 2014. Communicated by Andrew Chien.
TR-2014-02
CoAdapt: Predictable Behavior for Accuracy-Aware Applications Running on Power-Aware Systems. Henry Hoffmann. 19 March, 2014. Communicated by Henry Hoffmann.
TR-2014-01
Fault Tolerance in an Inner-outer Solver: A GVR-enabled Case Study. Ziming Zheng; Andrew A Chien; Mark Hoemmen; Keita Teranishi. 9 January, 2014. Communicated by Andrew Chien.
TR-2013-11
Error Checking and Snapshot-Based Recovery in a Preconditioned Conjugate Gradient Solver. Zachary Rubenstein; James Dinan; Hajime Fujita; Ziming Zheng; Andrew A Chien. 16 December, 2013. Communicated by Andrew Chien.
TR-2013-10
A disruptive dipole-dipole alignment promotes a stable molecular association. L. Ridgway Scott; Ariel Fernandez Stigliano. 22 November, 2013. Communicated by L. Ridgway Scott.
TR-2013-09
A Generalized Software Approach for Node-level Power Management. Henry Hoffmann; Martina Maggio. 31 October, 2013. Communicated by Henry Hoffmann.
TR-2013-08
Impact of Limpware on HDFS: A Probabilistic Estimation. Thanh Do; Haryadi S. Gunawi. 13 September, 2013. Communicated by Haryadi Gunawi.
TR-2013-07
Mathematically Informed Linear Algebra Codes Through Term Rewriting. Matthew Rocklin. 3 September, 2013. Communicated by L. Ridgway Scott.
TR-2013-06
Characterizing the Opportunity and Feasibility of Reconfigurable Memory Hierarchies for Improved Energy Efficiency. Pietro Cicotti; Laura Carrington; Andrew A. Chien. 21 August, 2013. Communicated by Andrew Chien.
TR-2013-05
A Generalized Software Framework for Accurate and Efficient Management of Performance Goals. Henry Hoffmann; Martina Maggio; Marco D. Santambrogio; Alberto Leva; Anant Agarwal. 7 August, 2013. Communicated by Henry Hoffmann.
TR-2013-04
Calibrating the Relationship between Hardware Customization and Energy Efficiency. Apala Guha; Yao Zhang; Raihan ur Rasool; Andrew A Chien. 11 July, 2013. Communicated by Andrew Chien.
TR-2013-03
Coordinating Application and System Adaptation for Performance, Power, and Accuracy Management. Henry Hoffmann. 30 May, 2013. Communicated by Henry Hoffmann.
TR-2013-02
Image Classification with Reconfigurable Spatial Structures. Sobhan Naderi Parizi. 19 April, 2013. Communicated by Pedro Felzenszwalb.
TR-2013-01
Tsunami Simulation. L. Ridgway Scott. 2 March, 2013. Communicated by L. Ridgway Scott.
TR-2012-08
Real norms are not complex. L. Ridgway Scott. 2 November, 2012. Communicated by L. Ridgway Scott.
TR-2012-07
An Evaluation of Difference and Threshold Techniques for Efficient Checkpoints. Sean Hogan; Jeff R. Hammond; Andrew A. Chien. 17 August, 2012. Communicated by Andrew Chien.
TR-2012-06
Moore’s Law: The First Ending and A New Beginning. Andrew A. Chien; Vijay Karamcheti. 17 August, 2012. Communicated by Andrew Chien.
TR-2012-05
Systematic Evaluation of Workload Clustering for Designing 10x10 Architectures. Apala Guha; Andrew Chien. 29 June, 2012. Communicated by Andrew Chien.
TR-2012-04
Measuring NUMA effects with the STREAM benchmark. Lars Bergstrom. 18 May, 2012. Communicated by John Reppy.
TR-2012-03
Typological consequences of candidate omission for weighted and ranked constraints in the {c,v} syllable structure model. Max Bane; Jason Riggle. 25 April, 2012. Communicated by John Goldsmith.
TR-2012-02
Fostering Interactions Between the Geosciences and Mathematics, Statistics, and Computer Science. L. Ridgway Scott; and twenty-six others. 3 April, 2012. Communicated by L. Ridgway Scott.
TR-2012-01
The 10x10 Foundation for Heterogeneity: Clustering Applications by Computation and Memory Behavior. Apala Guha; Pietro Ciccotti; Allan Snavely; Andrew A. Chien. 16 February, 2012. Communicated by Andrew Chien.
TR-2011-07
Exponential grids in high-dimensional space. Peter R. Brune; Matthew G. Knepley; L. Ridgway Scott. 15 December, 2011. Communicated by L. Ridgway Scott.
TR-2011-06
A group structure for strings: Towards a learning algorithm for morphophonology. John A. Goldsmith. 11 December, 2011. Communicated by John Goldsmith.
TR-2011-05
WRAPPA: A Screening Tool for Candidate Dehydron Identification. Christopher M. Fraser; Ariel Fernandez; L. Ridgway Scott. 4 December, 2011. Communicated by L. Ridgway Scott.
TR-2011-04
A New Symmetric Error Estimate for a Discrete-time Moving Mesh Method. Todd F Dupont; Itir Mogultay. 19 September, 2011. Communicated by Todd Dupont.
TR-2011-03
Vowel Harmony, Opacity, and Finite-State OT. Samuel R. Bowman. 22 July, 2011. Communicated by John Goldsmith.
TR-2011-02
Measuring NUMA effects with the STREAM benchmark. Lars Bergstrom. 26 May, 2011. Communicated by John Reppy.
TR-2011-01
Scalable solution of non-linear time-dependent systems. Mark Maienschein-Cline; L. Ridgway Scott. 19 April, 2011. Communicated by L. Ridgway Scott.
TR-2010-10
The end-game for Newton iteration. Todd Dupont; L. Ridgway Scott. 30 December, 2010. Communicated by L. Ridgway Scott.
TR-2010-09
Languages and Compilers for Variational Forms. Robert Kirby; Matt Knepley; L. Ridgway Scott. 23 October, 2010. Communicated by L. Ridgway Scott.
TR-2010-08
Evaluation of the Action of Finite Element Operators. Robert Kirby; Matt Knepley; L. Ridgway Scott. 23 October, 2010. Communicated by L. Ridgway Scott.
TR-2010-07
Two extensions to Manifold Learning Algorithms using \alpha-Complexes. Maia Fraser. 20 October, 2010. Communicated by John Goldsmith.
TR-2010-06
Nonstandard dielectric response. L. Ridgway Scott. 22 September, 2010. Communicated by L. Ridgway Scott.
TR-2010-05
Intrinsic Spectral Representation of Simplicial Finite Elements. L. Ridgway Scott. 10 September, 2010. Communicated by L. Ridgway Scott.
TR-2010-04
Fast Inference with Min-Sum Matrix Product. Pedro F. Felzenszwalb; Julian J. McAuley. 30 August, 2010. Communicated by Pedro Felzenszwalb.
TR-2010-03
An Analysis of Parallel U-cycle Multigrid Method. Dexuan Xie; L. Ridgway Scott. 20 April, 2010. Communicated by L. Ridgway Scott.
TR-2010-02
Object Detection Grammars. Pedro F. Felzenszwalb; David McAllester. 11 February, 2010. Communicated by Pedro Felzenszwalb.
TR-2010-01
Engineering Higher-Order Modules in SML/NJ. George Kuan; David MacQueen. 29 January, 2010. Communicated by Dave MacQueen.
TR-2009-03
Two statistical approaches to finding vowel harmony. Adam C. Baker. 28 July, 2009. Communicated by John Goldsmith.
TR-2009-02
An Experimental Evaluation of Keyword-Filler Hidden Markov Models. Aren Jansen; Partha Niyogi. 16 April, 2009. Communicated by Partha Niyogi.
TR-2009-01
Well-typed programs can't be blamed. Philip Wadler; Robby Findler. 6 January, 2009. Communicated by Robby Findler.
TR-2008-10
Erratum to the saturation hypothesis (SH) in "Geometric Complexity Theory". Ketan Mulmuley. 29 October, 2008. Communicated by Ketan Mulmuley.
TR-2008-09
Point Process Models for Spotting Keywords in Continuous Speech. Aren Jansen; Partha Niyogi. 19 September, 2008. Communicated by Partha Niyogi.
TR-2008-08
Three models for learning phonological categories. John A. Goldsmith; Aris Xanthos. 4 September, 2008. Communicated by John Goldsmith.
TR-2008-07
Typed Closure Conversion Preserves Observational Equivalence. Amal Ahmed; Matthias Blume. 8 July, 2008. Communicated by Robby Findler.
TR-2008-06
Equation-preserving multilanguage systems. Jacob Matthews. 25 April, 2008. Communicated by Robby Findler.
TR-2008-05
Multi-Scale Boundary Detection in Natural Images. Xiaofeng Ren. 6 April, 2008. Communicated by Pedro Felzenszwalb.
TR-2008-04
Point Process Models for Event-Based Speech Recognition. Aren Jansen; Partha Niyogi. 27 February, 2008. Communicated by Partha Niyogi.
TR-2008-03
Exception Handlers as Extensible Cases. Matthias Blume; Umut Acar; Wonseok Chae. 7 February, 2008. Communicated by Dave MacQueen.
TR-2008-02
FEM Software Automation, with a case study on the Stokes Equations. Andy Terrel. 6 February, 2008. Communicated by L. Ridgway Scott.
TR-2008-01
Manifold Regularization and Semi-supervised Learning: Some Theoretical Analyses. Partha Niyogi. 23 January, 2008. Communicated by Partha Niyogi.
TR-2007-19
Finding People in Archive Films through Tracking. Xiaofeng Ren. 11 December, 2007. Communicated by Pedro Felzenszwalb.
TR-2007-18
Imperative Self-Adjusting Computation. Umut Acar; Amal Ahmed; Matthias Blume. 9 November, 2007. Communicated by Robby Findler.
TR-2007-17
Imperative Self-Adjusting Computation. Umut A. Acar; Amal Ahmed; Matthias Blume. 10 September, 2007. Communicated by Robby Findler.
TR-2007-16
Geometric Complexity Theory: Introduction. Ketan D. Mulmuley; Milind Sohoni. 4 September, 2007. Communicated by Ketan Mulmuley.
TR-2007-15
Geometric Complexity Theory: On canonical bases for the nonstandard quantum groups. Ketan D. Mulmuley. 4 September, 2007. Communicated by Ketan Mulmuley.
TR-2007-14
Geometric Complexity Theory VII: Nonstandard quantum group for the plethysm problem. Ketan D. Mulmuley. 4 September, 2007. Communicated by Ketan Mulmuley.
TR-2007-13
On P vs. NP, Geometric Complexity Theory, and The Flip I: a high-level view. Ketan D. Mulmuley. 4 September, 2007. Communicated by Ketan Mulmuley.
TR-2007-12
Geometric Complexity Theory: Abstract. Ketan D. Mulmuley. 4 September, 2007. Communicated by Ketan Mulmuley.
TR-2007-11
A Symmetric Error Estimate for Galerkin Approximations of Time-Dependent Navier-Stokes Equations in Two Dimensions. Todd F. Dupont; Itir Mogultay. 20 July, 2007. Communicated by Todd Dupont.
TR-2007-10
A Type System for Recursive Modules. Derek Dreyer. 20 July, 2007. Communicated by Dave MacQueen.
TR-2007-09
On P vs. NP, Geometric Complexity Theory, and The Flip I: a high-level view. Ketan D. Mulmuley. 1 July, 2007. Communicated by Ketan Mulmuley.
TR-2007-08
Operational Semantics for Multi-Language Programs. Jacob Matthews; Robert Bruce Findler. 6 June, 2007. Communicated by Robby Findler.
TR-2007-07
A Probabilistic Speech Recognition Framework Based on the Temporal Dynamics of Distinctive Feature Landmark Detectors. Aren Jansen; Partha Niyogi. 1 June, 2007. Communicated by Partha Niyogi.
TR-2007-06
Dimension reduction applied to a model of sea breezes. Itir Mogultay; Todd F Dupont; Gidon Eshel. 28 May, 2007. Communicated by Todd Dupont.
TR-2007-05
Geometric Complexity Theory V: On deciding nonvanishing of a generalized Littlewood-Richardson coefficient. Ketan D. Mulmuley; Hariharan Narayanan. 18 May, 2007. Communicated by Ketan Mulmuley.
TR-2007-04
Geometric Complexity Theory VI: the flip via saturated and positive integer programming in representation theory and algebraic geometry. Ketan D. Mulmuley. 18 May, 2007. Communicated by Ketan Mulmuley.
TR-2007-03
A Rewriting Semantics for Type Inference. George Kuan. 23 March, 2007. Communicated by Dave MacQueen.
TR-2007-02
Principal Type Schemes for Modular Programs. Derek Dreyer; Matthias Blume. 5 January, 2007. Communicated by Dave MacQueen.
TR-2007-01
A Rewriting Semantics for Type Inference. George Kuan. 5 January, 2007. Communicated by Dave MacQueen.
TR-2006-10
Operational Semantics for Multi-Language Programs. Jacob Matthews; Robby Findler. 26 October, 2006. Communicated by Robby Findler.
TR-2006-09
Modular Type Classes. Derek Dreyer; Robert Harper; Manuel M.T. Chakravarty; Gabriele Keller. 26 October, 2006. Communicated by Pedro Felzenszwalb.
TR-2006-08
Principal Type Schemes for Modular Programs. Derek Dreyer; Matthias Blume. 26 October, 2006. Communicated by Pedro Felzenszwalb.
TR-2006-07
Practical Type Theory for Recursive Modules. Derek Dreyer. 31 August, 2006. Communicated by Robby Findler.
TR-2006-06
2006 Workshop on Scheme and Functional Programming. Robert Bruce Findler. 29 August, 2006. Communicated by Robby Findler.
TR-2006-05
Local Rhyme-based Acoustic Features for Mandarin Tone Recognition. Dinoj Surendran; Gina-Anne Levow. 25 May, 2006. Communicated by Gina-Anne Levow.
TR-2006-04
Additional Cues for Mandarin Tone Recognition. Dinoj Surendran; Gina-Anne Levow. 25 May, 2006. Communicated by Gina-Anne Levow.
TR-2006-03
Modular Type Classes. Derek Dreyer; Robert Harper; Manuel M.T. Chakravarty; Gabriele Keller. 14 April, 2006. Communicated by Robby Findler.
TR-2006-02
A foundation for trait-based metaprogramming (extended version). John Reppy; Aaron Turon. 1 February, 2006. Communicated by John Reppy.
TR-2006-01
Contracts as Pairs of Projections. Robby Findler; Matthias Blume. 20 January, 2006. Communicated by Robby Findler.
TR-2005-15
Contracts as Pairs of Projections. Robert Bruce Findler; Matthias Blume. 18 November, 2005. Communicated by Robby Findler.
TR-2005-14
Compiler Support for Implicit Process Sets. Ernesto Gomez; L. Ridgway Scott. 25 October, 2005. Communicated by L. Ridgway Scott.
TR-2005-13
Analysis of Pair-Wise Comparisons. L. Ridgway Scott; Angelika Longacre; Jerrold S. Levine. 6 October, 2005. Communicated by L. Ridgway Scott.
TR-2005-12
Computationally Analyzing Mass Spectra of Hydrogen Deuterium Exchange Experiments. Kevin S. Drew. 29 August, 2005. Communicated by Janos Simon.
TR-2005-11
Type-sensitive Control-flow Analysis. John Reppy. 18 July, 2005. Communicated by John Reppy.
TR-2005-10
Topological optimization of the evaluation of finite element matrices. Robert C. Kirby; Anders Logg; L. Ridgway Scott; Andy Terrel. 8 July, 2005. Communicated by Robert Kirby.
TR-2005-09
On Early Stopping in Gradient Descent Boosting. Yuan Yao; Lorenzo Rosasco; Andrea Caponnetto. 27 June, 2005. Communicated by Partha Niyogi.
TR-2005-08
A Geometric Perspective on Speech Sounds. Aren Jansen; Partha Niyogi. 27 June, 2005. Communicated by Partha Niyogi.
TR-2005-07
Embedded Debugging of C/C++ Plugins and Extension Modules. Jing Cao; David M. Beazley. 1 June, 2005. Communicated by David Beazley.
TR-2005-06
An algorithm for the unsupervised learning of morphology. John Goldsmith. 18 May, 2005. Communicated by John Goldsmith.
TR-2005-05
From Signatures to Finite State Automata. John Goldsmith; Yu Hu. 16 May, 2005. Communicated by John Goldsmith.
TR-2005-04
A heuristic for morpheme discovery based on string edit distance. John Goldsmith; Yu Hu; Irina Matveeva; Colin Sprague. 13 May, 2005. Communicated by John Goldsmith.
TR-2005-03
Optimizing FIAT with Level 3 BLAS. Robert C. Kirby. 4 May, 2005. Communicated by Robert Kirby.
TR-2005-02
Operational Semantics for Scheme via Term Rewriting. Jacob Matthews. 8 April, 2005. Communicated by Robby Findler.
TR-2005-01
Education and Research Challenges in Parallel Computing. L. Ridgway Scott; Terry Clark; Babak Bagheri. 30 January, 2005. Communicated by L. Ridgway Scott.
TR-2004-11
Graph Model Selection using the Minimum Description Length Principle. Ivona Bezakova; Adam Kalai; Rahul Santhanam. 14 December, 2004. Communicated by Lance Fortnow.
TR-2004-10
Allocating Indivisible Goods. Ivona Bezakova; Varsha Dani. 14 December, 2004. Communicated by Lance Fortnow.
TR-2004-09
About Analysa. Babak Bagheri; L. Ridgway Scott. 14 December, 2004. Communicated by L. Ridgway Scott.
TR-2004-08
Finding the Homology of Submanifolds with High Confidence from Random Samples. Partha Niyogi; Stephen Smale; Shmuel Weinberger. 12 November, 2004. Communicated by Partha Niyogi.
TR-2004-07
Evaluation of the Action of Finite Element Operators. Robert C. Kirby; Matthew Knepley; L. Ridgway Scott. 17 September, 2004. Communicated by Robert Kirby.
TR-2004-06
Manifold Regularization: A Geometric Framework for Learning from Examples. Mikhail Belkin; Partha Niyogi; Vikas Sindhwani. 25 August, 2004. Communicated by Partha Niyogi.
TR-2004-05
On Manifold Regularization. Mikhail Belkin; Partha Niyogi; Vikas Sindhwani. 20 June, 2004. Communicated by Partha Niyogi.
TR-2004-04
Optimal Evaluation of Finite Element Matrices. Robert Kirby; L. Ridgway Scott; Matthew Knepley. 7 May, 2004. Communicated by Robert Kirby.
TR-2004-03
IBL for Replica Selection in Data-Intensive Grid Applications. Yu Hu; Jennifer M. Schopf. 7 April, 2004. Communicated by Ian Foster.
TR-2004-02
An Investigation of Contracts as Projections. Robert Bruce Findler; Matthias Blume; Matthias Felleisen. 1 April, 2004. Communicated by Robby Findler.
TR-2004-01
A Fast Multigrid Method for Inverting Linear Parabolic Problems. Andrei Draganescu. 14 January, 2004. Communicated by Todd Dupont.
TR-2003-13
Statically typed traits. Kathleen Fisher; John Reppy. 12 December, 2003. Communicated by John Reppy.
TR-2003-12
Measuring the Functional Load of Phonological Contrasts. Dinoj Surendran; Partha Niyogi. 4 November, 2003. Communicated by Partha Niyogi.
TR-2003-11
Regression and Regularization on Large Graphs. Mikhail Belkin; Irina Matveeva; Partha Niyogi. 4 November, 2003. Communicated by Partha Niyogi.
TR-2003-10
Object-oriented aspects of Moby. Kathleen Fisher; John Reppy. 25 September, 2003. Communicated by John Reppy.
TR-2003-09
Locally Testable Cyclic Codes. Laszlo Babai; Amir Shpilka; Daniel Stefankovic. 12 August, 2003. Communicated by Laszlo Babai.
TR-2003-08
A linear algebraic approach to representing and computing finite elements. Robert C. Kirby. 24 June, 2003. Communicated by Robert Kirby.
TR-2003-07
A Constraint Language Approach to Grid Resource Selection. Chuang Liu; Ian Foster. 31 March, 2003. Communicated by Ian Foster.
TR-2003-06
Residual a posteriori error estimates for the mixed finite element method. Robert C. Kirby. 28 March, 2003. Communicated by Robert Kirby.
TR-2003-05
Mixing in Time and Space for Lattice Spin Systems: A Combinatorial View. Martin Dyer; Alistair Sinclair; Eric Vigoda; Dror Weitz. 9 March, 2003. Communicated by Eric Vigoda.
TR-2003-04
Elementary bounds on Poincare and log-Sobolev constants for decomposable Markov chains. Mark Jerrum; Jung-Bae Son; Prasad Tetali; Eric Vigoda. 9 March, 2003. Communicated by Eric Vigoda.
TR-2003-03
Implementing SEID as a Solution for Connecting NKCS. Svetlozar Nestorov; Nenad Jukic. 3 March, 2003. Communicated by Svetlozar Nestorov.
TR-2003-02
A Non-Markovian Coupling Technique. Thomas P. Hayes; Eric Vigoda. 25 February, 2003. Communicated by Eric Vigoda.
TR-2003-01
Data-Sharing Relationships in the Web. Adriana Iamnitchi; Matei Ripeanu; Ian Foster. 12 February, 2003. Communicated by Ian Foster.
TR-2002-12
Semi-supervised learning on manifolds. Mikhail Belkin; Partha Niyogi. 29 November, 2002. Communicated by Partha Niyogi.
TR-2002-11
Arbitrary order mixed finite elements for second order scalar elliptic problems. Robert C. Kirby. 31 October, 2002. Communicated by Robert Kirby.
TR-2002-10
TIRESIAS: A User Guide. A.N.M. Imroz Choudhury; Robert C. Kirby. 31 October, 2002. Communicated by Robert Kirby.
TR-2002-09
Locality Preserving Projections (LPP). Xiaofei He; Partha Niyogi. 29 October, 2002. Communicated by Partha Niyogi.
TR-2002-08
LLANO: Lazy evaluation, operator templates, and numerical linear algebra. Robert C. Kirby. 29 October, 2002. Communicated by Robert Kirby.
TR-2002-07
Locating Data in (Small-World?) Peer-to-Peer Scientific Collaborations. Adriana Iamnitchi; Matei Ripeanu; Ian Foster. 26 September, 2002. Communicated by Ian Foster.
TR-2002-06
A Peer-to-Peer Approach to Resource Discovery in Grid Environments. Adriana Iamnitchi; Ian Foster; Daniel C. Nurmi. 26 September, 2002. Communicated by Ian Foster.
TR-2002-05
VL Implementation Details. Ward, Brian. 5 August, 2002. Communicated by David Beazley.
TR-2002-04
Extensions to McDiarmid's inequality when differences are bounded with high probability. Samuel Kutin. 12 April, 2002. Communicated by Partha Niyogi.
TR-2002-03
Almost-everywhere algorithmic stability and generalization error. Samuel Kutin; Partha Niyogi. 25 March, 2002. Communicated by Partha Niyogi.
TR-2002-02
Detecting and Interpreting Acoustic Features Using Support Vector Machines. Partha Niyogi; Chris Burges. 16 January, 2002. Communicated by Partha Niyogi.
TR-2002-01
Laplacian Eigenmaps for Dimensionality Reduction and Data Representation. Mikhail Belkin; Partha Niyogi. 4 January, 2002. Communicated by Partha Niyogi.
TR-2001-30
The interaction of stability and weakness in AdaBoost. Samuel Kutin; Partha Niyogi. 19 October, 2001. Communicated by Partha Niyogi.
TR-2001-29
Constructing large set systems with given intersection sizes modulo composite numbers. Samuel Kutin. 30 August, 2001. Communicated by Laszlo Babai.
TR-2001-28
The Cactus Worm: Experiments with Dynamic Resource Discovery and Allocation in a Grid Environment. Gabrielle Allen; Dave Angulo; Ian Foster; Gerd Lanfermann; Chuang Liu; Thomas Radke; Ed Seidel; John Shalf. 1 August, 2001. Communicated by Ian Foster.
TR-2001-27
Cactus-G Toolkit: Supporting Efficient Execution in Heterogeneous Distributed Computing Environments. Gabrielle Allen; Thomas Dramlitsch; Ian Foster; Tom Goodale; Nick Karonis; Matei Ripeanu; Ed Seidel; Brian Toonen. 24 July, 2001. Communicated by Ian Foster.
TR-2001-26
Peer-to-Peer Architecture Case Study: Gnutella Network. Matei Ripeanu. 24 July, 2001. Communicated by Ian Foster.
TR-2001-25
Simultaneous Diophantine Approximation with Excluded Prime. Daniel Stefankovic. 30 June, 2001. Communicated by Laszlo Babai.
TR-2001-24
A large deviation inequality for vector valued martingales. Thomas P. Hayes. 15 May, 2001. Communicated by Laszlo Babai.
TR-2001-23
Performance Predictions for a Numerical Relativity Package in Grid Environments. Matei Ripeanu; Adriana Iamnitchi. 3 May, 2001. Communicated by Ian Foster.
TR-2001-22
Sensitivity, block sensitivity, and l-block sensitivity of boolean functions. Claire Kenyon; Samuel Kutin. 27 April, 2001. Communicated by Laszlo Babai.
TR-2001-21
On the number of zero-patterns of a sequence of polynomials. L. Ronyai; L. Babai; Murali K. Ganapathy. 1 January, 2001. Communicated by Laszlo Babai.
TR-2001-20
Set systems with restricted intersections modulo prime powers. L. Babai; P. Frankl; S. Kutin; D. Stefankovic. 1 January, 2001. Communicated by Laszlo Babai.
TR-2001-19
The cost of the missing bit: Communication complexity with help. L. Babai; T. Hayes; P. Kimmel. 1 January, 2001. Communicated by Laszlo Babai.
TR-2001-18
Recognizing simplicity of black-box groups and the frequency of {p}-singular elements in affine groups. L. Babai; A. Shalev. 1 January, 2001. Communicated by Laszlo Babai.
TR-2001-17
Automorphisms and enumeration of switching classes of tournaments. L. Babai; P. J. Cameron. 1 January, 2001. Communicated by Laszlo Babai.
TR-2001-16
Strong bias of group generators: an obstacle to the "product replacement algorithm.". L. Babai; I. Pak. 1 January, 2001. Communicated by Laszlo Babai.
TR-2001-15
Stronger separations for random-self-reducibility, rounds, and advice. L. Babai; S. Laplante. 1 January, 2001. Communicated by Laszlo Babai.
TR-2001-14
Finite Probability Spaces. L. Babai. 1 January, 2001. Communicated by Laszlo Babai.
TR-2001-13
Superpolynomial lower bounds for monotone span programs. L. Babai; Gal, A. Wigderson. 1 January, 2001. Communicated by Laszlo Babai.
TR-2001-12
A polynomial-time theory of black box groups I. L. Babai; R. Beals. 1 January, 2001. Communicated by Laszlo Babai.
TR-2001-11
Paul Erdos just left town. L. Babai. 1 January, 2001. Communicated by Laszlo Babai.
TR-2001-10
Finite and Transfinite Combinatorics. (Tribute to Paul Erdos.). L. Babai. 1 January, 2001. Communicated by Laszlo Babai.
TR-2001-09
Communication complexity. L. Babai. 1 January, 2001. Communicated by Laszlo Babai.
TR-2001-08
Short presentations for finite groups. L. Babai; A. J. Goodman; W. M. Kantor; E. M. Luks; P. P. Palfy. 1 January, 2001. Communicated by Laszlo Babai.
TR-2001-07
Randomized simultaneous messages: solution of a problem of Yao in communication complexity. L. Babai; P. Kimmel. 1 January, 2001. Communicated by Laszlo Babai.
TR-2001-06
Paul Erdos (1913--1996): His Influence on the Theory of Computing. L. Babai. 1 January, 2001. Communicated by Laszlo Babai.
TR-2001-05
Randomization in group algorithms: conceptual questions. L. Babai. 1 January, 2001. Communicated by Laszlo Babai.
TR-2001-04
The growth rate of vertex-transitive planar graphs. L. Babai. 1 January, 2001. Communicated by Laszlo Babai.
TR-2001-03
In and Out of Hungary: Paul Erdos, His Friends, and Times. L. Babai. 1 January, 2001. Communicated by Laszlo Babai.
TR-2001-02
A new proof of several inequalities on codes and sets. L. Babai; H. Snevily; R. M. Wilson. 1 January, 2001. Communicated by Laszlo Babai.
TR-2001-01
The Fourier Transform and Equations over Finite Abelian Groups. L. Babai. 1 January, 2001. Communicated by Laszlo Babai.
TR-2000-02
A Lower Bound on Computing Blocking Flows in Graphs. Ketan Mulmuley; Pradyut Shah. 1 November, 2000. Communicated by Ketan Mulmuley.
TR-2000-01
A Problem-Specific Fault-Tolerance Mechanism for Asynchronous, Distributed Systems. Iamnitchi, Adriana; Foster, Ian. 5 February, 2000. Communicated by Ian Foster.
TR-99-05
Solvability of Graph Inequalities. Schaefer, Marcus; Stefankovic, Daniel. 17 August, 1999.
TR-99-03
Completeness and Incompleteness. Schaefer, Marcus. 30 June, 1999.
TR-99-04
Randomness and Completeness in Computational Complexity. Van Melkebeek, Dieter. 21 May, 1999.
TR-99-02
Convergence of a Step-doubling Galerkin Method for Parabolic Problems. Ayati, Bruce P.; Dupont, Todd F.. 27 April, 1999. Communicated by Todd Dupont.
TR-99-06
New Bounds for the Distributed Firing Synchronization Problem. Settle, Tanya Amber. 26 February, 1999.
TR-99-01
Model Relaxations for the Fuel Cost Minimization of Steady-State Gas Pipeline Networks. Wu, Suming; Ríos-Mercado, Roger Z.; Boyd, E. Andrew; Scott, L. Ridgway. 16 February, 1999. Communicated by L. Ridgway Scott.
TR-98-12
Graph NonIsomorphism has Subexponential Size Proofs unless the Polynomial-Time Hierarchy Collapses. Klivans, Adam; Van Melkebeek, Dieter. 11 December, 1998.
TR-98-11
On the Quantum Complexity of Majority. Hayes, Thomas; Kutin, Samuel; Van Melkebeek, Dieter. 11 December, 1998.
TR-98-10
Galerkin Methods in Age and Space for a Population Model with Nonlinear Diffusion. Ayati, Bruce P.; Dupont, Todd F.. 9 September, 1998. Communicated by Todd Dupont.
TR-98-09
A Realization of Built-in Procedures in a Lambda Prolog Implementation. Perng, Shyan-Ming. 5 August, 1998.
TR-98-08
Derandomizing Arthur-Merlin Games. Van Melkebeek, Dieter. 14 July, 1998.
TR-98-06
Leveled Garbage Collection for Automatic Memory Management. Guanshan Tong. 8 June, 1998.
TR-98-07
On the Measure of BPP. Van Melkebeek, Dieter. 5 June, 1998.
TR-98-05
One-sided Versus Two-sided Randomness. Buhrman, Harry; Fortnow, Lance. 4 May, 1998.
TR-98-04
Graph Ramsey Theory and the Polynomial Hierarchy. Schaefer, Marcus. 30 March, 1998.
TR-98-03
Relativized Worlds with an Infinite Hierarchy. Fortnow, L.. 20 March, 1998.
TR-98-02
Automated Processing of Structured Online Documents. Kulyukin, Vladimir A.; Hammond, Kristian A.; Burke, Robin D.. 27 February, 1998.
TR-98-01
An Explicit Substitution Notation in a lambda Prolog Implementation. Nadathur, G.. 30 January, 1998. Communicated by Gopalan Nadathur.
TR-97-16
Hard Sets are Hard to Find. Buhrman, Harry; Van Melkebeek, Dieter. 28 December, 1997.
TR-97-15
A Guided Tour of Minimal Indices and Shortest Descriptions. Schaefer, Marcus. 21 November, 1997.
TR-97-14
An Interactive and Collaborative Approach To Answering Questions for an Organization. Kulyukin, Vladimir A.; Hammond, Kristian J.; Burke, Robin D.. 17 November, 1997.
TR-97-13
Kolmogorov Techniques in Computational Complexity Theory. Laplante, Sophie. 13 November, 1997.
TR-97-12
Correspondences between Classical, Intuitionistic and Uniform Provability. Nadathur, Gopalan. 7 November, 1997. Communicated by Gopalan Nadathur.
TR-97-10
A Variable Time Step Method for an Age-dependent Population Model with Nonlinear Diffusion. Ayati, Bruce P.. 25 September, 1997.
TR-97-09
Simple sets are not btt-cuppable. Schaefer, Marcus. 17 September, 1997.
TR-97-11
Nonrelativizing Separations. Buhrman, Harry; Fortnow, Lance; Thierauf, Thomas. 10 September, 1997.
TR-97-08
Non-Minimal Time Solutions for the Firing Sychronization Problem. Settle, Amber; Simon, Janos. 25 August, 1997. Communicated by Janos Simon.
TR-97-07
Realizing Modularity in lambdaProlog. Nadathur, Gopalan; Tong, Guanshan. 5 August, 1997. Communicated by Gopalan Nadathur.
TR-97-06
Simplicity and Strong Reductions. Schaefer, Marcus; Fenner, Stephen. 10 July, 1997.
TR-97-05
Question Answering from Frequently Asked Question Files: Experiences with the FAQ Finder System. Burke, Robin D.; Hammond, Kristian J.; Kulyukin, Vladimir A.; Lytinen, Steven L.; Tomuro, N.; Schoenberg, S.. 20 June, 1997.
TR-97-04
Complete Sets under Non-Adaptive Reductions are Scarce. Buhrman, Harry; Van Melkebeek, Dieter. 12 May, 1997.
TR-97-03
A Symmetric Nine-State Automaton for the Generalized Firing Synchronization Problem. Settle, Amber. 2 May, 1997.
TR-97-02
NP Might Not Be As Easy As Detecting Unique Solution. Beigel, R.; Buhrman, H.; Fortnow, L.. 28 April, 1997.
TR-96-26
Indistinguishability. Laplante, S.; Rogers, J.. 4 December, 1996.
TR-96-25
Extractors for Kolmogorov Complexity. Fortnow, L.; Laplante, S.. 4 December, 1996.
TR-96-24
Nondeterministic Polynomial Time versus Nondeterministic Logartithmic Space. Fortnow, Lance. 4 December, 1996.
TR-96-19
Combined Execution and Monitoring for Control of Autonomous Agents. Earl, Charles C.; Firby,R.James. 13 November, 1996.
TR-96-23
Simultaneous Messages vs. Communication. Babai, L.; Gal, A.; Kimmel, P.G.; Lokam, S.V.. 12 November, 1996. Communicated by Laszlo Babai.
TR-96-22
Integrating Range and Object Data for Robot Navigation. Franklin,XS David L.; Firby, R. James. 11 November, 1996.
TR-96-21
A Monotonicity Principle and Max-norm Error Bound for a Discrete Obstacle Problem. Yongmin Zhang. 8 November, 1996.
TR-96-20
Two Queries. Buhrman, H.; Fortnow, L. 25 September, 1996.
TR-96-18
BuGS 1.0 User Guide. Ayati, Bruce P.. 10 September, 1996.
TR-96-17
ECHO: An Information Gathering Agent. Fu,Xiaobin; Hammond,J.Kristian; Burke,Robin. 3 September, 1996.
TR-96-16
Two Results on Resource-Bounded Measure. Buhrman, Harry; Fenner, S.; Fortnow, L.. 30 August, 1996.
TR-96-14
WebSeer: An Image Search Engine for the World Wide Web. Frankel, Charles; Swain, Michael J; Athitsos, Vassilis. 31 July, 1996.
TR-96-15
Layer Formation in Momodispersive Suspensions. Hosoi, A.E.; Dupont, Todd F.. 18 July, 1996. Communicated by Todd Dupont.
TR-96-13
A Fine-Grained Notation for Lambda Terms and Its Use in Intensional. Nadathur, G.. 30 May, 1996. Communicated by Gopalan Nadathur.
TR-96-12
Uniformly Hard Languages. Downey, R.; Fortnow, L.. 10 May, 1996.
TR-97-01
A Notation for Lambda Terms: A Generalization of Environments. Nadathur, Gopalan; Wilson, Debra S.. 1 May, 1996. Communicated by Gopalan Nadathur.
TR-96-11
A Six Lecture Primer on Parallel Computing. Succi, Sauro; Ayati, Bruce P.; Hosoi, A.E.. 30 April, 1996.
TR-96-10
Randomized Simultaneous Messages. Babai, Laszlo; Kimmel, Peter G.. 30 April, 1996. Communicated by Laszlo Babai.
TR-96-09
Uniform Provability in Classical Logic. Nadathur, G. 19 March, 1996. Communicated by Gopalan Nadathur.
TR-96-08
Interest-Focused Tutoring: A Tractable Approach to Modeling in Intelligent Tutoring Systems. Burke, Robin D.; Kass, Alex. 23 February, 1996.
TR-96-07
Everyday-World Plan Use. Fasciano, Mark J.. 21 February, 1996.
TR-96-05
Real-Time Case-Based Reasoning in a Complex World. Fasciano, Mark J.. 21 February, 1996.
TR-96-04
Gesture Recognition Using the Perseus Architecture. Kahn, Roger E.; Swain, Michael J.; Prokopowicz, Peter N.; Firby, R. James. 19 February, 1996.
TR-96-03
Navigation for Everyday Life. Fu, Daniel D.; Hammond, Kristian J.; Swain, Michael J.. 12 February, 1996.
TR-96-01
gridIt 1.0 User Manual. Ayati, Bruce P.. 18 January, 1996.
TR-96-06
Actualized Intelligence: Case-Based Agency in Practice. Hammond, Kristian J.; Fasciano, Mark J.; Fu, Daniel D.; Converse, Timothy. 15 January, 1996.
TR-95-12
Uniform Provability in Classical Logic. Nadathur, Gopalan. 30 November, 1995. Communicated by Gopalan Nadathur.
TR-95-11
Distinguishing Complexity and Symmetry of Information. Buhrman, Harry; Fortnow, Lance. 8 November, 1995.
TR-95-10
Deciding the Vapnik-Cervonenkis dimension is Sigma_3^P-complete. Schaefer, Marcus. 20 September, 1995.
TR-95-09
A simple function that requires exponential size read-once branching programs. Gal, Anna. 31 August, 1995.
TR-95-08
Combinatorial Methods in Boolean Function Complexity. Gal, Anna. 30 August, 1995.
TR-95-07
Easy Sets Without Easy Small Subsets. Fortnow, Lance. 21 August, 1995.
TR-95-06
On Reductions of P Sets to Sparse Sets. Melkebeek, Dieter van. 7 August, 1995.
TR-95-05
On Inverting Onto Functions. Fenner, Stephen A.; Fortnow, Lance; Naik, Ashish V.; Rogers, John D.. 8 June, 1995.
TR-96-02
Hielp, A Fast Interactive Lazy Functional Language System. Bailey, Stephen W.. 1 June, 1995.
TR-95-03
Spectral Methods for Matrix Rigidity with Applications to Size-Depth Tradeoffs and Communication Complexity. Lokam, Satyanarayana V.. 5 May, 1995.
TR-95-04
Using Autoreducibility to Separate Complex Classes. Buhrman, Harry; Fortnow, Lance; Torenvliet, Leen. 26 April, 1995.
TR-95-01
Measure, Category and Learning Theory. Fortnow, Lance; Freivalds, Rusins; Gasarch, William I.; Kummer, Martin; Kurtz, Stuart A.; Smith, Carl; Stephan, Frank. 6 January, 1995. Communicated by Stuart Kurtz.
TR-94-25
Convergence in Recursive Analysis. Ho, Chun-Kuen. 15 December, 1994.
TR-94-24
Approximation and Online Algorithms for Graph Problems. Chandra, Barun. 1 December, 1994.
TR-94-23
Multiplicative equations over commuting matrices. Babai, Laszlo; Beals, Robert; Cai, Jin-yi; Ivanyos, Gabor; Luks, Eugene M.. 30 November, 1994. Communicated by Laszlo Babai.
TR-94-22
Simultaneous Messages vs. Communication. Babai, Laszlo; Kimmel, Peter G.; Lokam, Satyanarayana V.. 30 November, 1994. Communicated by Laszlo Babai.
TR-94-21
Beating A Finite Automaton in the Big Match. Fortnow, Lance; Kimmel, Peter. 23 November, 1994.
TR-94-20
The Isomorphism Conjecture Holds and One-way Functions Exist Relative to an Oracle. Rogers, John. 23 November, 1994.
TR-94-19
A note on adaptiveness and advice in coherence. Fortnow, Lance; Laplante, Sophie. 21 November, 1994.
TR-94-18
Fault tolerant circuits and probabilistically checkable proofs. Gal, Anna; Szegedy, Mario. 31 October, 1994.
TR-94-17
Intuitive Counterexamples for Constructive Fallacies. Lipton, James; O'Donnell, Michael J.. 1 October, 1994. Communicated by Michael O'Donnell.
TR-94-16
Equational Logic Programming. O'Donnell, Michael J.. 1 October, 1994. Communicated by Michael O'Donnell.
TR-94-15
Introduction: Logic and Logic Programming Languages. O'Donnell, Michael J.. 1 October, 1994. Communicated by Michael O'Donnell.
TR-94-14
Beyond P^NP = NEXP. Fenner, Stephen; Fortnow, Lance. 9 August, 1994.
TR-94-13
Run-Time and Compile-Time Improvements to Equational Programs. Sherman, David James. 15 July, 1994.
TR-94-12
Semi-unbounded fan-in circuits: Boolean vs. arithmetic. Gal, Anna. 15 July, 1994.
TR-94-11
Decomposition of Matrix Groups and Algebras. Friedl, Katalin. 10 June, 1994.
TR-94-10
Automorphism groups, isomorphism, reconstruction*. Babai, Laszlo. 9 June, 1994. Communicated by Laszlo Babai.
TR-94-09
Resource-Bounded Instance Complexity. Fortnow, Lance; Kammer, Martin. 7 June, 1994.
TR-94-08
Two results on the Bit Extraction Problem. Tsai, Shi-Chun; Friedl, Katalin. 25 May, 1994.
TR-94-07
Transparent Proofs and Limits to Approximation. Babai, Laszlo. 9 May, 1994. Communicated by Laszlo Babai.
TR-94-01
Optimality and Domination in Repeated Games. Fortnow, Lance; Whang, Duke. 20 April, 1994.
TR-94-06
Beyond Recursive Real Functions. Ho, Chun-Kuen. 25 March, 1994.
TR-94-05
The Capacity and the Sensitivity of Color Histogram Indexing. Stricker, Markus; Swain, Michael. 24 March, 1994.
TR-94-04
Simultaneous Messages vs. Communication. Babai, Laszlo; Kimmel, Peter. 11 March, 1994. Communicated by Laszlo Babai.
TR-94-03
A Kolmogorov Complexity proof of Hastad's switching lemma: An exposition. Laplante, Sophie. 11 March, 1994.
TR-94-02
Relatively Recursive Reals and Real Functions. Ho, Chun-Kuen. 18 February, 1994.
TR-93-18
t-Particle Random Walks and Recycle Random Bits in Parallel. Friedl, Katalin; Tsai, Shi-Chun. 22 December, 1993.
TR-93-17
Fault tolerant circuits and probabilistically checkable proofs. Gal, Anna; Szegedy, Mario. 13 December, 1993.
TR-93-16
Optimality and Domination in Repeated Games with Bounded Players. Fortnow, Lance; Whang, Duke. 15 November, 1993.
TR-93-15
Transparent Proofs and Limits to Approximation. Babai, Laszlo. 1 September, 1993. Communicated by Laszlo Babai.
TR-93-14
Separability and One-way Functions. Fortnow, Lance; Rogers, John. 30 August, 1993.
TR-93-13
On slightly superlinear transparent proofs. Babai, Laszlo; Friedl, Katalin. 16 August, 1993. Communicated by Laszlo Babai.
TR-93-12
On the Counting Functions. Li, Lide. 11 August, 1993.
TR-93-11
Electronic Journals: scholarly invariants in a changing medium. O'Donnell, Michael J.. 30 July, 1993. Communicated by Michael O'Donnell.
TR-93-10
Algorithms for Finite Groups. Beals, Robert M.. 29 July, 1993.
TR-93-09
A Note On Step Satisfiable Boolean Formulas. Kimmel, Peter. 21 July, 1993.
TR-93-08
A Generic Separation. Fortnow, Lance. 21 July, 1993.
TR-93-07
Direct Memory Access Parsing. Martin, Charles Eugene. 23 June, 1993.
TR-93-06
Tours, A System for Lazy Term-Based Communication. Rebelsky, Samuel A.. 17 June, 1993.
TR-93-05
Constructing Sparse Spanners for Most Graphs in Higher Dimensions. Chandra, Barun. 25 May, 1993.
TR-93-04
Efficient Algorithms for Token Management for One-bit Delay Rings with Priorities. Li, Lide; Simon, Janos. 20 May, 1993. Communicated by Janos Simon.
TR-93-03
On PP-Low Classes. Li, Lide. 14 May, 1993.
TR-93-02
Low degree test. Friedl, Katalin; Hatsagi, Zsolt. 29 April, 1993.
TR-93-01
Transparent (holographic) proofs. Babai, Laszlo. 6 January, 1993. Communicated by Laszlo Babai.
TR-92-28
Lower Bounds on Representing Boolean Functions as Polynomials in Zm. Tsai, Shi-Chun. 23 December, 1992.
TR-92-27
A Simple Proof of Representing OR Function as a Polynomial Modulo Prime Numbers. Tsai, Shi-Chun. 23 December, 1992.
TR-92-26
An Oracle Builder's Toolkit. Fenner, Stephen; Fortnow, Lance; Kurtz, Stuart A.; Li, Lide. 21 December, 1992. Communicated by Stuart Kurtz.
TR-92-25
Oracles, Proofs and Checking. Fortnow, Lance. 21 December, 1992.
TR-92-24
Online Algorithms for Graph Problems. Vishwanathan, Sundar. 16 December, 1992.
TR-92-23
Tree Pattern Matching for Strongly Sequential Systems. Hong, Jiefei. 25 November, 1992.
TR-92-22
Color and Geometry as Cues for Indexing,. Stricker, Markus A.. 23 November, 1992.
TR-92-21
Reducing the Rank of Lower Triangular All-Ones Matrices. Kimmel, Peter; Settle, Amber. 6 November, 1992.
TR-92-20
Drop Formation in a One-Dimensional Approximation of the Navier-Stokes Equation. Eggers, Jens; Dupont, Todd F.. 16 October, 1992. Communicated by Todd Dupont.
TR-92-19
How Required Compression Depends on the Thermodynamics of Rich Gas Flow. Dupont, Todd F.; Rachford, Jr., Henry H.. 2 October, 1992. Communicated by Todd Dupont.
TR-92-18
Several Procedures for Operator-Based Averaging for Elliptic Equations. Dawson, Clint N.; Dupont, Todd F.. 14 September, 1992. Communicated by Todd Dupont.
TR-92-17
Deciding finiteness of matrix groups in deterministic polynomial time. Babai, Laszlo; Beals, Robert; Rockmore, Daniel. 4 September, 1992. Communicated by Laszlo Babai.
TR-92-16
Computing the Composition Factors of Primitive Groups. Babai, Laszlo; Luks, Eugene M.; Seress, Akos. 4 September, 1992. Communicated by Laszlo Babai.
TR-92-15
Noniterative Domain Decomposition for Second Order Hyperbolic Problems. Dawson, Clint N.; Dupont, Todd F.. 2 September, 1992. Communicated by Todd Dupont.
TR-92-14
Graph Spanners. Soares, Jose. 2 September, 1992.
TR-92-13
Gap-Definability as a Closure Property. Fenner, Stephen; Fortnow, Lance; Li, Lide. 17 August, 1992.
TR-92-12
Graph Spanners: a Survey. Soares, Jose. 30 July, 1992.
TR-92-11
Short Presentations for Finite Groups. Babai, L.; Goodman, A.J.; Kantor, W. M.; Luks, E. M.; Palfy, P. P.. 15 June, 1992. Communicated by Laszlo Babai.
TR-92-10
On the Abstract Group of Automorphisms. Babai, Laszlo; Goodman, Albert J.. 15 June, 1992. Communicated by Laszlo Babai.
TR-92-09
New Sparseness Results on Graph Spanners. Chandra, Barun; Das, Gautam; Narasimhan, Giri; Soares, Jose. 29 April, 1992.
TR-92-08
An Oracle to which the Isomorphism Conjecture Holds. Fenner, Stephen; Fortnow, Lance; Kurtz, Stuart A.. 28 April, 1992. Communicated by Stuart Kurtz.
TR-92-07
Electronic Journals: scholarly invariants in a changing medium. O'Donnell, Michael J.. 9 April, 1992. Communicated by Michael O'Donnell.
TR-92-06
Observing Self-Stabilization. Lin, Chengdian; Simon, Janos. 3 March, 1992. Communicated by Janos Simon.
TR-92-05
Approximating Euclidean Distances by Small Degree Graphs. Soares, Jose. 2 March, 1992.
TR-92-04
A New Lower Bound Theorem for Read Only Once Branching Programs and Its Applications. Simon, Janos; Szegedy, Mario. 10 February, 1992. Communicated by Janos Simon.
TR-92-03
I/O Trees and I/O Support for Equational Logic Programming. Rebelsky, Samuel A.. 30 January, 1992.
TR-92-02
On the diameter of random Cayley graphs of the symmetric group. Babai, L.; Hetyei, G. L.. 20 January, 1992. Communicated by Laszlo Babai.
TR-92-01
Connecting Formal Semantics to Constructive Intuitions. Kurtz, Stuart A.; Mitchell, John C.; O'Donnell, Michael J.. 2 January, 1992. Communicated by Michael O'Donnell.
TR-91-30
Gap-Definable Counting Classes. Fenner, Steve; Fortnow, Lance; Kurtz, Stuart. 22 November, 1991. Communicated by Stuart Kurtz.
TR-91-29
An Approximation Algorithm for the Asymmetric Travelling Salesman Problem with Distances One and Two. Vishwanathan, Sundar. 12 November, 1991.
TR-91-28
An Introduction to Tours: A Protocol for Demand-Driven Communication of Terms. Rebelsky, Samuel A.. 1 November, 1991.
TR-91-27
(written by the attendees of the NSF Active Vision Workshop). Swain, M.; Stricker, M.. 14 October, 1991.
TR-91-26
Does Randomization Help in On-Line Packing?. Chandra, Barun. 30 August, 1991.
TR-91-25
Formal Power Series: An Algebraic Approach to GapP and #P. Li, Lide. 27 August, 1991.
TR-91-24
On Faithful Permutation Representations of Small Degree. Babai, Laszlo; Goodman, Albert J.. 15 August, 1991. Communicated by Laszlo Babai.
TR-91-23
On the diameter of permutation groups. Babai, Laszlo; Seress, Akos. 14 August, 1991. Communicated by Laszlo Babai.
TR-91-22
Local expansion of symmetrical graphs. Babai, Laszlo; Szegedy, Mario. 14 August, 1991. Communicated by Laszlo Babai.
TR-91-21
Permutation groups without exponentially many orbits on the power set. Babai, Laszlo; Pyber, Laszlo. 13 August, 1991. Communicated by Laszlo Babai.
TR-91-021
The Internals of the Equational Programming System, Version 3.1. Strandh, Robert. 9 August, 1991.
TR-91-20
Approximate Representation Theory of Finite Groups. Babai, Laszlo; Friedl, Katalin. 23 July, 1991. Communicated by Laszlo Babai.
TR-91-19
Thermal Simulation of Pipeline Flow. Keenan, Philip T.. 27 June, 1991.
TR-91-18
Chains, Gaps, and Finite Extensions: Three Topics in Structural Complexity. Fenner, Stephen Anthony. 11 June, 1991.
TR-91-17
Symmetry and Complexity. Babai, Laszlo; Beals, Robert; Takacsi-Nagy, Pal. 2 May, 1991. Communicated by Laszlo Babai.
TR-91-16
Nearly Linear Time Algorithms for Permutation Groups with a Small Base. Babai, Laszlo; Cooperman, Gene; Finkelstein, Larry; Seress, Akos. 2 May, 1991. Communicated by Laszlo Babai.
TR-91-15
Bounded round interactive proofs in finite groups. Babai, Laszlo. 15 April, 1991. Communicated by Laszlo Babai.
TR-91-14
Graph with Given Automorphism Group and Few Edge Orbits. Babai, Laszlo; Goodman, Albert J.; Lovasz, Laszlo. 12 April, 1991. Communicated by Laszlo Babai.
TR-91-13
Lower bounds for the complexity of reliable Boolean circuits with noisy gates. Gal, Anna. 9 April, 1991.
TR-91-12
Subdirect Reducible Groups and Edge-Minimal Graphs with Given Automorphism Group. Babai, Laszlo; Goodman, Albert J.. 5 April, 1991. Communicated by Laszlo Babai.
TR-91-11
The Edge-Orbit Conjecture of Babai. Goodman, Albert J.. 5 April, 1991.
TR-91-10
Non-Deterministic Exponential Time Has Two-Prover Interactive Protocols. Babai, Laszlo; Fortnow, Lance; Lund, Carsten. 5 April, 1991. Communicated by Laszlo Babai.
TR-91-09
Arithmetization: A New Method in Structural Complexity Theory. Babai, Laszlo; Fortnow, Lance. 5 April, 1991. Communicated by Laszlo Babai.
TR-91-08
Checking Computations in Polylogarithmic Time. Babai, Laszlo; Fortnow, Lance; Levin, Leonid A.; Szegedy, Mario. 22 March, 1991. Communicated by Laszlo Babai.
TR-91-06
Checking Computations in Polylogarithmic Time. Babai, Laszlo; Fortnow, Lance; Levin, Leonid A.; Szegedy, Mario. 7 March, 1991. Communicated by Laszlo Babai.
TR-91-05
Fast Monte Carlo Algorithms for Permutation Groups. Babai, Laszlo; Cooperman, Gene; Finkelstein, Larry; Luks, Eugene; Seress, Akos. 7 March, 1991. Communicated by Laszlo Babai.
TR-91-04
Tight lower bounds on genericity required to prevent one-way functions. Fenner, Stephen A.. 1 March, 1991.
TR-91-07
A simple online algorithm for constructing Voronoi diagrams. Mulmuley, Ketan. 25 February, 1991. Communicated by Ketan Mulmuley.
TR-91-03
Vertex-Transitive Graphs and Vertex-Transitive Maps. Babai, Laszlo. 11 February, 1991. Communicated by Laszlo Babai.
TR-91-02
Computational Complexity in Finite Groups. Babai, Laszlo. 6 February, 1991. Communicated by Laszlo Babai.
TR-91-01
The Power of Interaction. Lund, Carsten. 14 January, 1991.
TR-90-34
Notions of resource-bounded category and genericity. Fenner, Stephen A.. 31 December, 1990.
TR-90-33
Constructing Reliable Communication Networks of Small Weight Online. Chandra, Barun; Vishwanathan, Sundar. 8 November, 1990.
TR-90-32
Gap-definable counting classes. Fenner, Steve; Fortnow, Lance; Kurtz, Stuart. 7 November, 1990. Communicated by Stuart Kurtz.
TR-90-31
An Efficient Algorithm for Hidden Surface Removal II. Mulmuley, Ketan. 30 October, 1990. Communicated by Ketan Mulmuley.
TR-90-31B
Local expansion of vertex-transitive graphs and random generation in finite groups. Babai, Laszlo. 16 October, 1990. Communicated by Laszlo Babai.
TR-90-30
PP is Closed Under Truth-Table Reductions. Fortnow, Lance; Reingold, Nick. 25 September, 1990.
TR-90-29
Partial Evaluation of Intermediate Code from Equational Programs. Sherman, David J.; Strandh, Robert I.. 10 September, 1990.
TR-90-28
Lazy Directed Congruence Closure. Sherman, David J.. 10 September, 1990.
TR-90-26
Proving Unorientable Equational Formulas. Chen, Yiyun; O'Donnell, Michael J.. 30 August, 1990. Communicated by Michael O'Donnell.
TR-90-27
Nonterminating Rewritings with Head Boundedness. Chen, Yiyun; O'Donnell, Michael J.. 29 August, 1990. Communicated by Michael O'Donnell.
TR-90-25
View Dependent Partitions. Mulmuley, Ketan. 21 August, 1990. Communicated by Ketan Mulmuley.
TR-90-24
A Generalization of Dehn-Sommerville Relations to Simple Stratified Spaces. Mulmuley, Ketan. 21 August, 1990. Communicated by Ketan Mulmuley.
TR-90-23
On levels in arrangements and Voronoi diagrams, II: output sensitive and dynamic constructions. Mulmuley, Ketan. 21 August, 1990. Communicated by Ketan Mulmuley.
TR-90-22
On the Random-Self-Reducibility of Complete Sets. Feigenbaum, Joan; Fortnow, Lance. 20 August, 1990.
TR-90-20
An error estimate for a new scheme for the general variable coefficient linearized thermal pipeline equations. Keenan, Philip T.. 16 July, 1990.
TR-90-19
Sharing Common Subexpressions in EM code Programs. Sherman, David J.. 27 May, 1990.
TR-90-18
# P-completeness via man-one reductions. Zanko, Viktoria. 11 May, 1990.
TR-90-17
Maximum Diameter of Regular Digraphs. Soares, Jose A. R.. 3 May, 1990.
TR-90-16
Algebraic Methods for Interactive Proof Systems. Lund, Carsten; Fortnow, Lance; Karloff, Howard; Nisan, Noam. 30 April, 1990.
TR-90-15
E-mail and the Unexpected Power of Interaction. Babai, Laszlo. 24 April, 1990. Communicated by Laszlo Babai.
TR-90-14
BPP has Weak Subexponential Time Simulations unless EXPTIME has Publishable Proofs. Babai, Laszlo; Fortnow, Lance; Nisan, Noam; Wigderson, Avi. 23 April, 1990. Communicated by Laszlo Babai.
TR-90-13
Preliminary Notes on Version 4.1 of the Equational Compiler. Sellie, Linda; Sherman, David J.. 26 March, 1990.
TR-90-12
An Abstract Machine for Efficient Implementation of Term Rewriting. Sherman, David J.; Strandh, Robert I.. 26 March, 1990.
TR-90-11
Interactive Proof Systems and Alternating Time-Space Complexity. Fortnow, Lance; Lund, Carsten. 22 March, 1990.
TR-90-10
Vertex-Transitive Graphs and Vertex-Transitive Maps. Babai, Laszlo. 15 March, 1990. Communicated by Laszlo Babai.
TR-90-09
The Average Sensitivity of Functions in AC 0. Lund, Carsten. 27 February, 1990.