am interested in distributed computing systems, especially loosely-coupled, heterogeneous and failure-prone ones. My research approach encompasses formal models, algorithm design and analysis, and lower bounds and impossibility proofs. I am interested in problems that arise in a wide variety of contexts, whose common thread is the difficulties that arise from concurrency and uncertainty, especially that due to asynchrony and/or failures. The problems I have studied generally arise in providing infrastructure services (or \"middleware\") that can be used by end-user distributed applications, as opposed to the applications themselves. In more theoretical language, I have focused on ways to simulate more powerful (or better-behaved) systems on top of less powerful (or more poorly-behaved) systems.
- Ph.D. in Computer Science, Massachusetts Institute of Technology - (Cambridge, Massachusetts, United States) 1988
- S.M. in Computer Science, Massachusetts Institute of Technology - (Cambridge, Massachusetts, United States) 1984
- B.A. in Liberal Arts (Honors Program) with concentration in Mathematics, The University of Texas at Austin - (Austin, Texas, United States) 1979
- Kumar, S., & Welch, J. L. (2019). Implementing â‹„P with Bounded Messages on a Network of ADD Channels. Parallel Processing Letters. 29(1), 1950002-1950002.
- Talmage, E., & Welch, J. L. (2018). Anomalies and similarities among consensus numbers of variously-relaxed queues. COMPUTING.
- Attiya, H., Chung, H. C., Ellen, F., Kumar, S., & Welch, J. L. (2018). Emulating a Shared Register in a System that Never Stops Changing. IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS.
- Wang, J., Talmage, E., Lee, H., & Welch, J. L. (2018). Improved time bounds for linearizable implementations of abstract data types. INFORMATION AND COMPUTATION.
- Talmage, E., & Welch, J. L. (2018). Relaxed data types as consistency conditions. Algorithms. 11(5),
- Chaudhuri, S., Frank, R., & Welch, J. L. (2019). Brief announcement: How fast reads affect multi-valued register simulations. 215-217.
- Frank, R., & Welch, J. L. (2018). Brief announcement: A tight lower bound for clock synchronization in odd-ary m-toroids. Leibniz International Proceedings in Informatics, LIPIcs. 121,
- Talmage, E., & Welch, J. L. (2017). Anomalies and similarities among consensus numbers of variously-relaxed queues. ADVANCED DATA MINING AND APPLICATIONS, PROCEEDINGS. 10299 LNCS, 191-205.
- Ortiz-Lopez, K. D., & Welch, J. L. (2017). Bounded Reordering Allows Efficient Reliable Message Transmission. Proceedings - 2016 IEEE 30th International Parallel and Distributed Processing Symposium, IPDPS 2016. 327-336.
- Talmage, E., & Welch, J. L. (2017). Relaxed data types as consistency conditions. ADVANCED DATA MINING AND APPLICATIONS, PROCEEDINGS. 10616 LNCS, 142-156.
- Pandey, Sanat Kumar (2015-08). Performance Comparison of Neighbor Discovery Protocols in Wireless Ad-Hoc Network. (Master's Thesis)
- Chung, Hyun-Chul (2013-12). Information Infrastructures in Distributed Environments: Algorithms for Mobile Networks and Resource Allocation. (Doctoral Dissertation)
- Viqar, Saira (2012-08). Communication Algorithms for Wireless Ad Hoc Networks. (Doctoral Dissertation)
- Wang, Jiaqi (2011-12). Time Bounds for Shared Objects in Partially Synchronous Systems. (Master's Thesis)
- Sastry, Srikanth (2011-05). A Prescription for Partial Synchrony. (Doctoral Dissertation)