Michael J. Fischer

	2011
92		Michael J. Fischer, Michaela Iorga, René Peralta: A Public Randomness Service. SECRYPT 2011: 434-438
	2010
91		Shlomi Dolev, Jorge Arturo Cobb, Michael J. Fischer, Moti Yung: Stabilization, Safety, and Security of Distributed Systems - 12th International Symposium, SSS 2010, New York, NY, USA, September 20-22, 2010. Proceedings Springer 2010
90		Michael J. Fischer, Xueyuan Su, Yitong Yin: Assigning tasks for efficiency in Hadoop: extended abstract. SPAA 2010: 30-39
	2008
89		Michael J. Fischer: Evolution of distributed computing theory: from concurrency to networks and beyond. PODC 2008: 460
88		Dana Angluin, James Aspnes, Michael J. Fischer, Hong Jiang: Self-stabilizing population protocols. TAAS 3(4): (2008)
	2006
87		Dana Angluin, Michael J. Fischer, Hong Jiang: Stabilizing Consensus in Mobile Networks. DCOSS 2006: 37-50
86		Michael J. Fischer, Hong Jiang: Self-stabilizing Leader Election in Networks of Finite-State Anonymous Agents. OPODIS 2006: 395-409
85		Dana Angluin, James Aspnes, Zoë Diamadi, Michael J. Fischer, René Peralta: Computation in networks of passively mobile finite-state sensors. Distributed Computing 18(4): 235-253 (2006)
	2005
84		Dana Angluin, James Aspnes, Melody Chan, Michael J. Fischer, Hong Jiang, René Peralta: Stably Computable Properties of Network Graphs. DCOSS 2005: 63-74
83		Dana Angluin, James Aspnes, Michael J. Fischer, Hong Jiang: Self-stabilizing Population Protocols. OPODIS 2005: 103-117
	2004
82		Dana Angluin, James Aspnes, Zoë Diamadi, Michael J. Fischer, René Peralta: Computation in networks of passively mobile finite-state sensors. PODC 2004: 290-299
	2003
81		Michael J. Fischer, Michael Merritt: Appraising two decades of distributed computing theory research. Distributed Computing 16(2-3): 239-247 (2003)
80		Michael J. Fischer: JACM 1983-1986. J. ACM 50(1): 17 (2003)
	2001
79		James Aspnes, David F. Fischer, Michael J. Fischer, Ming-Yang Kao, Alok Kumar: Towards understanding the predictability of stock markets from the perspective of computational complexity. SODA 2001: 745-754
	2000
78		James Aspnes, David F. Fischer, Michael J. Fischer, Ming-Yang Kao, Alok Kumar: Towards Understanding the Predictability of Stock Markets from the Perspective of Computational Complexity CoRR cs.CE/0010021: (2000)
	1999
77		Michael J. Fischer, Mike Paterson: Optimal Layout of Edge-weighted Forests. Discrete Applied Mathematics 90(1-3): 135-159 (1999)
	1998
76		Michael J. Fischer: Estimating Parameters of Monotone Boolean Functions (Abstract). COCOON 1998: 3
	1996
75		Michael J. Fischer, Rebecca N. Wright: Bounds on Secret Key Exchange Using a Random Deal of Cards. J. Cryptology 9(2): 71-99 (1996)
74		Michael J. Fischer, Silvio Micali, Charles Rackoff: A Secure Protocol for the Oblivious Transfer (Extended Abstract). J. Cryptology 9(3): 191-195 (1996)
73		Michael J. Fischer, Shlomo Moran, Steven Rudich, Gadi Taubenfeld: The Wakeup Problem. SIAM J. Comput. 25(6): 1331-1332 (1996)
	1994
72		Michael J. Fischer, Mike Paterson: Fishspear: A Priority Queue Algorithm. J. ACM 41(1): 3-30 (1994)
71		Yehuda Afek, Hagit Attiya, Alan Fekete, Michael J. Fischer, Nancy A. Lynch, Yishay Mansour, Da-Wei Wang, Lenore D. Zuck: Reliable Communication Over Unreliable Channels. J. ACM 41(6): 1267-1297 (1994)
	1993
