| Publication | Date of Publication | Type |
|---|
| One-Dimensional Short-Range Nearest-Neighbor Interaction and Its Nonlinear Diffusion Limit | 2024-02-08 | Paper |
| Efficiency of Equivalence Algorithms | 2021-07-06 | Paper |
| Micro- and macroscopic modeling of crowding and pushing in corridors | 2021-01-08 | Paper |
| Appraising two decades of distributed computing theory research | 2020-12-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4602972 | 2018-02-08 | Paper |
| Fréchet Differentiability of Unsteady Incompressible Navier--Stokes Flow with Respect to Domain Variations of Low Regularity by Using a General Analytical Framework | 2017-11-02 | Paper |
| Application of parametric model reduction with matrix interpolation for simulation of moving loads in elastic multibody systems | 2016-01-13 | Paper |
| Computation in networks of passively mobile finite-state sensors | 2015-08-03 | Paper |
| Secure sealed-bid online auctions using discreet cryptographic proofs | 2014-05-14 | Paper |
| Some properties of precedence languages | 2014-03-14 | Paper |
| Greedy-based approximation of frequency-weighted Gramian matrices for model reduction in multibody dynamics | 2013-10-29 | Paper |
| Computation in networks of passively mobile finite-state sensors | 2013-06-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3365739 | 2006-01-23 | Paper |
| A minimal model for studying properties of the mode-coupling type instability in friction induced oscillations | 2003-05-14 | Paper |
| Towards understanding the predictability of stock markets from the perspective of computational complexity | 2002-07-22 | Paper |
| Optimal layout of edge-weighted forests | 1999-07-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4218401 | 1999-02-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4391216 | 1998-09-13 | Paper |
| The Wakeup Problem | 1997-06-09 | Paper |
| A secure protocol for the oblivious transfer. (Extended abstract) | 1996-11-24 | Paper |
| Bounds on secret key exchange using a random deal of cards | 1996-08-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3140454 | 1994-11-10 | Paper |
| Fishspear: a priority queue algorithm | 1994-06-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4287359 | 1994-04-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4035713 | 1993-05-18 | Paper |
| Space-efficient asynchronous consensus without shared memory initialization | 1993-05-16 | Paper |
| Optimal placement of identical resources in a tree | 1992-06-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3211252 | 1991-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3811756 | 1988-01-01 | Paper |
| Efficient fault-tolerant routings in networks | 1987-01-01 | Paper |
| Interpreting logics of knowledge in propositional dynamic logic | 1987-01-01 | Paper |
| Easy impossibility proofs for distributed consensus problems | 1986-01-01 | Paper |
| Probabilistic analysis of a network resource allocation algorithm | 1986-01-01 | Paper |
| Impossibility of distributed consensus with one faulty process | 1985-01-01 | Paper |
| Efficiency of Synchronous Versus Asynchronous Distributed Systems | 1983-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3666268 | 1983-01-01 | Paper |
| A technique for decomposing algorithms which use a single shared variable | 1983-01-01 | Paper |
| Storage requirements for fair scheduling | 1983-01-01 | Paper |
| An efficient algorithm for byzantine agreement without authentication | 1982-01-01 | Paper |
| A lower bound for the time to assure interactive consistency | 1982-01-01 | Paper |
| $\Omega (n\log n)$ Lower Bounds on Length of Boolean Formulas | 1982-01-01 | Paper |
| On describing the behavior and implementation of distributed systems | 1981-01-01 | Paper |
| A time-space tradeoff for sorting on non-oblivious machines | 1981-01-01 | Paper |
| Parallel Prefix Computation | 1980-01-01 | Paper |
| Propositional dynamic logic of regular programs | 1979-01-01 | Paper |
| Relations Among Complexity Measures | 1979-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3860833 | 1979-01-01 | Paper |
| Separating Nondeterministic Time Complexity Classes | 1978-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4197339 | 1977-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4195945 | 1977-01-01 | Paper |
| Relativization of the Theory of Computational Complexity | 1976-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4138127 | 1976-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4092993 | 1975-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4161258 | 1975-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4055156 | 1974-01-01 | Paper |
| The String-to-String Correction Problem | 1974-01-01 | Paper |
| Fast on-line integer multiplication | 1974-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4082296 | 1974-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4055196 | 1974-01-01 | Paper |
| Fast on-line integer multiplication | 1973-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4068074 | 1973-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5632134 | 1970-01-01 | Paper |
| Real-time solutions of the origin-crossing problem | 1968-01-01 | Paper |
