Michael J. Fischer

From MaRDI portal
Person:800080

Available identifiers

zbMath Open fischer.michael-jWikidataQ6831406 ScholiaQ6831406MaRDI QIDQ800080

List of research outcomes

PublicationDate of PublicationType
One-Dimensional Short-Range Nearest-Neighbor Interaction and Its Nonlinear Diffusion Limit2024-02-08Paper
Efficiency of Equivalence Algorithms2021-07-06Paper
Micro- and macroscopic modeling of crowding and pushing in corridors2021-01-08Paper
Appraising two decades of distributed computing theory research2020-12-04Paper
https://portal.mardi4nfdi.de/entity/Q46029722018-02-08Paper
Fréchet Differentiability of Unsteady Incompressible Navier--Stokes Flow with Respect to Domain Variations of Low Regularity by Using a General Analytical Framework2017-11-02Paper
Application of parametric model reduction with matrix interpolation for simulation of moving loads in elastic multibody systems2016-01-13Paper
Computation in networks of passively mobile finite-state sensors2015-08-03Paper
Secure sealed-bid online auctions using discreet cryptographic proofs2014-05-14Paper
Some properties of precedence languages2014-03-14Paper
Greedy-based approximation of frequency-weighted Gramian matrices for model reduction in multibody dynamics2013-10-29Paper
Computation in networks of passively mobile finite-state sensors2013-06-13Paper
https://portal.mardi4nfdi.de/entity/Q33657392006-01-23Paper
A minimal model for studying properties of the mode-coupling type instability in friction induced oscillations2003-05-14Paper
https://portal.mardi4nfdi.de/entity/Q27683762002-07-22Paper
Optimal layout of edge-weighted forests1999-07-06Paper
https://portal.mardi4nfdi.de/entity/Q42184011999-02-14Paper
https://portal.mardi4nfdi.de/entity/Q43912161998-09-13Paper
The Wakeup Problem1997-06-09Paper
A secure protocol for the oblivious transfer. (Extended abstract)1996-11-24Paper
Bounds on secret key exchange using a random deal of cards1996-08-28Paper
https://portal.mardi4nfdi.de/entity/Q31404541994-11-10Paper
Fishspear: a priority queue algorithm1994-06-29Paper
https://portal.mardi4nfdi.de/entity/Q42873591994-04-12Paper
https://portal.mardi4nfdi.de/entity/Q40357131993-05-18Paper
Space-efficient asynchronous consensus without shared memory initialization1993-05-16Paper
Optimal placement of identical resources in a tree1992-06-28Paper
https://portal.mardi4nfdi.de/entity/Q32112521991-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38117561988-01-01Paper
Efficient fault-tolerant routings in networks1987-01-01Paper
Interpreting logics of knowledge in propositional dynamic logic1987-01-01Paper
Easy impossibility proofs for distributed consensus problems1986-01-01Paper
Probabilistic analysis of a network resource allocation algorithm1986-01-01Paper
Impossibility of distributed consensus with one faulty process1985-01-01Paper
A technique for decomposing algorithms which use a single shared variable1983-01-01Paper
Storage requirements for fair scheduling1983-01-01Paper
https://portal.mardi4nfdi.de/entity/Q36662681983-01-01Paper
Efficiency of Synchronous Versus Asynchronous Distributed Systems1983-01-01Paper
A lower bound for the time to assure interactive consistency1982-01-01Paper
$\Omega (n\log n)$ Lower Bounds on Length of Boolean Formulas1982-01-01Paper
An efficient algorithm for byzantine agreement without authentication1982-01-01Paper
On describing the behavior and implementation of distributed systems1981-01-01Paper
A time-space tradeoff for sorting on non-oblivious machines1981-01-01Paper
Parallel Prefix Computation1980-01-01Paper
Propositional dynamic logic of regular programs1979-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38608331979-01-01Paper
Relations Among Complexity Measures1979-01-01Paper
Separating Nondeterministic Time Complexity Classes1978-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41959451977-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41973391977-01-01Paper
Relativization of the Theory of Computational Complexity1976-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41381271976-01-01Paper
https://portal.mardi4nfdi.de/entity/Q40929931975-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41612581975-01-01Paper
Fast on-line integer multiplication1974-01-01Paper
https://portal.mardi4nfdi.de/entity/Q40551561974-01-01Paper
https://portal.mardi4nfdi.de/entity/Q40551961974-01-01Paper
https://portal.mardi4nfdi.de/entity/Q40822961974-01-01Paper
The String-to-String Correction Problem1974-01-01Paper
https://portal.mardi4nfdi.de/entity/Q40680741973-01-01Paper
Fast on-line integer multiplication1973-01-01Paper
https://portal.mardi4nfdi.de/entity/Q56321341970-01-01Paper
Real-time solutions of the origin-crossing problem1968-01-01Paper

Research outcomes over time


Doctoral students

No records found.


Known relations from the MaRDI Knowledge Graph

PropertyValue
MaRDI profile typeMaRDI person profile
instance ofhuman


This page was built for person: Michael J. Fischer