70		Michael J. Fischer, Rebecca N. Wright: An Efficient Protocol for Unconditionally Secure Secret Key Exchange. SODA 1993: 475-483
69		Michael J. Fischer, Shlomo Moran, Gadi Taubenfeld: Space-Efficient Asynchronous Consensus Without Shared Memory Initialization. Inf. Process. Lett. 45(2): 101-105 (1993)
68		Michael J. Fischer: Lambda-Calculus Schemata. Lisp and Symbolic Computation 6(3-4): 259-288 (1993)
	1992
67		Michael J. Fischer, Nancy D. Griffeth, Leonidas J. Guibas, Nancy A. Lynch: Optimal Placement of Identical Resources in a Tree Inf. Comput. 96(1): 1-54 (1992)
	1991
66		Michael J. Fischer, Rebecca N. Wright: Multiparty Secret Key Exchange Using a Random Deal of Cards. CRYPTO 1991: 141-155
	1990
65		Michael J. Fischer, Shlomo Moran, Steven Rudich, Gadi Taubenfeld: The Wakeup Problem (Extended Abstract) STOC 1990: 106-116
	1989
64		Michael J. Fischer, Nancy A. Lynch, James E. Burns, Allan Borodin: Distributed FIFO Allocation of Identical Resources Using Small Shared Space. ACM Trans. Program. Lang. Syst. 11(1): 90-114 (1989)
	1988
63		Michael J. Fischer, Lenore D. Zuck: Reasoning about Uncertainty in Fault-tolerant Distributed Systems. FTRTFT 1988: 142-158
	1987
62		Andrei Z. Broder, Danny Dolev, Michael J. Fischer, Barbara Simons: Efficient Fault-Tolerant Routings in Networks Inf. Comput. 75(1): 52-64 (1987)
61		Michael J. Fischer, Neil Immerman: Interpreting Logics of Knowledge in Propositional Dynamic Logic with Converse. Inf. Process. Lett. 25(3): 175-181 (1987)
	1986
60		Michael J. Fischer: A Theoretician's View of Fault Tolerant Distributed Computing. Fault-Tolerant Distributed Computing 1986: 1-9
59		Michael J. Fischer, Nancy A. Lynch, Michael Merritt: Easy Impossibility Proofs for Distributed Consensus Problems. Fault-Tolerant Distributed Computing 1986: 147-170
58		Michael J. Fischer, Neil Immerman: Foundations of Knowledge for Distributed Systems. TARK 1986: 171-185
57		Michael J. Fischer, Nancy A. Lynch, Michael Merritt: Easy Impossibility Proofs for Distributed Consensus Problems. Distributed Computing 1(1): 26-39 (1986)
56		Nancy A. Lynch, Nancy D. Griffeth, Michael J. Fischer, Leonidas J. Guibas: Probabilistic Analysis of a Network Resource Allocation Algorithm Information and Control 68(1-3): 47-85 (1986)
	1985
55		Michael J. Fischer, Mike Paterson: Dynamic Monotone Priorities on Planar Sets (Extended Abstract) FOCS 1985: 289-292
54		Josh D. Cohen, Michael J. Fischer: A Robust and Verifiable Cryptographically Secure Election Scheme (Extended Abstract) FOCS 1985: 372-382
53		Michael J. Fischer, Nancy A. Lynch, Michael Merritt: Easy Impossibility Proofs for Distributed Consensus Problems. PODC 1985: 59-70
52		Michael J. Fischer, Nancy A. Lynch, Mike Paterson: Impossibility of Distributed Consensus with One Faulty Process J. ACM 32(2): 374-382 (1985)
	1984
51		Michael J. Fischer, Mike Paterson: Fishspear: A Priority Queue Algorithm (Extended Abstract) FOCS 1984: 375-386
50		Andrei Z. Broder, Danny Dolev, Michael J. Fischer, Barbara Simons: Efficient Fault Tolerant Routings in Networks STOC 1984: 536-541
	1983
