James Aspnes - RankMe

176 papers A* 48A 13B 23C 5Journal 83Unranked 1

Year	Rank	Type	Title / Venue / Authors
2025	J	`jnl`	Computational Obfuscations and Random Oracles for Derandomizing Asynchronous Consensus. CoRR James Aspnes, Shlomi Dolev, Amit Hendin
2025	J	`jnl`	Privacy in population protocols with probabilistic scheduling. Theor. Comput. Sci. Talley Amir, James Aspnes
2025	J	`jnl`	Stochastic well-structured transition systems. CoRR James Aspnes
2025	J	`jnl`	The consensus number of a shift register equals its width. CoRR James Aspnes
2024	J	`jnl`	Special Issue on the 1st Symposium on Algorithmic Foundations of Dynamic Networks (SAND 2022). J. Comput. Syst. Sci. James Aspnes, Othon Michail
2024	J	`jnl`	Stably computable relations and predicates. CoRR James Aspnes
2023	A*	`conf`	Fast Convergence of k-Opinion Undecided State Dynamics in the Population Protocol Model. PODC Talley Amir, James Aspnes, Petra Berenbrink, Felix Biermeier, Christopher Hahn, Dominik Kaaser, John Lazarsfeld
2023	J	`jnl`	Fast Convergence of k-Opinion Undecided State Dynamics in the Population Protocol Model. CoRR Talley Amir, James Aspnes, Petra Berenbrink, Felix Biermeier, Christopher Hahn, Dominik Kaaser, John Lazarsfeld
2023	C	`conf`	Privacy in Population Protocols with Probabilistic Scheduling. SSS Talley Amir, James Aspnes
2023	J	`jnl`	Privacy in Population Protocols with Probabilistic Scheduling. CoRR Talley Amir, James Aspnes
2023	J	`jnl`	Why Extension-Based Proofs Fail. SIAM J. Comput. Dan Alistarh, James Aspnes, Faith Ellen, Rati Gelashvili, Leqi Zhu
2022	—	`ed.`	1st Symposium on Algorithmic Foundations of Dynamic Networks, SAND 2022, Virtual Conference, March 28-30, 2022 SAND James Aspnes, Othon Michail
2021	J	`jnl`	Clocked population protocols. J. Comput. Syst. Sci. James Aspnes
2021	J	`jnl`	Optimizing in the Dark: Learning Optimal Network Resource Reservation Through a Simple Request Interface. IEEE/ACM Trans. Netw. Qiao Xiang, Haitao Yu, James Aspnes, Franck Le, Chin Guok, Linghe Kong, Yang Richard Yang
2020	J	`jnl`	Approximate Majority With Catalytic Inputs. CoRR Talley Amir, James Aspnes, John Lazarsfeld
2020	B	`conf`	Approximate Majority with Catalytic Inputs. OPODIS Talley Amir, James Aspnes, John Lazarsfeld
2020	A*	`conf`	Brief Announcement: Why Extension-Based Proofs Fail. PODC Dan Alistarh, James Aspnes, Faith Ellen, Rati Gelashvili, Leqi Zhu
2020	A	`conf`	Message Complexity of Population Protocols. DISC Talley Amir, James Aspnes, David Doty, Mahsa Eftekhari, Eric E. Severson
2020	J	`jnl`	Message complexity of population protocols. CoRR Talley Amir, James Aspnes, David Doty, Mahsa Eftekhari H., Eric E. Severson
2020	J	`jnl`	Notes on Randomized Algorithms. CoRR James Aspnes
2020	J	`jnl`	Notes on Theory of Distributed Systems. CoRR James Aspnes
2019	A	`conf`	Consensus with Max Registers. DISC James Aspnes, Heyang Er
2019	A*	`conf`	Optimizing in the Dark: Learning an Optimal Solution through a Simple Request Interface. AAAI Qiao Xiang, Haitao Yu, James Aspnes, Franck Le, Linghe Kong, Yang Richard Yang
2019	A*	`conf`	Why extension-based proofs fail. STOC Dan Alistarh, James Aspnes, Faith Ellen, Rati Gelashvili, Leqi Zhu
2018	B	`ed.`	21st International Conference on Principles of Distributed Systems, OPODIS 2017, Lisbon, Portugal, December 18-20, 2017 OPODIS James Aspnes, Alysson Bessani, Pascal Felber, João Leitão
2018	A	`conf`	Allocate-On-Use Space Complexity of Shared-Memory Algorithms. DISC James Aspnes, Bernhard Haeupler, Alexander Tong, Philipp Woelfel
2018	J	`jnl`	Communication-efficient randomized consensus. Distributed Comput. Dan Alistarh, James Aspnes, Valerie King, Jared Saia
2018	J	`jnl`	Concurrent use of write-once memory. J. Parallel Distributed Comput. James Aspnes, Keren Censor-Hillel, Eitan Yaakobi
2018	J	`jnl`	Erratum: Limited-Use Atomic Snapshots with Polylogarithmic Step Complexity. J. ACM James Aspnes, Hagit Attiya, Keren Censor-Hillel, Faith Ellen
2018	A*	`conf`	Space-Optimal Majority in Population Protocols. SODA Dan Alistarh, James Aspnes, Rati Gelashvili
2018	A*	`conf`	The FuzzyLog: A Partially Ordered Shared Log. OSDI Joshua Lockerman, Jose M. Faleiro, Juno Kim, Soham Sankaran, Daniel J. Abadi, James Aspnes, Siddhartha Sen, Mahesh Balakrishnan
2018	A*	`conf`	Toward the First SDN Programming Capacity Theorem on Realizing High-Level Programs on Low-Level Datapaths. INFOCOM Christopher Leet, Xin Wang, Yang Richard Yang, James Aspnes
2018	J	`jnl`	Why Extension-Based Proofs Fail. CoRR Dan Alistarh, James Aspnes, Faith Ellen, Rati Gelashvili, Leqi Zhu
2017	A*	`conf`	Brief Announcement: Object Oriented Consensus. PODC Yehuda Afek, James Aspnes, Edo Cohen, Danny Vainstein
2017	A*	`conf`	Clocked Population Protocols. PODC James Aspnes
2017	J	`jnl`	Space-Optimal Majority in Population Protocols. CoRR Dan Alistarh, James Aspnes, Rati Gelashvili
2017	A*	`conf`	Time-Space Trade-offs in Population Protocols. SODA Dan Alistarh, James Aspnes, David Eisenstat, Rati Gelashvili, Ronald L. Rivest
2016	B	`conf`	Concurrent Use of Write-Once Memory. SIROCCO James Aspnes, Keren Censor-Hillel, Eitan Yaakobi
2016	A	`conf`	Depth of a Random Binary Search Tree with Concurrent Insertions. DISC James Aspnes, Eric Ruppert
2016	J	`jnl`	Lower Bounds for Restricted-Use Objects. SIAM J. Comput. James Aspnes, Keren Censor-Hillel, Hagit Attiya, Danny Hendler
2016	J	`jnl`	Special Section on the Forty-Fifth Annual ACM Symposium on the Theory of Computing (STOC 2013). SIAM J. Comput. James Aspnes, Yuval Ishai, Peter Bro Miltersen
2016	B	`conf`	Time and Space Optimal Counting in Population Protocols. OPODIS James Aspnes, Joffroy Beauquier, Janna Burman, Devan Sohier
2016	J	`jnl`	Time and Space Optimal Counting in Population Protocols. CoRR James Aspnes, Joffroy Beauquier, Janna Burman, Devan Sohier
2016	J	`jnl`	Time-Space Trade-offs in Population Protocols. CoRR Dan Alistarh, James Aspnes, David Eisenstat, Rati Gelashvili, Ronald L. Rivest
2015	B	`conf`	Counting with Population Protocols. NCA Yves Mocquard, Emmanuelle Anceaume, James Aspnes, Yann Busnel, Bruno Sericola
2015	J	`jnl`	Faster randomized consensus with an oblivious adversary. Distributed Comput. James Aspnes
2015	J	`jnl`	Limited-Use Atomic Snapshots with Polylogarithmic Step Complexity. J. ACM James Aspnes, Hagit Attiya, Keren Censor-Hillel, Faith Ellen
2015	J	`jnl`	Network construction with subgraph connectivity constraints. J. Comb. Optim. Dana Angluin, James Aspnes, Lev Reyzin
2015	J	`jnl`	Spreading Alerts Quietly and the Subgroup Escape Problem. J. Cryptol. James Aspnes, Zoë Diamadi, Aleksandr Yampolskiy, Kristian Gjøsteen, René Peralta
2014	A	`conf`	Communication-Efficient Randomized Consensus. DISC Dan Alistarh, James Aspnes, Valerie King, Jared Saia
2014	A*	`conf`	Dynamic Task Allocation in Asynchronous Shared Memory. SODA Dan Alistarh, James Aspnes, Michael A. Bender, Rati Gelashvili, Seth Gilbert
2014	J	`jnl`	Effective storage capacity of labeled graphs. Inf. Comput. Dana Angluin, James Aspnes, Rida A. Bazzi, Jiang Chen, David Eisenstat, Goran Konjevod
2014	J	`jnl`	Tight Bounds for Adopt-Commit Objects. Theory Comput. Syst. James Aspnes, Faith Ellen
2014	J	`jnl`	Tight Bounds for Asynchronous Renaming. J. ACM Dan Alistarh, James Aspnes, Keren Censor-Hillel, Seth Gilbert, Rachid Guerraoui
2013	A	`conf`	Atomic Snapshots in O(log3 n) Steps Using Randomized Helping. DISC James Aspnes, Keren Censor-Hillel
2013	J	`jnl`	Mutation systems. Int. J. Comput. Math. Dana Angluin, James Aspnes, Raonne Barbosa Vargas
2013	J	`jnl`	On the learnability of shuffle ideals. J. Mach. Learn. Res. Dana Angluin, James Aspnes, Sarah Eisenstat, Aryeh Kontorovich
2013	A*	`conf`	Randomized loose renaming in PODC Dan Alistarh, James Aspnes, George Giakkoupis, Philipp Woelfel
2012	J	`jnl`	A modular approach to shared-memory consensus, with applications to the probabilistic-write model. Distributed Comput. James Aspnes
2012	J	`jnl`	A one-bit swap object using test-and-sets and a max register CoRR James Aspnes
2012	A*	`conf`	Faster randomized consensus with an oblivious adversary. PODC James Aspnes
2012	A*	`conf`	Faster than optimal snapshots (for a while): preliminary version. PODC James Aspnes, Hagit Attiya, Keren Censor-Hillel, Faith Ellen
2012	J	`jnl`	Low-contention data structures. J. Parallel Distributed Comput. James Aspnes, David Eisenstat, Yitong Yin
2012	B	`conf`	Lower bounds for restricted-use objects: extended abstract. SPAA James Aspnes, Hagit Attiya, Keren Censor-Hillel, Danny Hendler
2012	B	`conf`	On the Learnability of Shuffle Ideals. ALT Dana Angluin, James Aspnes, Aryeh Kontorovich
2012	J	`jnl`	Polylogarithmic concurrent data structures from monotone circuits. J. ACM James Aspnes, Hagit Attiya, Keren Censor-Hillel
2012	J	`jnl`	Randomized load balancing by joining and splitting bins. Inf. Process. Lett. James Aspnes, Yitong Yin
2011	C	`conf`	Mutation Systems. LATA Dana Angluin, James Aspnes, Raonne Barbosa Vargas
2011	A*	`conf`	Optimal-time adaptive strong renaming, with applications to counting. PODC Dan Alistarh, James Aspnes, Keren Censor-Hillel, Seth Gilbert, Morteza Zadimoghaddam
2011	A	`conf`	Randomized Consensus in Expected O(n 2) Total Work Using Single-Writer Registers. DISC James Aspnes
2011	A	`conf`	Sub-logarithmic Test-and-Set against a Weak Adversary. DISC Dan Alistarh, James Aspnes
2011	A*	`conf`	The Complexity of Renaming. FOCS Dan Alistarh, James Aspnes, Seth Gilbert, Rachid Guerraoui
2011	B	`conf`	Tight bounds for anonymous adopt-commit objects. SPAA James Aspnes, Faith Ellen
2010	A*	`conf`	A modular approach to shared-memory consensus, with applications to the probabilistic-write model. PODC James Aspnes
2010	J	`jnl`	Approximate shared-memory counting despite a strong adversary. ACM Trans. Algorithms James Aspnes, Keren Censor
2010	J	`jnl`	Combining shared-coin algorithms. J. Parallel Distributed Comput. James Aspnes, Hagit Attiya, Keren Censor
2010	B	`conf`	Inferring Social Networks from Outbreaks. ALT Dana Angluin, James Aspnes, Lev Reyzin
2010	B	`conf`	Low-contention data structures. SPAA James Aspnes, David Eisenstat, Yitong Yin
2010	J	`jnl`	Optimally learning social networks with activations and suppressions. Theor. Comput. Sci. Dana Angluin, James Aspnes, Lev Reyzin
2010	J	`jnl`	Slightly smaller splitter networks CoRR James Aspnes
2010	C	`conf`	Storage Capacity of Labeled Graphs. SSS Dana Angluin, James Aspnes, Rida A. Bazzi, Jiang Chen, David Eisenstat, Goran Konjevod
2010	C	`conf`	k ALGOSENSORS James Aspnes, Eric Blais, Murat Demirbas, Ryan O'Donnell, Atri Rudra, Steve Uurtamo
2009	—	`ch.`	An Introduction to Population Protocols. Middleware for Network Eccentric and Mobile Applications James Aspnes, Eric Ruppert
2009	A*	`conf`	Approximate shared-memory counting despite a strong adversary. SODA James Aspnes, Keren Censor
2009	J	`jnl`	Learning Acyclic Probabilistic Circuits Using Test Paths. J. Mach. Learn. Res. Dana Angluin, James Aspnes, Jiang Chen, David Eisenstat, Lev Reyzin
2009	J	`jnl`	Learning a circuit by injecting values. J. Comput. Syst. Sci. Dana Angluin, James Aspnes, Jiang Chen, Yinghua Wu
2009	A*	`conf`	Max registers, counters, and monotone circuits. PODC James Aspnes, Hagit Attiya, Keren Censor
2009	J	`jnl`	The expansion and mixing time of skip graphs with applications. Distributed Comput. James Aspnes, Udi Wieder
2008	J	`jnl`	A simple population protocol for fast robust approximate majority. Distributed Comput. Dana Angluin, James Aspnes, David Eisenstat
2008	J	`jnl`	Fast computation by population protocols with a leader. Distributed Comput. Dana Angluin, James Aspnes, David Eisenstat
2008	A*	`conf`	Learning Acyclic Probabilistic Circuits Using Test Paths. COLT Dana Angluin, James Aspnes, Jiang Chen, David Eisenstat, Lev Reyzin
2008	J	`jnl`	Learning large-alphabet and analog circuits with value injection queries. Mach. Learn. Dana Angluin, James Aspnes, Jiang Chen, Lev Reyzin
2008	B	`conf`	Optimally Learning Social Networks with Activations and Suppressions. ALT Dana Angluin, James Aspnes, Lev Reyzin
2008	A*	`conf`	Randomized consensus in expected O(n log n) individual work. PODC James Aspnes, Hagit Attiya, Keren Censor
2008	A*	`conf`	Ranged hash functions and the price of churn. SODA James Aspnes, Muli Safra, Yitong Yin
2008	J	`jnl`	Self-stabilizing population protocols. ACM Trans. Auton. Adapt. Syst. Dana Angluin, James Aspnes, Michael J. Fischer, Hong Jiang
2007	A	`conf`	A Simple Population Protocol for Fast Robust Approximate Majority. DISC Dana Angluin, James Aspnes, David Eisenstat
2007	J	`jnl`	An Introduction to Population Protocols. Bull. EATCS James Aspnes, Eric Ruppert
2007	B	`ed.`	Distributed Computing in Sensor Systems, Third IEEE International Conference, DCOSS 2007, Santa Fe, NM, USA, June 18-20, 2007, Proceedings DCOSS James Aspnes, Christian Scheideler, Anish Arora, Samuel Madden
2007	J	`jnl`	Editorial. Distributed Comput. James Aspnes
2007	A*	`conf`	Learning Large-Alphabet and Analog Circuits with Value Injection Queries. COLT Dana Angluin, James Aspnes, Jiang Chen, Lev Reyzin
2007	B	`conf`	O(logn)-Time Overlay Network Construction from Graphs with Out-Degree 1. OPODIS James Aspnes, Yinghua Wu
2007	A*	`conf`	Path-independent load balancing with unreliable machines. SODA James Aspnes, Yang Richard Yang, Yitong Yin
2007	J	`jnl`	Skip graphs. ACM Trans. Algorithms James Aspnes, Gauri Shah
2007	J	`jnl`	The computational power of population protocols. Distributed Comput. Dana Angluin, James Aspnes, David Eisenstat, Eric Ruppert
2007	J	`jnl`	Towards a theory of data entanglement. Theor. Comput. Sci. James Aspnes, Joan Feigenbaum, Aleksandr Yampolskiy, Sheng Zhong
2007	B	`conf`	Worm Versus Alert: Who Wins in a Battle for Control of a Large-Scale Network?. OPODIS James Aspnes, Navin Rustagi, Jared Saia
2006	J	`jnl`	A Theory of Network Localization. IEEE Trans. Mob. Comput. James Aspnes, Tolga Eren, David Kiyoshi Goldenberg, A. Stephen Morse, Walter Whiteley, Yang Richard Yang, Brian D. O. Anderson, Peter N. Belhumeur
2006	J	`jnl`	Computation in networks of passively mobile finite-state sensors. Distributed Comput. Dana Angluin, James Aspnes, Zoë Diamadi, Michael J. Fischer, René Peralta
2006	B	`ed.`	Distributed Computing in Sensor Systems, Second IEEE International Conference, DCOSS 2006, San Francisco, CA, USA, June 18-20, 2006, Proceedings DCOSS Phillip B. Gibbons, Tarek F. Abdelzaher, James Aspnes, Ramesh R. Rao
2006	J	`jnl`	Eight Open Problems in Distributed Computing. Bull. EATCS James Aspnes, Costas Busch, Shlomi Dolev, Panagiota Fatourou, Chryssis Georgiou, Alexander A. Shvartsman, Paul G. Spirakis, Roger Wattenhofer
2006	A	`conf`	Fast Computation by Population Protocols with a Leader. DISC Dana Angluin, James Aspnes, David Eisenstat
2006	J	`jnl`	Inoculation strategies for victims of viruses and the sum-of-squares partition problem. J. Comput. Syst. Sci. James Aspnes, Kevin L. Chang, Aleksandr Yampolskiy
2006	A*	`conf`	Learning a circuit by injecting values. STOC Dana Angluin, James Aspnes, Jiang Chen, Yinghua Wu
2006	J	`jnl`	Path-independent load balancing with unreliable machines CoRR James Aspnes, Yang Richard Yang, Yitong Yin
2006	J	`jnl`	Relationships between broadcast and shared memory in reliable anonymous distributed systems. Distributed Comput. James Aspnes, Faith Ellen Fich, Eric Ruppert
2006	A*	`conf`	Stably computable predicates are semilinear. PODC Dana Angluin, James Aspnes, David Eisenstat
2006	J	`jnl`	The computational power of population protocols CoRR Dana Angluin, James Aspnes, David Eisenstat, Eric Ruppert
2005	J	`jnl`	Compositional competitiveness for distributed algorithms. J. Algorithms James Aspnes, Orli Waarts
2005	—	`ch.`	Distributed Data Structures for Peer-to-Peer Systems. Handbook on Theoretical and Algorithmic Aspects of Sensor, Ad Hoc Wireless, and Peer-to-Peer Networks James Aspnes, Gauri Shah
2005	B	`conf`	Fast construction of overlay networks. SPAA Dana Angluin, James Aspnes, Jiang Chen, Yinghua Wu, Yitong Yin
2005	A*	`conf`	Inoculation strategies for victims of viruses and the sum-of-squares partition problem. SODA James Aspnes, Kevin L. Chang, Aleksandr Yampolskiy
2005	B	`conf`	On the Power of Anonymous One-Way Communication. OPODIS Dana Angluin, James Aspnes, David Eisenstat, Eric Ruppert
2005	A*	`ed.`	Proceedings of the Twenty-Fourth Annual ACM Symposium on Principles of Distributed Computing, PODC 2005, Las Vegas, NV, USA, July 17-20, 2005 PODC Marcos Kawazoe Aguilera, James Aspnes
2005	B	`conf`	Self-stabilizing Population Protocols. OPODIS Dana Angluin, James Aspnes, Michael J. Fischer, Hong Jiang
2005	B	`conf`	Skip B-Trees. OPODIS Ittai Abraham, James Aspnes, Jian Yuan
2005	A	`conf`	Spreading Alerts Quietly and the Subgroup Escape Problem. ASIACRYPT James Aspnes, Zoë Diamadi, Kristian Gjøsteen, René Peralta, Aleksandr Yampolskiy
2005	J	`jnl`	Spreading Alerts Quietly and the Subgroup Escape Problem. IACR Cryptol. ePrint Arch. James Aspnes, Zoë Diamadi, Kristian Gjøsteen, René Peralta, Aleksandr Yampolskiy
2005	B	`conf`	Stably Computable Properties of Network Graphs. DCOSS Dana Angluin, James Aspnes, Melody Chan, Michael J. Fischer, Hong Jiang, René Peralta
2005	B	`conf`	The expansion and mixing time of skip graphs with applications. SPAA James Aspnes, Udi Wieder
2004	A*	`conf`	Computation in networks of passively mobile finite-state sensors. PODC Dana Angluin, James Aspnes, Zoë Diamadi, Michael J. Fischer, René Peralta
2004	A*	`conf`	Load balancing and locality in range-queriable data structures. PODC James Aspnes, Jonathan Kirsch, Arvind Krishnamurthy
2004	C	`conf`	On the Computational Complexity of Sensor Network Localization. ALGOSENSORS James Aspnes, David Kiyoshi Goldenberg, Yang Richard Yang
2004	A	`conf`	Relationships Between Broadcast and Shared Memory in Reliable Anonymous Distributed Systems. DISC James Aspnes, Faith E. Fich, Eric Ruppert
2004	A	`conf`	Towards a Theory of Data Entanglement: (Extended Abstract). ESORICS James Aspnes, Joan Feigenbaum, Aleksandr Yampolskiy, Sheng Zhong
2003	J	`jnl`	Compositional competitiveness for distributed algorithms CoRR James Aspnes, Orli Waarts
2003	J	`jnl`	Fault-tolerant routing in peer-to-peer systems CoRR James Aspnes, Zoë Diamadi, Gauri Shah
2003	J	`jnl`	Randomized protocols for asynchronous consensus. Distributed Comput. James Aspnes
2003	J	`jnl`	Skip Graphs CoRR James Aspnes, Gauri Shah
2003	A*	`conf`	Skip graphs. SODA James Aspnes, Gauri Shah
2002	J	`jnl`	A Combinatorial Toolbox for Protein Sequence Design and Landscape Analysis in the Grand Canonical Model. J. Comput. Biol. James Aspnes, Julia Hartling, Ming-Yang Kao, Junhyong Kim, Gauri Shah
2002	J	`jnl`	Fast Deterministic Consensus in a Noisy Environment CoRR James Aspnes
2002	J	`jnl`	Fast deterministic consensus in a noisy environment. J. Algorithms James Aspnes
2002	A*	`conf`	Fault-tolerant routing in peer-to-peer systems. PODC James Aspnes, Zoë Diamadi, Gauri Shah
2002	J	`jnl`	Randomized protocols for asynchronous consensus CoRR James Aspnes
2002	A*	`conf`	Wait-free consensus with infinite arrivals. STOC James Aspnes, Gauri Shah, Jatin Shah
2001	B	`conf`	A Combinatorial Toolbox for Protein Sequence Design and Landscape Analysis in the Grand Canonical Model. ISAAC James Aspnes, Julia Hartling, Ming-Yang Kao, Junhyong Kim, Gauri Shah
2001	J	`jnl`	Combinatorial Toolbox for Protein Sequence Design and Landscape Analysis in the Grand Canonical Model CoRR James Aspnes, Julia Hartling, Ming-Yang Kao, Junhyong Kim, Gauri Shah
2001	A*	`conf`	Towards understanding the predictability of stock markets from the perspective of computational complexity. SODA James Aspnes, David F. Fischer, Michael J. Fischer, Ming-Yang Kao, Alok Kumar
2000	A*	`conf`	Fast deterministic consensus in a noisy environment. PODC James Aspnes
2000	J	`jnl`	Opportunity Cost Algorithms for Combinatorial Auctions CoRR Karhan Akcoglu, James Aspnes, Bhaskar DasGupta, Ming-Yang Kao
2000	J	`jnl`	Towards Understanding the Predictability of Stock Markets from the Perspective of Computational Complexity CoRR James Aspnes, David F. Fischer, Michael J. Fischer, Ming-Yang Kao, Alok Kumar
1998	J	`jnl`	Fairness in Scheduling J. Algorithms Miklós Ajtai, James Aspnes, Moni Naor, Yuval Rabani, Leonard J. Schulman, Orli Waarts
1998	J	`jnl`	Lower Bounds for Distributed Coin-Flipping and Randomized Consensus. J. ACM James Aspnes
1998	J	`jnl`	Spreading Rumors Rapidly Despite an Adversary. J. Algorithms James Aspnes, William Hurwood
1997	A*	`conf`	Lower Bounds for Distributed Coin-Flipping and Randomized Consensus. STOC James Aspnes
1997	J	`jnl`	On-line routing of virtual circuits with applications to load balancing and machine scheduling. J. ACM James Aspnes, Yossi Azar, Amos Fiat, Serge A. Plotkin, Orli Waarts
1996	—	`conf`	Competitive Analysis of Distributed Algorithms. Online Algorithms James Aspnes
1996	A*	`conf`	Modular Competitiveness for Distributed Algorithms. STOC James Aspnes, Orli Waarts
1996	J	`jnl`	Randomized Consensus in Expected O(n log² n) Operations Per Processor. SIAM J. Comput. James Aspnes, Orli Waarts
1996	A*	`conf`	Spreading Rumors Rapidly Despite and Adversary. PODC James Aspnes, William Hurwood
1995	A*	`conf`	A Modular Measure of Competitiveness for Distributed Algorithms (Abstract). PODC James Aspnes, Orli Waarts
1995	A*	`conf`	Fairness in Scheduling. SODA Miklós Ajtai, James Aspnes, Moni Naor, Yuval Rabani, Leonard J. Schulman, Orli Waarts
1994	A*	`conf`	A Theory of Competitive Analysis for Distributed Algorithms FOCS Miklós Ajtai, James Aspnes, Cynthia Dwork, Orli Waarts
1994	A*	`conf`	Competitiveness in Distributed Algorithms. PODC Miklós Ajtai, James Aspnes, Cynthia Dwork, Orli Waarts
1994	J	`jnl`	Counting Networks. J. ACM James Aspnes, Maurice Herlihy, Nir Shavit
1994	J	`jnl`	The Expressive Power of Voting Polynomials. Comb. James Aspnes, Richard Beigel, Merrick L. Furst, Steven Rudich
1993	A*	`conf`	On-line load balancing with applications to machine scheduling and virtual circuit routing. STOC James Aspnes, Yossi Azar, Amos Fiat, Serge A. Plotkin, Orli Waarts
1993	J	`jnl`	Time- and Space-Efficient Randomized Consensus. J. Algorithms James Aspnes
1992	A*	`conf`	Randomized Consensus in Expected O(n log ^2 n) Operations Per Processor FOCS James Aspnes, Orli Waarts
1991	A*	`conf`	Counting Networks and Multi-Processor Coordination STOC James Aspnes, Maurice Herlihy, Nir Shavit
1991	A*	`conf`	The Expressive Power of Voting Polynomials STOC James Aspnes, Richard Beigel, Merrick L. Furst, Steven Rudich
1990	J	`jnl`	Fast Randomized Consensus Using Shared Memory. J. Algorithms James Aspnes, Maurice Herlihy
1990	A*	`conf`	Time- and Space-Efficient Randomized Consensus. PODC James Aspnes
1990	B	`conf`	Wait-Free Data Structures in the Asynchronous PRAM Model. SPAA James Aspnes, Maurice Herlihy
1988	A*	`conf`	A Theory of Timestamp-Based Concurrency Control for Nested Transactions. VLDB James Aspnes, Alan D. Fekete, Nancy A. Lynch, Michael Merritt, William E. Weihl