Andreas Jakoby
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Andreas Jakoby has a total of 10 co-authors. Here are the top co-authors by number of shared publications:
- Maciej Liśkiewicz
Institute for Theoretical Computer Science University of Lübeck Germany
3 shared publications - Markus Hinkelmann
Universität zu Lübeck, Germany
2 shared publications - Bodo Manthey
Universität zu Lübeck, Institut für Theoretische Informatik, Ratzeburger Allee 160, 23538 Lübeck, Germany
1 shared publication - Bodo Manthey
Department of Applied Mathematics, University of Twente, Enschede, The Netherlands
1 shared publication - Jan Arpe
Institut für Theoretische Informatik, Universität zu Lübeck, Razeburger Allee 160, 23538 Lübeck, Germany;;
1 shared publication Maciej Liśkiewicz
Institut für Theoretische Informatik, Universität zu Lübeck, Razeburger Allee 160, 23538 Lübeck, Germany;;
1 shared publication
Latest Publications
- 16 October 2009
- Published by Springer Nature in Theory of Computing Systems
- Vol. 48 (1) , 211-245
Privacy in Non-private Environments
- 16 October 2009
- Published by Springer Nature in Theory of Computing Systems
- Vol. 48 (1) , 211-245
Privacy in Non-private Environments
- 1 September 2008
- Published by Springer Nature in Journal of Computer Science and Technology
- Vol. 23 (5) , 694-710
t-Private and t-Secure Auctions
- 1 September 2008
- Published by Springer Nature in Journal of Computer Science and Technology
- Vol. 23 (5) , 694-710
t-Private and t-Secure Auctions
- 1 October 2007
- Published by Elsevier in Theoretical Computer Science
- Vol. 384 (2-3) , 184-200
Communications in unknown networks: Preserving the secret of topology
- 1 October 2007
- Published by Elsevier in Theoretical Computer Science
- Vol. 384 (2-3) , 184-200
Communications in unknown networks: Preserving the secret of topology
- 31 August 2006
- Published by Elsevier in Journal of Algorithms
- Vol. 60 (2) , 85-114
Space efficient algorithms for directed series–parallel graphs
- 31 August 2006
- Published by Elsevier in Journal of Algorithms
- Vol. 60 (2) , 85-114
Space efficient algorithms for directed series–parallel graphs
- 15 October 2005
- Published by EDP Sciences in RAIRO - Theoretical Informatics and Applications
- Vol. 39 (4) , 687-706
One-way communication complexity of symmetric Boolean functions
We study deterministic one-way communication complexity of functions with Hankel communication matrices. Some structural properties of such matrices are established and applied to the one-way two-party communication complexity of symmetric Boolean functions. It is shown that the number of required communication bits does not depend on the communication direction, provided that neither direction needs maximum complexity. Moreover, in order to obtain an optimal protocol, it is in any case sufficient to consider only the communication direction from the party with the shorter input to the other party. These facts do not hold for arbitrary Boolean functions in general. Next, gaps between one-way and two-way communication complexity for symmetric Boolean functions are discussed. Finally, we give some generalizations to the case of multiple parties.
- 15 October 2005
- Published by EDP Sciences in RAIRO - Theoretical Informatics and Applications
- Vol. 39 (4) , 687-706
One-way communication complexity of symmetric Boolean functions
We study deterministic one-way communication complexity of functions with Hankel communication matrices. Some structural properties of such matrices are established and applied to the one-way two-party communication complexity of symmetric Boolean functions. It is shown that the number of required communication bits does not depend on the communication direction, provided that neither direction needs maximum complexity. Moreover, in order to obtain an optimal protocol, it is in any case sufficient to consider only the communication direction from the party with the shorter input to the other party. These facts do not hold for arbitrary Boolean functions in general. Next, gaps between one-way and two-way communication complexity for symmetric Boolean functions are discussed. Finally, we give some generalizations to the case of multiple parties.
- 27 May 2005
- Published by Springer Nature in Journal of Cryptology
- Vol. 19 (3) , 341-357
Private Computation: k-Connected versus 1-Connected Networks
- 27 May 2005
- Published by Springer Nature in Journal of Cryptology
- Vol. 19 (3) , 341-357
Private Computation: k-Connected versus 1-Connected Networks