| 2012 |
| 136 | Optimal placement of energy storage in the grid. Subhonmesh Bose, Dennice F. Gayme, Ufuk Topcu, K. Mani Chandy. CDC 2012, 5605-5612. Web SearchBibTeXDownload |
| 135 | Towards a discipline of geospatial distributed event based systems. Annie H. Liu, Michael Olson, Julian J. Bunn, K. Mani Chandy. DEBS 2012, 95-106. Web SearchBibTeXDownload |
| 2011 |
| 134 | Optimal contract for wind power in day-ahead electricity markets. Desmond W. H. Cai, Sachin Adlakha, K. Mani Chandy. CDC-ECE 2011, 1521-1527. Web SearchBibTeXDownload |
| 133 | Event processing grand challenges. Pedro Bizarro, K. Mani Chandy, Nenad Stojanovic. DEBS 2011, 361-362. Web SearchBibTeXDownload |
| 132 | Rapid detection of rare geospatial events: earthquake warning applications. Michael Olson, Annie H. Liu, Matthew Faulkner, K. Mani Chandy. DEBS 2011, 89-100. Web SearchBibTeXDownload |
| 131 | Verification of distributed systems with local-global predicates. K. Mani Chandy, Brian Go, Sayan Mitra, Concetta Pilotto, Jerome White. Formal Asp. Comput. (23): 649-679 (2011). Web SearchBibTeXDownload |
| 130 | Performance Issues in Cloud Computing for Cyber-physical Applications. Michael Olson, K. Mani Chandy. IEEE CLOUD 2011, 742-743. Web SearchBibTeXDownload |
| 129 | Sensor networks for the detection and tracking of radiation and other threats in cities. Annie H. Liu, Julian J. Bunn, K. Mani Chandy. IPSN 2011, 1-12. Web SearchBibTeXDownload |
| 128 | Demo abstract, the next big one: Detecting earthquakes and other rare events from community-based sensors. Matthew Faulkner, Michael Olson, Rishi Chandy, Jonathan Krause, K. Mani Chandy, Andreas Krause. IPSN 2011, 121-122. Web SearchBibTeXDownload |
| 127 | The next big one: Detecting earthquakes and other rare events from community-based sensors. Matthew Faulkner, Michael Olson, Rishi Chandy, Jonathan Krause, K. Mani Chandy, Andreas Krause. IPSN 2011, 13-24. Web SearchBibTeXDownload |
| 2010 |
| 126 | Consensus on asynchronous communication networks in presence of external input. Concetta Pilotto, K. Mani Chandy, Jerome White. CDC 2010, 3838-3844. Web SearchBibTeXDownload |
| 125 | A simple optimal power flow model with energy storage. K. Mani Chandy, Steven H. Low, Ufuk Topcu, Huan Xu. CDC 2010, 1051-1057. Web SearchBibTeXDownload |
| 124 | A Web That Senses and Responds. K. Mani Chandy. From Active Data Management to Event-Based Systems and More 2010, 78-84. Web SearchBibTeXDownload |
| 123 | Internet Predictions. Vinton G. Cerf, K. Mani Chandy, R. Michael Young, Larry Smarr, Andrew M. Odlyzko, David D. Clark, Viviane Reding, Toru Ishida, Sharad Sharma, Unknown, Urs Hölzle, Luiz André Barroso, Geoff Mulligan, Adrian Hooke, Chip Elliott. IEEE Internet Computing (14): 12-42 (2010). Web SearchBibTeXDownload |
| 2009 |
| 122 | Specifications and Architectures of Federated Event-Driven Systems. K. Mani Chandy, Michael Olson. AAAI Spring Symposium: Intelligent Event Processing 2009, 21-26. Web SearchBibTeXDownload |
| 121 | Event Driven Architecture. K. Mani Chandy. Encyclopedia of Database Systems 2009, 1040-1044. Cited by 8Web SearchBibTeXDownload |
| 2008 |
| 120 | Convergence Verification: From Shared Memory to Partially Synchronous Systems. K. Mani Chandy, Sayan Mitra, Concetta Pilotto. FORMATS 2008, 218-232. Cited by 7Web SearchBibTeXDownload |
| 119 | A Formalized Theory for Verifying Stability and Convergence of Automata in PVS. Sayan Mitra, K. Mani Chandy. TPHOLs 2008, 230-245. Cited by 4Web SearchBibTeXDownload |
| 2007 |
| 118 | Towards a theory of events. K. Mani Chandy, Michel Charpentier, Agostino Capponi. DEBS 2007, 180-187. Cited by 6Web SearchBibTeXDownload |
| 117 | 07191 Abstracts Collection -- Event Processing. Opher Etzion, K. Mani Chandy, Rainer von Ammon. Event Processing 2007. Web SearchBibTeXDownload |
| 116 | 07191 Summary -- Event Processing. K. Mani Chandy, Opher Etzion, Rainer von Ammon, Peter Niblett. Event Processing 2007. Web SearchBibTeXDownload |
| 115 | Self-Similar Algorithms for Dynamic Distributed Systems. K. Mani Chandy, Michel Charpentier. ICDCS 2007, 67. Cited by 7Web SearchBibTeXDownload |
| 114 | Event processing using database technology. K. Mani Chandy, Dieter Gawlick. SIGMOD Conference 2007, 1169-1170. Cited by 1Web SearchBibTeXDownload |
| 2006 |
| 113 | Enterprise Computing Systems as Information Factories. K. Mani Chandy, Lu Tian, Daniel M. Zimmerman. EDOC 2006, 427-432. Cited by 1Web SearchBibTeXDownload |
| 112 | Resource Allocation in Streaming Environments. Lu Tian, K. Mani Chandy. GRID 2006, 270-277. Cited by 6Web SearchBibTeXDownload |
| 111 | Snapshot Processing in Streaming Environments. Daniel M. Zimmerman, K. Mani Chandy. GRID 2006, 319-320. Cited by 1Web SearchBibTeXDownload |
| 110 | Event-Driven Architectures and Complex Event Processing. Opher Etzion, K. Mani Chandy, Rainer von Ammon, W. Roy Schulte. IEEE SCC 2006. Web SearchBibTeXDownload |
| 109 | Control-Based Scheduling in a Distributed Stream Processing System. Andrey Khorlin, K. Mani Chandy. SCW 2006, 55-64. Web SearchBibTeXDownload |
| 2005 |
| 108 | Sense and Respond Systems. K. Mani Chandy. Int. CMG Conference 2005, 59-66. Web SearchBibTeX |
| 107 | An Event Processing Language (EPL) for Building Sense and Respond Applications. Elli Albek, Eric Bax, Greg Billock, K. Mani Chandy, Ian Swett. IPDPS 2005. Cited by 7Web SearchBibTeXDownload |
| 106 | A Parallel Algorithm for Correlating Event Streams. Daniel M. Zimmerman, K. Mani Chandy. IPDPS 2005. Cited by 9Web SearchBibTeXDownload |
| 2004 |
| 105 | Specification transformers: a predicate transformer approach to composition. Michel Charpentier, K. Mani Chandy. Acta Inf. (40): 265-301 (2004). Cited by 6Web SearchBibTeXDownload |
| 104 | Event Servers for Crisis Management. K. Mani Chandy. HiPC 2004, 3. Cited by 9Web SearchBibTeXDownload |
| 2003 |
| 103 | Service Composition Issues for Distributed Business Processes. Roman Ginis, K. Mani Chandy. ICWS 2003, 27-33. Cited by 7Web SearchBibTeX |
| 2002 |
| 102 | An Experiment in Program Composition and Proof. K. Mani Chandy, Michel Charpentier. Formal Methods in System Design (20): 7-21 (2002). Cited by 19Web SearchBibTeXDownload |
| 101 | IC Online: Ubiquitous Computing: The Future of Development?. K. Mani Chandy, Axel Fuchs, Bill Janssen, Deepak Mulchandani, Mark Weiser. IEEE Distributed Systems Online (3) (2002). Web SearchBibTeXDownload |
| 2001 |
| 100 | What Are the Top Ten Most Influential Parallel and Distributed Processing Concepts of the Past Millenium?. Mitchell D. Theys, Shoukat Ali, Howard Jay Siegel, K. Mani Chandy, Kai Hwang, Ken Kennedy, Lui Sha, Kang G. Shin, Marc Snir, Larry Snyder, Thomas L. Sterling. J. Parallel Distrib. Comput. (61): 1827-1841 (2001). Web SearchBibTeXDownload |
| 2000 |
| 99 | Micro-option: a method for optimal selection and atomic reservation of distributed resources in a free market environment. Roman Ginis, K. Mani Chandy. ACM Conference on Electronic Commerce 2000, 207-214. Cited by 7Web SearchBibTeXDownload |
| 98 | Reasoning about Composition Using Property Transformers and Their Conjugates. Michel Charpentier, K. Mani Chandy. IFIP TCS 2000, 580-595. Cited by 5Web SearchBibTeXDownload |
| 97 | Monotonic Counters: A New Mechanism for Thread Synchronization. John Thornley, K. Mani Chandy. IPDPS 2000, 573-582. Cited by 6Web SearchBibTeXDownload |
| 96 | Theorems about Composition. Michel Charpentier, K. Mani Chandy. MPC 2000, 167-186. Cited by 16Web SearchBibTeXDownload |
| 1999 |
| 95 | Parallel Program Archetypes. Berna L. Massingill, K. Mani Chandy. IPPS/SPDP 1999, 290-296. Cited by 12Web SearchBibTeXDownload |
| 94 | Examples of Program Composition Illustrating the Use of Universal Properties. Michel Charpentier, K. Mani Chandy. IPPS/SPDP Workshops 1999, 1215-1227. Cited by 16Web SearchBibTeXDownload |
| 93 | Towards a Compositional Approach to the Design and Verification of Distributed Systems. Michel Charpentier, K. Mani Chandy. World Congress on Formal Methods 1999, 570-589. Cited by 34Web SearchBibTeXDownload |
| 1998 |
| 92 | Using announce-listen with global events to develop distributed control systems. K. Mani Chandy, Adam Rifkin, Eve M. Schooler. Concurrency - Practice and Experience (10): 1021-1027 (1998). Cited by 29Web SearchBibTeXDownload |
| 91 | A Cottage Industry of Software Publishing: Implications for Theories of Composition. K. Mani Chandy, Paolo A. G. Sivilotti, Joseph Kiniry. IPPS/SPDP Workshops 1998, 890-899. Cited by 4Web SearchBibTeXDownload |
| 90 | A Framework for Structured Distributed Object Computing. K. Mani Chandy, Joseph Kiniry, Adam Rifkin, Daniel M. Zimmerman. Parallel Computing (24): 1901-1922 (1998). Cited by 26Web SearchBibTeXDownload |
| 1997 |
| 89 | Systematic Composition of Distributed Objects: Processes and Sessions. K. Mani Chandy, Adam Rifkin. Comput. J. (40): 465-478 (1997). Cited by 2Web SearchBibTeXDownload |
| 88 | Systematic Composition of Objects in Distributed Internet Applications: Processes and Sessions. K. Mani Chandy, Adam Rifkin. HICSS (1) 1997, 395-404. Cited by 33Web SearchBibTeXDownload |
| 87 | A General Resource Reservation Framework for Scientific Computing. Ravi Ramamoorthi, Adam Rifkin, Boris Dimitrov, K. Mani Chandy. ISCOPE 1997, 283-290. Cited by 26Web SearchBibTeXDownload |
| 86 | Webs of Archived Distributed Computations for Asynchronous Collaboration. K. Mani Chandy, Joseph Kiniry, Adam Rifkin, Daniel M. Zimmerman. The Journal of Supercomputing (11): 101-118 (1997). Cited by 8Web SearchBibTeXDownload |
| 1996 |
| 85 | Designing Directories in Distributed Systems: A Systematic Framework. K. Mani Chandy, Eve M. Schooler. HPDC 1996, 318. Cited by 14Web SearchBibTeXDownload |
| 84 | A World-Wide Distributed System Using Java and the Internet. K. Mani Chandy, Adam Rifkin, Paolo A. G. Sivilotti, J. Mandelson, M. Richardson, W. Tanaka, L. Weisman. HPDC 1996, 11-18. Cited by 102Web SearchBibTeXDownload |
| 1995 |
| 83 | Integrating Task and Data Parallelism in UC. Maneesh Dhagat, Rajive Bagrodia, K. Mani Chandy. ICPP (2) 1995, 29-36. Web SearchBibTeX |
| 82 | A Notation for Deterministic Cooperating Processes. K. Mani Chandy, Ian T. Foster. IEEE Trans. Parallel Distrib. Syst. (6): 863-871 (1995). Cited by 16Web SearchBibTeXDownload |
| 81 | Integrating task and data parallelism with the group communication archetype. K. Mani Chandy, Rajit Manohar, Berna L. Massingill, Daniel I. Meiron. IPPS 1995, 724-733. Cited by 13Web SearchBibTeXDownload |
| 80 | Fortran M: A Language for Modular Parallel Programming. Ian T. Foster, K. Mani Chandy. J. Parallel Distrib. Comput. (26): 24-35 (1995). Cited by 243Web SearchBibTeXDownload |
| 79 | UC: A Set-Based Language for Data-Parallel Programming. Rajive Bagrodia, K. Mani Chandy, Maneesh Dhagat. J. Parallel Distrib. Comput. (28): 186-201 (1995). Web SearchBibTeXDownload |
| 78 | Predicate Transformers for Reasoning about Concurrent Computation. K. Mani Chandy, Beverly A. Sanders. Sci. Comput. Program. (24): 129-148 (1995). Cited by 41Web SearchBibTeXDownload |
| 1994 |
| 77 | Properties of Concurrent Programs. K. Mani Chandy. Formal Asp. Comput. (6): 607-619 (1994). Cited by 12Web SearchBibTeXDownload |
| 1993 |
| 76 | Concurrency and Discrete-Event Simulation. K. Mani Chandy, Rajive Bagrodia, Wen-Toh Liao. ACM Trans. Model. Comput. Simul. (3): 284-285 (1993). Web SearchBibTeX |
| 75 | Writing Correct Parallel Programs. K. Mani Chandy. IPPS 1993, 630-634. Cited by 1Web SearchBibTeX |
| 74 | Parallel Language Constructs for Paradigm Integration and Deterministic Computations. K. Mani Chandy, Ian T. Foster. PARCO 1993, 3-12. Web SearchBibTeX |
| 73 | Deterministic Parallel FORTRAN. K. Mani Chandy, Ian T. Foster. PPSC 1993, 798-805. Cited by 2Web SearchBibTeX |
| 1992 |
| 72 | The Derivation of Compositional Programs. K. Mani Chandy, Carl Kesselman. JICSLP 1992, 3-17. Cited by 17Web SearchBibTeX |
| 71 | Compositional C++: Compositional Parallel Programming. K. Mani Chandy, Carl Kesselman. LCPC 1992, 124-144. Cited by 156Web SearchBibTeXDownload |
| 1991 |
| 70 | A Unifying Framework for Distributed Simulation. Rajive Bagrodia, K. Mani Chandy, Wen-Toh Liao. ACM Trans. Model. Comput. Simul. (1): 348-385 (1991). Cited by 57Web SearchBibTeXDownload |
| 69 | Parallel Programming in 2001. K. Mani Chandy, Carl Kesselman. IEEE Software (8): 11-20 (1991). Cited by 19Web SearchBibTeXDownload |
| 1990 |
| 68 | UC: a language for the connection machine. Rajive Bagrodia, K. Mani Chandy, E. Kwan. SC 1990, 525-534. Cited by 13Web SearchBibTeXDownload |
| 67 | Reasoning About Continuous Systems. K. Mani Chandy. Sci. Comput. Program. (14): 117-132 (1990). Cited by 10Web SearchBibTeXDownload |
| 1989 |
| 66 | Mathematics of Program Construction Applied to Analog Neural Networks. K. Mani Chandy. MPC 1989, 21-35. Cited by 1Web SearchBibTeX |
| 65 | The composition of concurrent programs. K. Mani Chandy. SC 1989, 557-561. Web SearchBibTeXDownload |
| 1988 |
| 64 | Programming the Connection Machine. Rajive Bagrodia, K. Mani Chandy. ICCL 1988, 50-57. Cited by 3Web SearchBibTeXDownload |
| 63 | Programming parallel computers. K. Mani Chandy. ICCL 1988, 314-321. Cited by 5Web SearchBibTeXDownload |
| 62 | Performance Management of Parallel Computers. K. Mani Chandy. Int. CMG Conference 1988, 1076-1078. Web SearchBibTeX |
| 1987 |
| 61 | Parallelism and Programming: A Perspective. K. Mani Chandy, Jayadev Misra. FSTTCS 1987, 173-194. Cited by 2Web SearchBibTeXDownload |
| 60 | A Message-Based Approach to Discrete-Event Simulation. Rajive Bagrodia, K. Mani Chandy, Jayadev Misra. IEEE Trans. Software Eng. (13): 654-665 (1987). Cited by 51Web SearchBibTeXDownload |
| 59 | Representing Faulty Distributed Systems as Nondeterministic Sequential Systems. K. Mani Chandy. SRDS 1987, 171-173. Web SearchBibTeX |
| 1986 |
| 58 | An Example of Stepwise Refinement of Distributed Programs: Quiescence Detection. K. Mani Chandy, Jayadev Misra. ACM Trans. Program. Lang. Syst. (8): 326-343 (1986). Web SearchBibTeXDownload |
| 57 | Systolic Algorithms as Programs. K. Mani Chandy, Jayadev Misra. Distributed Computing (1): 177-183 (1986). Cited by 18Web SearchBibTeXDownload |
| 56 | How Processes Learn. K. Mani Chandy, Jayadev Misra. Distributed Computing (1): 40-52 (1986). Cited by 246Web SearchBibTeXDownload |
| 1985 |
| 55 | Distributed Snapshots: Determining Global States of Distributed Systems. K. Mani Chandy, Leslie Lamport. ACM Trans. Comput. Syst. (3): 63-75 (1985). Cited by 2015Web SearchBibTeXDownload |
| 54 | A Micro-Kernel for Distributed Applications. Rajive Bagrodia, K. Mani Chandy. ICDCS 1985, 140-149. Web SearchBibTeX |
| 53 | On Distributed Search. Ted Herman, K. Mani Chandy. Inf. Process. Lett. (21): 129-133 (1985). Web SearchBibTeXDownload |
| 52 | HSS: A Tool for Evaluating the Performance of Office Systems. Richard L. Gimarc, K. Mani Chandy. Int. CMG Conference 1985, 30-41. Web SearchBibTeX |
| 51 | Concurrent Programming For The Masses (PODC 1984 Invited Address). K. Mani Chandy. PODC 1985, 1-12. Web SearchBibTeXDownload |
| 50 | How Processes Learn. K. Mani Chandy, Jayadev Misra. PODC 1985, 204-214. Cited by 246Web SearchBibTeXDownload |
| 1984 |
| 49 | The MVA Priority Approximation. Raymond M. Bryant, Anthony E. Krzesinski, M. Seetha Lakshmi, K. Mani Chandy. ACM Trans. Comput. Syst. (2): 335-359 (1984). Cited by 52Web SearchBibTeXDownload |
| 48 | The Drinking Philosopher's Problem. K. Mani Chandy, Jayadev Misra. ACM Trans. Program. Lang. Syst. (6): 632-646 (1984). Web SearchBibTeXDownload |
| 1983 |
| 47 | Distributed Deadlock Detection. Gabriel Bracha, Jayadev Misra, Laura M. Haas. ACM Trans. Comput. Syst. (1): 144-156 (1983). Cited by 319Web SearchBibTeXDownload |
| 46 | A Characterization of Product-Form Queuing Networks. K. Mani Chandy, Alain J. Martin. J. ACM (30): 286-299 (1983). Cited by 94Web SearchBibTeXDownload |
| 45 | Performance models of token ring local area networks. Robert Berry, K. Mani Chandy. SIGMETRICS 1983, 266-274. Web SearchBibTeXDownload |
| 1982 |
| 44 | A Distributed Graph Algorithm: Knot Detection. Jayadev Misra, K. Mani Chandy. ACM Trans. Program. Lang. Syst. (4): 678-686 (1982). Cited by 52Web SearchBibTeXDownload |
| 43 | Termination Detection of Diffusing Computations in Communicating Sequential Processes. Jayadev Misra, K. Mani Chandy. ACM Trans. Program. Lang. Syst. (4): 37-43 (1982). Cited by 76Web SearchBibTeXDownload |
| 42 | The use of performance models in systematic design. K. Mani Chandy, Jayadev Misra, R. Berry, Doug Neuse. AFIPS National Computer Conference 1982, 251-256. Cited by 6Web SearchBibTeXDownload |
| 41 | Distributed Computation on Graphs: Shortest Path Algorithms. K. Mani Chandy, Jayadev Misra. Commun. ACM (25): 833-837 (1982). Cited by 131Web SearchBibTeXDownload |
| 40 | Linearzer: A Heuristic Algorithm for Queueing Network Models of Computing Systems. K. Mani Chandy, Doug Neuse. Commun. ACM (25): 126-134 (1982). Cited by 167Web SearchBibTeXDownload |
| 39 | A Distributed Algorithm for Detecting Resource Deadlocks in Distributed Systems. K. Mani Chandy, Jayadev Misra. PODC 1982, 157-164. Cited by 101Web SearchBibTeXDownload |
| 38 | Proving Safety and Liveness of Communicating Processes with Examples. Jayadev Misra, K. Mani Chandy, Todd Smith. PODC 1982, 201-208. Cited by 49Web SearchBibTeXDownload |
| 37 | HAM: The Heuristic Aggregation Method. Doug Neuse, K. Mani Chandy. SIGMETRICS Performance Evaluation Review (11): 195-212 (1982). Cited by 14Web SearchBibTeXDownload |
| 1981 |
| 36 | Asynchronous Distributed Simulation via a Sequence of Parallel Computations. K. Mani Chandy, Jayadev Misra. Commun. ACM (24): 198-206 (1981). Cited by 658Web SearchBibTeXDownload |
| 35 | Proofs of Networks of Processes. Jayadev Misra, K. Mani Chandy. IEEE Trans. Software Eng. (7): 417-426 (1981). Cited by 373Web SearchBibTeXDownload |
| 34 | A Computer Modeling System Based on a User-Extensible Modeling Library. Doug Neuse, K. Mani Chandy, Jayadev Misra, R. Berry. Int. CMG Conference 1981, 127-129. Web SearchBibTeX |
| 33 | Fast accurate heuristic algorithms for queueing network models of computing systems. K. Mani Chandy, Doug Neuse. Perform. Eval. (1): 96 (1981). Web SearchBibTeXDownload |
| 32 | SCAT: A Heuristic Algorithm for Queueing Network Models of Computing Systems. Doug Neuse, K. Mani Chandy. SIGMETRICS 1981, 59-79. Cited by 20Web SearchBibTeX |
| 1980 |
| 31 | Computational Algorithms for Product Form Queueing Networks. K. Mani Chandy, Charles H. Sauer. Commun. ACM (23): 573-583 (1980). Cited by 81Web SearchBibTeXDownload |
| 1979 |
| 30 | The Impact of Distributions and Disciplines on Multiple Processor Systems. Charles H. Sauer, K. Mani Chandy. Commun. ACM (22): 25-34 (1979). Cited by 15Web SearchBibTeXDownload |
| 29 | Distributed Simulation of Networks. K. Mani Chandy, Victor Holmes, Jayadev Misra. Computer Networks (3): 105-113 (1979). Cited by 54Web SearchBibTeXDownload |
| 28 | On the Design of Elementary Distributed Systems. Randolph T. Yeh, K. Mani Chandy. Computer Networks (3): 24-35 (1979). Web SearchBibTeXDownload |
| 27 | Distributed Simulation: A Case Study in Design and Verification of Distributed Programs. K. Mani Chandy, Jayadev Misra. IEEE Trans. Software Eng. (5): 440-452 (1979). Cited by 774Web SearchBibTeXDownload |
| 26 | Deadlock Absence Proofs for Networks of Communicating Processes. K. Mani Chandy, Jayadev Misra. Inf. Process. Lett. (9): 185-189 (1979). Cited by 31Web SearchBibTeXDownload |
| 25 | A Modeling Approach and Design Tool for Pipelined Central Processors. Tilak Agerwala, K. Mani Chandy, D. E. Lang. ISCA 1979, 122-129. Cited by 8Web SearchBibTeXDownload |
| 1978 |
| 24 | Approximate Methods for Analyzing Queueing Network Models of Computing Systems. K. Mani Chandy, Charles H. Sauer. ACM Comput. Surv. (10): 281-317 (1978). Cited by 147Web SearchBibTeXDownload |
| 23 | On the Design of Elementary Distributed Systems. Randolph T. Yeh, K. Mani Chandy. Berkeley Workshop 1978, 289-321. Web SearchBibTeX |
| 22 | Models for Parallel Processing Within Programs: Application to CPU: I/O and I/O: I/O Overlap. Donald F. Towsley, K. Mani Chandy, James C. Browne. Commun. ACM (21): 821-831 (1978). Cited by 14Web SearchBibTeXDownload |
| 1977 |
| 21 | Memory Management and Response Time. R. M. Brown, James C. Browne, K. Mani Chandy. Commun. ACM (20): 153-165 (1977). Web SearchBibTeXDownload |
| 20 | Selecting Capacities in Computer Communication Systems. K. Mani Chandy, J. Hogarth, Charles H. Sauer. IEEE Trans. Software Eng. (3): 290-295 (1977). Cited by 16Web SearchBibTeXDownload |
| 19 | Computational Complexity of Network Design Algorithms. Lawrence Van Sickle, K. Mani Chandy. IFIP Congress 1977, 235-239. Web SearchBibTeX |
| 18 | Product Form and Local Balance in Queueing Networks. K. Mani Chandy, John H. Howard Jr., Donald F. Towsley. J. ACM (24): 250-263 (1977). Cited by 159Web SearchBibTeXDownload |
| 17 | Models of Distributed Systems. K. Mani Chandy. VLDB 1977, 105-120. Cited by 19Web SearchBibTeX |
| 1976 |
| 16 | Bayesian Models of Design Based on Intuition. K. Mani Chandy. ICSE 1976, 281-285. Cited by 1Web SearchBibTeXDownload |
| 15 | Product Form and Local Balance in Queueing Networks. K. Mani Chandy, John H. Howard Jr., Donald F. Towsley. Performance 1976, 89-101. Cited by 159Web SearchBibTeX |
| 1975 |
| 14 | Approximate Analysis of General Queuing Networks. K. Mani Chandy, Ulrich Herzog, Lin S. Woo. IBM Journal of Research and Development (19): 43-49 (1975). Cited by 115Web SearchBibTeXDownload |
| 13 | Parametric Analysis of Queuing Networks. K. Mani Chandy, Ulrich Herzog, Lin S. Woo. IBM Journal of Research and Development (19): 36-42 (1975). Cited by 279Web SearchBibTeXDownload |
| 12 | Approximate Analysis of Central Server Models. Charles H. Sauer, K. Mani Chandy. IBM Journal of Research and Development (19): 301-313 (1975). Cited by 61Web SearchBibTeXDownload |
| 11 | Solution of Queuing Problems by a Recursive Technique. Ulrich Herzog, Lin S. Woo, K. Mani Chandy. IBM Journal of Research and Development (19): 295-300 (1975). Cited by 64Web SearchBibTeXDownload |
| 10 | Analytic Models for Rollback and Recovery Strategies in Data Base Systems. K. Mani Chandy, James C. Browne, Charles W. Dissly, Werner R. Uhrig. IEEE Trans. Software Eng. (1): 100-110 (1975). Web SearchBibTeXDownload |
| 9 | Open, Closed, and Mixed Networks of Queues with Different Classes of Customers. Forest Baskett, K. Mani Chandy, Richard R. Muntz, Fernando G. Palacios. J. ACM (22): 248-260 (1975). Cited by 1600Web SearchBibTeXDownload |
| 8 | Scheduling Partially Ordered Tasks with Probabilistic Execution Times. K. Mani Chandy, P. F. Reynolds. SOSP 1975, 169-177. Cited by 30Web SearchBibTeX |
| 1974 |
| 7 | A Comparison of List Schedules for Parallel Processing Systems. Thomas L. Adam, K. Mani Chandy, J. R. Dickson. Commun. ACM (17): 685-690 (1974). Cited by 451Web SearchBibTeXDownload |
| 6 | A Recognizer and Post-Recognizer for Optimizing Execution Times of Programs. P. F. Reynolds, K. Mani Chandy. Sagamore Computer Conference 1974, 203-204. Web SearchBibTeXDownload |
| 5 | Computer Models with Constrained Parallel Processors. Tom W. Keller, K. Mani Chandy. Sagamore Computer Conference 1974, 207-208. Cited by 3Web SearchBibTeXDownload |
| 1972 |
| 4 | A framework for hardware-software tradeoffs in the design of fault-tolerant computers. K. Mani Chandy, C. V. Ramamoorthy, A. Cowan. AFIPS Fall Joint Computing Conference (1) 1972, 55-63. Web SearchBibTeXDownload |
| 3 | Design automation and queueing networks: An interactive system for the evaluation of computer queueing models. K. Mani Chandy, Tom W. Keller, James C. Browne. DAC 1972, 357-367. Web SearchBibTeXDownload |
| 1970 |
| 2 | Optimization of Memory Hierarchies in Multiprogrammed Systems. C. V. Ramamoorthy, K. Mani Chandy. J. ACM (17): 426-445 (1970). Cited by 47Web SearchBibTeXDownload |
| 1968 |
| 1 | Optimization of Information Storage Systems. K. Mani Chandy, C. V. Ramamoorthy. Information and Control (13): 509-526 (1968). Cited by 6Web SearchBibTeXDownload |