49		Michael J. Fischer: The Consensus Problem in Unreliable Distributed Systems (A Brief Survey). FCT 1983: 127-140
48		Michael J. Fischer, Nancy A. Lynch, Mike Paterson: Impossibility of Distributed Consensus with One Faulty Process. PODS 1983: 1-7
47		Michael J. Fischer, Mike Paterson: Storage Requirements for Fair Scheduling. Inf. Process. Lett. 17(5): 249-250 (1983)
46		Eshrat Arjomandi, Michael J. Fischer, Nancy A. Lynch: Efficiency of Synchronous Versus Asynchronous Distributed Systems J. ACM 30(3): 449-456 (1983)
45		Nancy A. Lynch, Michael J. Fischer: A Technique for Decomposing Algorithms Which Use a Single Shared Variable. J. Comput. Syst. Sci. 27(3): 350-377 (1983)
	1982
44		Robert L. Probert, Michael J. Fischer, Nicola Santoro: ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing, Ottawa, CanadaAugust 18-20, 1982 ACM 1982
43		Albert G. Greenberg, Michael J. Fischer: On computing weak transitive closure on O(log N) expected random parallel time. ICPP 1982: 199-204
42		Michael J. Fischer, A. Michael: Sacrificing Serializability to Attain High Availability of Data. PODS 1982: 70-75
41		Michael J. Fischer, Nancy D. Griffeth, Nancy A. Lynch: Global States of a Distributed System. IEEE Trans. Software Eng. 8(3): 198-202 (1982)
40		Michael J. Fischer, Nancy A. Lynch: A Lower Bound for the Time to Assure Interactive Consistency. Inf. Process. Lett. 14(4): 183-186 (1982)
39		Danny Dolev, Michael J. Fischer, Robert J. Fowler, Nancy A. Lynch, H. Raymond Strong: An Efficient Algorithm for Byzantine Agreement without Authentication Information and Control 52(3): 257-274 (1982)
38		James E. Burns, Paul Jackson, Nancy A. Lynch, Michael J. Fischer, Gary L. Peterson: Data Requirements for Implementation of N-Process Mutual Exclusion Using a Single Shared Variable. J. ACM 29(1): 183-205 (1982)
37		Michael J. Fischer, Albert R. Meyer, Mike Paterson: Omega(n log n) Lower Bounds on Length of Boolean Formulas. SIAM J. Comput. 11(3): 416-427 (1982)
	1981
36		Michael J. Fischer, Leonidas J. Guibas, Nancy D. Griffeth, Nancy A. Lynch: Optimal Placement of Identical Resources in a Distributed Network. ICDCS 1981: 324-336
35		Edward D. Lazowska, Henry M. Levy, Guy T. Almes, Michael J. Fischer, Robert J. Fowler, Stephen C. Vestal: The Architecture of the Eden System. SOSP 1981: 148-159
34		Eshrat Arjomandi, Michael J. Fischer, Nancy A. Lynch: A Difference in Efficiency between Synchronous and Asynchronous Systems STOC 1981: 128-132
33		Allan Borodin, Michael J. Fischer, David G. Kirkpatrick, Nancy A. Lynch, Martin Tompa: A Time-Space Tradeoff for Sorting on Non-Oblivious Machines. J. Comput. Syst. Sci. 22(3): 351-364 (1981)
32		Nancy A. Lynch, Michael J. Fischer: On Describing the Behavior and Implementation of Distributed Systems. Theor. Comput. Sci. 13: 17-43 (1981)
	1980
31		Michael J. Fischer, Mike Paterson: Optimal Tree Layout (Preliminary Version) STOC 1980: 177-189
30		Richard E. Ladner, Michael J. Fischer: Parallel Prefix Computation. J. ACM 27(4): 831-838 (1980)
	1979
