Michael J. Fischer

106 papers A* 29A 1B 8C 4Misc 1Journal 46Unranked 16

Year	Rank	Type	Title / Venue / Authors
2021	C	`conf`	Privacy-Preserving Data Sharing for Medical Research. SSS Michael J. Fischer, Jonathan E. Hochman, Daniel Boffa
2019	—	`conf`	Incentives Don't Solve Blockchain's Problems. UEMCON Shea Ketsdever, Michael J. Fischer
2019	J	`jnl`	Incentives Don't Solve Blockchain's Problems. CoRR Shea Ketsdever, Michael J. Fischer
2017	A*	`conf`	Scalable Bias-Resistant Distributed Randomness. IEEE Symposium on Security and Privacy Ewa Syta, Philipp Jovanovic, Eleftherios Kokoris-Kogias, Nicolas Gailly, Linus Gasser, Ismail Khoffi, Michael J. Fischer, Bryan Ford
2016	J	`jnl`	Scalable Bias-Resistant Distributed Randomness. IACR Cryptol. ePrint Arch. Ewa Syta, Philipp Jovanovic, Eleftherios Kokoris-Kogias, Nicolas Gailly, Linus Gasser, Ismail Khoffi, Michael J. Fischer, Bryan Ford
2015	C	`conf`	Private Eyes: Secure Remote Biometric Authentication. SECRYPT Ewa Syta, Michael J. Fischer, David Wolinsky, Abraham Silberschatz, Gina Gallegos-García, Bryan Ford
2013	J	`jnl`	Secure sealed-bid online auctions using discreet cryptographic proofs. Math. Comput. Model. José A. Montenegro, Michael J. Fischer, Javier López, René Peralta
2011	C	`conf`	A Public Randomness Service. SECRYPT Michael J. Fischer, Michaela Iorga, René Peralta
2010	B	`conf`	Assigning tasks for efficiency in Hadoop: extended abstract. SPAA Michael J. Fischer, Xueyuan Su, Yitong Yin
2010	C	`ed.`	Stabilization, Safety, and Security of Distributed Systems - 12th International Symposium, SSS 2010, New York, NY, USA, September 20-22, 2010. Proceedings SSS Shlomi Dolev, Jorge Arturo Cobb, Michael J. Fischer, Moti Yung
2008	A*	`conf`	Evolution of distributed computing theory: from concurrency to networks and beyond. PODC Michael J. Fischer
2008	J	`jnl`	Self-stabilizing population protocols. ACM Trans. Auton. Adapt. Syst. Dana Angluin, James Aspnes, Michael J. Fischer, Hong Jiang
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	`conf`	Self-stabilizing Leader Election in Networks of Finite-State Anonymous Agents. OPODIS Michael J. Fischer, Hong Jiang
2006	B	`conf`	Stabilizing Consensus in Mobile Networks. DCOSS Dana Angluin, Michael J. Fischer, Hong Jiang
2005	B	`conf`	Self-stabilizing Population Protocols. OPODIS Dana Angluin, James Aspnes, Michael J. Fischer, Hong Jiang
2005	B	`conf`	Stably Computable Properties of Network Graphs. DCOSS Dana Angluin, James Aspnes, Melody Chan, Michael J. Fischer, Hong Jiang, René Peralta
2004	A*	`conf`	Computation in networks of passively mobile finite-state sensors. PODC Dana Angluin, James Aspnes, Zoë Diamadi, Michael J. Fischer, René Peralta
2003	J	`jnl`	Appraising two decades of distributed computing theory research. Distributed Comput. Michael J. Fischer, Michael Merritt
2003	J	`jnl`	JACM 1983-1986. J. ACM Michael J. Fischer
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	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
1999	J	`jnl`	Optimal Layout of Edge-weighted Forests. Discret. Appl. Math. Michael J. Fischer, Mike Paterson
1998	Misc	`conf`	Estimating Parameters of Monotone Boolean Functions (Abstract). COCOON Michael J. Fischer
1996	J	`jnl`	A Secure Protocol for the Oblivious Transfer (Extended Abstract). J. Cryptol. Michael J. Fischer, Silvio Micali, Charles Rackoff
1996	J	`jnl`	Bounds on Secret Key Exchange Using a Random Deal of Cards. J. Cryptol. Michael J. Fischer, Rebecca N. Wright
1996	J	`jnl`	The Wakeup Problem. SIAM J. Comput. Michael J. Fischer, Shlomo Moran, Steven Rudich, Gadi Taubenfeld
1994	J	`jnl`	Fishspear: A Priority Queue Algorithm. J. ACM Michael J. Fischer, Mike Paterson
1994	J	`jnl`	Reliable Communication Over Unreliable Channels. J. ACM Yehuda Afek, Hagit Attiya, Alan D. Fekete, Michael J. Fischer, Nancy A. Lynch, Yishay Mansour, Da-Wei Wang, Lenore D. Zuck
1993	A*	`conf`	An Efficient Protocol for Unconditionally Secure Secret Key Exchange. SODA Michael J. Fischer, Rebecca N. Wright
1993	J	`jnl`	Lambda-Calculus Schemata. LISP Symb. Comput. Michael J. Fischer
1993	J	`jnl`	Space-Efficient Asynchronous Consensus Without Shared Memory Initialization. Inf. Process. Lett. Michael J. Fischer, Shlomo Moran, Gadi Taubenfeld
1992	—	`ch.`	Decision Making in the Presence of Noise. Informatik Michael J. Fischer, Sophia A. Paleologou
1992	J	`jnl`	Optimal Placement of Identical Resources in a Tree Inf. Comput. Michael J. Fischer, Nancy D. Griffeth, Leonidas J. Guibas, Nancy A. Lynch
1991	A*	`conf`	Multiparty Secret Key Exchange Using a Random Deal of Cards. CRYPTO Michael J. Fischer, Rebecca N. Wright
1990	—	`conf`	An Application of Game-Theoretic Techniques to Cryptography. Advances In Computational Complexity Theory Michael J. Fischer, Rebecca N. Wright
1990	A*	`conf`	The Wakeup Problem (Extended Abstract) STOC Michael J. Fischer, Shlomo Moran, Steven Rudich, Gadi Taubenfeld
1989	J	`jnl`	Distributed FIFO Allocation of Identical Resources Using Small Shared Space. ACM Trans. Program. Lang. Syst. Michael J. Fischer, Nancy A. Lynch, James E. Burns, Allan Borodin
1989	J	`jnl`	Primitive recursion without implicit predecessor. SIGACT News Michael J. Fischer, Robert P. Fischer, Richard Beigel
1989	—	`conf`	Secret Bit Transmission Using a Random Deal of Cards. Distributed Computing And Cryptography Michael J. Fischer, Michael S. Paterson, Charles Rackoff
1988	—	`conf`	Reasoning about Uncertainty in Fault-tolerant Distributed Systems. FTRTFT Michael J. Fischer, Lenore D. Zuck
1987	J	`jnl`	Efficient Fault-Tolerant Routings in Networks Inf. Comput. Andrei Z. Broder, Danny Dolev, Michael J. Fischer, Barbara Simons
1987	J	`jnl`	Interpreting Logics of Knowledge in Propositional Dynamic Logic with Converse. Inf. Process. Lett. Michael J. Fischer, Neil Immerman
1986	—	`conf`	A Theoretician's View of Fault Tolerant Distributed Computing. Fault-Tolerant Distributed Computing Michael J. Fischer
1986	—	`conf`	Easy Impossibility Proofs for Distributed Consensus Problems. Fault-Tolerant Distributed Computing Michael J. Fischer, Nancy A. Lynch, Michael Merritt
1986	J	`jnl`	Easy Impossibility Proofs for Distributed Consensus Problems. Distributed Comput. Michael J. Fischer, Nancy A. Lynch, Michael Merritt
1986	B	`conf`	Foundations of Knowledge for Distributed Systems. TARK Michael J. Fischer, Neil Immerman
1986	J	`jnl`	Probabilistic Analysis of a Network Resource Allocation Algorithm Inf. Control. Nancy A. Lynch, Nancy D. Griffeth, Michael J. Fischer, Leonidas J. Guibas
1985	A*	`conf`	A Robust and Verifiable Cryptographically Secure Election Scheme (Extended Abstract) FOCS Josh D. Cohen, Michael J. Fischer
1985	A*	`conf`	Dynamic Monotone Priorities on Planar Sets (Extended Abstract) FOCS Michael J. Fischer, Mike Paterson
1985	A*	`conf`	Easy Impossibility Proofs for Distributed Consensus Problems. PODC Michael J. Fischer, Nancy A. Lynch, Michael Merritt
1985	J	`jnl`	Impossibility of Distributed Consensus with One Faulty Process J. ACM Michael J. Fischer, Nancy A. Lynch, Mike Paterson
1984	A*	`conf`	Efficient Fault Tolerant Routings in Networks STOC Andrei Z. Broder, Danny Dolev, Michael J. Fischer, Barbara Simons
1984	A*	`conf`	Fishspear: A Priority Queue Algorithm (Extended Abstract) FOCS Michael J. Fischer, Mike Paterson
1983	J	`jnl`	A Technique for Decomposing Algorithms Which Use a Single Shared Variable. J. Comput. Syst. Sci. Nancy A. Lynch, Michael J. Fischer
1983	J	`jnl`	Efficiency of Synchronous Versus Asynchronous Distributed Systems J. ACM Eshrat Arjomandi, Michael J. Fischer, Nancy A. Lynch
1983	A*	`conf`	Impossibility of Distributed Consensus with One Faulty Process. PODS Michael J. Fischer, Nancy A. Lynch, Mike Paterson
1983	J	`jnl`	Storage Requirements for Fair Scheduling. Inf. Process. Lett. Michael J. Fischer, Mike Paterson
1983	B	`conf`	The Consensus Problem in Unreliable Distributed Systems (A Brief Survey). FCT Michael J. Fischer
1982	J	`jnl`	A Lower Bound for the Time to Assure Interactive Consistency. Inf. Process. Lett. Michael J. Fischer, Nancy A. Lynch
1982	A*	`ed.`	ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing, Ottawa, Canada, August 18-20, 1982 PODC Robert L. Probert, Michael J. Fischer, Nicola Santoro
1982	J	`jnl`	An Efficient Algorithm for Byzantine Agreement without Authentication Inf. Control. Danny Dolev, Michael J. Fischer, Robert J. Fowler, Nancy A. Lynch, H. Raymond Strong
1982	J	`jnl`	Data Requirements for Implementation of N-Process Mutual Exclusion Using a Single Shared Variable. J. ACM James E. Burns, Paul Jackson, Nancy A. Lynch, Michael J. Fischer, Gary L. Peterson
1982	J	`jnl`	Global States of a Distributed System. IEEE Trans. Software Eng. Michael J. Fischer, Nancy D. Griffeth, Nancy A. Lynch
1982	J	`jnl`	Omega(n log n) Lower Bounds on Length of Boolean Formulas. SIAM J. Comput. Michael J. Fischer, Albert R. Meyer, Mike Paterson
1982	B	`conf`	On computing weak transitive closure on O(log N) expected random parallel time. ICPP Albert G. Greenberg, Michael J. Fischer
1982	A*	`conf`	Sacrificing Serializability to Attain High Availability of Data. PODS Michael J. Fischer, Alan Michael
1981	A*	`conf`	A Difference in Efficiency between Synchronous and Asynchronous Systems STOC Eshrat Arjomandi, Michael J. Fischer, Nancy A. Lynch
1981	J	`jnl`	A Time-Space Tradeoff for Sorting on Non-Oblivious Machines. J. Comput. Syst. Sci. Allan Borodin, Michael J. Fischer, David G. Kirkpatrick, Nancy A. Lynch, Martin Tompa
1981	J	`jnl`	On Describing the Behavior and Implementation of Distributed Systems. Theor. Comput. Sci. Nancy A. Lynch, Michael J. Fischer
1981	A	`conf`	Optimal Placement of Identical Resources in a Distributed Network. ICDCS Michael J. Fischer, Leonidas J. Guibas, Nancy D. Griffeth, Nancy A. Lynch
1981	A*	`conf`	The Architecture of the Eden System. SOSP Edward D. Lazowska, Henry M. Levy, Guy T. Almes, Michael J. Fischer, Robert J. Fowler, Stephen C. Vestal
1980	A*	`conf`	Optimal Tree Layout (Preliminary Version) STOC Michael J. Fischer, Mike Paterson
1980	J	`jnl`	Parallel Prefix Computation. J. ACM Richard E. Ladner, Michael J. Fischer
1979	A*	`conf`	A Time-Space Tradeoff for Sorting on Non-Oblivious Machines FOCS Allan Borodin, Michael J. Fischer, David G. Kirkpatrick, Nancy A. Lynch, Martin Tompa
1979	J	`jnl`	A time-space tradeoff for sorting and related non-oblivious computations. SIGACT News Allan Borodin, Michael J. Fischer, David G. Kirkpatrick, Nancy A. Lynch, Martin Tompa
1979	—	`conf`	On Describing the Behavior and Implementation of Distributed Systems. Semantics of Concurrent Computation Nancy A. Lynch, Michael J. Fischer
1979	A*	`ed.`	Proceedings of the 11h Annual ACM Symposium on Theory of Computing, April 30 - May 2, 1979, Atlanta, Georgia, USA STOC Michael J. Fischer, Richard A. DeMillo, Nancy A. Lynch, Walter A. Burkhard, Alfred V. Aho
1979	J	`jnl`	Propositional Dynamic Logic of Regular Programs. J. Comput. Syst. Sci. Michael J. Fischer, Richard E. Ladner
1979	J	`jnl`	Relations Among Complexity Measures. J. ACM Nicholas Pippenger, Michael J. Fischer
1979	A*	`conf`	Resource Allocation with Immunity to Limited Process Failure (Preliminary Report) FOCS Michael J. Fischer, Nancy A. Lynch, James E. Burns, Allan Borodin
1978	J	`jnl`	Separating Nondeterministic Time Complexity Classes. J. ACM Joel I. Seiferas, Michael J. Fischer, Albert R. Meyer
1977	A*	`conf`	Economical Solutions for the Critical Section Problem in a Distributed System (Extended Abstract) STOC Gary L. Peterson, Michael J. Fischer
1977	A*	`conf`	Propositional Modal Logic of Programs (Extended Abstract) STOC Michael J. Fischer, Richard E. Ladner
1976	A*	`conf`	A Note on the Average Time to Compute Transitive Closures. ICALP Peter A. Bloniarz, Michael J. Fischer, Albert R. Meyer
1975	—	`conf`	Hauptvortrag: The complexity of negation-limited networks - A brief survey. Automata Theory and Formal Languages Michael J. Fischer
1975	A*	`conf`	Lower Bounds on the Size of Boolean Formulas: Preliminary Report STOC Michael J. Fischer, Albert R. Meyer, Mike Paterson
1974	J	`jnl`	Fast On-Line Integer Multiplication. J. Comput. Syst. Sci. Michael J. Fischer, Larry J. Stockmeyer
1974	J	`jnl`	The String-to-String Correction Problem. J. ACM Robert A. Wagner, Michael J. Fischer
1973	J	`jnl`	A note on disjunctive form tautologies. SIGACT News M. Bauer, D. Brand, Michael J. Fischer, Albert R. Meyer, Mike Paterson
1973	A*	`conf`	Fast On-Line Integer Multiplication STOC Michael J. Fischer, Larry J. Stockmeyer
1973	A*	`conf`	Mode Modules as Representations of Domains. POPL Alice E. Fischer, Michael J. Fischer
1973	—	`conf`	Refinements of the Nondeterministic Time and Space Hierarchies SWAT Joel I. Seiferas, Michael J. Fischer, Albert R. Meyer
1973	A*	`conf`	Sets that Don't Help STOC Nancy A. Lynch, Albert R. Meyer, Michael J. Fischer
1972	—	`conf`	Efficiency of Equivalence Algorithms. Complexity of Computer Computations Michael J. Fischer
1972	—	`conf`	Lambda calculus schemata. Proving Assertions About Programs Michael J. Fischer
1971	—	`conf`	Boolean Matrix Multiplication and Transitive Closure SWAT Michael J. Fischer, Albert R. Meyer
1971	—	`conf`	Economy of Description by Automata, Grammars, and Formal Systems SWAT Albert R. Meyer, Michael J. Fischer
1969	A*	`conf`	Some Properties of Precedence Languages STOC Michael J. Fischer
1969	—	`conf`	Two Characterizations of the Context-Sensitive Languages SWAT Michael J. Fischer
1968	—	`conf`	Grammars with Macro-Like Productions SWAT Michael J. Fischer
1968	—	`conf`	Limited Random Access Turing Machines SWAT Michael J. Fischer, Arnold L. Rosenberg
1968	J	`jnl`	Real-Time Solutions of the Origin-Crossing Problem. Math. Syst. Theory Michael J. Fischer, Arnold L. Rosenberg
1965	J	`jnl`	The iteration element. Commun. ACM Bernard A. Galler, Michael J. Fischer
1964	J	`jnl`	An improved equivalence algorithm. Commun. ACM Bernard A. Galler, Michael J. Fischer
1964	J	`jnl`	In defense of the equivalence algorithm. Commun. ACM Bernard A. Galler, Michael J. Fischer