Tech Report Index By Author
Abadi, Daniel
Abiteboul, Serge
Acevedo, Daniel
Acharya, Swarup
- CS-97-15: Broadcast Disks: Dissemination-based Data Management for Asymmetric Communication Environments
- CS-94-43: Broadcast Disks: Data Management for Asymmetric Communication Environments
- CS-93-43: An Efficient Scheme for Dynamic Data Replication
Adcock, John
Agrawal, A.
Agrawal, Ajit
- CS-91-19: Approximating Fill in Solving Sparse Linear Systems
- CS-91-18: Ordering Problems Approximated: Register Sufficiency, Single-Processor Scheduling and Interval Graph
- CS-91-17: An Approximate Max-flow Min-cut Relation for Multicommodity Flow and its Applications
- CS-90-32: When Trees Collide: An Approximation Algorithm for the Generalized Steiner Problem on Networks
- CS-90-05: Fault-Tolerant Computing on Trees
Agrawal, Ajit Kumar
Ahmad, Yanif
- CS-06-05: Extensible Profile-driven Data Dissemination
- CS-04-08: The Design of the Borealis Stream Processing Engine
Akdere, Mert
Alonso, Rafael
Altun, Yasemin
- CS-04-12: Gaussian Process Classification for Segmenting and Annotating Sequences
- CS-03-23: Gaussian Process Classification for Segmenting and Annotating Sequences
Anagnostopoulos, A.
Anagnostopoulos, Aris
Andrews, Stuart
- CS-06-06: A Cutting-Plane Algorithm for Learning from Ambiguous Examples
- CS-02-15: Visualization of Contact Areas and Ligament Paths in Joints
Apgar, Scott
Apgar, Scott W.
Aron, Ionut
Atallah, Mikhail J.
Baker, J.E.
Balakrishnan, Hari
Balasubramanian, Ramprasad
Balazinska, Magdalena
- CS-04-08: The Design of the Borealis Stream Processing Engine
- CS-04-05: High-Availability Algorithms for Distributed Stream Processing
- CS-03-17: A Comparison of Stream-Oriented High-Availability Algorithms
Banchoff, Thomas F.
Barman, Dilip K.
Basye, K.
Basye, Kenneth
Battista, G.
Battista, Giuseppe Di
- CS-99-04: Turn-Regularity and Optimal Area Drawings of Orthogonal Representations
- CS-96-25: Output-Sensitive Reporting of Disjoint Paths
- CS-96-24: Drawing Directed Acyclic Graphs: An Experimental Study (Preliminary Version)
- CS-95-26: On-Line Convex Planarity Testing
- CS-94-46: Optimal Upward Planarity Testing of Single-Source Digraphs
- CS-90-10: Area Requirement and Symmetry Display of Planar-Upward Drawings
- CS-89-31: On-Line Planarity Testing
Belenkiy, Mira
Benhamou, F.
Bent, Russell
- CS-03-22: The Value of Consensus in Online Stochastic Scheduling
- CS-03-16: A Simple and Deterministic Competitive\\ Algorithm for Online Facility Location
- CS-03-10: Dynamic Vehicle Routing with Stochastic Requests
- CS-01-06: A Two-Stage Hybrid Local Search for the Vehicle Routing Problem with Time Windows
Bent, Russell W.
Berland, Matthew
Bertolazzi, Paola
Bhuphaibool, Dom
Bilardi, Gianfranco
- CS-95-17: Processor-Time Tradeoffs under Bounded-Speed Message Propagation: Part I, Upper Boundes
- CS-93-20: Horizons of Parallel Computation
Bj{\o}rnestad, Solveig
Black, Michael J.
- CS-07-03: Denoising Archival Films using a Learned Bayesian Model
- CS-06-08: HumanEva: Synchronized Video and Motion Capture Dataset for Evaluation of Articulated Human Motion
- CS-04-15: The Dense Estimation of Motion and Appearance in Layers
Blundell, Colim
Boddy, Mark
- CS-89-13: Investigations of Model-Preference Defaults
- CS-89-03: Solving Time-Dependent Planning Problems
Boddy, Mark Steven
Borger, J.
Borradaile, Glencora
Boyer, Robert
Braem, C.
Bragdon, Andrew
Breuer, Kenneth
Bridgeman, Stina
Brown, Marc H.
Brown, Mark
Buchsbaum, Adam L.
Bull, Christopher
Buss, Jonathan F.
Calistri, Randall J.
- CS-90-11: Classifying and Detecting Plan-Based Misconceptions for Robust Plans
- CS-89-37: An Annotated Compendium of Naturally Occurring Plan-Based Misconceptions
- CS-89-16: Classifying and Detecting Plan-Based Misconceptions
Camus, Ted
Camus, Theodore Armand
Cantrill, Bryan M.
Caraballo, Sharon A.
Carney, Don
- CS-02-04: Monitoring Streams - A New Class of Data Management Applications
- CS-02-01: Monitoring Streams - A New Class of DBMS Applications
Carroll, Glenn
- CS-94-08: Combining Grammars For Improved Learning
- CS-94-07: Context-Sensitive Statistics for Improved Grammatical Language Models
- CS-94-06: Taggers for Parsers
- CS-92-16: Two Experiments on Learning Probabilistic Dependency Grammars from Corpora
- CS-91-44: A Probabilistic Analysis of Marker-Passing Techniques for Plan Recognition
Cassandra, A.
Cassandra, Anthony
Cassandra, Anthony R.
- CS-96-08: Planning and Acting in Partially Observable Stochastic Domains
- CS-95-19: Efficient dynamic-programming updates in partially observable Markov decision processes
- CS-94-20: Acting Optimally in Partially Observable Stochastic Domains
- CS-94-14: Optimal Policies for Partially Observable Markov Decision Processes
Casta\~nos, Jos\'{e}G.
Castanos, Jose
Castanos, Jose Gabriel
Ceri, Stefano
Cervone, D.
Cetintemel, Ugur
- CS-08-01: Plan-based Complex Event Detection across Distributed Sources
- CS-07-06: XFlow: Internet-scale Distributed Stream Processing
- CS-06-05: Extensible Profile-driven Data Dissemination
- CS-04-10: SemCast: Semantic Multicast for Content-based Data Dissemination
- CS-04-08: The Design of the Borealis Stream Processing Engine
- CS-04-05: High-Availability Algorithms for Distributed Stream Processing
- CS-03-17: A Comparison of Stream-Oriented High-Availability Algorithms
- CS-03-03: Load Shedding in a Data Stream Manager
- CS-02-12: Load Shedding in a Data Stream Manager
- CS-02-04: Monitoring Streams - A New Class of Data Management Applications
- CS-02-01: Monitoring Streams - A New Class of DBMS Applications
Charlier, B. Le
- CS-94-17: Cardinality Analysis of Prolog
- CS-94-16: An Abstract Interpretation Framework for (almost) Full Prolog
- CS-93-52: Type Analysis of Prolog Using Type Graphs
- CS-93-13: Conceptual and Software Support for Abstract Domain Design: Generic Structural Domain and Open Product
Charlier, Baudouin Le
- CS-93-05: Abstract Interpretation of Prolog Based on OLDT Resolution
- CS-92-49: Groundness Analysis for Prolog: Implementation and Evaluation of the Domain Prop
- CS-92-25: A Universal Top-Down Fixpoint Algorithm
- CS-92-12: Reexecution in Abstract Interpretation of Prolog
- CS-91-67: Generic Abstract Interpretation Algorithms for Prolog: Two Optimization Techniques and Their Experimental Evaluation
- CS-91-55: Experimental Evaluation of a Generic Abstract Interpretation Algorithm for Prolog
- CS-90-25: A Generic Abstract Interpretation Algorithm and its Complexity Analysis (extended abstract)
Charniak, Eugene
- CS-07-04: A Generative Discourse-New Model for Text Coherence
- CS-99-12: A Maximum-Entropy-Inspired Parser
- CS-99-02: Finding Parts in Very Large Corpora
- CS-98-06: Getting Useful Gender Statistics from English Text
- CS-96-37: Expected-Frequency Interpolation
- CS-96-12: Figures of Merit for Best-First Probabilistic Chart Parsing
- CS-96-02: Tree-bank Grammars
- CS-95-29: A Statistical Syntactic Disambiguation Program and What it Learns
- CS-95-28: Parsing with Context-Free Grammars and Word Statistics
- CS-94-08: Combining Grammars For Improved Learning
- CS-94-07: Context-Sensitive Statistics for Improved Grammatical Language Models
- CS-94-06: Taggers for Parsers
- CS-92-16: Two Experiments on Learning Probabilistic Dependency Grammars from Corpora
- CS-91-44: A Probabilistic Analysis of Marker-Passing Techniques for Plan Recognition
- CS-91-12: Probabilistic Abduction for Plan Recognition
- CS-91-11: A New Admissible Heuristic for Minimal-Cost Proofs
- CS-90-13: A Probabilistic Approach to Text Understanding
- CS-90-02: Probabilistic Semantics for Cost-Based Abduction
Chase, David R.
Chase, Melissa
Chatzi, Vasiliki
- CS-00-03: Using Pyramids in Mixed Meshes - Point Placement and Basis Functions
- CS-99-01: Introduction to Integer-Coordinate Crystalline Meshes
Cherniack, Mitch
- CS-04-08: The Design of the Borealis Stream Processing Engine
- CS-03-03: Load Shedding in a Data Stream Manager
- CS-02-12: Load Shedding in a Data Stream Manager
- CS-02-04: Monitoring Streams - A New Class of Data Management Applications
- CS-02-01: Monitoring Streams - A New Class of DBMS Applications
Chiang, Yi-Jen
- CS-95-27: Dynamic and I/O-Efficient Algorithms for Computational Geometry and Graph Problems: Theoretical and Experimental Results
- CS-95-07: Experiments on the Practical I/O Efficiency of Geometric Algorithms: Distribution Sweep vs. Plane Sweep
- CS-94-34: External-Memory Graph Algorithms (extended abstract)
- CS-94-03: Optimal Shortest Path and Minimum-Link Path Queries Between Two Convex Polygons in the Presence of Obstacles
- CS-92-07: A Unified Approach to Dynamic Point Location, Ray Shooting and Shortest Paths in Planar Maps
- CS-92-06: Dynamization of the Trapezoid Method for Planar Point Location in Monotone Subdivisions
- CS-91-24: Dynamic Algorithms in Computational Geometry
Chowdhury, Anir
Cohen, R.
Cohen, R.F.
Cohen, Robert F.
- CS-92-45: Combine and Conquer
- CS-92-19: Combine and Conquer
- CS-91-02: Fully Dynamic Techniques for Reachability in Planar sT-graphs
- CS-90-35: Dynamic Expression Trees
Conner, D. Brookshire
- CS-93-33: Supporting Graphics Using Delegation and Multi-Methods
- CS-92-46: Efficient Rendering on Massively Parallel Architectures
- CS-92-01: UGA Software Standards
- CS-91-10: An Object-Oriented Framework for the Integration of Interactive Animation Techniques
Conner, D.B.
Convey, Christian
Cook, William
Cook, William R.
Cooper, Gregory
Cortesi, A.
- CS-93-52: Type Analysis of Prolog Using Type Graphs
- CS-93-13: Conceptual and Software Support for Abstract Domain Design: Generic Structural Domain and Open Product
Crisco, Joseph
Cruz, I.F.
Cruz, Isabel F.
- CS-93-58: User-Defined Visual Languages for Querying Data
- CS-93-57: Expressing Constraints for Data Display Specification: A Visual Approach
Cytron, Ron
- CS-91-21: Efficiently Computing Static Single Assignment Form and the Control Dependence Graph
- CS-88-16: An Efficient Method of Computing Static Single Assignment Form
Dai, Peng
Dayal, Umeshwar
- CS-91-41: Object-Oriented Query Optimization: What's the Problem?
- CS-91-38: An Architecture for Query Processing in Persistent Object Stores
Dean, Thomas
- CS-06-14: Learning Invariant Features Using Inertial Priors
- CS-05-13: Hierarchical Expectation Refinement for Learning Generative Perception Models
- CS-00-02: Linear Algebra in Very High-Dimension Vector Spaces: Algorithms and Data Structures for Implementing Exact and Approximate Solution Methods
- CS-97-05: Bounded Parameter Markov Decision Processes
- CS-95-10: Decomposition Techniques for Planning in Stochastic Domains
- CS-94-35: Deliberation Scheduling for Time-Critical Scheduling in Stochastic Domains
- CS-94-13: Localized Temporal Reasoning Using Subgoals and Abstraction
- CS-93-55: Planning Under Time Constraints in Stochastic Domains
- CS-93-24: Exploiting Locality in Temporal Reasoning
- CS-92-26: Package Routing in Transportation Networks with Fixed Vehicle Schedules: Formulation, Complexity Results and Approximation Algorithms
- CS-92-14: A Formal Description of the Transportation Problem
- CS-89-44: Decision-Theoretic Control of Inference for Time-Critical Applications
- CS-89-27: Coping with Uncertainty in Map Learning
- CS-89-04: A Model for Reasoning About Persistence and Causation
- CS-89-03: Solving Time-Dependent Planning Problems
Dean, Thomas L.
Degimbe, Oliver
Demiralp, Cagatay
Deville, Y.
Deville, Yves
- CS-01-05: A Constraint Satisfaction Approach for Enclosing Solutions to Parametric Ordinary Differential Equations
- CS-01-04: Optimal Pruning in Parametric Differential Equations
- CS-93-02: Design, Implementation, and Evaluation of the Constraint Language cc(FD)
- CS-91-65: A Generic Arc Consistency Algorithm and Its Specializations
- CS-90-36: Efficient Arc Consistency Algorithm for a Class of CSP Problems
- CS-90-24: The Cardinality Operator: A New Logical Connective for Constraint Logic Programming
- CS-90-23: Operational Semantics of Constraint Logic Programming over Finite Domains
Devillers, Olivier
- CS-97-11: Checking the Convexity of Polytopes and the Planarity of Subdivisions
- CS-96-27: A Probabilistic Analysis of the Power of Arithmetic Filters
Didimo, Walter
Dincbas, Mehmet
Doeppner Jr., Thomas W.
- CS-95-36: VTRACE and Communication Performance Analysis
- CS-93-59: Open Software: UNIX, DCE, and Competitors
- CS-93-53: The Thread-Monitor Library: A System Monitoring Solaris-Threads Programs
- CS-92-60: Open Software UNIX/OSF/UI, Etc.
- CS-88-19: A Threads Tutorial - Fortran Version
Domingues, Eladio
Dooms, Gregoire
Duby, Carolyn K.
- CS-93-12: Constraining the Structure and Style of Object-Oriented Programs
- CS-92-51: CCEL: A Metalanguage for C++
Eades, Peter
Egan, Kevin T.
Ehrens, David
Elsner, Micha
Englebert, Vincent
Ersan, Murat
Erway, C. Chris
Everitt, Cass
Ewald, Alan N.
Fablet, Ronan
Fernandez, Mary F.
- CS-90-27: ObServer: A Storage System for Object-Oriented Applications
- CS-90-03: Cooperative Transaction Hierarchies
Ferrante, Jeanne
- CS-91-21: Efficiently Computing Static Single Assignment Form and the Control Dependence Graph
- CS-88-16: An Efficient Method of Computing Static Single Assignment Form
Fisler, Kathi
Forsberg, Andrew
- CS-02-17: Directly Rendering Spectral Elements Using Texture Shaders
- CS-02-14: Color Rapid Prototyping for Scientific Visualization: Diffusion Tensor MRI Visualization and Topographical Exploration of Mars
Forsberg, Andrew S.
- CS-05-04: Look-That-There: Exploiting Gaze in Virtual Reality Interactions
- CS-05-02: A Comparison of a Cave and A Fish Tank VR system for Counting Biological Features in a Volume
Frances, Angel
Franklin, Michael
Frikken, Keith B.
G.Liotta,
Gardy, Daniele
- CS-91-53: On Coefficients of Powers of Functions
- CS-91-29: Saddle Point Techniques in Asymptotic Coding Theory
Garg, Ashim
- CS-96-24: Drawing Directed Acyclic Graphs: An Experimental Study (Preliminary Version)
- CS-96-13: Where to Draw the Line
- CS-94-10: On the Computational Complexity of Upward and Rectilinear Planarity Testing
Gervet, Carmen
Givan, Robert
Globus, Al
Gold, Melissa Y.
Goldin, D.
Goldin, Dina
- CS-04-14: The Orgins of the Turing Thesis Myth
- CS-99-14: Behavior and Expressiveness of Persistent Turing Machines
- CS-99-13: Mathematical Models of Interactive Computing
Goldin, Dina Q
Goldman, Robert
Goldman, Robert P.
- CS-90-17: A Logic-Programming Approach to All-Paths Parsing
- CS-90-13: A Probabilistic Approach to Text Understanding
- CS-89-13: Investigations of Model-Preference Defaults
Goldman, Robert Prescott
Goldwasser, M.
Goldwater, Sharon
Golin, Eric J.
- CS-90-19: A Method for the Specification and Parsing of Visual Languages
- CS-89-06: Parsing in a Visual Language Environment
- CS-89-05: Representing Visual Programs with Object-Graphs
Gondek, David
Goodrich, Michael T.
- CS-94-34: External-Memory Graph Algorithms (extended abstract)
- CS-92-44: Blocking for External Graph Searching
Gordon, Colin S.
Gordon, Geoff
Gotoh, Yoshihiko
Gottlieb, Lee-Ad J.
Greenberg, Micheal Matthew
Greenfield, Eliot
Greenwald, Amy
- CS-07-10: No-Regret Learning in Convex Games
- CS-06-15: Heuristics for the Deterministic Bidding Problem: Lessons from TAC Travel
- CS-06-10: Bounds for Regret-Matching Algorithms
- CS-06-01: Blackwell's Approachability Theorem: A Generalization in a Special Case
- CS-05-16: Bid Determination in Simultaneous Auctions
- CS-05-08: Correlated Q-Learning
- CS-05-07: A Direct Proof of the Existense of Correlated Equilibrium Policies in General-Sum Markov Games
- CS-04-09: Varieties of Regret in Online Prediction
Greenwald, Lloyd
- CS-94-41: Time-Critical Planning and Scheduling Research at Brown University
- CS-94-35: Deliberation Scheduling for Time-Critical Scheduling in Stochastic Domains
- CS-92-26: Package Routing in Transportation Networks with Fixed Vehicle Schedules: Formulation, Complexity Results and Approximation Algorithms
- CS-91-04: The Lark Project: Design of a Highly Parallel Programmable Logic Array
Greenwald, Lloyd G.
Grimm, Cindy
Grollman, Daniel H
Grove, Edward F.
H.B.Netzer, Robert
Hale, John
Hall, Keith
Harkness, Cheryl L.
- CS-90-12: VLSI Placement Using Uncertain Costs
- CS-89-43: Improved Methods for Modeling Uncertainty in RC Timing Analysis
- CS-89-38: Modeling Uncertainty in RC Timing Analysis
- CS-89-07: Simulating Switch-Level Networks with Uncertain Transistor Strengths and Node Sizes
Harkness, Cheryl Lynn
Harper, Mary Patricia
Hazlehurst, Samuel E.
Herlihy, Maurice
- CS-07-08: Transactional Boosting: A Methodology for Highly-Concurrent Transactional Objects
- CS-96-03: The Topological Structure of Asynchronous Computability
Hillebrand, G.
Hillebrand, Gerd
Hillebrand, Gerd G.
- CS-94-26: Functional Database Query Languages as Typed Lambda Calculi of Fixed Order
- CS-94-25: An Analysis of the Core-ML Language: Expressive Power and Type Reconstruction
- CS-94-24: Finite Model Theory in the Simply Typed Lambda Calculus
- CS-93-06: Database Query Languages Embedded in the Typed Lambda Calculus
- CS-92-20: Undecidable Boundedness Problem For Datalog Program
Hoang, Dzung T.
Hoang, Dzung Tien
Hofmann, Thomas
- CS-06-06: A Cutting-Plane Algorithm for Learning from Ambiguous Examples
- CS-04-12: Gaussian Process Classification for Segmenting and Annotating Sequences
- CS-03-23: Gaussian Process Classification for Segmenting and Annotating Sequences
Holden, Loring
Howard, Paul G.
- CS-92-18: Practical Implementations of Arithmetic Coding
- CS-92-17: Analysis of Arithmetic Coding for Data Compression
- CS-91-47: New Methods for Lossless Image Compression Using Arithmetic Coding
- CS-91-45: Practical Implementations of Arithmetic Coding
- CS-91-03: Analysis of Arithmetic Coding for Data Compression
Howard, Paul Glor
Huang, Nate
Hubbard, P.
Hubbard, Philip M.
- CS-95-08: Collision Detection for Interactive Graphics Applications
- CS-93-04: Space-Time Bounds for Collision Detection
- CS-91-30: UGA: A Unified Graphics Architecture
- CS-90-07: Constructive Solid Geometry for Triangulated Polyhedra
Hudson, Benoit
Hueso, Eduardo
Hughes, John F.
- CS-04-16: Customizable Presentations
- CS-04-03: Animation Sketching: An Approach to Accessible Animation
- CS-03-19: Fast, Practical and Robust Shadows
- CS-03-05: Differential Geometry of Implicit Surfaces in 3-Space - A Primer
Hughey, Richard
- CS-89-32: The B-SYS Programmable Systolic Array
- CS-89-08: An Architecture for Programmable Systolic Arrays
Hughey, Richard Paul
Hunt III, H.B.
Husain, Saadia
Hwang, Jeong-Hyon
- CS-04-08: The Design of the Borealis Stream Processing Engine
- CS-04-05: High-Availability Algorithms for Distributed Stream Processing
- CS-03-17: A Comparison of Stream-Oriented High-Availability Algorithms
I.G.Tollis,
Imbert, J.L.
Imbert, Jean-Louis
- CS-92-11: A Note on Redundant Linear Constraints
- CS-91-23: Efficient Handling of Disequations in CLP Over Linear Rational Arithmetic
Jackson, Cullen D.
Jafari, Amir
Jannotti, \\ John
Jannotti, John
- CS-07-06: XFlow: Internet-scale Distributed Stream Processing
- CS-06-05: Extensible Profile-driven Data Dissemination
- CS-04-08: The Design of the Borealis Stream Processing Engine
Janssen, M.
Janssen, Micha
- CS-02-06: Precisely A(alpha)-stable One-Leg Multistep Methods
- CS-02-02: Shifted Slope-Comparison Multistep Formulas for ODEs
- CS-01-05: A Constraint Satisfaction Approach for Enclosing Solutions to Parametric Ordinary Differential Equations
- CS-01-04: Optimal Pruning in Parametric Differential Equations
Jenkins, Odest Chadwicke
- CS-05-12: Real-time Silhouette Intersection by Maintaining the Distribution of Occupancy
- CS-05-11: Extensible Data-driven Classification of Robot Sensor Data
Kaelbling, L.
Kaelbling, Leslie
Kaelbling, Leslie Pack
- CS-97-04: Learning Hidden Markov Models with Geometric Information
- CS-96-08: Planning and Acting in Partially Observable Stochastic Domains
- CS-95-19: Efficient dynamic-programming updates in partially observable Markov decision processes
- CS-94-41: Time-Critical Planning and Scheduling Research at Brown University
- CS-94-39: A Bibliography of Work Related to Reinforcement Learning
- CS-94-20: Acting Optimally in Partially Observable Stochastic Domains
- CS-93-55: Planning Under Time Constraints in Stochastic Domains
Kanazawa, Keiji
- CS-92-61: Reasoning about Time and Probability
- CS-89-13: Investigations of Model-Preference Defaults
- CS-89-04: A Model for Reasoning About Persistence and Causation
Kanellakis, Paris
- CS-94-28: Functional Programming Formalisms for OODB Methods
- CS-94-26: Functional Database Query Languages as Typed Lambda Calculi of Fixed Order
- CS-94-09: Indexing for Data Models with Constraints and Classes
- CS-92-33: Method Schemas
- CS-89-26: Object Identity As A Query Language Primitive
Kanellakis, Paris C.
- CS-95-15: OODB Indexing by Class-Division
- CS-94-31: Constraint Programming and Database Query Languages
- CS-94-29: Efficient Parallelism vs Reliable Distribution: a Trade-off for Concurrent Computations
- CS-94-25: An Analysis of the Core-ML Language: Expressive Power and Type Reconstruction
- CS-94-23: Controlling Memory Access Concurrency in Efficient Fault-Tolerant Parallel Algorithms
- CS-93-21: Indexing for Data Models with Constraints and Classes
- CS-93-06: Database Query Languages Embedded in the Typed Lambda Calculus
- CS-92-50: Constraint Query Languages
- CS-92-20: Undecidable Boundedness Problem For Datalog Program
- CS-91-54: Parallel Algorithms with Processor Failures and Delays
- CS-91-36: Efficient Parallel Algorithms on Restartable Fail-stop Processors
- CS-90-31: Constraint Query Languages
- CS-90-26: Unification and ML Type Reconstruction
- CS-89-40: Polymorphic Unification of ML Typing
- CS-89-39: Elements of Relational Database Theory
- CS-89-35: Efficient Parallel Algorithms Can Be Made Robust
- CS-89-21: A Data Structure for Arc Insertion and Regular Path Finding
Kang, Sarah
Kant, G.
Kapur, D.
Karelitz, David B.
Karniadakis, George
Katriel, Irit
Katz, Jeremy
Keefe, Daniel F.
Kenyon-Mathieu, Claire M.
Kilgard, Mark
Kim, Kee-Eung
Kirby, R.M.
Kirman, Jak
- CS-94-44: Predicting Real-Time Planner Preformance by Domain Characterization
- CS-93-55: Planning Under Time Constraints in Stochastic Domains
Klein, P.
Klein, Philip
- CS-94-12: Faster Shortest-Path Algorithms for Planar Graphs
- CS-92-54: A Nearly best-possible approximation algorithm for node-weighted Steiner trees
- CS-92-30: When Cycles Collapse: A General Approximation Technique for Constrained Two-Connectivity Problems
- CS-91-48: Parallel Algorithms for Chordal Graphs
- CS-91-43: Faster Approximation Algorithms for the Unit-Capacity Concurrent Flow Problem with Applications to Routing and Finding Sparse Cuts
- CS-91-19: Approximating Fill in Solving Sparse Linear Systems
- CS-91-18: Ordering Problems Approximated: Register Sufficiency, Single-Processor Scheduling and Interval Graph
- CS-91-17: An Approximate Max-flow Min-cut Relation for Multicommodity Flow and its Applications
- CS-90-32: When Trees Collide: An Approximation Algorithm for the Generalized Steiner Problem on Networks
Klein, Philip N.
- CS-96-07: Efficient Approximation Algorithms for Semidefinite Programs Arising from MAX CUT and COLORING
- CS-93-49: A Randomized Linear-Time Algorithm for Finding Minimum Spanning Trees
- CS-93-47: A Data Structure for Bicategories with Application to Speeding Up an Approximation Algorithm
- CS-93-35: A Linear-Processor Polylog-Time Algorithm for Shortest Paths in Planar Graphs
- CS-93-30: Bounds on the Max-Flow Min-Cut Ratio for Directed Multicommodity Flows
- CS-93-29: Detecting Race Conditions in Parallel Programs That Use One Semaphore
- CS-91-58: Approximating Concurrent Flow with Uniform Demands and Capacities: An Implementation
- CS-91-56: A Parallel Randomized Approximation Scheme for Shortest Paths
- CS-90-16: Parallelism, Preprocessing, and Reachability: A Hybrid Algorithm for Directed Graphs
Knobe, Kathleen
Koskinen, Eric
Krishnamurthi, Shriram
- CS-06-12: ASM Relational Transducer Security Policies
- CS-06-04: Towards Reasonability Properties for Access-Control Policy Languages with Extended XACML Analysis
- CS-03-20: FrTime: Functional Reactive Programming in PLT Scheme
- CS-03-07: A Constraint-Based Approach to Open Feature Verification
- CS-02-13: A Semantics for Pointcuts and Advice in Higher-Order Languages
Krishnan, P.
- CS-95-24: Online Prediction Algorithms for Databases and Operating Systems
- CS-91-59: Combinatorial Optimization 1990: Lecture Notes
- CS-91-46: Optimal Prefetching via Data Compression
Kupcu, Alptekin
Kuper, Gabriel M.
Kurien, J.
Laidlaw, David
- CS-02-18: Hierarchical Clustering of Streamtubes
- CS-02-16: Simulation and Visualization of Air Flow Around Bat Wings During Flight
- CS-02-15: Visualization of Contact Areas and Ligament Paths in Joints
- CS-02-14: Color Rapid Prototyping for Scientific Visualization: Diffusion Tensor MRI Visualization and Topographical Exploration of Mars
Laidlaw, David H.
- CS-05-09: Comparative Evaluation of Desktop and Cave Environments for Learning Hypercube Rotations
- CS-04-06: Visualization of the interaction of multiple sclerosis lesions with adjacent white matter fibers using streamtubes and streamsurfaces
- CS-03-26: Using CavePainting to Create Scientific Visualizations
Lamagna, Edmund A.
Landon, Benjamin R.
Langworthy, D.
Langworthy, David E.
- CS-95-22: On the use of Asynchrony in achieving Extensibility and High Performance in an object Storage System
- CS-94-22: Storage Class Extensibility in the Brown Object Storage System
- CS-93-45: Extensible High-Performance Support for Persistence
LaViola Jr., Joseph J.
- CS-04-11: Fluid Inking: Using Punctuation to Allow Modeless Combination of Marking andGesturing
- CS-02-07: The Predictive Tracking Algorithm Testing Suite: A Tool for Developing and Analyzing Predictive Tracking Algorithms
- CS-01-03: Immersive Hierarchical Visualization and Steering for Spectral/hp Element Methods
- CS-99-15: Whole-Hand and Speech Input in Virtual Environments
- CS-99-11: A Survey of Hand Posture and Gesture Recognition Techniques and Technology
- CS-99-09: A Discussion of Cybersickness in Virtual Environments
- CS-99-08: The Coach's Playbook
- CS-97-17: Analysis of Mouse Movement Time based on Varying Control to Display Ratios using Fitts' Law
Leach, Sonia
Lease, Matthew
Lee, Sangdon
- CS-02-04: Monitoring Streams - A New Class of Data Management Applications
- CS-02-01: Monitoring Streams - A New Class of DBMS Applications
Lee, Seong Jae
Lejter, Luis David
Lejter, Moises
- CS-91-52: Support for Maintaining Object-Oriented Programs
- CS-91-51: Automatic Detection of C{\tt ++}Programming Errors: Initial Thoughts on a {\sf lint{\tt ++}}
Lenhart, William
Leung, Theodore W.
- CS-94-05: Compiling Object-Oriented Queries
- CS-93-10: Ordered Types in the Aqua Data Model
- CS-93-09: The Aqua Data Model And Algebra
Li, Zheng
Lin, Jyh-Han
- CS-92-53: A Theory for Memory-Based Learning
- CS-92-37: Approximation Algorithms for Geometric Median Problems
- CS-92-29: Approximations with Minimum Packing Constraint Violation
- CS-90-01: Complexity Issues in Learning by Neural Nets
- CS-88-17: Learning in Parallel
Lin, Sheiu-Hong
Lin, Shieu-Hong
- CS-97-14: Exploiting Structure for Planning and Control
- CS-95-10: Decomposition Techniques for Planning in Stochastic Domains
- CS-93-24: Exploiting Locality in Temporal Reasoning
Lin, Yi-Jing
- CS-95-31: Configuration Management in Terms of Logical Structures
- CS-95-23: Configuration Management with Logical Structures
- CS-94-45: Configuration Management in terms of Modules
- CS-93-38: An Object-Centered Approach to Designing Programming Environments
- CS-91-37: A Framework for Automatic Algorithm Animation
Lin, Yueh-Hong
Lindner, Wolfgang
Liotta, G.
- CS-96-29: Area Requirement of Gabriel Drawings
- CS-96-23: Area Requirement of Visibility Representations of Trees
- CS-96-22: The Rectangle of Influence Drawability Problem
- CS-96-16: Robust Proximity Queries in Implicit Voronoi Diagrams
Liotta, Giuseppe
- CS-99-04: Turn-Regularity and Optimal Area Drawings of Orthogonal Representations
- CS-97-11: Checking the Convexity of Polytopes and the Planarity of Subdivisions
- CS-96-28: Low Degree Algorithms for Computing and Checking Gabriel Graphs
- CS-96-24: Drawing Directed Acyclic Graphs: An Experimental Study (Preliminary Version)
- CS-96-21: Proximity Drawings of Outerplanar Graphs (Preliminary Version)
Littman, Michael
Littman, Michael L.
- CS-96-11: Generalized Markov Decision Processes: Dynamic-programming and Reinforcement-learning Algorithms
- CS-96-10: A Generalized Reinforcement-Learning Model: Convergence and Applications
- CS-96-08: Planning and Acting in Partially Observable Stochastic Domains
- CS-95-19: Efficient dynamic-programming updates in partially observable Markov decision processes
- CS-94-40: The Witness Algorithm: Solving Partially Observable Markov Decision Processes
- CS-94-39: A Bibliography of Work Related to Reinforcement Learning
- CS-94-20: Acting Optimally in Partially Observable Stochastic Domains
Littman, Michael Lederman
Liu, Liyuan
Loper, Matthew Maverick
Lopresti, Daniel
Lopresti, Daniel P.
- CS-91-04: The Lark Project: Design of a Highly Parallel Programmable Logic Array
- CS-90-12: VLSI Placement Using Uncertain Costs
- CS-89-43: Improved Methods for Modeling Uncertainty in RC Timing Analysis
- CS-89-38: Modeling Uncertainty in RC Timing Analysis
- CS-89-32: The B-SYS Programmable Systolic Array
- CS-89-18: I/O Overhead and Parallel VLSI Architectures for Lattice Computations
- CS-89-07: Simulating Switch-Level Networks with Uncertain Transistor Strengths and Node Sizes
Lu, Hsueh-I
- CS-96-33: Efficient Approximation Algorithms for Some Semidefinite Programs
- CS-96-07: Efficient Approximation Algorithms for Semidefinite Programs Arising from MAX CUT and COLORING
- CS-96-06: A Near-linear-time Approximation Algorithm for Maximum-leaf Spanning Tree
- CS-96-05: The Power of Local Optimizations: Approximation Algorithms for Maximun-leaf Spanning Tree (DRAFT)*
- CS-93-29: Detecting Race Conditions in Parallel Programs That Use One Semaphore
Lu, Philip N. Klein Hsueh-I
Luks, D.
Lysyanskaya, Anna
Madden, Samuel
Mairson, Harry G.
- CS-94-25: An Analysis of the Core-ML Language: Expressive Power and Type Reconstruction
- CS-93-06: Database Query Languages Embedded in the Typed Lambda Calculus
- CS-92-20: Undecidable Boundedness Problem For Datalog Program
- CS-90-26: Unification and ML Type Reconstruction
Mannino, Carlo
Manohar, Swaminathan
Marai, G.Elisabeta
Marathe, M.V.
Markosien, Lee
Marks, Casey
- CS-07-10: No-Regret Learning in Convex Games
- CS-06-10: Bounds for Regret-Matching Algorithms
- CS-06-01: Blackwell's Approachability Theorem: A Generalization in a Special Case
- CS-05-05: The Soundness and Completeness of Margrave with Respect to a Subset of XACML
- CS-04-09: Varieties of Regret in Online Prediction
Marquez, Alberto
Matejic, Larisa
Mayer, A.
McAllester, D.
- CS-95-01: Solving Polynomial Systems Using a Branch and Prune Approach
- CS-94-18: CLP (Intervals) Revisited
McCann, John
McClain, Andrew W.
McCluskey, Peter C.
McGuire, Morgan
Meijer, A. Lubiw H.
Mercier, Luc
Meyer, Tom
Meyerovich, Leo A.
Meyerovich, Leo Alexander
Meyers, Scott
- CS-93-37: Facilitating Software Maintenance by Automated Detection of Constraint Violations
- CS-93-23: CCEL: The C++ Constraint Expression Language: An Annotated Reference Manual, Version 0.5
- CS-93-12: Constraining the Structure and Style of Object-Oriented Programs
- CS-93-03: FIELD Support for C++
- CS-92-51: CCEL: A Metalanguage for C++
- CS-91-52: Support for Maintaining Object-Oriented Programs
- CS-91-51: Automatic Detection of C{\tt ++}Programming Errors: Initial Thoughts on a {\sf lint{\tt ++}}
- CS-91-50: A System for Multiparadigm Development of Software Systems
- CS-89-02: Creating Graphical Languages in Garden
- CS-89-01: Annotating Software With Arbitrary Performance Characteristics
Meyers, Scott Douglas
Michailidis, Dimitris
- CS-94-29: Efficient Parallelism vs Reliable Distribution: a Trade-off for Concurrent Computations
- CS-94-23: Controlling Memory Access Concurrency in Efficient Fault-Tolerant Parallel Algorithms
Michel, L.
Michel, Laurent
- CS-07-09: Length-Lex Open Constraints
- CS-04-07: Constraint-Based Combinators for Local Search
- CS-04-01: Scheduling Abstractions for Local Search
- CS-03-21: Iterative Relaxations for Iterative Flattening in Cumulative Scheduling
- CS-03-06: Control Abstractions for Local Search
- CS-02-05: A Simple Tabu Search for Warehouse Location
- CS-01-02: Localizer++: An Open Library for local Search
- CS-00-07: OPL++: A Modeling Layer for Constraint Programming Libraries
- CS-98-03: Job-Shop Scheduling in Localizer
- CS-98-02: Localizer
- CS-97-03: Localizer: A Modeling Language for Local Search
- CS-95-33: Helios: A Modeling Language for Nonlinear Constraint Solv ing and Global Optimization using Interval Analysis
- CS-95-32: Helios: A Mathematical Modeling Language for Newton
- CS-95-25: Newton: Constraint Programming over Nonlinear Real Constraints
- CS-93-05: Abstract Interpretation of Prolog Based on OLDT Resolution
Miller, Barton P.
- CS-94-32: Optimal Tracing and Replay for Debugging Message-Passing Parallel Programs
- CS-92-55: Experience with Techniques for Refining Data Race Detection
Miller, David M.
Miller, Timothy
- CS-05-10: Fluid Inking: Modeless Integration of Gestures with Inking
- CS-04-11: Fluid Inking: Using Punctuation to Allow Modeless Combination of Marking andGesturing
- CS-96-15: Hidden-Surfaces: Combining BSP Trees with Graph-Based Algorithms
- CS-95-06: Practically Frameless Rendering
Mitchell, Gail
- CS-93-09: The Aqua Data Model And Algebra
- CS-91-41: Object-Oriented Query Optimization: What's the Problem?
- CS-91-38: An Architecture for Query Processing in Persistent Object Stores
Mitchell, Gail Anne
Mitchell, John C.
Modart, S.
Moldovan, Teodor Mihai
Morgenstern, Leora
Moscovich, Tomer
- CS-04-16: Customizable Presentations
- CS-04-03: Animation Sketching: An Approach to Accessible Animation
Musumbu, Kaninda
Nachbar, Curran
Naroditskiy, Victor
Netzer, Robert H. B.
- CS-96-04: Race-Condition Detection in Parallel Computation with Semaphores
- CS-94-19: Critical-Path-Based Message Logging for Incremental Replay of Message-Passing Programs
- CS-93-26: Adaptive Message Logging for Incremental Replay of Message-Passing Programs
- CS-93-25: Adaptive Independent Checkpointing for Reducing Rollback Propagation
- CS-92-55: Experience with Techniques for Refining Data Race Detection
Netzer, Robert H.B.
- CS-94-11: Optimal Tracing and Incremental Reexecution for Debugging Long-Running Programs
- CS-93-32: Necessary and Sufficient Conditions for Consistent Global Snapshots
- CS-93-29: Detecting Race Conditions in Parallel Programs That Use One Semaphore
- CS-93-27: Trace Size vs. Parallelism in Trace-and-Replay Debugging of Shared-Memory Programs
- CS-93-15: Optimal Tracing and Replay for Debugging Shared-Memory Parallel Programs
Ni, Wen-Chun
Nicholson, Ann
- CS-93-55: Planning Under Time Constraints in Stochastic Domains
- CS-93-31: Techniques for Handling Inference Complexity in Dynamic Belief Networks
Nodine, Marian H.
- CS-93-17: Interacctions: Multidatabase Support for Planning Applications
- CS-92-59: Supporting Reactive Planning Tasks on an Evolving Multidatabase
- CS-91-64: InterActions: Multidatabase Support for Planning Applications
- CS-91-63: The Whole Transaction Model for Heterogeneous Multidatabases
- CS-91-27: Conflict, Queueing, and Deadlocks in Cooperative Transaction Hierarchies
- CS-90-03: Cooperative Transaction Hierarchies
Nodine, Mark H.
- CS-92-44: Blocking for External Graph Searching
- CS-92-38: Optimal Deterministic Sorting in Parallel Memory Hierarchies
- CS-92-08: Optimal Deterministic Sorting on Parallel Disks
- CS-92-02: Large-Scale Sorting in Uniform Memory Hierarchies
- CS-91-20: Greed Sort: An Optimal External Sorting Algorithm for Multiple Disks
- CS-90-04: Greed Sort: An Optimal External Sorting Algorithm for Multiple Disks
- CS-89-18: I/O Overhead and Parallel VLSI Architectures for Lattice Computations
Nodine, Mark Howard
Ortiz, Luis E.
Palmer, Mark
Palmer, Mark L.
Palsberg, Jens
Papaemmanouil, Olga
- CS-07-06: XFlow: Internet-scale Distributed Stream Processing
- CS-06-05: Extensible Profile-driven Data Dissemination
- CS-04-10: SemCast: Semantic Multicast for Content-based Data Dissemination
Pappas, Matthew Nicholas
Parise, Armando
Peng, Bernard
Pickering, Jeffry M.
Pietracaprina, A.
Pivkin, Igor
Plotkin, Serge
Plotkin, Serge A.
Pollard, Nancy S.
- CS-04-04: Evaluating and Tuning Motion Graphs for Character Animation
- CS-99-08: The Coach's Playbook
Prabhat,
- CS-05-09: Comparative Evaluation of Desktop and Cave Environments for Learning Hypercube Rotations
- CS-02-14: Color Rapid Prototyping for Scientific Visualization: Diffusion Tensor MRI Visualization and Topographical Exploration of Mars
Preparata, F. P.
Preparata, F.P.
Preparata, Franco
Preparata, Franco P.
- CS-00-03: Using Pyramids in Mixed Meshes - Point Placement and Basis Functions
- CS-99-01: Introduction to Integer-Coordinate Crystalline Meshes
- CS-97-11: Checking the Convexity of Polytopes and the Planarity of Subdivisions
- CS-96-27: A Probabilistic Analysis of the Power of Arithmetic Filters
- CS-93-20: Horizons of Parallel Computation
- CS-92-28: A Simplified Technique for Hidded-Line Elimination in Terrains
- CS-92-07: A Unified Approach to Dynamic Point Location, Ray Shooting and Shortest Paths in Planar Maps
- CS-91-40: A Simplified Technique for Hidden-Line Elimination in Terrains
- CS-89-50: Output-Sensitive Generation of the Perspective View of Isothetic Parallelepipeds
- CS-89-47: Efficient Point Location in a Convex Spatial Cell Complex
- CS-89-24: Dynamic Planar Point Location with Optimal Query Time
Price, Daniel B.
Proctor, Seth
Puget, Jean-Francios
Radge, Prabhakar L.
Ramachandran, Viswanath
Ramaswamy, Sridhar
- CS-95-15: OODB Indexing by Class-Division
- CS-94-28: Functional Programming Formalisms for OODB Methods
- CS-94-27: Path Caching: A Technique for Optimal External Searching
- CS-94-09: Indexing for Data Models with Constraints and Classes
- CS-93-21: Indexing for Data Models with Constraints and Classes
- CS-92-33: Method Schemas
- CS-91-25: Transaction Control For Cooperative Applications
Rao, Satish
- CS-94-12: Faster Shortest-Path Algorithms for Planar Graphs
- CS-93-30: Bounds on the Max-Flow Min-Cut Ratio for Directed Multicommodity Flows
- CS-91-17: An Approximate Max-flow Min-cut Relation for Multicommodity Flow and its Applications
Rasachandran, Viswanath
Rasin, Alexander
- CS-04-08: The Design of the Borealis Stream Processing Engine
- CS-04-05: High-Availability Algorithms for Distributed Stream Processing
- CS-03-17: A Comparison of Stream-Oriented High-Availability Algorithms
Rauch, Monika
Ravenscroft Jr., Robert A.
Ravenscroft Jr., Robert Andrews
Ravi, R.
- CS-96-06: A Near-linear-time Approximation Algorithm for Maximum-leaf Spanning Tree
- CS-96-05: The Power of Local Optimizations: Approximation Algorithms for Maximun-leaf Spanning Tree (DRAFT)*
- CS-93-42: A Primal-Dual Approximation Algorithm for the Steiner Forest
- CS-92-58: Many Birds With One Stone: Multi-Objective Approximation Algorithms
- CS-92-54: A Nearly best-possible approximation algorithm for node-weighted Steiner trees
- CS-92-30: When Cycles Collapse: A General Approximation Technique for Constrained Two-Connectivity Problems
- CS-92-21: Approximation Algorithms for Steiner Augmentations for Two-Connectivity
- CS-91-59: Combinatorial Optimization 1990: Lecture Notes
- CS-91-19: Approximating Fill in Solving Sparse Linear Systems
- CS-91-18: Ordering Problems Approximated: Register Sufficiency, Single-Processor Scheduling and Interval Graph
- CS-91-17: An Approximate Max-flow Min-cut Relation for Multicommodity Flow and its Applications
- CS-90-32: When Trees Collide: An Approximation Algorithm for the Generalized Steiner Problem on Networks
Ravi, Ramamurthy
Ravi, S.S.
Reiss, Steve
Reiss, Steven P.
- CS-95-23: Configuration Management with Logical Structures
- CS-95-14: An Engine for the 3D Visualization of Program Information
- CS-95-13: Fragments: A Mechanism for Low Cost Data Integration
- CS-94-45: Configuration Management in terms of Modules
- CS-93-39: Stretching the Rubber Sheet: A Metaphor for Viewing Large Layouts on Small Screens
- CS-93-38: An Object-Centered Approach to Designing Programming Environments
- CS-93-12: Constraining the Structure and Style of Object-Oriented Programs
- CS-93-03: FIELD Support for C++
- CS-92-56: A Data Model for Object-Oriented Databases
- CS-92-51: CCEL: A Metalanguage for C++
- CS-92-42: Manipulating Screen Space with {\em StretchTools}: Visualizing Large Structures on Small Screens
- CS-92-35: Generating Abstractions for Visualization
- CS-91-52: Support for Maintaining Object-Oriented Programs
- CS-91-50: A System for Multiparadigm Development of Software Systems
- CS-91-32: On the Use of Annotations for Integrating the Source in a Program Development Environment
- CS-89-51: Interacting with the FIELD Environment
- CS-89-34: The Brown Workstation Environment: A User Interface Design Toolkit
- CS-89-06: Parsing in a Visual Language Environment
- CS-89-05: Representing Visual Programs with Object-Graphs
- CS-89-02: Creating Graphical Languages in Garden
- CS-88-18: Integration Mechanisms in the FIELD Environment
Reiter, Jonathan
Reitsma, Paul S. A.
Revesz, Peter Z.
- CS-92-50: Constraint Query Languages
- CS-91-39: A Closed-Form Evaluation for Datalog Queries with Integer-Order Constraints
- CS-90-31: Constraint Query Languages
- CS-89-29: Matcher Neural Networks
Roland, Didier
Rosen, Barry K.
- CS-91-21: Efficiently Computing Static Single Assignment Form and the Control Dependence Graph
- CS-88-16: An Efficient Method of Computing Static Single Assignment Form
Rosenkrantz, D.J.
Rosenzweig, S.
Rossi, S.
Roth, Stefan
Roussos, Kostadis
Russell, Stuart
Sairam, S.
- CS-92-15: A Divide-and-Conquer Approach to Shortest Paths in Planar Layered Digraphs
- CS-91-66: A Complexity-Theoretic Approach to Incremental Computation
- CS-91-59: Combinatorial Optimization 1990: Lecture Notes
- CS-91-02: Fully Dynamic Techniques for Reachability in Planar sT-graphs
Salesin, David
Sanders, Kate
Sanders, Kathryn E.
- CS-94-38: CHIRON: Planning in an Open-Textured Domain
- CS-89-23: A Logic for Emotions: A Basis for Reasoning About Commonsense Psychological Knowledge
Santos Jr., Eugene
- CS-92-47: On Spline Approximations for Bayesian Computations
- CS-92-24: A Linear Constraint Satisfaction Approach for Abductive Reasoning
- CS-92-03: A Linear Constraint Satisfaction Approach to Cyclicity
- CS-91-14: A Structured Neural Network Approach to Robust Parsing
- CS-91-13: Cost-Based Abduction and Linear Constraint Satisfaction
Saraswat, Vijay
Sarkar, Manojit
- CS-95-09: A Model for Active Entities in Software Systems
- CS-93-40: Graphical Fisheye Views
- CS-93-39: Stretching the Rubber Sheet: A Metaphor for Viewing Large Layouts on Small Screens
- CS-92-57: A Data Model and A Query Language for Object-Oreinted Databases
- CS-92-56: A Data Model for Object-Oriented Databases
- CS-92-42: Manipulating Screen Space with {\em StretchTools}: Visualizing Large Structures on Small Screens
- CS-92-35: Generating Abstractions for Visualization
- CS-91-61: Graphical Fisheye Views of Graphs
Savage, John E.
- CS-03-09: Efficient Data Storage in Large Nanoarrays
- CS-99-10: Parallel Refinement of Unstructured Meshes
- CS-96-31: The Dynamic Adaptation of Parallel Mesh-Based Computation
- CS-93-19: Limits on Heterogeneous Supercomputing
- CS-93-08: Space-Time Tradeoffs in Memory Hierarchies
- CS-93-01: Mob --- A Parallel Heuristic for Graph-Embedding
- CS-91-07: Parallel Graph-Embedding and the Mob Heuristic
- CS-89-41: Heuristics for Parallel Graph-Partitioning
- CS-88-21: Parallel Constraint Graph Generation
Scholz, Karin
Schulze, Jurgen P.
- CS-05-04: Look-That-There: Exploiting Gaze in Virtual Reality Interactions
- CS-05-03: Volume Rendering with Animation of Gulf Stream Currents
- CS-05-02: A Comparison of a Cave and A Fish Tank VR system for Counting Biological Features in a Volume
Science, Department of Computer
Seidman, Greg
- CS-02-04: Monitoring Streams - A New Class of Data Management Applications
- CS-02-01: Monitoring Streams - A New Class of DBMS Applications
Shapiro, Michael W.
Shatkay, Hagit
- CS-98-11: Learning Models for Robot Navigation
- CS-97-04: Learning Hidden Markov Models with Geometric Information
- CS-95-37: The Fourier Transform - A Primer
- CS-95-03: Approximate Queries and Representations for Large Data Sequences
Shavit, Nir
Shaw, Gail M.
Shewchuk, John
Shimony, Solomon E.
- CS-90-14: On Irrelevance and Partial Assignments to Belief Networks
- CS-90-02: Probabilistic Semantics for Cost-Based Abduction
Shimony, Solomon Eyal
- CS-91-57: A Probabilistic Framework for Explanation
- CS-89-25: Plan-Related Negation in Story Understanding
Shriver, Elizabeth A. M.
- CS-90-22: Algorithms for Parallel Memory II: Hierarchical Multilevel Memories
- CS-90-21: Algorithms for Parallel Memory I: Two-Level Memories
Shriver, Elizabeth A.M.
- CS-92-05: Algorithms for Parallel Memory II: Hierarchical Multilevel Memories
- CS-92-04: Algorithms for Parallel Memory I: Two-Level Memories
Shvartsman, Alex A.
- CS-94-29: Efficient Parallelism vs Reliable Distribution: a Trade-off for Concurrent Computations
- CS-94-23: Controlling Memory Access Concurrency in Efficient Fault-Tolerant Parallel Algorithms
- CS-92-09: How to Write-All Efficiently Even with Contaminated Memory
- CS-91-54: Parallel Algorithms with Processor Failures and Delays
- CS-91-36: Efficient Parallel Algorithms on Restartable Fail-stop Processors
- CS-89-49: Achieving Optimal CRCW PRAM Fault-Tolerance
- CS-89-35: Efficient Parallel Algorithms Can Be Made Robust
Shvartsman, Alexander Allister
Sibley, Peter G.
Sigal, Leonid
Sigelman, Ben
Simon, Jack
Simonis, Helmut
Skarra, Andrea H.
Slivkins, Aleksandrs
- CS-07-07: Towards Fast Decentralized Construction of \\ Locality-Aware Overlay Networks
- CS-07-05: Adapting to a Stochastically Changing Environment: The Dynamic Multi-Armed Bandits Problem
- CS-07-01: Towards Fast Decentralized Construction of Locality-Aware Overlay Networks
Snibbe, S.
Snibbe, Scott S.
Sobel, Jason S.
Sole, Patrick
Spiewak, Joshua S.
Staff, Technical
Stasko, John
Stasko, John T.
Stasko, John Thomas
Stein, Clifford
Stein, Lynn Andrea
- CS-90-18: Resolving Ambiguity in Nonmonotonic Reasoning
- CS-90-08: A Preference-Based Approach to Inheritance
- CS-89-42: Clovers: The Dynamic Behavior of Types and Instances
- CS-89-15: Towards a Unified Method of Sharing in Object-Oriented Programming
- CS-89-14: Skeptical Inheritance: Computing the Intersection of Credulous Extensions
- CS-89-13: Investigations of Model-Preference Defaults
- CS-89-12: Motivated Action Theory: A Formal Theory of Causal Reasoning
- CS-88-15: A Shared View of Sharing: The Treaty of Orlando
Stewart, Jennifer K.
Stonebraker, Michael
- CS-04-08: The Design of the Borealis Stream Processing Engine
- CS-04-05: High-Availability Algorithms for Distributed Stream Processing
- CS-03-17: A Comparison of Stream-Oriented High-Availability Algorithms
- CS-03-03: Load Shedding in a Data Stream Manager
- CS-02-12: Load Shedding in a Data Stream Manager
- CS-02-04: Monitoring Streams - A New Class of Data Management Applications
- CS-02-01: Monitoring Streams - A New Class of DBMS Applications
Strauss, Paul Steven
Subramanian, Bharathi
Subramanian, Sairam
- CS-95-04: Parallel and Dynamic Shortest-Path Algorithms for Sparse Graphs
- CS-94-27: Path Caching: A Technique for Optimal External Searching
- CS-94-19: Critical-Path-Based Message Logging for Incremental Replay of Message-Passing Programs
- CS-94-12: Faster Shortest-Path Algorithms for Planar Graphs
- CS-93-35: A Linear-Processor Polylog-Time Algorithm for Shortest Paths in Planar Graphs
Swartz, Sharon
Szepesv\'ari, Csaba
Szepesva\'ri, Csaba
Tamassia, R.
- CS-97-10: Visualizing Geometric Algorithms Over the Web
- CS-96-29: Area Requirement of Gabriel Drawings
- CS-96-23: Area Requirement of Visibility Representations of Trees
- CS-96-16: Robust Proximity Queries in Implicit Voronoi Diagrams
- CS-92-34: A Framework for Dynamic Graph Drawing
Tamassia, Roberto
- CS-06-07: Flexible, Secure and Private Point-based Trust Management
- CS-05-01: Generalized and Practical Role-Based Cascaded Delegation
- CS-04-17: Aggregate Group Signature and Anonymous Delegation
- CS-99-04: Turn-Regularity and Optimal Area Drawings of Orthogonal Representations
- CS-97-18: A Case Study in Algorithm Engineering for Geometric Computing
- CS-97-11: Checking the Convexity of Polytopes and the Planarity of Subdivisions
- CS-96-25: Output-Sensitive Reporting of Disjoint Paths
- CS-96-24: Drawing Directed Acyclic Graphs: An Experimental Study (Preliminary Version)
- CS-95-26: On-Line Convex Planarity Testing
- CS-94-46: Optimal Upward Planarity Testing of Single-Source Digraphs
- CS-94-34: External-Memory Graph Algorithms (extended abstract)
- CS-94-10: On the Computational Complexity of Upward and Rectilinear Planarity Testing
- CS-94-03: Optimal Shortest Path and Minimum-Link Path Queries Between Two Convex Polygons in the Presence of Obstacles
- CS-92-19: Combine and Conquer
- CS-92-15: A Divide-and-Conquer Approach to Shortest Paths in Planar Layered Digraphs
- CS-92-07: A Unified Approach to Dynamic Point Location, Ray Shooting and Shortest Paths in Planar Maps
- CS-92-06: Dynamization of the Trapezoid Method for Planar Point Location in Monotone Subdivisions
- CS-91-66: A Complexity-Theoretic Approach to Incremental Computation
- CS-91-24: Dynamic Algorithms in Computational Geometry
- CS-91-02: Fully Dynamic Techniques for Reachability in Planar sT-graphs
- CS-90-35: Dynamic Expression Trees
- CS-90-10: Area Requirement and Symmetry Display of Planar-Upward Drawings
- CS-89-47: Efficient Point Location in a Convex Spatial Cell Complex
- CS-89-45: Parallel Transitive Closure and Point Location in Planar Structures
- CS-89-31: On-Line Planarity Testing
- CS-89-28: Dynamic Planar Graph Embedding
- CS-89-24: Dynamic Planar Point Location with Optimal Query Time
- CS-89-20: Optimal Parallel Algorithms for Transitive Closure and Point Location in Planar Structures
- CS-89-10: Representations of Graphs on a Cylinder
- CS-89-09: Algorithms for Drawing Graphs: An Annotated Bibliography
Tandon, Amit
Tardos, Eva
- CS-93-30: Bounds on the Max-Flow Min-Cut Ratio for Directed Multicommodity Flows
- CS-91-43: Faster Approximation Algorithms for the Unit-Capacity Concurrent Flow Problem with Applications to Routing and Finding Sparse Cuts
Tarjan, Robert E.
Tassinari, Emanuele
Tatbul, Nesime
- CS-08-01: Plan-based Complex Event Detection across Distributed Sources
- CS-05-06: No False Positives: Window-aware Load Shedding for Data Streams
- CS-04-13: Window-aware Load Shedding for Data Streams
- CS-04-08: The Design of the Borealis Stream Processing Engine
- CS-03-03: Load Shedding in a Data Stream Manager
- CS-02-12: Load Shedding in a Data Stream Manager
- CS-02-04: Monitoring Streams - A New Class of Data Management Applications
- CS-02-01: Monitoring Streams - A New Class of DBMS Applications
- CS-01-09: Index Structures and Algorithms for Efficient Profile Matching
Tegan, Patrice A.
Teng, Choh-Man
Tirthapura, Maurice Herlihy Srikanta
Tollis, I. G.
- CS-96-29: Area Requirement of Gabriel Drawings
- CS-96-23: Area Requirement of Visibility Representations of Trees
Tollis, Ioannis G.
- CS-90-10: Area Requirement and Symmetry Display of Planar-Upward Drawings
- CS-89-10: Representations of Graphs on a Cylinder
Tschantz, Michael Carl
- CS-06-04: Towards Reasonability Properties for Access-Control Policy Languages with Extended XACML Analysis
- CS-05-05: The Soundness and Completeness of Margrave with Respect to a Subset of XACML
Tucker, David B.
Tversky, Oren J.
- CS-93-39: Stretching the Rubber Sheet: A Metaphor for Viewing Large Layouts on Small Screens
- CS-93-07: Cone Trees in the UGA Graphics System: Suggestions for a More Robust Visualization Tool
- CS-92-46: Efficient Rendering on Massively Parallel Architectures
Upfal, \\ Eli
Upfal, Eli
- CS-07-05: Adapting to a Stochastically Changing Environment: The Dynamic Multi-Armed Bandits Problem
van Dam, Andries
Van Hentenryck, P.
- CS-03-01: A Simulated Annealing Approach to the Traveling Tournament Problem
- CS-01-01: A Constraint Satisfaction Approach to Parametric Differential Equations
- CS-95-01: Solving Polynomial Systems Using a Branch and Prune Approach
- CS-94-18: CLP (Intervals) Revisited
- CS-94-17: Cardinality Analysis of Prolog
- CS-94-16: An Abstract Interpretation Framework for (almost) Full Prolog
- CS-93-52: Type Analysis of Prolog Using Type Graphs
- CS-93-13: Conceptual and Software Support for Abstract Domain Design: Generic Structural Domain and Open Product
van Hentenryck, Pascal
Van Hentenryck, Pascal
- CS-07-09: Length-Lex Open Constraints
- CS-06-09: Randomized Filtering Algorithms
- CS-04-07: Constraint-Based Combinators for Local Search
- CS-04-01: Scheduling Abstractions for Local Search
- CS-03-22: The Value of Consensus in Online Stochastic Scheduling
- CS-03-21: Iterative Relaxations for Iterative Flattening in Cumulative Scheduling
- CS-03-16: A Simple and Deterministic Competitive\\ Algorithm for Online Facility Location
- CS-03-11: Safe and Tight Linear Estimators for Global Optimization
- CS-03-10: Dynamic Vehicle Routing with Stochastic Requests
- CS-03-06: Control Abstractions for Local Search
- CS-03-04: On the Complexity of the Robust Spanning Tree Problem with Interval Data
- CS-02-08: Scenario-Based Planning for Partially Dynamic Vehicle Routing with Stochastic Customers
- CS-02-06: Precisely A(alpha)-stable One-Leg Multistep Methods
- CS-02-05: A Simple Tabu Search for Warehouse Location
- CS-02-02: Shifted Slope-Comparison Multistep Formulas for ODEs
- CS-01-06: A Two-Stage Hybrid Local Search for the Vehicle Routing Problem with Time Windows
- CS-01-05: A Constraint Satisfaction Approach for Enclosing Solutions to Parametric Ordinary Differential Equations
- CS-01-04: Optimal Pruning in Parametric Differential Equations
- CS-01-02: Localizer++: An Open Library for local Search
- CS-00-07: OPL++: A Modeling Layer for Constraint Programming Libraries
- CS-98-03: Job-Shop Scheduling in Localizer
- CS-98-02: Localizer
- CS-97-03: Localizer: A Modeling Language for Local Search
- CS-96-34: A Constraint Satisfaction Approach to a Circuit Design Problem
- CS-95-32: Helios: A Mathematical Modeling Language for Newton
- CS-95-30: Source to Source Optimizations of CLP($\Re_{Lin}$)
- CS-95-25: Newton: Constraint Programming over Nonlinear Real Constraints
- CS-95-12: LSign Reordered
- CS-95-02: Redundancy Elimination with a Lexicographic Solved Form
- CS-93-51: Backtracking Without Trailing in CLP(${\Re}_{\rm Lin}$)
- CS-93-05: Abstract Interpretation of Prolog Based on OLDT Resolution
- CS-93-02: Design, Implementation, and Evaluation of the Constraint Language cc(FD)
- CS-92-49: Groundness Analysis for Prolog: Implementation and Evaluation of the Domain Prop
- CS-92-43: Scheduling and Packing in the Constraint Language cc(FD)
- CS-92-25: A Universal Top-Down Fixpoint Algorithm
- CS-92-12: Reexecution in Abstract Interpretation of Prolog
- CS-92-11: A Note on Redundant Linear Constraints
- CS-91-67: Generic Abstract Interpretation Algorithms for Prolog: Two Optimization Techniques and Their Experimental Evaluation
- CS-91-65: A Generic Arc Consistency Algorithm and Its Specializations
- CS-91-62: Constraint Satifaction Using Constraint Logic Programming
- CS-91-55: Experimental Evaluation of a Generic Abstract Interpretation Algorithm for Prolog
- CS-91-23: Efficient Handling of Disequations in CLP Over Linear Rational Arithmetic
- CS-91-05: Constraint Logic Programming
- CS-90-36: Efficient Arc Consistency Algorithm for a Class of CSP Problems
- CS-90-25: A Generic Abstract Interpretation Algorithm and its Complexity Analysis (extended abstract)
- CS-90-24: The Cardinality Operator: A New Logical Connective for Constraint Logic Programming
- CS-90-23: Operational Semantics of Constraint Logic Programming over Finite Domains
Van Henteryck, Pascal
van Hoeve, Willem-Jan
Vance, Bennet
Vandenberg, Scott L.
VanHentenryck, Pascal
Vardi, Moshe Y.
Vargiu, Francesco
Vengroff, Darren
Vengroff, Darren E.
Vengroff, Darren Erik
Vergados, Y.
Viola, Paul
Vismara, Luca
- CS-99-04: Turn-Regularity and Optimal Area Drawings of Orthogonal Representations
- CS-97-18: A Case Study in Algorithm Engineering for Geometric Computing
- CS-96-25: Output-Sensitive Reporting of Disjoint Paths
- CS-96-24: Drawing Directed Acyclic Graphs: An Experimental Study (Preliminary Version)
- CS-95-26: On-Line Convex Planarity Testing