29		Michael J. Fischer, Richard A. DeMillo, Nancy A. Lynch, Walter A. Burkhard, Alfred V. Aho: Proceedings of the 11h Annual ACM Symposium on Theory of Computing, April 30 - May 2, 1979, Atlanta, Georgia, USA ACM 1979
28		Michael J. Fischer, Nancy A. Lynch, James E. Burns, Allan Borodin: Resource Allocation with Immunity to Limited Process Failure (Preliminary Report) FOCS 1979: 234-254
27		Allan Borodin, Michael J. Fischer, David G. Kirkpatrick, Nancy A. Lynch, Martin Tompa: A Time-Space Tradeoff for Sorting on Non-Oblivious Machines FOCS 1979: 319-327
26		Nancy A. Lynch, Michael J. Fischer: On Describing the Behavior and Implementation of Distributed Systems. Semantics of Concurrent Computation 1979: 147-172
25		Nicholas Pippenger, Michael J. Fischer: Relations Among Complexity Measures. J. ACM 26(2): 361-381 (1979)
24		Michael J. Fischer, Richard E. Ladner: Propositional Dynamic Logic of Regular Programs. J. Comput. Syst. Sci. 18(2): 194-211 (1979)
	1978
23		Joel I. Seiferas, Michael J. Fischer, Albert R. Meyer: Separating Nondeterministic Time Complexity Classes. J. ACM 25(1): 146-167 (1978)
	1977
22		Michael J. Fischer, Richard E. Ladner: Propositional Modal Logic of Programs (Extended Abstract) STOC 1977: 286-294
21		Gary L. Peterson, Michael J. Fischer: Economical Solutions for the Critical Section Problem in a Distributed System (Extended Abstract) STOC 1977: 91-97
	1976
20		Peter A. Bloniarz, Michael J. Fischer, Albert R. Meyer: A Note on the Average Time to Compute Transitive Closures. ICALP 1976: 425-434
	1975
19		Michael J. Fischer: Hauptvortrag: The complexity of negation-limited networks - A brief survey. Automata Theory and Formal Languages 1975: 71-82
18		Michael J. Fischer, Albert R. Meyer, Mike Paterson: Lower Bounds on the Size of Boolean Formulas: Preliminary Report STOC 1975: 37-44
	1974
17		Robert A. Wagner, Michael J. Fischer: The String-to-String Correction Problem. J. ACM 21(1): 168-173 (1974)
16		Michael J. Fischer, Larry J. Stockmeyer: Fast On-Line Integer Multiplication. J. Comput. Syst. Sci. 9(3): 317-331 (1974)
	1973
15		Alice E. Fischer, Michael J. Fischer: Mode Modules as Representations of Domains. POPL 1973: 139-143
14		Nancy A. Lynch, Albert R. Meyer, Michael J. Fischer: Sets that Don't Help STOC 1973: 130-134
13		Michael J. Fischer, Larry J. Stockmeyer: Fast On-Line Integer Multiplication STOC 1973: 67-72
12		Joel I. Seiferas, Michael J. Fischer, Albert R. Meyer: Refinements of the Nondeterministic Time and Space Hierarchies SWAT (FOCS) 1973: 130-137
	1972
11		Michael J. Fischer: Efficiency of Equivalence Algorithms. Complexity of Computer Computations 1972: 153-167
	1971
10		Michael J. Fischer, Albert R. Meyer: Boolean Matrix Multiplication and Transitive Closure SWAT (FOCS) 1971: 129-131
9		Albert R. Meyer, Michael J. Fischer: Economy of Description by Automata, Grammars, and Formal Systems SWAT (FOCS) 1971: 188-191
	1969
8		Michael J. Fischer: Some Properties of Precedence Languages STOC 1969: 181-190
7		Michael J. Fischer: Two Characterizations of the Context-Sensitive Languages SWAT (FOCS) 1969: 149-156
	1968
6		Michael J. Fischer: Grammars with Macro-Like Productions SWAT (FOCS) 1968: 131-142
5		Michael J. Fischer, Arnold L. Rosenberg: Limited Random Access Turing Machines SWAT (FOCS) 1968: 356-367
4		Michael J. Fischer, Arnold L. Rosenberg: Real-Time Solutions of the Origin-Crossing Problem. Mathematical Systems Theory 2(3): 257-263 (1968)
	1965
