The following pages link to Andreas Jakoby (Q850499):
Displayed 36 items.
- Private computation: \(k\)-connected versus 1-connected networks (Q850501) (← links)
- Approximating schedules for dynamic process graphs efficiently (Q876729) (← links)
- Improving the average delay of sorting (Q1007244) (← links)
- The complexity of broadcasting in planar and decomposable graphs (Q1392535) (← links)
- (Q1819638) (redirect page) (← links)
- Finite-element semi-discretization of linearized compressible and resistive MHD (Q1819639) (← links)
- Malign distributions for average case circuit complexity. (Q1854270) (← links)
- Communications in unknown networks: preserving the secret of topology (Q2382672) (← links)
- Privacy in non-private environments (Q2429730) (← links)
- (Q2762791) (← links)
- (Q2766685) (← links)
- (Q2766891) (← links)
- Circuit complexity (Q2817597) (← links)
- Algorithmic Meta Theorems for Circuit Classes of Constant and Logarithmic Depth (Q2904750) (← links)
- Preserving Privacy versus Data Retention (Q3630210) (← links)
- (Q4409119) (← links)
- (Q4418642) (← links)
- (Q4474122) (← links)
- (Q4474220) (← links)
- (Q4501685) (← links)
- On the complexity of worst case and expected time in a circuit (Q4593940) (← links)
- Malign distributions for average case circuit complexity (Q4596659) (← links)
- The average case complexity of the parallel prefix problem (Q4632459) (← links)
- (Q4737163) (← links)
- The complexity of scheduling problems with communication delays for trees (Q5056138) (← links)
- Improving the Average Delay of Sorting (Q5425446) (← links)
- t-Private and Secure Auctions (Q5425460) (← links)
- Revealing Additional Information in Two-Party Computations (Q5451067) (← links)
- Logspace Algorithms for Computing Shortest and Longest Paths in Series-Parallel Graphs (Q5458836) (← links)
- Privacy in Non-private Environments (Q5465808) (← links)
- Space efficient algorithms for directed series–parallel graphs (Q5491454) (← links)
- Susceptible Two-Party Quantum Computations (Q5502797) (← links)
- Structural Information and Communication Complexity (Q5710081) (← links)
- Fundamentals of Computation Theory (Q5900794) (← links)
- Data transmission in processor networks (Q6084553) (← links)
- The complexity of broadcasting in planar and decomposable graphs (Q6184371) (← links)