Andreas Jakoby

From MaRDI portal
Person:850499

Available identifiers

zbMath Open jakoby.andreasMaRDI QIDQ850499

List of research outcomes





PublicationDate of PublicationType
The complexity of broadcasting in planar and decomposable graphs2024-01-05Paper
Data transmission in processor networks2023-12-01Paper
The complexity of scheduling problems with communication delays for trees2022-12-09Paper
The average case complexity of the parallel prefix problem2019-04-29Paper
Malign distributions for average case circuit complexity2017-12-04Paper
On the complexity of worst case and expected time in a circuit2017-11-16Paper
Circuit complexity: from the worst case to the average case2016-09-01Paper
Algorithmic meta theorems for circuit classes of constant and logarithmic depth2012-08-23Paper
Privacy in non-private environments2011-04-01Paper
One-way communication complexity of symmetric Boolean functions.2010-04-20Paper
Preserving Privacy versus Data Retention2009-06-03Paper
Improving the average delay of sorting2009-03-20Paper
Susceptible Two-Party Quantum Computations2009-01-09Paper
Logspace Algorithms for Computing Shortest and Longest Paths in Series-Parallel Graphs2008-04-24Paper
Revealing Additional Information in Two-Party Computations2008-03-18Paper
Improving the Average Delay of Sorting2007-11-13Paper
t-Private and Secure Auctions2007-11-13Paper
Communications in unknown networks: preserving the secret of topology2007-10-02Paper
Approximating schedules for dynamic process graphs efficiently2007-04-26Paper
Private computation: \(k\)-connected versus 1-connected networks2006-11-03Paper
Space efficient algorithms for directed series–parallel graphs2006-10-05Paper
Structural Information and Communication Complexity2005-11-30Paper
Privacy in Non-private Environments2005-08-12Paper
https://portal.mardi4nfdi.de/entity/Q47371632004-08-11Paper
https://portal.mardi4nfdi.de/entity/Q44742202004-08-04Paper
https://portal.mardi4nfdi.de/entity/Q44741222004-08-04Paper
https://portal.mardi4nfdi.de/entity/Q44186422003-08-11Paper
https://portal.mardi4nfdi.de/entity/Q44091192003-06-30Paper
Malign distributions for average case circuit complexity.2003-01-14Paper
https://portal.mardi4nfdi.de/entity/Q27666852002-07-09Paper
https://portal.mardi4nfdi.de/entity/Q27668912002-06-25Paper
https://portal.mardi4nfdi.de/entity/Q27627912002-01-09Paper
https://portal.mardi4nfdi.de/entity/Q45016852000-11-07Paper
The complexity of broadcasting in planar and decomposable graphs1998-12-02Paper
Finite-element semi-discretization of linearized compressible and resistive MHD1986-01-01Paper

Research outcomes over time

This page was built for person: Andreas Jakoby