Jennifer L. Welch
According to our database^{1},
Jennifer L. Welch
authored at least 141 papers
between 1986 and 2019.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis OtherLinks
Homepages:

at orcid.org
On csauthors.net:
Bibliography
2019
Emulating a Shared Register in a System That Never Stops Changing.
IEEE Trans. Parallel Distrib. Syst., 2019
Distributed Computing Column 73 SPAA 2018 Review.
SIGACT News, 2019
Implementing ♢P with Bounded Messages on a Network of ADD Channels.
Parallel Processing Letters, 2019
How Fast Reads Affect MultiValued Register Simulations.
Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing, 2019
2018
Distributed Computing Column 72: Annual Review 2018.
SIGACT News, 2018
Distributed Computing Column 71: Recent Algorithmic Advances in Population Protocols.
SIGACT News, 2018
Distributed Computing Column 70: Formalizing and Implementing Distributed Ledger Objects.
SIGACT News, 2018
Distributed Computing Column 69 Proving PACELC and Concurrent Computing Summer School.
SIGACT News, 2018
Brief Announcement: A Tight Lower Bound for Clock Synchronization in OddAry MToroids.
Proceedings of the 32nd International Symposium on Distributed Computing, 2018
Complexity of MultiValued Register Simulations: A Retrospective (Keynote).
Proceedings of the 22nd International Conference on Principles of Distributed Systems, 2018
2017
Distributed Computing Column 68.
SIGACT News, 2017
Distributed Computing Column 67: Review of 2016 BIRS CMO Workshop on Complexity and Analysis of Distributed Algorithms.
SIGACT News, 2017
Distributed Computing Column 66 Algorithmic Foundations of Programmable Matter Dagstuhl Seminar 16271.
SIGACT News, 2017
Distributed Computing Column 65: Automatic Synthesis of Distributed Protocols and SIROCCO 2016 Review.
SIGACT News, 2017
Relaxed Data Types as Consistency Conditions.
Proceedings of the Stabilization, Safety, and Security of Distributed Systems, 2017
Anomalies and Similarities Among Consensus Numbers of VariouslyRelaxed Queues.
Proceedings of the Networked Systems  5th International Conference, 2017
Bounded Reordering Allows Efficient Reliable Message Transmission.
Proceedings of the 2017 IEEE International Parallel and Distributed Processing Symposium, 2017
2016
Distributed Computing Column 64: Annual Review 2016.
SIGACT News, 2016
Distributed Computing Column 63: A Note on Faulttolerant Consensus in Directed Networks.
SIGACT News, 2016
Distributed Computing Column 62: Decidability in Parameterized Verification.
SIGACT News, 2016
Distributed Computing Column 61: Distributed Algorithmic Foundations of Dynamic Networks.
SIGACT News, 2016
2015
Time Complexity of Link Reversal Routing.
ACM Trans. Algorithms, 2015
Distributed Computing Column 60: Annual Review 2015.
SIGACT News, 2015
Distributed Computing Column 59: ResourceCompetitive Algorithms.
SIGACT News, 2015
Distributed Computing Column 58: Maurice Herlihy's 60th Birthday Celebration.
SIGACT News, 2015
Distributed Computing Column 57 Distributed Algorithms as Combinatorial Structures.
SIGACT News, 2015
Simulating a Shared Register in an Asynchronous System that Never Stops Changing  (Extended Abstract).
Proceedings of the Distributed Computing  29th International Symposium, 2015
Generic Proofs of Consensus Numbers for Abstract Data Types.
Proceedings of the 19th International Conference on Principles of Distributed Systems, 2015
2014
Distributed Computing Column 56 Annual Review 2014.
SIGACT News, 2014
Distributed computing column 55 WTTM 2013 review, and lower bounds for distributed quantum computing.
SIGACT News, 2014
Distributed computing column 54 transactional memory: models and algorithms.
SIGACT News, 2014
Distributed computing column 53: Dagstuhl seminar review: consistency in distributed systems.
SIGACT News, 2014
Improving Average Performance by Relaxing Distributed Data Structures.
Proceedings of the Distributed Computing  28th International Symposium, 2014
Improved Time Bounds for Linearizable Implementations of Abstract Data Types.
Proceedings of the 2014 IEEE 28th International Parallel and Distributed Processing Symposium, 2014
Stabilizing Dining with Failure Locality 1.
Proceedings of the Distributed Computing and Networking  15th International Conference, 2014
2013
Distributed computing column 52: annual review 2013.
SIGACT News, 2013
Link Reversal Routing with Binary Link Labels: Work Complexity.
SIAM J. Comput., 2013
A leader election algorithm for dynamic networks with causal clocks.
Distributed Computing, 2013
2012
WaitFree Stabilizing Dining Using Regular Registers.
Proceedings of the Principles of Distributed Systems, 16th International Conference, 2012
Stochastic Modeling of Dynamic Distributed Systems with Crash Recovery and Its Application to Atomic Registers.
Proceedings of the Principles of Distributed Systems, 16th International Conference, 2012
Neighbor Knowledge of Mobile Nodes in a Road Network.
Proceedings of the 2012 IEEE 32nd International Conference on Distributed Computing Systems, 2012
2011
Link Reversal Algorithms
Synthesis Lectures on Distributed Computing Theory, Morgan & Claypool Publishers, 2011
Multiwriter Consistency Conditions for Shared Memory Registers.
SIAM J. Comput., 2011
Quorumbased dynamic regular registers in systems with churn.
Proceedings of the Workshop on Theoretical Aspects on Dynamic Distributed Systems, 2011
Dynamic Regular Registers in Systems with Churn.
Proceedings of the Stabilization, Safety, and Security of Distributed Systems, 2011
Brief announcement: full reversal routing as a linear dynamical system.
Proceedings of the SPAA 2011: Proceedings of the 23rd Annual ACM Symposium on Parallelism in Algorithms and Architectures, 2011
Partial is Full.
Proceedings of the Structural Information and Communication Complexity, 2011
Full Reversal Routing as a Linear Dynamical System.
Proceedings of the Structural Information and Communication Complexity, 2011
Time bounds for shared objects in partially synchronous systems.
Proceedings of the 30th Annual ACM Symposium on Principles of Distributed Computing, 2011
Reliable Networks with Unreliable Sensors.
Proceedings of the Distributed Computing and Networking  12th International Conference, 2011
Optimal regional consecutive leader election in mobile adhoc networks.
Proceedings of the FOMC'11, 2011
2010
Scheduling Sensors by Tiling Lattices.
Parallel Processing Letters, 2010
A simple Byzantinefaulttolerant algorithm for a multiwriter regular register.
IJPEDS, 2010
Brief Announcement: Failure Detectors Encapsulate Fairness.
Proceedings of the Distributed Computing, 24th International Symposium, 2010
Corrigendum: weakest failure detector for waitfree dining under eventual weak exclusion.
Proceedings of the SPAA 2010: Proceedings of the 22nd Annual ACM Symposium on Parallelism in Algorithms and Architectures, 2010
Failure Detectors Encapsulate Fairness.
Proceedings of the Principles of Distributed Systems  14th International Conference, 2010
Finding available parking spaces made easy.
Proceedings of the DIALMPOMC Joint Workshop on Foundations of Mobile Computing, 2010
Reliable neighbor discovery for mobile ad hoc networks.
Proceedings of the DIALMPOMC Joint Workshop on Foundations of Mobile Computing, 2010
Regional consecutive leader election in mobile adhoc networks.
Proceedings of the DIALMPOMC Joint Workshop on Foundations of Mobile Computing, 2010
Brief Announcement: Regional Consecutive Leader Election in Mobile AdHoc Networks.
Proceedings of the Algorithms for Sensor Systems, 2010
2009
CrashQuiescent Failure Detection.
Proceedings of the Distributed Computing, 23rd International Symposium, 2009
The 2009 Edsger W. Dijkstra Prize in Distributed Computing.
Proceedings of the Distributed Computing, 23rd International Symposium, 2009
The weakest failure detector for waitfree dining under eventual weak exclusion.
Proceedings of the SPAA 2009: Proceedings of the 21st Annual ACM Symposium on Parallelism in Algorithms and Architectures, 2009
Routing without ordering.
Proceedings of the SPAA 2009: Proceedings of the 21st Annual ACM Symposium on Parallelism in Algorithms and Architectures, 2009
Crash fault detection in celerating environments.
Proceedings of the 23rd IEEE International Symposium on Parallel and Distributed Processing, 2009
Byzantine faulttolerant implementation of a multiwriter regular register.
Proceedings of the 23rd IEEE International Symposium on Parallel and Distributed Processing, 2009
An asynchronous leader election algorithm for dynamic networks.
Proceedings of the 23rd IEEE International Symposium on Parallel and Distributed Processing, 2009
A distributed pool architecture for genetic algorithms.
Proceedings of the IEEE Congress on Evolutionary Computation, 2009
Deterministic Collision Free Communication Despite Continuous Motion.
Proceedings of the Algorithmic Aspects of Wireless Sensor Networks, 2009
Link Reversal: How to Play Better to Work Less.
Proceedings of the Algorithmic Aspects of Wireless Sensor Networks, 2009
2008
Scheduling sensors by tilinglattices.
Proceedings of the TwentySeventh Annual ACM Symposium on Principles of Distributed Computing, 2008
A world of (Im) possibilities.
Proceedings of the TwentySeventh Annual ACM Symposium on Principles of Distributed Computing, 2008
Efficient and Robust Local Mutual Exclusion in Mobile Ad Hoc Networks.
Proceedings of the 28th IEEE International Conference on Distributed Computing Systems (ICDCS 2008), 2008
2006
MONET Special Issue on Foundations of Mobile Computing.
MONET, 2006
Maintaining Information About Nearby Processors in a Mobile Environment.
Proceedings of the Distributed Computing and Networking, 8th International Conference, 2006
2005
Distributed Token Circulation in Mobile Ad Hoc Networks.
IEEE Trans. Mob. Comput., 2005
Selfstabilizing dynamic mutual exclusion for mobile ad hoc networks.
J. Parallel Distrib. Comput., 2005
Randomized registers and iterative algorithms.
Distributed Computing, 2005
Autonomous virtual mobile nodes.
Proceedings of the SPAA 2005: Proceedings of the 17th Annual ACM Symposium on Parallelism in Algorithms and Architectures, 2005
Optimal Clock Synchronization Under Energy Constraints in Wireless AdHoc Networks.
Proceedings of the Principles of Distributed Systems, 9th International Conference, 2005
Locationbased broadcasting for dense mobile ad hoc networks.
Proceedings of the 8th International Symposium on Modeling Analysis and Simulation of Wireless and Mobile Systems, 2005
Autonomous virtual mobile nodes.
Proceedings of the DIALMPOMC Joint Workshop on Foundations of Mobile Computing, 2005
2004
Selfstabilizing clock synchronization in the presence of Byzantine faults.
J. ACM, 2004
Distributed reconfiguration of metamorphic robot chains.
Distributed Computing, 2004
Virtual Mobile Nodes for Mobile Ad Hoc Networks.
Proceedings of the Distributed Computing, 18th International Conference, 2004
Brief announcement: virtual mobile nodes for mobile ad hoc networks.
Proceedings of the TwentyThird Annual ACM Symposium on Principles of Distributed Computing, 2004
Accurate Multihop Clock Synchronization in Mobile Ad Hoc Networks.
Proceedings of the 33rd International Conference on Parallel Processing Workshops (ICPP 2004 Workshops), 2004
Distributed computing  fundamentals, simulations, and advanced topics (2. ed.).
Wiley series on parallel and distributed computing, Wiley, ISBN: 9780471453246, 2004
2003
The Impact of Timing Knowledge on the Session Problem.
SIAM J. Comput., 2003
Location tracking using quorums in mobile ad hoc networks.
Ad Hoc Networks, 2003
Multiwriter Consistency Conditions for Shared Memory Objects.
Proceedings of the Distributed Computing, 17th International Conference, 2003
GeoQuorums: Implementing Atomic Memory in Mobile Ad Hoc Networks.
Proceedings of the Distributed Computing, 17th International Conference, 2003
2002
Concurrent metamorphosis of hexagonal robot chains into simple connected configurations.
IEEE Trans. Robotics and Automation, 2002
Random Walk for SelfStabilizing Group Communication in AdHoc Networks.
Proceedings of the 21st Symposium on Reliable Distributed Systems (SRDS 2002), 2002
Random walk for selfstabilitzing group communication in ad hoc networks.
Proceedings of the TwentyFirst Annual ACM Symposium on Principles of Distributed Computing, 2002
Selfstabilizing mutual exclusion using tokens in mobile ad hoc networks.
Proceedings of the 6th International Workshop on Discrete Algorithms and Methods for Mobile Computing and Communications (DIALM 2002), 2002
2001
A Mutual Exclusion Algorithm for Ad Hoc Mobile Networks.
Wireless Networks, 2001
Closed form bounds for clock synchronization under simple uncertainty assumptions.
Inf. Process. Lett., 2001
Randomized shared queues.
Proceedings of the Twentieth Annual ACM Symposium on Principles of Distributed Computing, 2001
Randomized Shared Queues Applied to Distributed Optimization Algorithms.
Proceedings of the Algorithms and Computation, 12th International Symposium, 2001
Distributed Token Circulation on Mobile Ad Hoc Networks.
Proceedings of the 9th International Conference on Network Protocols (ICNP 2001), 2001
Applications of Probabilistic Quorums to Iterative Algorithms.
Proceedings of the 21st International Conference on Distributed Computing Systems (ICDCS 2001), 2001
2000
Onewrite algorithms for multivalued regular and atomic registers.
Acta Inf., 2000
Distributed reconfigurtion of metamorphic robot chains.
Proceedings of the Nineteenth Annual ACM Symposium on Principles of Distributed Computing, 2000
Specification, implementation and application of randomized regular registers (brief announcement).
Proceedings of the Nineteenth Annual ACM Symposium on Principles of Distributed Computing, 2000
Leader election algorithms for mobile ad hoc networks.
Proceedings of the 4th International Workshop on Discrete Algorithms and Methods for Mobile Computing and Communications (DIALM 2000), 2000
1998
Shared Memory Consistency Conditions for Nonsequential Execution: Definitions and Programming Strategies.
SIAM J. Comput., 1998
1997
Crash Resilient Communication in Dynamic Networks.
IEEE Trans. Computers, 1997
Time Bounds on Synchronization in a Periodic Distributed System.
Inf. Process. Lett., 1997
WaitFree Clock Synchronization.
Algorithmica, 1997
HazardFree Connection Release.
Proceedings of the International Conference on Parallel and Distributed Processing Techniques and Applications, 1997
1996
Selfstabilizing topology maintenance protocols for highspeed networks.
IEEE/ACM Trans. Netw., 1996
The Role of DataRaceFree Programs in Recoverable DSM (Abstract).
Proceedings of the Fifteenth Annual ACM Symposium on Principles of Distributed Computing, 1996
Implementation of Recoverable Distributed Shared Memory by Logging Writes.
Proceedings of the 16th International Conference on Distributed Computing Systems, 1996
1995
Using Adaptive Timeouts to Achieve AtMostOnce Message Delivery.
Distributed Computing, 1995
SelfStabilizing Clock Synchronization in the Presence of Byzantine Faults (Abstract).
Proceedings of the Fourteenth Annual ACM Symposium on Principles of Distributed Computing, 1995
On the Time Complexity of the Dining Philosophers Problem.
Proceedings of the International Conference on Parallel and Distributed Processing Techniques and Applications, 1995
Modified Tree Structure for Location Management in Mobile Environments.
Proceedings of the Proceedings IEEE INFOCOM '95, 1995
A Competitive Analysis for Retransmission Timeout.
Proceedings of the 15th International Conference on Distributed Computing Systems, Vancouver, British Columbia, Canada, May 30, 1995
Connection management without retaining information.
Proceedings of the 28th Annual Hawaii International Conference on System Sciences (HICSS28), 1995
1994
Sequential Consistency versus Linearizability.
ACM Trans. Comput. Syst., 1994
Bounds on the Costs of Multivalued Register Implementations.
SIAM J. Comput., 1994
1993
Modular Cosntruction of an Efficient 1Bit Byzantine Agreement Protocol.
Mathematical Systems Theory, 1993
A Modular Drinking Philosophers Algorithm.
Distributed Computing, 1993
Crash Resilient Communication in Dynamic Networks (Preliminary Version).
Proceedings of the Distributed Algorithms, 7th International Workshop, 1993
Shared Memory Consistency Conditions for NonSequential Execution: Definitions and Programming Strategies.
Proceedings of the 5th Annual ACM Symposium on Parallel Algorithms and Architectures, 1993
WaitFree Clock Synchronization (Extended Abstract).
Proceedings of the Twelth Annual ACM Symposium on Principles of Distributed Computing, 1993
1992
Modular Construction of a Byzantine Agreement Protocol with Optimal Message Bit Complexity
Inf. Comput., March, 1992
The Impact of Time on the Session Problem.
Proceedings of the Eleventh Annual ACM Symposium on Principles of Distributed Computing, 1992
1991
Using Adaptive Timeouts to Achive AtMostOnce Message Delivery.
Proceedings of the Distributed Algorithms, 5th International Workshop, 1991
Upper and lower bounds for onewrite multivalued regular registers.
Proceedings of the Third IEEE Symposium on Parallel and Distributed Processing, 1991
Sequential Consistency Versus Linearizability (Extended Abstract).
Proceedings of the 3rd Annual ACM Symposium on Parallel Algorithms and Architectures, 1991
1990
Transaction Commit in a Realistic Timing Model.
Distributed Computing, 1990
Bounds on the Costs of Register Implementations.
Proceedings of the Distributed Algorithms, 4th International Workshop, 1990
1989
Efficient Distributed Recovery Using Message Logging.
Proceedings of the Eighth Annual ACM Symposium on Principles of Distributed Computing, 1989
Modular Construction of Nearly Optimal Byzantine Agreement Protocols.
Proceedings of the Eighth Annual ACM Symposium on Principles of Distributed Computing, 1989
1988
A New FaultTolerance Algorithm for Clock Synchronization
Inf. Comput., April, 1988
Topics in distributed computing: the impact of partial synchrony, and modular decomposition of algorithms.
PhD thesis, 1988
A LatticeStructured Proof of a Minimum Spanning.
Proceedings of the Seventh Annual ACM Symposium on Principles of Distributed Computing, 1988
1987
Simulating Synchronous Processors
Inf. Comput., August, 1987
1986
An Overview of Clock Synchronization.
Proceedings of the FaultTolerant Distributed Computing [Asilomar Workshop 1986], 1986