Michael J. Fischer - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 98 from 98

2021

Privacy-Preserving Data Sharing for Medical ResearchMichael J. Fischer, Jonathan E. Hochman, Daniel Boffa. sss 2021: 78-89 [doi]

2019

Incentives Don't Solve Blockchain's ProblemsShea Ketsdever, Michael J. Fischer. uemcom 2019: 873-876 [doi]

2017

Scalable Bias-Resistant Distributed RandomnessEwa Syta, Philipp Jovanovic, Eleftherios Kokoris-Kogias, Nicolas Gailly, Linus Gasser, Ismail Khoffi, Michael J. Fischer, Bryan Ford. sp 2017: 444-460 [doi]

2016

Scalable Bias-Resistant Distributed RandomnessEwa Syta, Philipp Jovanovic, Eleftherios Kokoris-Kogias, Nicolas Gailly, Linus Gasser, Ismail Khoffi, Michael J. Fischer, Bryan Ford. iacr, 2016:1067, 2016. [doi]

2015

Private Eyes: Secure Remote Biometric AuthenticationEwa Syta, Michael J. Fischer, David Wolinsky, Abraham Silberschatz, Gina Gallegos-García, Bryan Ford. secrypt 2015: 243-250 [doi]

2013

Secure sealed-bid online auctions using discreet cryptographic proofsJosé A. Montenegro, Michael J. Fischer, Javier Lopez, René Peralta. mcm, 57(11-12):2583-2595, 2013. [doi]

2011

A Public Randomness ServiceMichael J. Fischer, Michaela Iorga, René Peralta. secrypt 2011: 434-438

2010

Assigning tasks for efficiency in Hadoop: extended abstractMichael J. Fischer, Xueyuan Su, Yitong Yin. spaa 2010: 30-39 [doi]

2008

Self-stabilizing population protocolsDana Angluin, James Aspnes, Michael J. Fischer, Hong Jiang. taas, 3(4), 2008. [doi]

Evolution of distributed computing theory: from concurrency to networks and beyondMichael J. Fischer. podc 2008: 460 [doi]

2006

Computation in networks of passively mobile finite-state sensorsDana Angluin, James Aspnes, Zoë Diamadi, Michael J. Fischer, René Peralta. dc, 18(4):235-253, 2006. [doi]

Stabilizing Consensus in Mobile NetworksDana Angluin, Michael J. Fischer, Hong Jiang. dcoss 2006: 37-50 [doi]

2005

Self-stabilizing Population ProtocolsDana Angluin, James Aspnes, Michael J. Fischer, Hong Jiang. opodis 2006: 103-117 [doi]

Stably Computable Properties of Network GraphsDana Angluin, James Aspnes, Melody Chan, Michael J. Fischer, Hong Jiang, René Peralta. dcoss 2005: 63-74 [doi]

2004

Computation in networks of passively mobile finite-state sensorsDana Angluin, James Aspnes, Zoë Diamadi, Michael J. Fischer, René Peralta. podc 2004: 290-299 [doi]

2003

Appraising two decades of distributed computing theory researchMichael J. Fischer, Michael Merritt. dc, 16(2-3):239-247, 2003. [doi]

JACM 1983-1986Michael J. Fischer. JACM, 50(1):17, 2003. [doi]

2001

Towards understanding the predictability of stock markets from the perspective of computational complexityJames Aspnes, David F. Fischer, Michael J. Fischer, Ming-Yang Kao, Alok Kumar. soda 2001: 745-754 [doi]

1999

Optimal Layout of Edge-weighted ForestsMichael J. Fischer, Mike Paterson. DAM, 90(1-3):135-159, 1999. [doi]

1998

Estimating Parameters of Monotone Boolean Functions (Abstract)Michael J. Fischer. cocoon 1998: 3 [doi]

1996

A Secure Protocol for the Oblivious Transfer (Extended Abstract)Michael J. Fischer, Silvio Micali, Charles Rackoff. joc, 9(3):191-195, 1996.

Bounds on Secret Key Exchange Using a Random Deal of CardsMichael J. Fischer, Rebecca N. Wright. joc, 9(2):71-99, 1996.

The Wakeup ProblemMichael J. Fischer, Shlomo Moran, Steven Rudich, Gadi Taubenfeld. SICOMP, 25(6):1331-1332, 1996.

1994

Reliable Communication Over Unreliable ChannelsYehuda Afek, Hagit Attiya, Alan Fekete, Michael J. Fischer, Nancy A. Lynch, Yishay Mansour, Da-Wei Wang, Lenore D. Zuck. JACM, 41(6):1267-1297, 1994. [doi]