3		Bernard A. Galler, Michael J. Fischer: The iteration element. Commun. ACM 8(6): 349 (1965)
	1964
2		Bernard A. Galler, Michael J. Fischer: An improved equivalence algorithm. Commun. ACM 7(5): 301-303 (1964)
1		Bernard A. Galler, Michael J. Fischer: In defense of the equivalence algorithm. Commun. ACM 7(8): 506 (1964)

Coauthor Index

1	Yehuda Afek	[71]
2	Alfred V. Aho	[29]
3	Guy T. Almes	[35]
4	Dana Angluin	[82] [83] [84] [85] [87] [88]
5	Eshrat Arjomandi	[34] [46]
6	James Aspnes	[78] [79] [82] [83] [84] [85] [88]
7	Hagit Attiya (Chagit Attiya)	[71]
8	Josh Benaloh (Josh Cohen Benaloh, Josh D. Cohen)	[54]
9	Peter A. Bloniarz	[20]
10	Allan Borodin	[27] [28] [33] [64]
11	Andrei Z. Broder	[50] [62]
12	Walter A. Burkhard	[29]
13	James E. Burns	[28] [38] [64]
14	Melody Chan	[84]
15	Jorge Arturo Cobb	[91]
16	Richard A. DeMillo	[29]
17	Zoë Diamadi	[82] [85]
18	Danny Dolev	[39] [50] [62]
19	Shlomi Dolev	[91]
20	Alan Fekete (Alan David Fekete, A. D. Fekete)	[71]
21	Alice E. Fischer	[15]
22	David F. Fischer	[78] [79]
23	Robert J. Fowler (Rob Fowler)	[35] [39]
24	Bernard A. Galler	[1] [2] [3]
25	Albert G. Greenberg	[43]
26	Nancy D. Griffeth	[36] [41] [56] [67]
27	Leonidas J. Guibas	[36] [56] [67]
28	Neil Immerman	[58] [61]
29	Michaela Iorga	[92]
30	Paul Jackson	[38]
31	Hong Jiang	[83] [84] [86] [87] [88]
32	Ming-Yang Kao	[78] [79]
33	David G. Kirkpatrick	[27] [33]
34	Alok Kumar	[78] [79]
35	Richard E. Ladner	[22] [24] [30]
36	Edward D. Lazowska	[35]
37	Henry M. Levy (Hank Levy)	[35]
38	Nancy A. Lynch	[14] [26] [27] [28] [29] [32] [33] [34] [36] [38] [39] [40] [41] [45] [46] [48] [52] [53] [56] [57] [59] [64] [67] [71]
39	Yishay Mansour	[71]
40	Michael Merritt	[53] [57] [59] [81]
41	Albert R. Meyer	[9] [10] [12] [14] [18] [20] [23] [37]
42	Silvio Micali	[74]
43	A. Michael	[42]
44	Shlomo Moran	[65] [69] [73]
45	Mike Paterson	[18] [31] [37] [47] [48] [51] [52] [55] [72] [77]
46	René Peralta	[82] [84] [85] [92]
47	Gary L. Peterson	[21] [38]
48	Nicholas Pippenger	[25]
49	Robert L. Probert	[44]
50	Charles Rackoff	[74]
51	Arnold L. Rosenberg	[4] [5]
52	Steven Rudich	[65] [73]
53	Nicola Santoro	[44]
54	Joel I. Seiferas	[12] [23]
55	Barbara B. Simons (Barbara Simons)	[50] [62]
56	Larry J. Stockmeyer	[13] [16]
57	H. Raymond Strong	[39]
58	Xueyuan Su	[90]
59	Gadi Taubenfeld	[65] [69] [73]
60	Martin Tompa	[27] [33]
61	Stephen C. Vestal	[35]
62	Robert A. Wagner	[17]
63	Da-Wei Wang	[71]
64	Rebecca N. Wright	[66] [70] [75]
65	Yitong Yin	[90]
66	Moti Yung (Mordechai M. Yung)	[91]
67	Lenore D. Zuck	[63] [71]

Colors in the list of coauthors

Last update Tue May 29 20:41:18 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page