Pratt, Vaughan - Department of Computer Science, Stanford University

• 52 March 2004 QUEUE rants: feedback@acmqueue.com ProcessorsProgrammability with Efficiency
• IEEE TRANSACTIONS ON VISUALIZATION AND COMPUTER GRAPHICS 1 Dynamic Simulation of Articulated Rigid Bodies
• A Conversation About Beliefs Last year, Sam spent the summer in Cambridge, Massachusetts--staying
• Scheduling Algebra Rob van Glabbeek
• DEPARTMENT OF COMPUTER SCIENCE MSCS Program Sheet (2007-08)
• Guide to the MSCS Program Sheet Eric Roberts (revisions by Claire Stager) September 2009
• Beta Version, Copyright c 2006 Nils J. Nilsson, All Rights Reserved (Book Web Page: http://ai.stanford.edu/nilsson/hawtk/hawtk-webpage.htm)
• BHH Ultimate Booted Blowout Party --8:00 Saturday June 20th 1998
• Temporal Structures Ross Casley Roger F. Crew Jose Meseguer Vaughan Pratt
• Translation of 1 John 3:16 Je rey D. Oldham
• Combinatorial Approximation Algorithms for Generalized Flow Problems \Lambda
• Parallel Algorithms for the All-Sources Generalized Shortest Paths Je rey D. Oldham y Vaughan Pratt z
• NearPerfect Fractional Matching via BallsandBins Rajeev Motwani #
• Reactive Verification with Queues In proceedings of Engineering Automation
• God's Calling Je rey D. Oldham
• An Implementation of a Combinatorial Approximation Algorithm for MinimumCost
• Financial Turmoil and One's Faith \Lambda Jeffrey D. Oldham
• APPROXIMATION ALGORITHMS FOR FACILITY LOCATION PROBLEMS
• Je#rey D. Oldham March 5, 2006
• INTEGRATING DECISION PROCEDURES FOR TEMPORAL VERIFICATION
• Using MCMCF to Solve Multicommodity Flow Problems \Lambda Jeffrey D. Oldham
• An Implementation of a Combinatorial Approximation
• Easier Ways to Win Logical Games Ronald Fagin
• Revenue Submodularity Shaddin Dughmi y
• Minimal Typing Derivations Nikolaj Skallerud Bjrner
• Combinatorial Approximation Algorithms for Generalized Flow Jeffrey D. Oldham \Lambda
• Implementation Combinatorial
• Absolute Explicit Unification Nikolaj Bjrner 1? and C'esar Mu~noz 2??
• Les Earnest 12769 Dianne Drive; Los Altos Hills, CA 94022
• DEPARTMENT OF COMPUTER SCIENCE MSCS Program Sheet (2004-05)
• Toolkit Support for Integrating Physical and Digital Interactions
• Avoiding Ballot Stuffing in eBaylike Reputation Systems Rajat Bhattacharjee #
• Names of God and Exodus 3:16 Je rey D. Oldham
• A Practical Integration of FirstOrder Reasoning and Decision Procedures ?
• A Better Approximation Algorithm for Finding Planar Subgraphs Gruia Calinescu \Lambda Cristina G. Fernandes y Ulrich Finkler z Howard Karloff \Lambda
• Entropy based Nearest Neighbor Search in High Dimensions Rina Panigrahy #
• Balanced Allocation on Graphs Krishnaram Kenthapadi # Rina Panigrahy +
• Distributions and Mutual Funds \Lambda Jeffrey D. Oldham
• MODELING BODY LANGUAGE FROM SPEECH IN NATURAL CONVERSATION
• Proximal regularization for online and batch learning Chuong B. Do CHUONGDO@CS.STANFORD.EDU
• Dynamic Sample Selection for Approximate Query Processing
• Shredding Your Garbage: Reducing Data Lifetime Through Secure Deallocation
• Link Privacy in Social Networks Aleksandra Korolova, Rajeev Motwani, Shubha U. Nabar, Ying Xu
• POINTS ON CONICS MODULO p TEAM 2: JONGMIN BAEK, ANAND DEOPURKAR,
• EXPERIENCES DESIGNING A VOICE INTERFACE FOR RURAL INDIA Neil Patel 1
• Ad Auction Design and User Experience Zoe Abrams1
• Programmable Graphics Hardware Computer Systems Laboratory
• Multiple alignment of protein sequences with repeats and rearrangements
• Absence of reptation in the high-temperature folding of the trpzip2 -hairpin peptide
• CS 221 Othello Report Demosthenes
• 50 communications of the acm | october 2008 | vol. 51 | no. 10 ILLUSTRATIONBYDREWFLAHERTY
• Analysis of Social Influence in Online Book Reviews Patty Sakunkoo and Nathan Sakunkoo
• A Framework with Peer Fostering Mechanism for Mobile P2P Application Development
• The Saturn Program Analysis System Alex Aiken Suhabe Bugrara Isil Dillig Thomas Dillig
• Genome Biology 2007, 8:R269 Open Access2007Grosset al.Volume 8, Issue 12, Article R269Method
• Lower Bounds for Round and Communication Complexities of Unconditional Verifiable Secret Sharing
• Verifying Finite-State Safety Properties on Millions of Lines of Code
• Optimizing the Migration of Virtual Computers Constantine P. Sapuntzakis Ramesh Chandra Ben Pfaff Jim Chow
• An Internal Agent Architecture Incorporating Standard Reasoning Components and Standards-based Agent Communication
• Feasibility of diffusion-NMR surface-to-volume measurements tested by calculations and computer simulations
• BIOINFORMATICS Vol. 24 ISMB 2008, pages i68i76
• CMU JAVELIN System for NTCIR5 CLQA1 Frank Lin Hideki Shima Mengqiu Wang Teruko Mitamura
• Expectation Maximization Strategies for Multi-atlas Multi-label Segmentation
• Design and Calibration of a Multi-view TOF Sensor Fusion System Young Min Kim Derek Chan Christian Theobalt Sebastian Thrun
• Methods of Synthesis and Characterization of Nanostructures Bridged By Single An Undergraduate Honors Thesis
• Catching the Drift: Learning Broad Matches from Clickthrough Data
• An Implementation of a Combinatorial Approximation
• Bach's Christmas Oratorio: Oratorio? Original? Regardless--A Masterpiece
• The Monte Carlo Method and Software Reliability Theory
• Fuzzy segmentation of X-ray fluoroscopy images Daniel B. Russakoff, Torsten Rohlfing, and Calvin R. Maurer, Jr.
• Declarative Agent Programming Support for a FIPA-Compliant Agent Platform
• HONGLAK LEE hllee@cs.stanford.edu (650) 804-6961 http://www.stanford.edu/~hllee
• txt 4 l8r: Lowering the Burden for Diary Studies Under Mobile Conditions
• Markov Random Field Models of Transient Interactions Between Protein Complexes in Yeast
• Machine Vision and Applications (2002) 13: 164173 Machine Vision and Applications
• Gymnasium Puchheim Kollegstufenjahrgang 2002/04 aus dem Fach
• A PORTABLE RUNTIME INTERFACE FOR MULTI-LEVEL MEMORY HIERARCHIES
• An Agent-based Approach to Assist Collaborations in A Framework for Mobile P2P
• Coding Interactively while Prototyping William Choi, Joel Brandt, Scott R. Klemmer
• Truly Incremental Locally Linear Embedding Sebastian Schuon, Marko urkovic, Klaus Diepold
• Revenue Maximization When Bidders Have Budgets Zoe Abrams
• Copyright c 2003 Springer-Verlag. This paper was published in Bildverarbeitung fur die Medizin 2003, Algorithmen -Systeme -Anwendungen, Proceedings des Workshops vom 9. bis 11. Marz
• Daniel Benjamin Russakoff Born: November 30, 1973
• Averaged Probabilistic Relational Models Daniel Wright
• Personalized Ad Delivery when Ads Fatigue: An Approximation Algorithm
• A Noise-Aware Filter for Real-Time Depth Upsampling Derek Chan Hylke Buisman Christian Theobalt Sebastian Thrun
• Pathfinding in Open Terrain S. D. Goodwin, S. Menon
• Data Parallel Computing on Graphics Hardware
• What A Mesh: Dependent Data Types For Correct Mesh Manipulation Algorithms
• Bermudian English: History, Features, Social Role Luke Swartz
• An Implementation of a Combinatorial Approximation Algorithm for Minimum-Cost
• Can Voice User Interfaces Say "I"? An Experiment with Recorded Speech and TTS
• Sound, Complete, and Scalable Path-Sensitive Analysis Sound, Complete, and Scalable Path-Sensitive
• Ad Delivery with Budgeted Advertisers: A Comprehensive LP Approach
• Diagnosis of Asynchronous Discrete Event Systems: Datalog to the Rescue!
• STREAM COMPUTING ON GRAPHICS HARDWARE a dissertation
• Automatically Detecting Action Items in Audio Meeting Recordings William Morgan Pi-Chuan Chang Surabhi Gupta
• k-Anonymous Message Transmission Luis von Ahn Andrew Bortz Nicholas J. Hopper
• Combinatorial Approximation Algorithms for Generalized Flow Jeffrey D. Oldham
• 3D Shape Scanning with a Time-of-Flight Camera , Sebastian Schuon2
• May 16, 2007 15:53 WSPC/Trim Size: 11in x 8.5in for Proceedings CSBfinalversion DISCOVERING PROTEIN COMPLEXES IN DENSE RELIABLE
• A majorization-minimization algorithm for (multiple) hyperparameter learning
• Figure 1: An art'nfact showing the wealthiest people from China. The pop-out shows details of the buttons added by
• A Dual-layer CRFs Based Joint Decoding Method for Cascaded Segmentation and Labeling Tasks
• Synthesizing Switching Logic using Constraint Ankur Taly1
• PARALLEL SIMOS: SCALABILITY AND PERFORMANCE FOR LARGE SYSTEM SIMULATION
• State Coverage: A Structural Test Adequacy Criterion for Behavior Checking
• Incentive Based Ranking Mechanisms Rajat Bhattacharjee
• Data Lifetime is a Systems Problem Tal Garfinkel, Ben Pfaff, Jim Chow, Mendel Rosenblum
• Overwhelmed by Technology: How did user interface failures on board the USS Vincennes lead to 290 dead?
• Rochambeau: Playing Games With ROCS Imran Haque1
• Recognizing Activities with Multiple Cues Rahul Biswas1
• An intensity-based registration algorithm for probabilistic images and its application for 2-D to 3-D image registration
• Cuts from Proofs: A Complete and Practical Technique for Solving Linear Inequalities over Integers Cuts from Proofs
• IEEE Network March/April 20102 0890-8044/10/$25.00 2010 IEEE here is no doubt that Skype is the most popular VoIP
• Auctions with Revenue Guarantees for Sponsored Search Zo-e Abrams
• Genome Biology 2006, 7:322 commentreviewsreportsdepositedresearchinteractionsinformationrefereedresearch
• Crossing the Line: Tradition, Ceremony, Initiation
• The CLOSER: Automating Resource Management in Java Isil Dillig Thomas Dillig
• Undergraduate Research Project: Computer Modeling of Nanotube Embedded Chemicapacitive Sensors
• 260 Genome Informatics 16(2): 260269 (2005) Interaction Graph Mining for Protein Complexes Using
• Opportunistic Programming: How Rapid Ideation and Prototyping Occur in Practice
• nature biotechnology volume 26 number 8 august 2008 897 don't know the coin used for each set of tosses.
• Roshan R Sumbaly Information
• The CLOSER: Automating Resource Management in Java The CLOSER: Automating Resource
• A Fast, Accurate Deterministic Parser for Chinese Mengqiu Wang Kenji Sagae Teruko Mitamura
• Protecting Browsers from DNS Rebinding Attacks Collin Jackson
• 18 March/April 2008 ACM QUEUE rants: feedback@acmqueue.com A gamer wanders through a virtual world rendered in near-
• JAVELIN III: Cross-Lingual Question Answering from Japanese and Chinese Documents
• Multi-stage Replay with Crosscut Jim Chow Dominic Lucchetti Tal Garfinkel
• Peak GFLOPS GFLOPS/W (x100) SER Intel Core i7 975
• BIOINFORMATICS Vol. 25 ISMB 2009, pages i21i29
• Lossless Handover with n-casting between WiFi-WiMAX on OpenRoads
• No Noise Medium Noise Stark Noise var = 0 var = 0.7 var = 5
• Link Privacy in Social Networks Aleksandra Korolova
• Tracking Graphics State forTracking Graphics State for Network RenderingNetwork Rendering
• A Survey of Information Systems Reaching Small Producers in Global Agricultural Value Chains
• SAIL: Static Analysis Intermediate Language with a Two-Level Representation
• SPRING 2005 Many organizations need to pro-
• PAPER--Accelerating Parallel Evaluations of ROCS IMRAN S. HAQUE,1
• CS276B Project Report: Streaming XPath Engine Amruta Joshi Oleg Slezberg
• Tighter Bounds for Structured Estimation Chuong B. Do, Quoc Le
• Vispedia: On-demand Data Integration for Interactive Visualization and Exploration
• Power trace filled in from expectedvalue PMF ((2a) in Algorithm)
• The Top 200 Secrets of Success and the Pillars of Self-Mastery --Robin S. Sharma
• Image Similarity Using Mutual Information of Daniel B. Russakoff1,2
• GliFlix: Using Movie Subtitles for Language Learning Nathan Sakunkoo
• ) $$ 0 ' $ 1 $ / 2 1 ' 3 '$ // 2 $ ' $4 / 1 ' 3/ 1 $40 ) '
• Lies, Damned Lies, and AUC Confidence Intervals Imran S. Haque1
• Active Reinforcement Learning Arkady Epshteyn aepshtey@google.com
• Kerr-Mikroskop Von Sebastian Schuon
• Static Analysis by Policy Iteration on Relational Stephane Gaubert1
• Avaaj Otalo --A Field Study of an Interactive Voice Forum for Small Farmers in Rural India
• Keyword Generation for Search Engine Advertising Amruta Joshi1
• Fast Intensity-based 2D-3D Image Registration of Clinical Data Using Light Daniel B. Russakoff
• Cheminformatics at Scale: Bigger, Longer, and Uncut Imran S. Haque1
• Real-Time Prosody-Driven Synthesis of Body Language Sergey Levine Christian Theobalt Vladlen Koltun
• Language-Based Isolation of Untrusted JavaScript Sergio Maffeis1
• The Second Calculus of Binary Relations Vaughan Pratt
• In Proceedings of IEEE Logic in Computer Science, 2003 Proof Nets for Unit-free Multiplicative-Additive Linear Logic
• TCC Overview -January 2007 Transactional Memory
• 18 I E E E S o f t wa r E Pu b l i s h e d b y t h e I EEE C o m p u t e r S o c i e t y 0 74 0 -74 5 9 / 0 9 / $ 2 6 . 0 0 2 0 0 9 I E E E speed and ease of development over robustness and
• % . 2 3 4 ! % 5 !! % ! ! !
• Chu Spaces from the Representational Vaughan Pratt
• ing them in terms of information processing. And computer models are increasingly helping biologists design new experi-
• PrediCalc: a logical spreadsheet management M I C H A E L K A S S O F F and M I C H A E L R . G E N E S E R E T H
• Automatic Generation of XSS and SQL Injection Attacks with Goal-Directed Model Checking
• Using ProgrammerWritten Compiler Extensions to Catch Security Holes
• ad hoc corre cte ss rule ith e xte de
• A structured set is a set, equipped with some structure. Examples of structured sets are: posets. A poset is a pair (S; ) with S a set and ` S \Theta S a partial order. A poset (S; ) is
• Reactive, Generative and Stratified Models of Probabilistic Processes
• The Individual and Collective Token Interpretations of Petri Nets
• The CWEB System of Structured Documentation (Version 3.0)
• IEEE TRANSACTIONS ON VISUALIZATION AND COMPUTER GRAPHICS 1 Impulse Based Control of Joints and Muscles
• COMPUTING NATURAL LANGUAGE Lecture Notes
• The next day, Nick began by saying, "So far, we've been talking about models--what they are and how we get them. But we haven't talked very
• DEPARTMENT OF COMPUTER SCIENCE MSCS Program Sheet (2002-2003)
• The Ghost Fluid Method for Viscous Flows1 Ronald P. Fedkiw
• Errata, 1994--1997 THIS IS A LIST of all corrections made to the second edition of Concrete
• A canonical graphical syntax for nonempty finite products and sums DOMINIC HUGHES
• Axiomatizing Prefix Iteration with Silent Steps Luca Aceto \Lambda
• arXiv:math.CT/0504037 Modelling Linear Logic without Units
• Bisimulation R.J. van Glabbeek
• Arabic and Persian names November 30, 2009 (The \Western" form of a name is not usually a systematic transliteration of the
• THE ART OF COMPUTER PROGRAMMING ERRATA TO VOLUME 4 FASCICLE 3
• So Real It'll Make You Wet Willi Geiger
• DEPARTMENT OF COMPUTER SCIENCE MSCS Program Sheet (2004-05)
• STANFORD UNIVERSITY SCHOOL OF ENGINEERING
• INTRODUCTION TO INFINITE RAMSEY Jongmin Baek
• Purcell's Dido and Aeneas and Virgil's Aeneid: Roman Mythology Seen Through an English Restoration Lens
• Combinatorial Approximation Algorithms for Generalized Flow Jeffrey D. Oldham
• Small Formulas for Large Programs: On-line Constraint Simplification in
• Rashmi Raj Page 1 of 2 7360 Gallagher Drive, Apt# A113 Phone: (952) 200-4346
• Although I cant See, I can Hear: Speech-Assisted Self Portraits on Mobile Devices
• Poster Abstract: On the Scaling Properties of Low Power Wireless Links
• Keyword Translation Accuracy and Cross-Lingual Question Answering in Chinese and Japanese
• Rule 4: (xy)[l,h] => x[0,h-size(y)]y[l,size(y)-1] if (h >= size(y))
• Intensity-Based 2D-3D Spine Image Registration Incorporating One Fiducial Marker
• Exposing Private Information by Timing Web Applications
• Optimal Delivery of Sponsored Search Advertisements Subject to Budget Constraints
• Harvesting Helpfulness: A Case Study of an Online Farmer's Forum
• Vegetation Clipper Jongmin Baek, Aaron Doody
• RESEARCH STATEMENT Alyssa Glass
• URL Recommendation based on Asymmetric Tag Similarity and Diffusion Based Grouping
• Second Sound in He II Otis Chodosh, Jeremy Hiatt, Samir Shah, and Ning Yan
• What is the Jeopardy Model? A Quasi-Synchronous Grammar for QA Mengqiu Wang and Noah A. Smith and Teruko Mitamura
• Instability of FIFO at Arbitrarily Low Rates in the Adversarial Queueing Model
• "Any person... a pamphleteer" Internet Anonymity in the Age of Web 2.0
• Indoor Localization in Multi-Floor Environments with Reduced Effort Hua-Yan Wang, Vincent W. Zheng, Junhui Zhao and Qiang Yang
• Kratos: Princeton University's entry in the 2008 Intelligent Ground Vehicle Competition
• Beyond the General Belgrano and Sheffield: Lessons in Undersea and Surface Warfare from the Falkland Islands Conflict
• FINDING GEODESICS ON SURFACES TEAM 2: JONGMIN BAEK, ANAND DEOPURKAR,
• Robots in Human Environments O. Khatib, K. Yokoi, O. Brock, K. Chang, and A. Casal
• Orion File System : File-level Host-based Virtualization Amruta Joshi
• 10.1101/gr.072850.107Access the most recent version at doi: 2008 18: 676-682; originally published online Mar 18, 2008;Genome Res.
• Releasing Search Queries and Clicks Privately Aleksandra Korolova
• A ComplexBased Reconstruction of the S. cerevisiae Interactome Haidong Wang1
• Automatic Parameter Learning for Multiple Network Alignment
• CONTRAlign: Discriminative Training for Protein Sequence Alignment
• Princeton University's Entry in the 2008 Intelligent Ground Vehicle Competition
• Lash-Ups: A Toolkit for Location-Aware Mash-Ups Joel Brandt, Scott R. Klemmer
• A Non-Manipulable Trust System Based on Zoe Abrams and Robert McGrew and Serge Plotkin
• Constraint-Based Analysis in the Presence of Uncertainty and Imprecision Constraint-Based Analysis in the Presence of
• High-Quality Scanning Using Time-Of-Flight Depth Superresolution Sebastian Schuon
• CS229 Project Report: Automated photo tagging in Facebook
• Decoupling dynamic program analysis from execution in virtual environments
• Fluid Updates:Fluid Updates: Beyond Strong vs. WeakBeyond Strong vs. Weak
• A Passive Approach to Sensor Network Localization
• Luke Swartz Philosophy 189
• AC 2009-2507: CPAS: ON THE STRUCTURE AND USABILITY OF A COURSE PLANNING AND AUDIT SYSTEM
• LidarBoost: Depth Superresolution for ToF 3D Shape Scanning Sebastian Schuon
• A Distributed Approach to Passive Localization for Sensor Networks Rahul Biswas and Sebastian Thrun
• A State Coverage Tool for JUnit Agitar Software Laboratories
• Fluid Updates: Beyond Strong vs. Weak Isil Dillig Thomas Dillig Alex Aiken
• SCISSORS: A Linear-Algebraical Technique to Rapidly Approximate Chemical Similarities Imran S. Haque
• The Simplified Partial Digest Problem: Hardness and a Probabilistic Analysis
• A FLOW-, PATH-, AND CONTEXT-SENSITIVE NULL DEREFERENCE ANALYSIS FOR C PROGRAMS
• Understanding Data Lifetime via Whole System Simulation Jim Chow, Ben Pfaff, Tal Garfinkel, Kevin Christopher, Mendel Rosenblum
• Fast calculation of digitally reconstructed radiographs using light fields
• Set K-Cover Algorithms for Energy Efficient Monitoring in Wireless Sensor Networks
• SIML: A Fast SIMD Algorithm for Calculating LINGO Chemical Similarities on GPUs Imran S. Haque,
• Anchor-based Proximity Measures Amruta Joshi Ravi Kumar Benjamin Reed Andrew Tomkins
• Searching for Rising Stars in Bibliography Networks Xiao-Li Li, Chuan Sheng Foo, Kar Leong Tew, See-Kiong Ng
• A Framework for Activity Recognition and Detection of Unusual Activities Dhruv Mahajan Nipun Kwatra Sumit Jain Prem Kalra
• A Survey of Answer Extraction Techniques in Factoid Question Answering
• Proximal regularization for online and batch learning Chuong B. Do CHUONGDO@CS.STANFORD.EDU
• BODY LANGUAGE ANIMATION SYNTHESIS FROM PROSODY
• Hard Data on Soft Errors: A Large-Scale Assessment of Real-World Error Rates in GPGPU
• Rahul Thathoo 1 RAHUL THATHOO
• Static Error Detection Using Semantic Inconsistency Inference Static Error Detection Using Semantic
• Designing and Evaluating Voice-Based Virtual Communities
• DARPA Urban Challenge Princeton University
• Parallel Algorithms for the All-Sources Generalized Shortest Paths Jeffrey D. Oldham Vaughan Pratt
• Deformable Spanners and Applications Leonidas J. Guibas
• Decomposition-based Motion Planning: Towards Real-time Planning for Robots
• Shape-Based Object Localization for Descriptive Classification
• Modular Approach to Error Analysis and Evaluation for Multilingual Question Answering
• Begin at the beginning: Predicting genes with 5 UTRs
• SAFETY ANALYSIS OF SYSTEMS A DISSERTATION
• Using Portfolio Theory for Better and More Consistent Agitar Software Laboratories
• The "Mozart Effect": Does Mozart Make You Smarter?
• TaskConsistent Obstacle Avoidance and Motion Behavior for Mobile Manipulation
• Primality Testing A Report Submitted
• Optimizations for Compiling Declarative Models into Boolean Formulas
• Scalable Learning for Object Detection with GPU Hardware Adam Coates, Paul Baumstarck, Quoc Le, and Andrew Y. Ng
• Data Lifetime is a Systems Problem Tal Garfinkel, Ben Pfa#, Jim Chow, Mendel Rosenblum
• Understanding Data Lifetime via Whole System Simulation Jim Chow, Ben Pfaff, Tal Garfinkel, Kevin Christopher, Mendel Rosenblum
• Combining Planning Contexts Sasa Buvac and John McCarthy
• Terra: A Virtual MachineBased Platform for Trusted Computing Tal Garfinkel Ben Pfaff Jim Chow Mendel Rosenblum Dan Boneh
• A Fast Genomic Dictionary Valentin I. Spitkovsky
• The Eighth International Symposium of Robotics Research
• Mobile Manipulation: Collision-Free Path Modi cation and Motion Coordination
• Verifying the Safety of User Pointer Dereferences Suhabe Bugrara
• Decompositionbased Motion Planning: Towards Realtime Planning for Robots
• Real-Time Replanning in High-Dimensional Con guration Spaces Using Sets of Homotopic Paths
• Towards Real-time Motion Planning in High-dimensional Spaces Oliver Brock Lydia E. Kavraki
• Resolving Lexical Ambiguity using a Formal Theory of Context
• HumanCentered Robotics and Interactive Haptic Simulation O. Khatib, O. Brock, K.C. Chang, D. Ruspini, L. Sentis, S. Viji
• A Dictionary Based Approach for Gene Annotation Lior Pachter y , Sera m Batzoglou zy , Valentin I. Spitkovsky, Eric Banks,
• Robots in Human Environments O. Khatib, K. Yokoi, O. Brock, K. Chang, and A. Casal
• Verifying FiniteState Safety Properties on Millions of Lines of Code
• Unifying EquivalenceBased Definitions of Protocol Security # Anupam Datta 1 , Ralf Kusters 1 , John C. Mitchell 1 , Ajith Ramanathan 1 , and Vitaly Shmatikov 2
• Quantificational Logic of Context Sasa Buvac
• MultiCamera Object Detection for Robotics Adam Coates Andrew Y. Ng
• Spreadsheet Motivations
• Vistas/Planning Vistas/Planning
• Shredding Your Garbage: Reducing Data Lifetime Through Secure Deallocation
• A Declarative Formalization of Knowledge Translation Sasa Buvac and Richard Fikes \Lambda
• Contexts : A Formalization and Some Applications Ramanathan V. Guha
• Propositional Logic of Context Sasa Buvac & Ian A. Mason
• Probabilistic Bisimulation and Equivalence for Security Analysis of Network Protocols #
• NOTES ON FORMALIZING CONTEXT # John McCarthy
• A Dictionary Based Approach for Gene Annotation Lior Pachter \Lambday , Serafim Batzoglou zy , Valentin I. Spitkovsky, William S. Beebee Jr.,
• Formalizing Context (Expanded Notes)
• Elastic Strips: A Framework for Integrated Planning and Execution
• Triangulating the Real Projective Plane Mridul Aanjaneya and Monique Teillaud
• Weighted Congestion Games: Price of Anarchy, Universal Worst-Case Examples, and Tightness
• Object Capabilities and Isolation of Untrusted Web Applications Sergio Maffeis
• Posting Prices with Unknown Distributions Moshe Babaioff1
• 0 0.2 0.4 0.6 0.8 1 0 0.2 0.4 0.6 0.8 1
• CHU SPACES: A MODEL OF CONCURRENCY a dissertation
• Guide to the MSCS Program Sheet Eric Roberts and Mehran Sahami (revisions by Claire Stager) September 2010
• John McCarthy Awards for Excellence in Research and Research Environments
• A Practical Flow-Sensitive and Context-Sensitive C and C++ Memory Leak Detector
• PrPl: A Decentralized Social Networking Infrastructure Seok-Won Seong Jiwon Seo Matthew Nasielski Debangsu Sengupta
• A Survey of Reactive Synthesis Nikolaj S. Bjrner
• Worstcase and Smoothed Analysis of the ICP Algorithm, with an Application to the kmeans Method
• INTERVAL AND POINTBASED APPROACHES TO HYBRID SYSTEM VERIFICATION
• Analyzing the E#ciency of BitTorrent and Related PeertoPeer Networks
• How Slow is the kMeans Method? David Arthur #
• On Finding Frequent Elements in a Data Stream Ravi Kumar 1 and Rina Panigrahy 2
• MultiAgent Algorithms for Solving Graphical Games David Vickrey
• Deciding Fixed and Nonfixed Size Bitvectors \Lambday Nikolaj S. Bjrner and Mark C. Pichora
• Experiences Using the Parascope Editor: an Interactive Parallel Programming Tool
• An Implementation of a Combinatorial Approximation Algorithm for MinimumCost
• kmeans++: The Advantages of Careful Seeding David Arthur # Sergei Vassilvitskii +
• HASHING, SEARCHING, SKETCHING A DISSERTATION
• Seeing, Seeking, Following \Lambda Jeffrey D. Oldham
• The restricted arc-width of a graph David Arthur
• Beta Version, Copyright c 2006 Nils J. Nilsson, All Rights Reserved (Book Web Page: http://ai.stanford.edu/nilsson/hawtk/hawtk-webpage.htm)
• STANFORD UNIVERSITY SCHOOL OF ENGINEERING
• In Math. Struct. in Comp. Science, 13:4, 485-529, August 2003. Transition and Cancellation in Concurrency
• Games and Definability for System F Dominic J.D. Hughes
• Interface Compilation: Steps toward Compiling Program Interfaces as Languages
• arXiv:math.LO/0504028 Classical logic = Fibred MLL
• Reconciling Event Structures and Higher Dimensional Automata Vaughan Pratt \Lambda
• On the Expressiveness of Higher Dimensional Automata
• Hypergame Semantics: Full Completeness for System F
• Electronic Notes in Theoretical Computer Science 7 (1997) URL: http://www.elsevier.nl/locate/entcs/volume7.html 21 pages
• Mr. Privacy: Open and Federated Social Networking Using Email
• Divide and Congruence: From Decomposition of Modalities
• DEPARTMENT OF COMPUTER SCIENCE MSCS Program Sheet (2007-08)
• Consumerizing PCs from research to product
• DEPARTMENT OF COMPUTER SCIENCE MSCS Program Sheet (2004-05)
• Guide to the MSCS Program Sheet Eric Roberts September 2007
• Chu Spaces: Automata with quantum aspects Vaughan R. Pratt
• DEPARTMENT OF COMPUTER SCIENCE MSCS Program Sheet (2009-10)
• DEPARTMENT OF COMPUTER SCIENCE MSCS Program Sheet (2010-11)
• DEPARTMENT OF COMPUTER SCIENCE MSCS Program Sheet (2007-08)
• arXiv:math.LO/0408282v120Aug2004 Proofs Without Syntax
• DEPARTMENT OF COMPUTER SCIENCE MSCS Program Sheet (2010-11)
• Local Smoothness and the Price of Anarchy in Atomic Splittable Congestion Games
• Parallel Computing 24 1998 445--475 Maximizing parallelism and minimizing
• Static analysis versus software model checking for bug nding
• ``acquirel ock L before accessing shared variabl e X''
• Compositionality of HennessyMilner Logic by Structural Operational Semantics
• HOW ARE WE TO KNOW? Nils J. Nilsson
• DEPARTMENT OF COMPUTER SCIENCE MSCS Program Sheet (2008-09)
• The Stone Gamut: A Coordinatization of Mathematics Vaughan R. Pratt
• Figure 1: MDP Die Photo Figure 2: J-Machine The J-Machine: A Retrospective
• Achieving Single Channel, Full Duplex Wireless Communication
• DEPARTMENT OF COMPUTER SCIENCE MSCS Program Sheet (2002-2003)
• Is Shapley Cost Sharing Optimal? Shahar Dobzinski1
• Event-State Duality: The Enriched Case Vaughan R. Pratt
• 591 landon cour! Iairfax, vj.rginia
• Can Self-Organizing P2P File Distribution Provide QoS Guarantees?
• Cooperative Bug Isolation Benjamin Robert Liblit
• Geodesic spaces : momentum Groups : symmetry
• Topoalgebra Vaughan Pratt
• Publications Vaughan R. Pratt
• AN ELEMENTARY MODEL OF MULTIDECADAL CLIMATE CHANGE: 1850-2010 1850 1860 1870 1880 1890 1900 1910 1920 1930 1940 1950 1960 1970 1980 1990 2000 2010
• [1] L. Aceto, W.J. Fokkink, R.J. van Glabbeek & A. Ingolfsdottir (1996): Axiom-atizing prefix iteration with silent steps. Information and Computation 127(1), pp. 2640.
• Orthocurrence as both Interaction and Observation Vaughan R. Pratt
• Chu Spaces and their Interpretation as Concurrent Objects
• The Duality of Time and Information Vaughan R. Pratt
• Origins of the Calculus of Binary Relations Vaughan Pratt
• Dynamic Algebras: Examples, Constructions, Applications
• Event Spaces and Their Linear Logic Vaughan Pratt
• Modeling Concurrency with Geometry Vaughan Pratt
• Action Logic and Pure Induction Vaughan Pratt
• ENRICHED CATEGORIES AND THE FLOYD-WARSHALL CONNECTION Vaughan Pratt
• Dynamic Algebras as a well-behaved fragment of Relation Algebras Vaughan Pratt
• Modelling Concurrency with Partial Orders* Vaughan Pratt
• Two Easy Theories Whose Combination is Hard Sept. 1, 1977
• On the Expressiveness of Higher Dimensional Automata
• !#"%$'&(0)1#"235467 839$ @BADCFEG@IHQPRPDS
• Nested Semantics over Finite Trees are Equationally Hard
• Proof Nets for Unit-free Multiplicative-Additive Linear Logic
• Simple multiplicative proof nets with units DOMINIC J. D. HUGHES
• WoLLIC 2006 Towards Hilbert's 24th
• Combinatorial Proof Semantics DOMINIC J. D. HUGHES
• arXiv:math.CT/0504037v13Apr2005 Modelling Linear Logic without Units
• arXiv:math.LO/0504065v14Apr2005 Logic Without Syntax
• Electronic Notes in Theoretical Computer Science 83 (2004) URL: http://www.elsevier.nl/locate/entcs/volume83.html 18 pages
• Deep inference proof theory equals categorical proof theory minus coherence
• Games and Definability for System F Dominic J.D. Hughes
• AI Lab Travel Reimbursement Request Use this form to record expenses.
• Report No.STAN-CS-851055 A Programming and Problem-Solving-Seminar
• On Cool Congruence Formats for Weak Bisimulations
• Divide and Congruence: From Decomposition of Modalities
• Compositionality of Hennessy-Milner Logic through Structural Operational Semantics
• Compositionality of Hennessy-Milner Logic by Structural Operational Semantics
• Query Nets: Interacting Workflow Modules that Ensure Global Termination
• Scheduling Algebra Rob van Glabbeek1
• On Specifying Timeouts Rob van Glabbeek
• Computing Trust from Revision History Honglei Zeng1
• Beta Version, Copyright c 2006 Nils J. Nilsson, All Rights Reserved (Book Web Page: http://ai.stanford.edu/nilsson/hawtk/hawtk-webpage.htm)
• Beta Version, Copyright c 2006 Nils J. Nilsson, All Rights Reserved (Book Web Page: http://ai.stanford.edu/nilsson/hawtk/hawtk-webpage.htm)
• Beta Version, Copyright c 2006 Nils J. Nilsson, All Rights Reserved (Book Web Page: http://ai.stanford.edu/nilsson/hawtk/hawtk-webpage.htm)
• Beta Version, Copyright c 2006 Nils J. Nilsson, All Rights Reserved (Book Web Page: http://ai.stanford.edu/nilsson/hawtk/hawtk-webpage.htm)
• Who Leads Whom: Topical Lead-Lag Analysis across Xiaolin Shi, Ramesh Nallapati, Jure Lescovec, Dan McFarland, Dan Jurafsky
• A Multi-Pass Sieve for Coreference Resolution Karthik Raghunathan, Heeyoung Lee, Sudarshan Rangarajan, Nathanael Chambers,
• Profiting from Mark-Up: Hyper-Text Annotations for Guided Parsing Valentin I. Spitkovsky
• Learning to Follow Navigational Directions Adam Vogel and Dan Jurafsky
• My analog to digital conversion Les Earnest (les at cs.stanford.edu)
• Supervised Random Walks: Predicting and Recommending Links in Social Networks
• Modeling Information Diffusion in Implicit Networks Jaewon Yang
• Empirical Comparison of Algorithms for Network Community Detection
• Signed Networks in Social Media Jure Leskovec
• IntelligentWebServices 48 Published by the IEEE Computer Society 1089-7801/09/$25.00 2009 IEEE IEEE INTERNET COMPUTING
• Adding AI to Web Services Charles Petrie1
• research papers Acta Crystallographica Section D
• Efficient Energy Computation for Monte Carlo Simulation of Proteins
• Skiplist-Based Concurrent Priority Queues Stanford University
• Microsoft Research at RTE-2: Syntactic Contributions in the Entailment Task: an implementation
• Effectively Using Syntax for Recognizing False Entailment Computer Science Department
• Linear Algebra and its Applications 412 (2006) 3038 www.elsevier.com/locate/laa
• Building a Semantic Taxonomy Using this classifier we may now extend and construct semantic taxonomies.
• Algorithms for the Database Layout Problem Gagan Aggarwal , Tomas Feder , Rajeev Motwani , Rina Panigrahy, and
• Finding Longest Increasing and Common Subsequences in Streaming Data
• Geometric Spanners for Routing in Mobile Networks Leonidas J. Guibas
• Advice for Program Chairs October 3, 2010
• John Backus A memorial given at the 2007 Conference on Programming Language Design and Implementation
• Memory Management with Explicit Regions David Edward Gay
• Measuring Empirical Computational Complexity Simon Fredrick Goldsmith
• TYPE SAFETY IN THE LINUX KERNEL A DISSERTATION
• EFFECTIVE STATIC RACE DETECTION FOR JAVA A DISSERTATION
• STATIC DETECTION OF SOFTWARE ERRORS A DISSERTATION
• Low-Power Architecture Stanford University
• 66 communicAtions of the Acm | FeBrUAry 2010 | vOl. 53 | nO. 2 contributed articles
• Execution Generated Test Cases: How to Make Systems Code Crash Itself Cristian Cadar and Dawson Engler
• Model Checking Large Network Protocol Implementations Madanlal Musuvathi
• -& . / 0 & #123!4 & 51667 + , -", *. ! /01 , -/01
• Correlation Exploitation in Error Ranking Ted Kremenek, Ken Ashcraft, Junfeng Yang and Dawson Engler
• ARCHER: Using Symbolic, Path-sensitive Analysis to Detect Memory Access Errors
• Using Redundancies to Find Errors Yichen Xie and Dawson Engler
• Using Redundancies to Find Errors Yichen Xie and Dawson Engler
• A System and Language for Building System-Specific, Static Analyses
• Implicit Surface Tension Formulation with a Lagrangian Surface mesh on an Eulerian Simulation Grid
• Numerically Stable Fluid-Structure Interactions Between Compressible Flow and Solid Structures
• A symmetric positive definite formulation for monolithic fluid structure interaction
• Robust Treatment of Interfaces for Fluid Flows and Computer Graphics
• A Boundary Condition Capturing Method for Incompressible Flame Discontinuities
• Coupling an Eulerian Fluid Calculation to a Lagrangian Solid Calculation with the Ghost Fluid
• Fluid 1 Ghost Cells Fluid 1 Ghost Cells
• Simpli ed Discretization of Systems of Hyperbolic Conservation Laws Containing Advection Equations
• A Conservative Approach to the Multiphase Euler Equations without Spurious Pressure Oscillations
• A General Technique for Eliminating Spurious Oscillations in Conservative Schemes for Multiphase
• Fi-1/2 Fi+3/2Fi+1/2 Fi-1/2 Fi+1/2 Fi+3/2
• velocity=-1 velocity=-1 velocity=1
• UNIVERSITY OF CALIFORNIA Los Angeles
• Eurographics/ ACM SIGGRAPH Symposium on Computer Animation (2009) E. Grinspun and J. Hodgins (Editors)
• To appear in the ACM SIGGRAPH conference proceedings A Mass Spring Model for Hair Simulation
• Wrinkled Flames and Cellular Patterns Jeong-Mo Hong
• IEEE TRANSACTIONS ON VISUALIZATION AND COMPUTER GRAPHICS 1 Fracturing Rigid Materials
• Space Battle Pyromania Willi Geiger
• Eurographics/ACM SIGGRAPH Symposium on Computer Animation (2004) R. Boulic, D. K. Pai (Editors)
• A Virtual Node Algorithm for Changing Mesh Topology During Simulation Neil Molino
• Smoke Simulation For Large Scale Phenomena Nick Rasmussen
• A Fast Hybrid k-Means Level Set Algorithm For Segmentation Frederic Gibou Ronald Fedkiw
• Physically Based Modeling and Animation of Fire Duc Quang Nguyen
• Visual Simulation of Smoke Ronald Fedkiw
• scott r klemmer This statement highlights my three research threads that investigate how software tools can
• When Is Collaborating With Friends A Good Idea? Insights From Design Education
• PLEASE SCROLL DOWN FOR ARTICLE This article was downloaded by: [Stanford University]
• Trading Design Spaces: Exchanging Ideas on Physical Design Environments
• Books with Voices: Paper Transcripts as a Tangible Interface to Oral Histories
• Two Worlds Apart: Bridging the Gap Between Physical and Virtual Media for Distributed Design Collaboration
• ,"&$)-'.%""/0' .&,/0'#1(2/$34#%$&+(5(6''784(9/:;(
• Research and Teaching Statement Christoforos (Christos) Kozyrakis
• Software Transactional Memory Panacea or PandoraPanacea or Pandora''s Box?s Box?
• Transactional Programming In A Multi-core Environment
• How to Have a Bad CareerHow to Have a Bad Career as a Stanford Graduateas a Stanford Graduate
• MonicaS.Lam StanfordUniversity
• An Exploration of Distributed Social Networking Monica S. Lam
• The Junction Protocol for Ad Hoc Peer-to-Peer Mobile Applications
• RETROSPECTIVE: A Data Locality Optimizing Algorithm
• Software Pipelining: An Effective Scheduling Technique for VLIW Machines
• Patterns of Temporal Variation in Online Media Jaewon Yang
• On the Convexity of Latent Social Network Inference Seth A. Myers
• Collection Tree Protocol Omprakash Gnawali
• Flexible Tree Matching Ranjitha Kumar Jerry O. Talton Salman Ahmad Tim Roughgarden Scott R. Klemmer
• Welfare Guarantees for Combinatorial Auctions with Item Bidding Kshipra Bhawalkar
• Algorithmic Game Theory Tim Roughgarden
• Weighted Congestion Games: Price of Anarchy, Universal Worst-Case Examples, and Tightness
• The Price of Anarchy is Independent of the Network Tim Roughgarden
• How Bad is Selfish Routing? Tim Roughgarden Eva Tardos
• Computing Equilibria: A Computational Complexity Perspective
• Errata for Algorithmic Game Theory Noam Nisan, Tim Roughgarden, Eva Tardos, and Vijay V. Vazirani, editors
• Efficient Top-K Query Calculation in Distributed Networks cao@theory.stanford.edu
• The Hippocratic File System: Protecting Privacy in Networked Storage Privacy protection is increasingly difficult in today's in-
• Saturday May 4th Consider the words... "sunny," "tropical,"
• Homomorphic Signatures for Polynomial Functions Stanford University, USA
• Linearly Homomorphic Signatures over Binary Fields and New Tools for Lattice-Based Signatures
• Converting Pairing-Based Cryptosystems from Composite-Order Groups to Prime-Order Groups
• Constructing Abelian Varieties for Pairing-Based Cryptography David Stephen Freeman
• Pairing-Based Identification Schemes David Freeman
• Fast arithmetic and pairing evaluation on genus 2 curves
• Name: SU ID: Email: Local Phone
• Name: SU ID: Email: Local Phone
• Name: SU ID: Email: Local Phone
• Name: SU ID: Email: Local Phone
• Name: SU ID: Email: Local Phone
• Name: SU ID: Email: Local Phone
• Name: SU ID: Email: Local Phone
• Name: SU ID: Email: Local Phone
• Name: SU ID: Email: Local Phone
• Name: SU ID: Email: Local Phone
• Name: SU ID: Email: Local Phone
• Name: SU ID: Email: Local Phone
• Name: SU ID: Email: Local Phone
• Name: SU ID: Email: Local Phone
• Name: SU ID: Email: Local Phone
• Name: SU ID: Email: Local Phone
• Name: SU ID: Email: Local Phone
• Name: SU ID: Email: Local Phone
• STANFORD UNIVERSITY SCHOOL OF ENGINEERING
• STANFORD UNIVERSITY SCHOOL OF ENGINEERING
• STANFORD UNIVERSITY SCHOOL OF ENGINEERING
• STANFORD UNIVERSITY SCHOOL OF ENGINEERING
• STANFORD UNIVERSITY SCHOOL OF ENGINEERING
• STANFORD UNIVERSITY SCHOOL OF ENGINEERING
• Name: SU ID: Email: Local Phone
• Name: SU ID: Email: Local Phone
• STANFORD UNIVERSITY SCHOOL OF ENGINEERING
• Name: SU ID: Email: Local Phone
• Name: SU ID: Email: Local Phone
• Name: SU ID: Email: Local Phone
• STANFORD UNIVERSITY SCHOOL OF ENGINEERING
• STANFORD UNIVERSITY SCHOOL OF ENGINEERING
• DEPARTMENT OF COMPUTER SCIENCE MSCS Program Sheet (2010-11)
• DEPARTMENT OF COMPUTER SCIENCE MSCS Program Sheet (2010-11)
• DEPARTMENT OF COMPUTER SCIENCE MSCS Program Sheet (2010-11)
• DEPARTMENT OF COMPUTER SCIENCE MSCS Program Sheet (2010-11)
• DEPARTMENT OF COMPUTER SCIENCE MSCS Program Sheet (2010-11)
• DEPARTMENT OF COMPUTER SCIENCE MSCS Program Sheet (2010-11)
• DEPARTMENT OF COMPUTER SCIENCE MSCS Program Sheet (2010-11)
• DEPARTMENT OF COMPUTER SCIENCE MSCS Program Sheet (2010-11)
• DEPARTMENT OF COMPUTER SCIENCE MSCS Program Sheet (2009-10)
• DEPARTMENT OF COMPUTER SCIENCE MSCS Program Sheet (2009-10)
• DEPARTMENT OF COMPUTER SCIENCE MSCS Program Sheet (2009-10)
• DEPARTMENT OF COMPUTER SCIENCE MSCS Program Sheet (2009-10)
• DEPARTMENT OF COMPUTER SCIENCE MSCS Program Sheet (2009-10)
• DEPARTMENT OF COMPUTER SCIENCE MSCS Program Sheet (2009-10)
• DEPARTMENT OF COMPUTER SCIENCE MSCS Program Sheet (2008-09)
• DEPARTMENT OF COMPUTER SCIENCE MSCS Program Sheet (2008-09)
• DEPARTMENT OF COMPUTER SCIENCE MSCS Program Sheet (2008-09)
• DEPARTMENT OF COMPUTER SCIENCE MSCS Program Sheet (2007-08)
• DEPARTMENT OF COMPUTER SCIENCE MSCS Program Sheet (2007-08)
• DEPARTMENT OF COMPUTER SCIENCE MSCS Program Sheet (2007-08)
• DEPARTMENT OF COMPUTER SCIENCE MSCS Program Sheet (2006-07)
• DEPARTMENT OF COMPUTER SCIENCE MSCS Program Sheet (2006-07)
• DEPARTMENT OF COMPUTER SCIENCE MSCS Program Sheet (2006-07)
• Guide to the MSCS Program Sheet Eric Roberts September 2005
• DEPARTMENT OF COMPUTER SCIENCE MSCS Program Sheet (2005-06)
• DEPARTMENT OF COMPUTER SCIENCE MSCS Program Sheet (2005-06)
• DEPARTMENT OF COMPUTER SCIENCE MSCS Program Sheet (2005-06)
• DEPARTMENT OF COMPUTER SCIENCE MSCS Program Sheet (2005-06)
• Guide to the MSCS Program Sheet Eric Roberts September 2002
• DEPARTMENT OF COMPUTER SCIENCE MSCS Program Sheet (2002-2003)
• DEPARTMENT OF COMPUTER SCIENCE MSCS Program Sheet (2002-2003)
• DEPARTMENT OF COMPUTER SCIENCE MSCS Program Sheet (2002-03)
• DEPARTMENT OF COMPUTER SCIENCE MSCS Program Sheet (2002-2003)
• DEPARTMENT OF COMPUTER SCIENCE MSCS Program Sheet (2001-2002)
• DEPARTMENT OF COMPUTER SCIENCE MSCS Program Sheet (2001-2002)
• DEPARTMENT OF COMPUTER SCIENCE MSCS Program Sheet (2001-2002)
• DEPARTMENT OF COMPUTER SCIENCE MSCS Program Sheet (2001-02)
• DEPARTMENT OF COMPUTER SCIENCE MSCS Program Sheet (2001-2002)
• DEPARTMENT OF COMPUTER SCIENCE MSCS Program Sheet (2000-2001)
• DEPARTMENT OF COMPUTER SCIENCE MSCS Program Sheet (2000-2001)
• Please use the following labels when submitting forms and recommendations. While you will not be penalized in the admission process for not using them, using these labels will help ensure accurate and timely sorting and processing of your documents. Failu
• Stanford freedom begins with the space of an 8,180-acre
• Please use the following labels when submitting forms and recommendations. While you will not be penalized in the admission process for not using them, using these labels will help ensure accurate and timely sorting and processing of your documents. Failu
• Challenges in New 4G Wireless Networks
• ouise Marie Bohning Knuth was born in South Newburgh Township (now called Garfield
• Algorithm and Data Structures for Efficient Energy Maintenance during Monte Carlo Simulation of Proteins
• STANFORD UNIVERSITY SCHOOL OF ENGINEERING
• CONSTRUCTING PAIRING-FRIENDLY HYPERELLIPTIC CURVES USING WEIL RESTRICTION
• Computing Correlated Equilibria in Multi-Player Games Christos H. Papadimitriou
• HOW ARE WE TO KNOW? Nils J. Nilsson
• Design and Evaluation of a Compiler Algorithm for Prefetching
• Guide to the MSCS Program Sheet Eric Roberts September 2006
• DEPARTMENT OF COMPUTER SCIENCE MSCS Program Sheet (2004-05)
• Program Analysis with Regularly Annotated Constraints John Kodumal
• DEPARTMENT OF COMPUTER SCIENCE MSCS Program Sheet (2002-2003)
• DEPARTMENT OF COMPUTER SCIENCE MSCS Program Sheet (2000-2001)
• On the Expressiveness of Higher Dimensional Automata
• Success, strategy and skill: an experimental study Christopher Archibald
• Teams Can See Pomsets Extended Abstract
• Modeling Concurrency with Geometry Vaughan Pratt y
• Course notes for CS352 Computer Science Department, Stanford University
• Name: SU ID: Email: Local Phone
• Beta Version, Copyright c 2006 Nils J. Nilsson, All Rights Reserved (Book Web Page: http://ai.stanford.edu/nilsson/hawtk/hawtk-webpage.htm)
• Stanford Artificial tnteliigence Laboratory Memo AIM-228
• Automated Analysis of Security-Critical JavaScript APIs Stanford University
• Restoring Pure Equilibria to Weighted Congestion Games
• Switching Logic Synthesis for Reachability Computer Science Dept., Stanford University
• A canonical graphical syntax for non-empty finite products and sums DOMINIC HUGHES
• Linear Logic for Generalized Quantum Mechanics Vaughan Pratt
• StanfordUniversity withDanBoneh,RuvenChu,BenDodson,Bobby
• Notes on the Chu construction and Recursion Gordon Plotkin
• Scheduling Algebra Rob van Glabbeek
• The Second Calculus of Binary Relations Vaughan Pratt \Lambda
• Towards Full Completeness of the Linear Logic of Chu Spaces Vaughan Pratt \Lambda
• From Convex Optimization to Randomized Mechanisms: Toward Optimal Combinatorial Auctions
• DEPARTMENT OF COMPUTER SCIENCE MSCS Program Sheet (2008-09)
• DEPARTMENT OF COMPUTER SCIENCE MSCS Program Sheet (2006-07)
• DEPARTMENT OF COMPUTER SCIENCE MSCS Program Sheet (2010-11)
• Proof Nets for Unit-free Multiplicative-Additive Linear Logic (Extended abstract)
• Guide to the MSCS Program Sheet Eric Roberts (revisions by Claire Stager) September 2008
• Taking the concept of thin clients to the limit, this paper proposes that desktop machines should just be simple,
• Ecient Coroutine Generation of Constrained Gray Sequences Donald E. Knuth and Frank Ruskey
• Automatically Generating Malicious Disks using Symbolic Junfeng Yang, Can Sar, Paul Twohey, Cristian Cadar and Dawson Engler
• Web Caching With Request Reordering Tom as Feder Rajeev Motwani y Rina Panigrahy z An Zhu x
• arXiv:math.LO/0504028v11Apr2005 Classical logic = Fibred MLL
• DEPARTMENT OF COMPUTER SCIENCE MSCS Program Sheet (2004-05)
• DEPARTMENT OF COMPUTER SCIENCE MSCS Program Sheet (2001-2002)
• StanfordUniversity withDanBoneh,RuvenChu,BenDodson,
• DEPARTMENT OF COMPUTER SCIENCE MSCS Program Sheet (2008-09)
• DEPARTMENT OF COMPUTER SCIENCE MSCS Program Sheet (2004-05)
• DEPARTMENT OF COMPUTER SCIENCE MSCS Program Sheet (2005-06)
• The Efficacy of Prototyping Under Time Constraints Steven P. Dow, Kate Heddleston, Scott R. Klemmer
• Pre-stabilization for Rigid Body Articulation with Contact and Collision Rachel Weinstein
• Skeletons and the Shapes of Bundles Shaddin F. Doghmi, Joshua D. Guttman, and F. Javier Thayer
• DAN JURAFSKY Department of Linguistics,
• Shorter proof of universality of Chu spaces Vaughan Pratt
• The Collective: A Cache-Based System Management Architecture Ramesh Chandra Nickolai Zeldovich Constantine Sapuntzakis Monica S. Lam
• DEPARTMENT OF COMPUTER SCIENCE MSCS Program Sheet (2000-2001)
• The Linear Time --Branching Time Spectrum II The semantics of sequential systems with silent moves
• THE ART OF COMPUTER PROGRAMMING ERRATA TO VOLUME 4 FASCICLE 0
• The Load Rebalancing Problem # Gagan Aggarwal a,1 Rajeev Motwani a,2 An Zhu a,3
• Proof Nets for Unit-free Multiplicative-Additive Linear Logic
• Proof Nets for Unit-free Multiplicative-Additive Linear Logic
• Some Monoidal Closed Categories of Stable Domains and Event Structures
• Incorporating application semantics and control into compilation Dawson R. Engler
• Ntyft/ntyxt Rules Reduce to Ntree Rules Wan Fokkink \Lambda
• On Specifying Timeouts # Rob van Glabbeek
• RacerX: E ective, Static Detection of Race Conditions and Deadlocks Dawson Engler and Ken Ashcraft
• The Linear Time -Branching Time Spectrum I The Semantics of Concrete, Sequential Processes
• The Stone Gamut: A Coordinatization of Mathematics Vaughan R. Pratt \Lambda
• Deborah L. McGuinness Work Address
• A Uniform Framework for Approximating Weighted Connectivity Problems NP-hard problems are problems that are computationally expensive to solve optimally. In
• Nested Semantics over Finite Trees are Equationally Hard
• Approximation of Protein Structure for Fast Similarity Measures Itay Lotan1
• DEPARTMENT OF COMPUTER SCIENCE MSCS Program Sheet (2010-11)
• DEPARTMENT OF COMPUTER SCIENCE MSCS Program Sheet (2005-06)
• This is page 1 Printer: Opaque this
• Time and Information in Sequential and Concurrent Computation
• DEPARTMENT OF COMPUTER SCIENCE MSCS Program Sheet (2008-09)
• DEPARTMENT OF COMPUTER SCIENCE MSCS Program Sheet (2008-09)
• Using Bloom Filters to Speed Up HITS-like Ranking Algorithms
• k-means++: The Advantages of Careful Seeding David Arthur
• Deterministic Decentralized Search in Random Graphs
• Revenue Maximization with a Single Sample Dhangwatnotai
• DEPARTMENT OF COMPUTER SCIENCE MSCS Program Sheet (2008-09)
• Two Studies of Opportunistic Programming: Interleaving Web Foraging, Learning, and Writing Code
• Electronic Notes in Theoretical Computer Science 82 No. 1 (2007) URL: http://www.elsevier.nl/locate/entcs/volume82.html 11 pages
• Optimal Efficiency Guarantees for Network Design Mechanisms
• The Meaning of Negative Premises in Transition System Speci cations II
• Bundle Event Structures and CCSP ? Rob van Glabbeek 1 and Frits Vaandrager 2
• Axiomatizing Prefix Iteration with Silent Steps \Lambda Luca Aceto y
• THE ART OF COMPUTER PROGRAMMING ERRATA TO VOLUME 1 (after 2010)
• How to Write Systemspecific, Static Checkers in Metal Benjamin Chelf, Dawson Engler, and Seth Hallem
• Query Nets: Interacting Workflow Modules that Ensure Global Termination #
• Limits of Control Flow on Parallelism Monica S. Lam and Robert P. Wilson
• Robust Treatment of Collisions, Contact and Friction for Cloth Animation Robert Bridson
• The Limits of Smoothness: A Primal-Dual Framework for Price of Anarchy
• DEPARTMENT OF COMPUTER SCIENCE MSCS Program Sheet (2010-11)
• ``sanitizeu ser beforeu sing it''; ``check permissions
• Discrete Mobile Centers Jie Gao # Leonidas J. Guibas # John Hershberger +
• Using Metalevel Compilation to Check FLASH Protocol Code Andy Chou, Benjamin Chelf, Dawson Engler \Lambda
• Electronic Notes in Theoretical Computer Science 83 (2004) URL: http://www.elsevier.nl/locate/entcs/volume83.html 18 pages
• Errata to Mariages Stables (last updated 27 February 2011)
• MECA: an Extensible, Expressive System and Language for Statically Checking Security Properties
• Name: SU ID: Email: Local Phone
• Mobile to GLORIAD Educator's perspectives
• STANFORD UNIVERSITY SCHOOL OF ENGINEERING
• Application Performance and Flexibility on Exokernel Systems M. Frans Kaashoek, Dawson R. Engler, Gregory R. Ganger,
• STANFORD UNIVERSITY SCHOOL OF ENGINEERING
• To appear in Math. Struct. in Comp. Science Higher Dimensional Automata Revisited
• 30-YEAR PROJECTION OF CLIMATE CHANGE: 1850-1981 1850 1860 1870 1880 1890 1900 1910 1920 1930 1940 1950 1960 1970 1980 1990 2000 2010
• Patterns of Collaboration in Design Courses: Team dynamics affect technology appropriation,
• No instruction sequence inverts to yield intermediate
• DEPARTMENT OF COMPUTER SCIENCE MSCS Program Sheet (2007-08)
• On the Representation of Abelian Groups as Chu Vaughan Pratt
• MonicaLam,StanfordUniversity SeokWonSeong,SudheendraHangal,
• Rational Mechanics and Natural Mathematics Vaughan Pratt
• DEPARTMENT OF COMPUTER SCIENCE MSCS Program Sheet (2009-10)
• RETROSPECTIVE: Software Pipelining
• STANFORD UNIVERSITY SCHOOL OF ENGINEERING
• Converting Cycles into Ease-of-Use and Robustness
• A Simple Method for Extracting Models from Protocol Code David Lie Andy Chou Dawson Engler David L. Dill
• verific ation, notc hec king high level design
• Using Redundancies to Find Errors Yichen Xie and Dawson Engler
• Model Checking Large Network Protocol Implementations Madanlal Musuvathi # , Dawson R. Engler
• Full completeness of the multiplicative linear logic of Chu spaces HARISH DEVARAJAN
• An Empirical Study of Operating Systems Errors Andy Chou, Junfeng Yang, Benjamin Chelf, Seth Hallem, and Dawson Engler
• Proof Nets for Unitfree MultiplicativeAdditive Linear Logic (Extended abstract) #
• Generalized Efficiency Bounds In Distributed Resource Allocation Jason R. Marden Tim Roughgarden
• STANFORD UNIVERSITY SCHOOL OF ENGINEERING
• Event Structures for Resolvable Conflict Rob van Glabbeek and Gordon Plotkin
• Universally Utility-Maximizing Privacy Mechanisms Arpita Ghosh
• "Truth" Or "Consequences" "Gio said that truth is a label he attaches to some of his beliefs," Sam
• DEPARTMENT OF COMPUTER SCIENCE MSCS Program Sheet (2009-10)
• Linear Logic complements Classical Logic Vaughan Pratt
• Who Should I Cite? Learning Literature Search Models from Citation Behavior
• DEPARTMENT OF COMPUTER SCIENCE MSCS Program Sheet (2008-09)
• Surviving Sensor Network Software Faults , Omprakash Gnawali
• How Bodies Matter: Five Themes for Interaction Design Scott R. Klemmer, Bjrn Hartmann
• DEPARTMENT OF COMPUTER SCIENCE MSCS Program Sheet (2002-03)
• DEPARTMENT OF COMPUTER SCIENCE MSCS Program Sheet (2004-05)
• Modeling Correlations in Web-Traces and Implications for Designing Replacement Policies.
• Statistical language learning Eugene Charniak
• ARCHER: Using Symbolic, Pathsensitive Analysis to Detect Memory Access Errors
• Final version of completed and signed program sheet due to the department no later than one month prior to the last quarter of senior year.
• STANFORD UNIVERSITY SCHOOL OF ENGINEERING
• Doctoral students may pursue a minor in another department to complement their Ph.D. program. The minor should represent a program of graduate quality and depth, including core requirements and electives or examinations. The department offering the
• DEPARTMENT OF COMPUTER SCIENCE MSCS Program Sheet (2006-07)
• EUROGRAPHICS 2009 / P. Dutr and M. Stamminger (Guest Editors)
• Declaring CS or CSE 1. Find an Advisor
• Improving the Use of Pseudo-Words for Evaluating Selectional Preferences
• Data-driven curvature for real-time line drawing of dynamic scenes
• DEPARTMENT OF COMPUTER SCIENCE MSCS Program Sheet (2006-07)
• Chu spaces: Complementarity and Uncertainty
• ONLINE COMPUTATIONS IN SCHEDULING AND NETWORK APPLICATIONS
• lot s of bugs, lot s of code checked.
• Fourth Intern. Conf. on Architectural Support for Programming Languages and Operating Systems (ASPLOS IV)
• Visible Legacies for Y3K Les Earnest (les at cs.stanford.edu)
• Context-Sensitive Program Analysis as Database Queries Monica S. Lam John Whaley V. Benjamin Livshits Michael C. Martin
• Eurographics/ ACM SIGGRAPH Symposium on Computer Animation (2009), pp. 110 E. Grinspun and J. Hodgins (Editors)
• From Uncertainty to Belief: Inferring the Specification Within Ted Kremenek
• Understanding Sequentialization DOMINIC HUGHES
• Refinement of Actions and Equivalence Notions for Concurrent Systems
• Everything You Always Wanted to Know About Probability Theory, But Were Afraid to Ask \Lambda
• Bisimulation and Propositional Intuitionistic Anna Patterson
• Gates Hall, Fourth Floor 01/10/96 7:06 AM Amarasinghe
• BERND GIROD Email: bgirod@stanford.edu Phone: +1-650-724-6354
• The Individual and Collective Token Interpretations of Petri Nets
• Under-constrained Execution: Making Automatic Code Destruction Easy and Scalable
• STANFORD UNIVERSITY SCHOOL OF ENGINEERING
• Semantic Email Addressing: Sending Email to People, Not Strings Michael Kassoff, Charles Petrie, Lee-Ming Zen and Michael Genesereth
• 9780521872829main CUNY1061-Nisan 0 521 87282 0 May 23, 2007 4:23 Routing Games
• Simple free star-autonomous categories and full coherence DOMINIC J. D. HUGHES
• DEPARTMENT OF COMPUTER SCIENCE MSCS Program Sheet (2005-06)
• Program Report The Program Committee
• Extracting Schema from Semistructured Data SVETLOZAR NESTOROV
• Interactive Privacy via the Median Mechanism Carnegie Mellon University
• STANFORD UNIVERSITY SCHOOL OF ENGINEERING
• sm free_checker { state decl any_pointer v;
• STANFORD UNIVERSITY SCHOOL OF ENGINEERING
• Jeffrey D. Oldham March 5, 2006
• Chu realizes all small concrete categories Vaughan Pratt
• Hash-AV: Fast Virus Signature Scanning by Cache-Resident Filters
• ALGORITHMS EXPLOITING THE CHAIN STRUCTURE OF a dissertation
• An introduction to logical spreadsheets M I C H A E L K A S S O F F 1
• Static Detection of Leaks in Polymorphic Containers David L. Heine
• Eurographics Symposium on Geometry Processing (2006) Konrad Polthier, Alla Sheffer (Editors)
• Software Design RulesSoftware Design RulesSoftware Design Rules Monica LamMonica LamMonica Lam
• The Meaning of Negative Premises in Transition System Specifications II
• Bugs as Deviant Behavior: A General Approach to Inferring Errors in Systems Code
• deadlo cks are bad. ardo e es n de
• Disjunctive Systems and LDomains GuoQiang Zhang
• Eye Spy: Improving Vision through Dialog Adam Vogel, Karthik Raghunathan, Dan Jurafsky
• Have you seen me? Height: 5'10" Weight: 165
• Software Geography: Physical and Economic Vaughan R. Pratt
• Estimating PageRank on Graph Streams Atish Das Sarma
• An Improved Algorithm Finding Nearest Neighbor Using Kd-trees
• ANALYZING AND IMPROVING LOCAL SEARCH: K-MEANS AND ICP
• Using MCMCF to Solve Multicommodity Flow Problems Jeffrey D. Oldham
• DEPARTMENT OF COMPUTER SCIENCE MSCS Program Sheet (2006-07)
• DEPARTMENT OF COMPUTER SCIENCE MSCS Program Sheet (2000-2001)
• DEPARTMENT OF COMPUTER SCIENCE MSCS Program Sheet (2009-10)
• DEPARTMENT OF COMPUTER SCIENCE MSCS Program Sheet (2005-06)
• Full Abstraction in Structural Operational Semantics
• A System and Language for Building SystemSpecific, Static Analyses
• Axiomatising STBisimulation Equivalence Nadia Busi a \Lambda Rob van Glabbeek b y Roberto Gorrieri c \Lambda
• On Cool Congruence Formats for Weak Bisimulations
• Divide and Congruence Applied to #Bisimulation
• THE ART OF COMPUTER PROGRAMMING ERRATA TO VOLUME 2 (3rd edition)
• Information Hiding, Anonymity and Privacy: A Modular Approach
• On the Expressiveness of Higher Dimensional Automata
• What is branching time semantics and why to use it? R.J. van Glabbeek \Lambda
• Search and Replication in Unstructured PeertoPeer Networks Qin Lv Pei Cao Edith Cohen Kai Li Scott Shenker
• Analysis of Queueing Policies in QoS An Zhu a,1 ,
• Petri Nets, Configuration Structures and Higher Dimensional Automata ?
• {accept,reject} empirically
• DPF: Fast, Flexible Message Demultiplexing using Dynamic Code Generation Dawson R. Engler, and M. Frans Kaashoek
• DEPARTMENT OF COMPUTER SCIENCE MSCS Program Sheet (2008-09)
• Integrating Physical and Digital Interactions on Walls for Fluid
• December 13, 2009 Les Earnest, Executive Officer of the Stanford Artificial Intelligence Lab, 1965-80,
• DEPARTMENT OF COMPUTER SCIENCE MSCS Program Sheet (2001-2002)
• Algorithms for and the Complexity of Constraint Entailment Zhendong Patrick Su
• DEPARTMENT OF COMPUTER SCIENCE MSCS Program Sheet (2009-10)
• Linear process algebra Vaughan Pratt
• Learning Structured Prediction Models: A Large Margin Approach Ben Taskar taskar@cs.berkeley.edu
• Discriminative Learning of Markov Random Fields for Segmentation of 3D Scan Data
• Empirical Bi-Action Tables: A Tool for the Evaluation and
• 24 December/January 2006-2007 ACM QUEUE rants: feedback@acmqueue.com Architecture
• Broadening the denotational semantics of linear Vaughan Pratt
• Algorithms for Multi-Product Pricing Gagan Aggarwal1 , Tomas Feder , Rajeev Motwani1 , and An Zhu1
• AnImplementationofaCombinatorial ApproximationAlgorithmforMinimum-Cost
• The power of two min-hashes for similarity search among hierarchical data objects
• Black-Box Randomized Reductions in Algorithmic Mechanism Design
• Information Hiding, Anonymity and Privacy: A Modular Approach
• Name: SU ID: Email: Local Phone
• September 2010 MS CS Secondary Depth Requirements
• The Linear Time Branching Time Spectrum I \Lambda The Semantics of Concrete, Sequential Processes
• THE ART OF COMPUTER PROGRAMMING ERRATA TO VOLUME 3 (after 2010)
• Proof Nets for Unitfree MultiplicativeAdditive Linear Logic (Extended abstract) #
• Precongruence Formats for Decorated Trace Semantics IBM T.J. Watson Research Center
• Modelling Concurrency with Partial Orders* Vaughan Pratt
• Understanding Sequentialization DOMINIC HUGHES
• OE THE ART OF COMPUTER PROGRAMMING OE OEOEOE ERRATA TO VOLUME 1 (2nd edition) OEOEOE
• Divide and Congruence: From Decomposition of Modalities
• STANFORD UNIVERSITY SCHOOL OF ENGINEERING
• The following notes have been sent by people who were not able to attend the SAIL Reunion on November 22, 2009, http://www.stanford.edu/~learnest/SAIL.reunion.pdf.
• Remembrance Of Things Past Gio began the session by remarking, "Many of my models concern things
• Vaughan Pratt Stanford University
• God's Calling Jeffrey D. Oldham
• Lower bounds on Locality Sensitive Hashing Rajeev Motwani
• Online multiple-item multi-unit auctions Shipra Agrawal
• Token-controlled place refinement in hierarchical Petri nets with application to active document
• Groups Without Tears: Mining Social Topologies from Email
• HCI at Stanford Terry Winograd
• The Meaning of Negative Premises in Transition System Specifications II
• Proof Nets for Unit-free Multiplicative-Additive Linear Logic (Extended abstract)
• A Characterisation of Weak Bisimulation Congruence
• Analyzing BitTorrent and Related Peer-to-Peer Networks David Arthur
• Financial Turmoil and One's Faith Jeffrey D. Oldham
• 3.5-Way Cuckoo Hashing for the Price of 2-and-a-Bit Eric Lehman1
• Curriculum Vitae Qixing Huang
• A Data Locality Optimizing Algorithm Michael E. Wolf and Monica S. Lam
• STANFORD UNIVERSITY SCHOOL OF ENGINEERING
• Corinne Barkow HR & Faculty Affairs
• EXE: Automatically Generating Inputs of Death Cristian Cadar, Vijay Ganesh, Peter M. Pawlowski, David L. Dill, Dawson R. Engler
• Approximation via Cost Sharing: Simpler and Better Approximation Algorithms for Network
• Chu spaces as a semantic bridge between linear logic and mathematics
• Transact Workshop ---August 2007 Beyond Transactions
• DEPARTMENT OF COMPUTER SCIENCE MSCS Program Sheet (2004-05)
• Gates Accept Concurrent Behavior Vineet Gupta
• Applying Sentence Simplification to the CoNLL-2008 Shared Task David Vickrey and Daphne Koller
• A Geometric Approach to Lower Bounds for Approximate Near-Neighbor Search and Partial Match
• Beta Version, Copyright c 2006 Nils J. Nilsson, All Rights Reserved (Book Web Page: http://ai.stanford.edu/nilsson/hawtk/hawtk-webpage.htm)
• Learning Hierarchical Object Maps Of Non-Stationary Environments With Mobile Robots
• Restoring Pure Equilibria to Weighted Congestion Games
• Name: SU ID: Email: Local Phone
• Quantifying Inefficiency in Cost-Sharing Mechanisms Tim Roughgarden
• CURRICULUM VITAE Vaughan R. Pratt
• DEPARTMENT OF COMPUTER SCIENCE MSCS Program Sheet (2006-07)
• Interleaving Semantics and Action Refinement with Atomic Choice
• Static analysis versus software model checking for bug nding Dawson Engler and Madanlal Musuvathi
• COMPUTER PROGRAMMING VOLUME 4 PRE-FASCICLE 1B
• Arithmetic + Logic + Geometry = Concurrency Vaughan Pratt \Lambda
• Switch Scheduling via Randomized Edge Coloring Gagan Aggarwal + Rajeev Motwani # Devavrat Shah An Zhu
• Parsing as Statistical Pattern Recognition David M. Magerman
• COMPUTER PROGRAMMING DONALD E. KNUTH Stanford University
• Axiomatizing Flat Iteration R.J. van Glabbeek \Lambda
• Ntyft/ntyxt Rules Reduce to Ntree Rules \Lambda Wan Fokkink y
• In Proceedings of IEEE Logic in Computer Science, 2003 Proof Nets for Unitfree MultiplicativeAdditive Linear Logic
• OE THE ART OF COMPUTER PROGRAMMING OE OEOEOEOEOEOEOE ERRATA, VOLUME THREE OEOEOEOEOEOEOE
• Well-behaved Flow Event Structures for Parallel Composition and Action Re nement
• A Characterisation of Weak Bisimulation Congruence
• EXE: Automatically Generating Inputs of Death Cristian Cadar, Vijay Ganesh, Peter M. Pawlowski, David L. Dill, Dawson R. Engler
• EXPLODE: a Lightweight, General System for Finding Serious Storage System Errors
• DEPARTMENT OF COMPUTER SCIENCE MSCS Program Sheet (2006-07)
• Human-Centered Robotics and Interactive Haptic Simulation O. Khatib, O. Brock, K.C. Chang, D. Ruspini, L. Sentis, S. Viji
• DEPARTMENT OF COMPUTER SCIENCE MSCS Program Sheet (2007-08)
• Distributions and Mutual Funds Jeffrey D. Oldham
• STANFORD UNIVERSITY SCHOOL OF ENGINEERING
• On the Expressiveness of Higher Dimensional Automata
• Merrimac: Supercomputing with Streams William J. Dally Patrick Hanrahan Mattan Erez Timothy J. Knight
• Z .Parallel Computing 24 1998 445475 Maximizing parallelism and minimizing
• Anatomy of the Pentium Bug Vaughan Pratt
• A method for avoiding the acoustic time step restriction in compressible flow
• Z-Ranking: Using Statistical Analysis to Counter the Impact of Static Analysis Approximations
• Divide and Congruence Applied to -Bisimulation
• DEPARTMENT OF COMPUTER SCIENCE MSCS Program Sheet (2007-08)
• Correcting for Missing Data in Information Cascades Eldar Sadikov
• Beta Version, Copyright c 2006 Nils J. Nilsson, All Rights Reserved (Book Web Page: http://ai.stanford.edu/nilsson/hawtk/hawtk-webpage.htm)
• DEPARTMENT OF COMPUTER SCIENCE MSCS Program Sheet (2006-07)
• Cloning-Based Context-Sensitive Pointer Alias Analysis Using Binary Decision Diagrams
• Submodular Functions: Extensions, Distributions, and Algorithms Shaddin Dughmi
• Revenue Maximization with a Single Sample Dhangwatnotai
• LEARNING STRUCTURED PROBABILISTIC MODELS FOR SEMANTIC ROLE LABELING
• Non-Local Contrastive Objectives David Vickrey dvickrey@cs.stanford.edu
• An Active Learning Approach to Finding Related Terms David Vickrey
• Searching for Shapes in Cryptographic Shaddin F. Doghmi, Joshua D. Guttman, and F. Javier Thayer
• BIBLIOGRAPHY 1. with J. E. Hopcroft Formal Languages and Their Relation to Automata, Addison Wesley, Reading,
• Directly Visible Pairs and Illumination by Reflections in Orthogonal Polygons
• Research Summary Shipra Agrawal
• Diagnosing Link-level Anomalies Using Passive Shipra Agrawal
• Efficient Detection of Distributed Constraint Violations Shipra Agrawal
• Equilibrium in Prediction Markets with Buyers and Sellers
• Succinct Coverage Oracles Ioannis Antonellis1
• Amplified Hardness of Approximation for VCG-Based Mechanisms Shaddin Dughmi
• Adaptive Navigation of Vehicles in Congested Road Networks
• RESEARCH STATEMENT I am broadly interested in computer and network security, cryptography, programming language
• Research Statement January 29, 2010 Aneesh Sharma Page 1 of 7
• An Axiomatic Approach for Result Diversification Sreenivas Gollapudi
• Classifying Regular Languages by a Split Game BASICS Laboratory,
• Worst-case and Smoothed Analysis of the ICP Algorithm, with an Application to the k-means Method
• How Slow is the k-Means Method? David Arthur
• Seeing, Seeking, Following Jeffrey D. Oldham
• Names of God and Exodus 3:16 Jeffrey D. Oldham
• Various Translations of Psalm 23a Jeffrey D. Oldham
• Avoiding Fraud: Tips for Individuals Jeffrey D. Oldham
• The Oil Searching Problem Andrew McGregor1
• Spamming Botnets: Signatures and Characteristics Yinglian Xie, Fang Yu, Kannan Achan, Rina Panigrahy, Geoff Hulten+
• Trace reconstruction with constant deletion probability and related Thomas Holenstein
• Finding Frequent Elements in Non-bursty Rina Panigrahy1
• Quantifying Inefficiency in Cost-Sharing Mechanisms Tim Roughgarden
• Optimal Marketing Strategies over Social Networks Jason Hartline
• Computing Optimal Bundles for Sponsored Search Arpita Ghosh
• Stochastic Mechanism Design (Extended Abstract)
• A Modular Correctness Proof of IEEE 802.11i and CHANGHUA HE
• SecRet 2008 An Automated Approach for Proving PCL
• I. Jonassen and J. Kim (Eds.): WABI 2004, LNBI 3240, pp. 326337, 2004. Springer-Verlag Berlin Heidelberg 2004
• Stochastic Kronecker Graphs Mohammad Mahdian
• Fractional Matching via Balls-and-Bins Rajeev Motwani
• ) Deterministic Gossiping Algorithm for Radio Networks
• DETECTING COLLUDERS IN PAGERANK: FINDING SLOW MIXING STATES IN A MARKOV CHAIN
• Switch Scheduling via Randomized Edge Coloring Gagan Aggarwal Rajeev Motwani Devavrat Shah An Zhu
• TRADE-OFFS IN COST SHARING A DISSERTATION
• Optimizing Joins in a Map-Reduce Environment Foto N. Afrati
• A New Computation Model for Cluster Computing Foto N. Afrati
• Skeletons, Homomorphisms, and Shapes: Characterizing Protocol Executions 1
• 2008 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any c
• History Preserving Process Graphs R.J. van Glabbeek*
• [1]L. Aceto, W.J. Fokkink, R.J. van Glabbeek & A. Ing'olfsd'ottir (1996): Axi* atizing prefix iteration with silent steps. Information and Computation 12*
• Well-behaved Flow Event Structures for Parallel Composition and Action Refinement
• Nested Semantics over Finite Trees are Equationally Hard
• Tracking Down Software Bugs Using Automatic Anomaly Detection
• Divide and Congruence: From Decomposition of Modalities
• [1] L. Aceto, W.J. Fokkink, R.J. van Glabbeek & A. Ing olfsd ottir (1996): Axiom-atizing pre x iteration with silent steps. Information and Computation 127(1), pp. 26{40.
• Scheduling Algebra Rob van Glabbeek 1 , Peter Rittgen 2
• INDEX TO ALGORITHMS AND THEOREMS Algorithm 1.1E, 2, 4.
• Branching Bisimulation as a Tool in the Analysis of Weak Bisimulation y
• Errata for Stable Marriage| rst printing of the English edition (last updated 07 October 2010)
• CURRICULUM VIT April 29, 2011 1. Biographical and Personal Information
• Proof Nets for Unit-free Multiplicative-Additive Linear Logic
• Compositionality of HennessyMilner Logic through Structural Operational Semantics #
• Maximizing Multiprocessor Performance with the SUIF Compiler Mary W. Hall y Jennifer M. Anderson Saman P. Amarasinghe
• COMPUTER PROGRAMMING PRE-FASCICLE 2B
• Clifford Nass Department of Communication
• Iterative Design and Evaluation of an Event Architecture for Pen-and-Paper Interfaces
• DEPARTMENT OF COMPUTER SCIENCE MSCS Program Sheet (2007-08)
• DEPARTMENT OF COMPUTER SCIENCE MSCS Program Sheet (2010-11)
• DEPARTMENT OF COMPUTER SCIENCE MSCS Program Sheet (2000-2001)
• DEPARTMENT OF COMPUTER SCIENCE MSCS Program Sheet (2010-11)
• DEPARTMENT OF COMPUTER SCIENCE MSCS Program Sheet (2001-2002)
• Constructing Pairing-Friendly Genus 2 Curves with Ordinary Jacobians
• Bundle Event Structures and CCSP Rob van Glabbeek
• DEPARTMENT OF COMPUTER SCIENCE MSCS Program Sheet (2002-2003)
• ON THE SPECIFICATION OF CONCURRENT SYSTEMS a dissertation
• Diamonds and Dragons: Notes on Dekking's Generalized Dragon Curves Don Knuth, September 2010
• Slavic names November 30, 2009 (The \Western" form of a name is not usually a systematic transliteration of the
• Precongruence Formats for Decorated Trace Preorders IBM T.J. Watson Research Center
• Hybrid Diagrams: A DeductiveAlgorithmic Approach to Hybrid System Verification ?
• The Load Rebalancing Problem Gagan Aggarwal #
• Algorithms for MultiProduct Pricing Gagan Aggarwal 1 # , Tomas Feder ## , Rajeev Motwani 1 ### , and An Zhu 1 +
• Parsing a Natural Language Using Mutual Information Statistics \Lambda
• arXiv:math.LO/0504065 Logic Without Syntax
• A Complete Axiomatization for Branching Bisimulation Congruence of FiniteState Behaviours
• Deep inference proof theory equals categorical proof theory minus coherence
• Discrete Mobile Centers Jie Gao # Leonidas J. Guibas # John Hershberger +
• Exokernel: An Operating System Architecture for ApplicationLevel Resource Management
• Checking System Rules Using System-Speci c, Programmer-Written Compiler Extensions
• Simple free starautonomous categories and full coherence DOMINIC J. D. HUGHES
• ZRanking: Using Statistical Analysis to Counter the Impact of Static Analysis Approximations
• The Meaning of Negative Premises in Transition System Specifications II
• Some lessons from using static analysis and software model checking for bug nding
• On the Expressiveness of Higher Dimensional Automata
• Tokencontrolled place refinement in hierarchical Petri nets with application to active document
• Combining Request Scheduling with Web Tomas Feder a , Rajeev Motwani b,1 , Rina Panigrahy c ,
• Optimal Cost-Sharing Mechanisms for Steiner Forest Problems
• ICEBERG: An Internet-core Network Architecture for Integrated Communications Helen J. Wang, Bhaskaran Raman, Rahul Biswas, Chen-nee Chuah,
• Guide to the MSCS Program Sheet Eric Roberts September 2004
• Name: SU ID: Email: Local Phone
• DEPARTMENT OF COMPUTER SCIENCE MSCS Program Sheet (2010-11)
• DEPARTMENT OF COMPUTER SCIENCE MSCS Program Sheet (2010-11)
• Papier-Mch: Toolkit Support for Tangible Input Scott R. Klemmer, Jack Li, James Lin
• STANFORD UNIVERSITY SCHOOL OF ENGINEERING
• Guide to the MSCS Program Sheet Eric Roberts September 2001
• DEPARTMENT OF COMPUTER SCIENCE MSCS Program Sheet (2005-06)
• Inferring Networks of Diffusion and Influence Gomez-Rodriguez
• An Unconditionally Stable Fully Conservative Semi-Lagrangian Method Michael Lentine
• Online Word Games for Semantic Data Collection David Vickrey Aaron Bronzan William Choi Aman Kumar
• Compositionality of Hennessy-Milner Logic by Structural Operational Semantics
• Refinement of Actions and Equivalence Notions for Concurrent Systems
• History Preserving Process Graphs R.J. van Glabbeek*
• Errata for Surreal Numbers (last updated 09 Feb 2008)
• Errata for Literate Programming (last updated 31 December 2002)
• Divide and Congruence: From Decomposition of Modalities
• Ntyft/ntyxt Rules Reduce to Ntree Rules* Wan Fokkinky Rob van Glabbeekz
• Configuration Structures (extended abstract)
• On the Expressiveness of Higher Dimensional Automata
• Reactive, Generative and Stratified Models of Probabilistic Processes
• Compositionality of Hennessy-Milner Logic through Structural Operational Semantics?
• On Specifying Timeouts Rob van Glabbeek
• Electronic Notes in Theoretical Computer Science 83 (2004) URL: http://www.elsevier.nl/locate/entcs/volume83.html18 pages
• Branching Bisimulation as a Tool in the Analysis of Weak Bisimulationy
• Errata for Mathematical Writing, second printing (last updated 24 August 2002)
• Games and Definability for System F Dominic J.D. Hughes
• Axiomatising ST-Bisimulation Equivalence Nadia Busia * Rob van Glabbeekb y Roberto Gorrieric *
• Errata for Axioms and Hulls (last updated 13 June 2003)
• Precongruence Formats for Decorated Trace Preorders Bard Bloom Wan Fokkink* Rob van Glabbeek
• Types for Deterministic Concurrency Tachio Terauchi
• Name: SU ID: Email: Local Phone
• Name: SU ID: Email: Local Phone
• On the Expressiveness of ACP (extended abstract) \Lambda
• THE ART OF COMPUTER PROGRAMMING ERRATA TO VOLUME 4 FASCICLE 1
• OE THE ART OF COMPUTER PROGRAMMING OE OEOEOE ERRATA TO VOLUME 2 (2nd edition) OEOEOE
• THE ART OF COMPUTER PROGRAMMING ERRATA TO VOLUME 4 FASCICLE 3
• THE ART OF COMPUTER PROGRAMMING ERRATA TO VOLUME 1 (3rd edition)
• in terfaces, tricky ratsn est of
• Tasks and Revocation for Java (or, Hey! You got your Operating System my Language!)
• COMPUTER PROGRAMMING PRE-FASCICLE 2A
• INDEX TO ALGORITHMS AND THEOREMS Algorithm 5.1.1C, 591{592.
• Towards Object Mapping in Non-Stationary Environments With Mobile Robots
• DEPARTMENT OF COMPUTER SCIENCE MSCS Program Sheet (2000-2001)
• DEPARTMENT OF COMPUTER SCIENCE MSCS Program Sheet (2010-11)
• November 20, 2009 Registered Attendees for the
• DEPARTMENT OF COMPUTER SCIENCE MSCS Program Sheet (2000-2001)
• Sentence Simplification for Semantic Role Labeling David Vickrey and Daphne Koller
• /' 0 1 * 2 * ( " # $( 0 ,)*1+
• Estimating Sum by Weighted Sampling Rajeev Motwani1
• The restricted arc-width of a graph David Arthur
• Approximating the Smallest Grammar: Kolmogorov Complexity in Natural Models
• 9780521872829main CUNY1061-Nisan 0 521 87282 0 May 23, 2007 18:15 Qualifying the
• BIOINFORMATICS Vol. 19 Suppl. 1 2003, pages i54i62 DOI: 10.1093/bioinformatics/btg1005
• Stanford's motto, "Die Luft der Freiheit weht"
• SAIL Walkabout Saturday, November 21, 2009
• DEPARTMENT OF COMPUTER SCIENCE MSCS Program Sheet (2000-01)
• Concurrent ontology and the extensional conception of attribute Vaughan Pratt
• Coordinating Tasks on the Commons: Designing for Personal Goals, Expertise and Serendipity
• Balanced Allocation on Graphs Krishnaram Kenthapadi
• Vision Paper: Enabling Privacy for the Paranoids G. Aggarwal, M. Bawa, P. Ganesan, H. Garcia-Molina, K. Kenthapadi,
• A Framework for High-Accuracy Privacy-Preserving Mining Shipra Agrawal Jayant R. Haritsa
• A Discussion of Click-Through Algorithms for Web Page Ranking 1 Introduction
• A Peer-to-Peer System as an Exchange Economy Christina Aperjis
• Stochastic Kronecker Graphs Mohammad Mahdian1
• MEASURING AND MODELING THE WEB A DISSERTATION
• An Empirical Analysis of Return on Investment Maximization in Sponsored Search Auctions
• On Characterizations of Truthful Mechanisms for Combinatorial Auctions and Scheduling
• Universally Utility-Maximizing Privacy Mechanisms Arpita Ghosh
• Completeness of the Authentication Tests Shaddin F. Doghmi, Joshua D. Guttman, and F. Javier Thayer
• Translation of 1 John 3:16 Jeffrey D. Oldham
• Robust Mechanisms for Risk-Averse Sellers Mukund Sundararajan
• On the Price of Truthfulness in Path Auctions Department of Computer Science, Stanford University
• Non-Preemptive Coordination Mechanisms for Identical Machine Scheduling Games
• Pari-mutuel Betting on Permutations
• A Unified Framework for Dynamic Pari-mutuel Information Market
• Correlation Robust Stochastic Optimization Shipra Agrawal
• Parimutuel Betting on Permutations Shipra Agrawal1, Zizhuo Wang2, and Yinyu Ye3
• Excursions in Neighborhood Geometry of Tessellations Mridul Aanjaneya (Roll No.: 04CS1022)
• Equilibrium Efficiency and Price Complexity in Sponsored Search Auctions
• Guide to the MSCS Program Sheet Eric Roberts September 2003
• Efficient Maintenance and Self-Collision Testing for Kinematic Chains
• STANFORD UNIVERSITY SCHOOL OF ENGINEERING
• PrediCalc: A Logical Spreadsheet Management System Michael Kassoff Lee-Ming Zen Ankit Garg Michael Genesereth
• Improving Traffic Locality in BitTorrent via Biased Neighbor Selection
• Name: SU ID: Email: Local Phone
• % & ' 0 0 $### % ! 2 3##4 5
• DEPARTMENT OF COMPUTER SCIENCE MSCS Program Sheet (2007-08)
• Axiomatizing Flat Iteration R.J. van Glabbeek \Lambda
• The General Steiner Tree-Star Problem Samir Khuller An Zhu y
• Configuration Structures (extended abstract)
• THE ART OF COMPUTER PROGRAMMING ERRATA TO VOLUME 4A
• THE ART OF COMPUTER PROGRAMMING ERRATA TO VOLUME 3 (2nd edition)
• The duality of prime event structures and automata Course notes for CS352
• Event Structures for Resolvable Conflict # Rob van Glabbeek and Gordon Plotkin
• METRIC PROCESS MODELS a dissertation
• Gates Hall, First Floor 01/10/96 7:04 AM 194 192 190 188 184 182 180
• Full completeness of the multiplicative linear logic of Chu spaces HARISH DEVARAJAN
• Constructing Pairing-Friendly Elliptic Curves with Embedding Degree 10.
• Randomized Algorithms Prabhakar Raghavan
• Name: SU ID: Email: Local Phone
• Name: SU ID: Email: Local Phone
• Concurrent Kripke Structures Vineet Gupta
• Nonconvex Rigid Bodies with Stacking Eran Guendelman
• Notes on Event structures and Chu Gordon Plotkin
• A Characterisation of Weak Bisimulation Congruence
• A Complete Axiomatization for Branching Bisimulation Congruence of Finite-State Behaviours
• The Meaning of Negative Premises in Transition System Specifications II*
• On the Expressiveness of Higher Dimensional Automata
• The Linear Time -Branching Time Spectrum I* The Semantics of Concrete, Sequential Processes
• Divide and Congruence Applied to j-Bisimulation
• The Meaning of Negative Premises in Transition System Specifications II
• On Cool Congruence Formats for Weak Bisimulations
• On the Expressiveness of ACP (extended abstract)*
• The Individual and Collective Token Interpretations of Petri Nets
• Ntyft/ntyxt Rules Reduce to Ntree Rules Wan Fokkink* Rob van Glabbeeky
• Bisimulation R.J. van Glabbeek
• Axiomatizing Prefix Iteration with Silent Steps Luca Aceto* Wan Fokkinkz
• The Difference between Splitting in n and n + 1 (abstract)
• Deep inference proof theory equals categorical proof theory minus coherence
• Errata to Mathematics for the Analysis of Algorithms, third edition (last updated 09 February 2008
• Bundle Event Structures and CCSP? Rob van Glabbeek1 and Frits Vaandrager2
• Event Structures for Resolvable Conflict? Rob van Glabbeek and Gordon Plotkin
• Errata for Stable Marriage_first printing of the English edition (last updated 07 October 2010)
• Axiomatizing Flat Iteration R.J. van Glabbeek*
• Axiomatizing Prefix Iteration with Silent Steps* Luca Acetoy Wan Fokkinkx
• Petri Nets, Configuration Structures and Higher Dimensional Automata?
• What is branching time semantics and why to use it? R.J. van Glabbeek*
• Interleaving Semantics and Action Refinement with Atomic Choice
• Divide and Congruence: From Decomposition of Modalities
• Donald E. Knuth (B.S. and M.S., Case Institute of Technology 1960; Ph.D., California Institute of
• The Meaning of Negative Premises in Transition System Specifications II
• Full completeness of the multiplicative linear logic of Chu spaces Harish Devarajan Dominic Hughes Gordon Plotkin Vaughan Pratt
• On the Expressiveness of Higher Dimensional Automata
• An Algorithmic Game Theory Primer Tim Roughgarden
• The first three spelling checkers Les Earnest
• DEPARTMENT OF COMPUTER SCIENCE MSCS Program Sheet (2001-2002)
• LOGICAL SPREADSHEETS A DISSERTATION
• Paraconsistent Inference from Data using Existential -Entailment Michael Kassoff and Michael R. Genesereth
• The Markov Reformulation Theorem Michael Kassoff and Michael Genesereth
• Newsgroups: rec.bicycles.racing From: Les Earnest
• Effects of User Similarity in Social Media Ashton Anderson Daniel Huttenlocher Jon Kleinberg Jure Leskovec
• John McCarthy (1927-2011) John McCarthy introduced the term "artificial intelligence" to identify his principal
• The Life and Death of Online Groups: Predicting Group Growth and Longevity
• PRECISE AND AUTOMATIC VERIFICATION OF CONTAINER-MANIPULATING PROGRAMS
• Inferring Networks of Diffusion and Influence MANUEL GOMEZ-RODRIGUEZ
• USING INFLUENCE TO UNDERSTAND COMPLEX SYSTEMS A DISSERTATION
• DAN JURAFSKY Department of Linguistics,
• Structure from sorts, properties, and composition A minimalist approach to topoalgebraic structure
• A MODULAR AND SYMBOLIC APPROACH TO STATIC PROGRAM ANALYSIS
• E. Kalogerakis, A. Hertzmann, K. Singh / Learning 3D Mesh Segmentation and Labeling, TOG 29{3}, Siggraph 2010 Learning 3D Mesh Segmentation and Labeling
• Human Wayfinding in Information Networks Robert West
• Eurographics Symposium on Geometry Processing 2009 Marc Alexa and Michael Kazhdan
• Hedged Public-Key Encryption: How to Protect Against Bad Randomness
• Weak Verifiable Random Functions Zvika Brakerski1
• Inferring Networks of Diffusion and Influence MANUEL GOMEZ-RODRIGUEZ, Stanford University and MPI for Intelligent Systems
• Energy-Efficient Networking Energy-Aware Routing Protocol
• Doctoral students may pursue a minor in another department to complement their Ph.D. program. The minor should represent a program of graduate quality and depth, including core requirements and electives or examinations. The department offering the
• Eurographics Symposium on Geometry Processing (2006) Konrad Polthier, Alla Sheffer (Editors)
• Eigentransport for Efficient and Accurate All-Frequency Relighting Derek Nowrouzezahrai Patricio Simari Evangelos Kalogerakis Eugene Fiume
• Inferring Networks of Diffusion and Influence Gomez-Rodriguez
• Eurographics Symposium on Geometry Processing (2007) Alexander Belyaev, Michael Garland (Editors)
• Jitter-Approximation Tradeoff for Periodic Zvika Brakerski Boaz Patt-Shamir
• Learning Hatching for Pen-and-Ink Illustration of Surfaces EVANGELOS KALOGERAKIS
• General Perfectly Periodic Scheduling Zvika Brakerski Aviv Nisgav Boaz Patt-Shamir
• EUROGRAPHICS 2009 / P. Dutr and M. Stamminger (Guest Editors)
• Extracting lines of curvature from noisy point clouds
• Local Property Restoring EXTENDED ABSTRACT
• Probabilistic Reasoning for Assembly-Based 3D Modeling Siddhartha Chaudhuri
• Limits on the Power of Zero-Knowledge Proofs in Cryptographic Constructions
• Data-driven curvature for real-time line drawing of dynamic scenes
• Dispatching in Perfectly-Periodic Schedules Zvika Brakerski, Vladimir Dreizin, Boaz Patt-Shamir
• December 1, 2000 Page 1 of 1 Administrative Guide Memo 66 Stanford University
• Fully Homomorphic Encryption from Ring-LWE and Security for Key Dependent Messages