| |
 |      |
                                              |
Note: Links lead to the DBLP on the Web. Alan J. Demers Indranil Gupta , Kenneth P. Birman , Prakash Linga , Alan J. Demers, Robbert van Renesse : Kelips: Building an Efficient and Stable P2P DHT through Increased Memory and Background Overhead. IPTPS 2003 : 160-169 Alan J. Demers, Johannes Gehrke , Rajmohan Rajaraman , Agathoniki Trigoni , Yong Yao : The Cougar Project: a work-in-progress report. SIGMOD Record 32 (4): 53-59 (2003) David Kempe , Jon M. Kleinberg , Alan J. Demers: Spatial gossip and resource location protocols. STOC 2001 : 163-172 Mike Spreitzer , Marvin Theimer , Karin Petersen , Alan J. Demers, Douglas B. Terry : Dealing with server corruption in weakly consistent replicated data systems. Wireless Networks 5 (5): 357-371 (1999) Mike Spreitzer , Marvin Theimer , Karin Petersen , Alan J. Demers, Douglas B. Terry : Dealing with Server Corruption in Weakly Consistent, Replicated Data Systems. MOBICOM 1997 : 234-240 Karin Petersen , Mike Spreitzer , Douglas B. Terry , Marvin Theimer , Alan J. Demers: Flexible Update Propagation for Weakly Consistent Replication. SOSP 1997 : 288-301 Frances Yao , Alan J. Demers, Scott Shenker : A Scheduling Model for Reduced CPU Energy. FOCS 1995 : 374-382 Douglas B. Terry , Marvin Theimer , Karin Petersen , Alan J. Demers, Mike Spreitzer , Carl Hauser : Managing Update Conflicts in Bayou, a Weakly Connected Replicated Storage System. SOSP 1995 : 172-183 Mark Weiser , Brent Welch , Alan J. Demers, Scott Shenker : Scheduling for Reduced CPU Energy. OSDI 1994 : 13-23 Douglas B. Terry , Alan J. Demers, Karin Petersen , Mike Spreitzer , Marvin Theimer , Brent W. Welch : Session Guarantees for Weakly Consistent Replicated Data. PDIS 1994 : 140-149 Alan J. Demers: Research Issues in Ubiquitous Computing. PODC 1994 : 2-8 Vaduvur Bharghavan , Alan J. Demers, Scott Shenker , Lixia Zhang : MACAW: A Media Access Protocol for Wireless LAN's. SIGCOMM 1994 : 212-225 Marvin Theimer , Alan J. Demers, Brent B. Welch : Operating System Issues for PDAs. Workshop on Workstation Operating Systems 1993 : 2-8 Hans-Juergen Boehm , Alan J. Demers, Christ Uhler : Implementing Multiple Locks Using Lamport's Mutual Exclusion Algorithm. LOPLAS 2 (1-4): 46-58 (1993) Hans-Juergen Boehm , Alan J. Demers, Scott Shenker : Mostly Parallel Garbage Collection. PLDI 1991 : 157-164 Alan J. Demers, Mark Weiser , Barry Hayes , Hans-Juergen Boehm , Daniel G. Bobrow , Scott Shenker : Combining Generational and Conservative Garbage Collection: Framework and Implementations. POPL 1990 : 261-269 Russell R. Atkinson , Alan J. Demers, Carl Hauser , Christian Jacobi , Peter Kessler , Mark Weiser : Experiences Creating a Portable Cedar. PLDI 1989 : 322-329 Alan J. Demers, Srinivasan Keshav , Scott Shenker : Analysis and Simulation of a Fair Queueing Algorithm. SIGCOMM 1989 : 1-12 Mark Weiser , Alan J. Demers, Carl Hauser : The Portable Common Runtime Approach to Interoperability. SOSP 1989 : 114-122 Robert Cartwright , Alan J. Demers: The Topology of Program Termination LICS 1988 : 296-308 Alan J. Demers, Daniel H. Greene , Carl Hauser , Wes Irish , John Larson , Scott Shenker , Howard E. Sturgis , Daniel C. Swinehart , Douglas B. Terry : Epidemic Algorithms for Replicated Database Maintenance. Operating Systems Review 22 (1): 8-32 (1988) Alan J. Demers, Daniel H. Greene , Carl Hauser , Wes Irish , John Larson : Epidemic Algorithms for Replicated Database Maintenance. PODC 1987 : 1-12 Anne Neirynck , Prakash Panangaden , Alan J. Demers: Computation of Aliases and Support Sets. POPL 1987 : 274-283 Thomas W. Reps , Alan J. Demers: Sublinear-Space Evaluation Algorithms for Attribute Grammars. ACM Trans. Program. Lang. Syst. 9 (3): 408-440 (1987) Susan Horwitz , Alan J. Demers, Tim Teitelbaum : An Efficient General Iterative Algorithm for Dataflow Analysis. Acta Inf. 24 (6): 679-694 (1987) Hans-Juergen Boehm , Alan J. Demers: Implementing RUSSELL. SIGPLAN Symposium on Compiler Construction 1986 : 186-195 Van Nguyen , Alan J. Demers, David Gries , Susan S. Owicki : A Model and Temporal Proof System for Networks of Processes. Distributed Computing 1 (1): 7-25 (1986) Bowen Alpern , Alan J. Demers, Fred B. Schneider : Safety Without Stuttering. Inf. Process. Lett. 23 (4): 177-180 (1986) Van Nguyen , Alan J. Demers, David Gries , Susan S. Owicki : Behavior: A Temporal Approach to Process Modelling. Logic of Programs 1985 : 237-254 James E. Donahue , Alan J. Demers: Data Types Are Values. ACM Trans. Program. Lang. Syst. 7 (3): 426-445 (1985) Alan J. Demers, James E. Donahue : Making Variables Abstract: An Equational Theory for Russell. POPL 1983 : 59-72 Thomas W. Reps , Tim Teitelbaum , Alan J. Demers: Incremental Context-Dependent Analysis for Language-Based Editors. ACM Trans. Program. Lang. Syst. 5 (3): 449-477 (1983) Alan J. Demers, C. Keleman , Bernd Reusch : On Some Decidable Properties of Finite State Translations. Acta Inf. 17 : 349-364 (1982) Alan J. Demers, Thomas W. Reps , Tim Teitelbaum : Incremental Evaluation for Attribute Grammars with Application to Syntax-Directed Editors. POPL 1981 : 105-116 Alan J. Demers, James E. Donahue : Data Types, Parameters, and Type Checking. POPL 1980 : 12-23 Alan J. Demers, James E. Donahue : ``Type-Completeness'' as a Language Design Principle. POPL 1980 : 234-244 Lishing Liu , Alan J. Demers: An Algorithm for Testing Lossless Join Property in Relational Databases. Inf. Process. Lett. 11 (2): 73-76 (1980) Alan J. Demers, James E. Donahue , Glenn Skinner : Data Types as Values: Polymorphism, Type-Checking, Encapsulation. POPL 1978 : 23-30 Alan J. Demers: Generalized Left Corner Parsing. POPL 1977 : 170-182 Alan J. Demers, James E. Donahue , Ray T. Teitelbaum , John H. Williams : Encapsulated data types and generic. Design and Implementation of Programming Languages 1976 : 171-214 Alan J. Demers: Elimination of Single Productions and Merging Nonterminal Symbols of LR(1) Grammars. Comput. Lang. 1 (2): 105-119 (1976) Alan J. Demers: Skeletal LR Parsing FOCS 1974 : 185-198 David S. Johnson , Alan J. Demers, Jeffrey D. Ullman , M. R. Garey , Ronald L. Graham : Worst-Case Performance Bounds for Simple One-Dimensional Packing Algorithms. SIAM J. Comput. 3 (4): 299-325 (1974) 1 [ 16 ] 2 [ 27 ] 3 [ 32 ] 4 [ 43 ] 5 [ 28 ] 6 [ 18 ] [ 28 ] [ 29 ] [ 30 ] 7 [ 24 ] 8 [ 4 ] [ 6 ] [ 8 ] [ 9 ] [ 13 ] [ 14 ] 9 [ 1 ] 10 [ 42 ] 11 [ 1 ] 12 [ 22 ] [ 23 ] 13 [ 15 ] [ 17 ] 14 [ 43 ] 15 [ 22 ] [ 23 ] [ 25 ] [ 27 ] [ 36 ] 16 [ 28 ] 17 [ 19 ] 18 [ 22 ] [ 23 ] 19 [ 27 ] 20 [ 1 ] 21 [ 11 ] 22 [ 41 ] 23 [ 26 ] 24 [ 27 ] 25 [ 41 ] 26 [ 22 ] [ 23 ] 27 [ 43 ] 28 [ 7 ] 29 [ 21 ] 30 [ 15 ] [ 17 ] 31 [ 15 ] [ 17 ] 32 [ 21 ] 33 [ 34 ] [ 36 ] [ 38 ] [ 39 ] [ 40 ] 34 [ 42 ] 35 [ 43 ] 36 [ 10 ] [ 12 ] [ 20 ] 37 [ 11 ] 38 [ 16 ] 39 [ 23 ] [ 26 ] [ 28 ] [ 29 ] [ 32 ] [ 35 ] [ 37 ] 40 [ 6 ] 41 [ 34 ] [ 36 ] [ 38 ] [ 39 ] [ 40 ] 42 [ 23 ] 43 [ 23 ] 44 [ 4 ] 45 [ 10 ] [ 12 ] [ 19 ] 46 [ 23 ] [ 34 ] [ 36 ] [ 38 ] [ 39 ] [ 40 ] 47 [ 31 ] [ 34 ] [ 36 ] [ 38 ] [ 39 ] [ 40 ] 48 [ 42 ] 49 [ 30 ] 50 [ 1 ] 51 [ 25 ] [ 27 ] [ 28 ] [ 35 ] 52 [ 35 ] 53 [ 31 ] 54 [ 34 ] 55 [ 4 ] 56 [ 37 ] 57 [ 42 ] 58 [ 32 ]  ©2004 Association for Computing Machinery |
