The following pages link to Michael J. Fischer (Q800080):
Displaying 50 items.
- A technique for decomposing algorithms which use a single shared variable (Q800081) (← links)
- Micro- and macroscopic modeling of crowding and pushing in corridors (Q828464) (← links)
- Application of parametric model reduction with matrix interpolation for simulation of moving loads in elastic multibody systems (Q904238) (← links)
- Storage requirements for fair scheduling (Q1054474) (← links)
- Easy impossibility proofs for distributed consensus problems (Q1079947) (← links)
- Efficient fault-tolerant routings in networks (Q1091360) (← links)
- Interpreting logics of knowledge in propositional dynamic logic (Q1096609) (← links)
- On describing the behavior and implementation of distributed systems (Q1143167) (← links)
- A time-space tradeoff for sorting on non-oblivious machines (Q1152950) (← links)
- A lower bound for the time to assure interactive consistency (Q1168726) (← links)
- Optimal placement of identical resources in a tree (Q1184728) (← links)
- Space-efficient asynchronous consensus without shared memory initialization (Q1209330) (← links)
- Propositional dynamic logic of regular programs (Q1258296) (← links)
- Optimal layout of edge-weighted forests (Q1276965) (← links)
- Fast on-line integer multiplication (Q1847139) (← links)
- A minimal model for studying properties of the mode-coupling type instability in friction induced oscillations (Q1872674) (← links)
- Bounds on secret key exchange using a random deal of cards (Q1916027) (← links)
- A secure protocol for the oblivious transfer. (Extended abstract) (Q1924198) (← links)
- Computation in networks of passively mobile finite-state sensors (Q2375293) (← links)
- Secure sealed-bid online auctions using discreet cryptographic proofs (Q2450498) (← links)
- (Q2768376) (← links)
- Greedy-based approximation of frequency-weighted Gramian matrices for model reduction in multibody dynamics (Q2856581) (← links)
- (Q3140454) (← links)
- (Q3211252) (← links)
- (Q3365739) (← links)
- (Q3666268) (← links)
- Probabilistic analysis of a network resource allocation algorithm (Q3720324) (← links)
- Efficiency of Synchronous Versus Asynchronous Distributed Systems (Q3763580) (← links)
- Impossibility of distributed consensus with one faulty process (Q3766835) (← links)
- (Q3811756) (← links)
- (Q3860833) (← links)
- Parallel Prefix Computation (Q3890136) (← links)
- $\Omega (n\log n)$ Lower Bounds on Length of Boolean Formulas (Q3950469) (← links)
- (Q4035713) (← links)
- (Q4055156) (← links)
- (Q4055196) (← links)
- (Q4068074) (← links)
- (Q4082296) (← links)
- (Q4092993) (← links)
- Relativization of the Theory of Computational Complexity (Q4124321) (← links)
- (Q4138127) (← links)
- Separating Nondeterministic Time Complexity Classes (Q4142696) (← links)
- (Q4161258) (← links)
- Relations Among Complexity Measures (Q4191603) (← links)
- (Q4195945) (← links)
- (Q4197339) (← links)
- (Q4218401) (← links)
- (Q4287359) (← links)
- Fishspear: a priority queue algorithm (Q4299294) (← links)
- (Q4391216) (← links)