Fishspear: A Priority Queue AlgorithmMichael J. Fischer, Mike Paterson. JACM, 41(1):3-30, 1994. [doi]

1993

Lambda-Calculus SchemataMichael J. Fischer. lisp, 6(3-4):259-288, 1993.

An Efficient Protocol for Unconditionally Secure Secret Key ExchangeMichael J. Fischer, Rebecca N. Wright. soda 1993: 475-483

Space-Efficient Asynchronous Consensus Without Shared Memory InitializationMichael J. Fischer, Shlomo Moran, Gadi Taubenfeld. ipl, 45(2):101-105, 1993.

1992

Decision Making in the Presence of NoiseMichael J. Fischer, Sophia A. Paleologou. In Johannes Buchmann 0001, Harald Ganzinger, Wolfgang J. Paul, editors, Informatik, Festschrift zum 60. Geburtstag von Günter Hotz. Volume 1 of Teubner-Texte zur Informatik, pages 145-168, Teubner / Springer, 1992. [doi]

Optimal Placement of Identical Resources in a TreeMichael J. Fischer, Nancy D. Griffeth, Leonidas J. Guibas, Nancy A. Lynch. iandc, 96(1):1-54, January 1992.

1991

Multiparty Secret Key Exchange Using a Random Deal of CardsMichael J. Fischer, Rebecca N. Wright. crypto 1992: 141-155 [doi]

1990

An Application of Game-Theoretic Techniques to CryptographyMichael J. Fischer, Rebecca N. Wright. dimacs 1993: 99-118

The Wakeup Problem (Extended Abstract)Michael J. Fischer, Shlomo Moran, Steven Rudich, Gadi Taubenfeld. stoc 1990: 106-116

1989

Secret Bit Transmission Using a Random Deal of CardsMichael J. Fischer, Michael S. Paterson, Charles Rackoff. dimacs 1991: 173-182

Distributed FIFO Allocation of Identical Resources Using Small Shared SpaceMichael J. Fischer, Nancy A. Lynch, James E. Burns, Allan Borodin. TOPLAS, 11(1):90-114, 1989. [doi]

1988

Reasoning about Uncertainty in Fault-tolerant Distributed SystemsMichael J. Fischer, Lenore D. Zuck. ftrtft 1988: 142-158

1987

Efficient Fault-Tolerant Routings in NetworksAndrei Z. Broder, Danny Dolev, Michael J. Fischer, Barbara Simons. iandc, 75(1):52-64, October 1987.

Interpreting Logics of Knowledge in Propositional Dynamic Logic with ConverseMichael J. Fischer, Neil Immerman. ipl, 25(3):175-181, 1987.

1986

1985

A Robust and Verifiable Cryptographically Secure Election Scheme (Extended Abstract)Josh D. Cohen, Michael J. Fischer. focs 1985: 372-382

Dynamic Monotone Priorities on Planar Sets (Extended Abstract)Michael J. Fischer, Mike Paterson. focs 1985: 289-292

Easy Impossibility Proofs for Distributed Consensus ProblemsMichael J. Fischer, Nancy A. Lynch, Michael Merritt. podc 1985: 59-70

Impossibility of Distributed Consensus with One Faulty ProcessMichael J. Fischer, Nancy A. Lynch, Mike Paterson. JACM, 32(2):374-382, April 1985. [doi]

1984

Efficient Fault Tolerant Routings in NetworksAndrei Z. Broder, Danny Dolev, Michael J. Fischer, Barbara Simons. stoc 1984: 536-541

Fishspear: A Priority Queue Algorithm (Extended Abstract)Michael J. Fischer, Mike Paterson. focs 1984: 375-386

1983

1982

Data Requirements for Implementation of N-Process Mutual Exclusion Using a Single Shared VariableJames E. Burns, Paul Jackson, Nancy A. Lynch, Michael J. Fischer, Gary L. Peterson. JACM, 29(1):183-205, 1982. [doi]

An Efficient Algorithm for Byzantine Agreement without AuthenticationDanny Dolev, Michael J. Fischer, Robert J. Fowler, Nancy A. Lynch, H. Raymond Strong. iandc, 52(3):257-274, March 1982.

Sacrificing Serializability to Attain High Availability of DataMichael J. Fischer, A. Michael. PODS 1982: 70-75 [doi]

Omega(n log n) Lower Bounds on Length of Boolean FormulasMichael J. Fischer, Albert R. Meyer, Mike Paterson. SICOMP, 11(3):416-427, 1982.

A Lower Bound for the Time to Assure Interactive ConsistencyMichael J. Fischer, Nancy A. Lynch. ipl, 14(4):183-186, 1982.

On computing weak transitive closure on O(log N) expected random parallel timeAlbert G. Greenberg, Michael J. Fischer. icpp 1982: 199-204

1981

1980

Optimal Tree Layout (Preliminary Version)Michael J. Fischer, Mike Paterson. stoc 1980: 177-189

Parallel Prefix ComputationRichard E. Ladner, Michael J. Fischer. JACM, 27(4):831-838, 1980. [doi]

1979

A Time-Space Tradeoff for Sorting on Non-Oblivious MachinesAllan Borodin, Michael J. Fischer, David G. Kirkpatrick, Nancy A. Lynch, Martin Tompa. focs 1979: 319-327

A time-space tradeoff for sorting and related non-oblivious computationsAllan Borodin, Michael J. Fischer, David G. Kirkpatrick, Nancy A. Lynch, Martin Tompa. sigact, 11(2):24, 1979. [doi]

Resource Allocation with Immunity to Limited Process Failure (Preliminary Report)Michael J. Fischer, Nancy A. Lynch, James E. Burns, Allan Borodin. focs 1979: 234-254

Propositional Dynamic Logic of Regular ProgramsMichael J. Fischer, Richard E. Ladner. jcss, 18(2):194-211, 1979.

On Describing the Behavior and Implementation of Distributed SystemsNancy A. Lynch, Michael J. Fischer. scc 1979: 147-172

Relations Among Complexity MeasuresNicholas Pippenger, Michael J. Fischer. JACM, 26(2):361-381, 1979. [doi]

1978

Separating Nondeterministic Time Complexity ClassesJoel I. Seiferas, Michael J. Fischer, Albert R. Meyer. JACM, 25(1):146-167, 1978. [doi]

1977

Propositional Modal Logic of Programs (Extended Abstract)Michael J. Fischer, Richard E. Ladner. stoc 1977: 286-294

Economical Solutions for the Critical Section Problem in a Distributed System (Extended Abstract)Gary L. Peterson, Michael J. Fischer. stoc 1977: 91-97

1976

A Note on the Average Time to Compute Transitive ClosuresPeter A. Bloniarz, Michael J. Fischer, Albert R. Meyer. icalp 1976: 425-434

1975

Hauptvortrag: The complexity of negation-limited networks - A brief surveyMichael J. Fischer. automata 1975: 71-82

Lower Bounds on the Size of Boolean Formulas: Preliminary ReportMichael J. Fischer, Albert R. Meyer, Mike Paterson. stoc 1975: 37-44

1974

Fast On-Line Integer MultiplicationMichael J. Fischer, Larry J. Stockmeyer. jcss, 9(3):317-331, 1974.

The String-to-String Correction ProblemRobert A. Wagner, Michael J. Fischer. JACM, 21(1):168-173, 1974. [doi]

1973

1972

Efficiency of Equivalence AlgorithmsMichael J. Fischer. coco 1972: 153-167

Lambda calculus schemataMichael J. Fischer. praapr 1972: 104-109 [doi]

1971

Boolean Matrix Multiplication and Transitive ClosureMichael J. Fischer, Albert R. Meyer. focs 1971: 129-131

Economy of Description by Automata, Grammars, and Formal SystemsAlbert R. Meyer, Michael J. Fischer. focs 1971: 188-191

1969

Two Characterizations of the Context-Sensitive LanguagesMichael J. Fischer. focs 1969: 149-156

Some Properties of Precedence LanguagesMichael J. Fischer. stoc 1969: 181-190

1968

Grammars with Macro-Like ProductionsMichael J. Fischer. focs 1968: 131-142

Real-Time Solutions of the Origin-Crossing ProblemMichael J. Fischer, Arnold L. Rosenberg. mst, 2(3):257-263, 1968.

Limited Random Access Turing MachinesMichael J. Fischer, Arnold L. Rosenberg. focs 1968: 356-367

1965

The iteration elementBernard A. Galler, Michael J. Fischer. CACM, 8(6):349, 1965. [doi]

1964

An improved equivalence algorithmBernard A. Galler, Michael J. Fischer. CACM, 7(5):301-303, 1964. [doi]

In defense of the equivalence algorithmBernard A. Galler, Michael J. Fischer. CACM, 7(8):506, 1964. [doi]

Sign in or sign up to see more results.

runs on WebDSL