The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Andreas Jakoby: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Markus Bläser, Andreas Jakoby, Maciej Liskiewicz, Bodo Manthey
    Privacy in Non-private Environments. [Citation Graph (0, 0)][DBLP]
    ASIACRYPT, 2004, pp:137-151 [Conf]
  2. Andreas Jakoby, Maciej Liskiewicz
    Revealing Additional Information in Two-Party Computations. [Citation Graph (0, 0)][DBLP]
    ASIACRYPT, 2005, pp:121-135 [Conf]
  3. Andreas Jakoby, Rüdiger Reischuk
    Average Case Complexity of Unbounded Fanin Circuits. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 2000, pp:170-0 [Conf]
  4. Markus Bläser, Andreas Jakoby, Maciej Liskiewicz, Bodo Siebert
    Private Computation - k-Connected versus 1-Connected Networks. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 2002, pp:194-209 [Conf]
  5. Jan Arpe, Andreas Jakoby, Maciej Liskiewicz
    One-Way Communication Complexity of Symmetric Boolean Functions. [Citation Graph (0, 0)][DBLP]
    FCT, 2003, pp:158-170 [Conf]
  6. Andreas Jakoby, Christian Schindelhauer
    Efficient Addition on Field Programmable Gate Arrays. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 2001, pp:219-231 [Conf]
  7. Christian Schindelhauer, Andreas Jakoby
    The Non-Recursive Power of Erroneous Computation. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1999, pp:394-406 [Conf]
  8. Andreas Jakoby, Maciej Liskiewicz
    Paths Problems in Symmetric Logarithmic Space. [Citation Graph (0, 0)][DBLP]
    ICALP, 2002, pp:269-280 [Conf]
  9. Andreas Jakoby, Rüdiger Reischuk, Christian Schindelhauer, Stephan Weis
    The Average Case Complexity of the Parallel Prefix Problem. [Citation Graph (0, 0)][DBLP]
    ICALP, 1994, pp:593-604 [Conf]
  10. Andreas Jakoby, Maciej Liskiewicz
    The Complexity of Some Basic Problems for Dynamic Process Graphs. [Citation Graph (0, 0)][DBLP]
    ISAAC, 2001, pp:562-574 [Conf]
  11. Andreas Jakoby, K. Degener-Boening, A. Gohlke, P. Schrott
    Ein Konzept zur verteilten Datenhaltung in einem Netz mit Standard-Datenbanksystemen als Elementareinheiten. [Citation Graph (0, 0)][DBLP]
    Kommunikation in Verteilten Systemen, 1991, pp:201-215 [Conf]
  12. Markus Hinkelmann, Andreas Jakoby
    Communications in Unknown Networks: Preserving the Secret of Topology. [Citation Graph (0, 0)][DBLP]
    SIROCCO, 2005, pp:155-169 [Conf]
  13. Andreas Jakoby
    The Average Time Complexity to Compute Prefix Functions in Processor Networks. [Citation Graph (0, 0)][DBLP]
    STACS, 1999, pp:78-89 [Conf]
  14. Andreas Jakoby, Maciej Liskiewicz, Rüdiger Reischuk
    Space Efficient Algorithms for Series-Parallel Graphs. [Citation Graph (0, 0)][DBLP]
    STACS, 2001, pp:339-352 [Conf]
  15. Andreas Jakoby, Maciej Liskiewicz, Rüdiger Reischuk
    Private Computations in Networks: Topology versus Randomness. [Citation Graph (0, 0)][DBLP]
    STACS, 2003, pp:121-132 [Conf]
  16. Andreas Jakoby, Maciej Liskiewicz, Rüdiger Reischuk
    Scheduling Dynamic Graphs. [Citation Graph (0, 0)][DBLP]
    STACS, 1999, pp:383-392 [Conf]
  17. Andreas Jakoby, Rüdiger Reischuk, Christian Schindelhauer
    Malign Distributions for Average Case Circuit Complexity. [Citation Graph (0, 0)][DBLP]
    STACS, 1995, pp:628-639 [Conf]
  18. Andreas Jakoby, Christian Schindelhauer
    On the Complexity of Worst Case and Expected Time in a Circuit. [Citation Graph (0, 0)][DBLP]
    STACS, 1996, pp:295-306 [Conf]
  19. Andreas Jakoby, Rüdiger Reischuk, Christian Schindelhauer
    Circuit complexity: from the worst case to the average case. [Citation Graph (0, 0)][DBLP]
    STOC, 1994, pp:58-67 [Conf]
  20. Andreas Jakoby, Rüdiger Reischuk
    The Complexity of Scheduling Problems with Communication Delays for Trees. [Citation Graph (0, 0)][DBLP]
    SWAT, 1992, pp:165-177 [Conf]
  21. Faith E. Fich, Andreas Jakoby
    Short Headers Suffice for Communication in a DAG with Link Failures. [Citation Graph (0, 0)][DBLP]
    DISC, 2000, pp:360-373 [Conf]
  22. Andreas Jakoby, Rüdiger Reischuk
    Data Transmission in Processor Networks. [Citation Graph (0, 0)][DBLP]
    WDAG, 1995, pp:145-159 [Conf]
  23. Andreas Jakoby, Maciej Liskiewicz, Rüdiger Reischuk
    The Expressive Power and Complexity of Dynamic Process Graphs. [Citation Graph (0, 0)][DBLP]
    WG, 2000, pp:230-242 [Conf]
  24. Andreas Jakoby, Rüdiger Reischuk, Christian Schindelhauer
    The Complexity of Broadcasting in Planar and Decomposable Graphs. [Citation Graph (0, 0)][DBLP]
    WG, 1994, pp:219-231 [Conf]
  25. Andreas Jakoby, Rüdiger Reischuk, Christian Schindelhauer
    The complexity of broadcasting in planar and decomposable graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1998, v:83, n:1-3, pp:179-206 [Journal]
  26. Andreas Jakoby, Maciej Liskiewicz, Rüdiger Reischuk
    Dynamic Process Graphs and the Complexity of Scheduling [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2001, v:, n:090, pp:- [Journal]
  27. Andreas Jakoby, Maciej Liskiewicz, Rüdiger Reischuk
    Space Efficient Algorithms for Directed Series-Parallel Graphs [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2002, v:, n:021, pp:- [Journal]
  28. Markus Bläser, Andreas Jakoby, Maciej Liskiewicz, Bodo Manthey
    Private Computation - k-connected versus 1-connected Networks [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2003, v:10, n:009, pp:- [Journal]
  29. Markus Bläser, Andreas Jakoby, Maciej Liskiewicz, Bodo Manthey
    Privacy in Non-Private Environments [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2003, v:, n:071, pp:- [Journal]
  30. Jan Arpe, Andreas Jakoby, Maciej Liskiewicz
    One-Way Communication Complexity of Symmetric Boolean Functions [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2003, v:, n:083, pp:- [Journal]
  31. Andreas Jakoby, Rüdiger Reischuk, Christian Schindelhauer
    Malign Distributions for Average Case Circuit Complexity. [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 1999, v:150, n:2, pp:187-208 [Journal]
  32. Andreas Jakoby, Maciej Liskiewicz, Rüdiger Reischuk
    Space efficient algorithms for directed series-parallel graphs. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 2006, v:60, n:2, pp:85-114 [Journal]
  33. Andreas Jakoby, Maciej Liskiewicz, Rüdiger Reischuk
    Approximating schedules for dynamic process graphs efficiently. [Citation Graph (0, 0)][DBLP]
    J. Discrete Algorithms, 2004, v:2, n:4, pp:471-500 [Journal]
  34. Markus Bläser, Andreas Jakoby, Maciej Liskiewicz, Bodo Manthey
    Private Computation: k-Connected versus 1-Connected Networks. [Citation Graph (0, 0)][DBLP]
    J. Cryptology, 2006, v:19, n:3, pp:341-357 [Journal]
  35. Andreas Jakoby, Maciej Liskiewicz, Rüdiger Reischuk, Christian Schindelhauer
    Improving the Average Delay of Sorting. [Citation Graph (0, 0)][DBLP]
    TAMC, 2007, pp:330-341 [Conf]
  36. Markus Hinkelmann, Andreas Jakoby, Peer Stechert
    t -Private and Secure Auctions. [Citation Graph (0, 0)][DBLP]
    TAMC, 2007, pp:486-498 [Conf]
  37. Andreas Jakoby, Maciej Liskiewicz, Aleksander Madry
    Using quantum oblivious transfer to cheat sensitive quantum bit commitment [Citation Graph (0, 0)][DBLP]
    CoRR, 2006, v:0, n:, pp:- [Journal]
  38. Markus Hinkelmann, Andreas Jakoby
    Communications in unknown networks: Preserving the secret of topology. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2007, v:384, n:2-3, pp:184-200 [Journal]

  39. Using Quantum Oblivious Transfer to Cheat Sensitive Quantum Bit Commitment. [Citation Graph (, )][DBLP]


  40. Computing Shortest Paths in Series-Parallel Graphs in Logarithmic Space. [Citation Graph (, )][DBLP]


  41. Logspace Algorithms for Computing Shortest and Longest Paths in Series-Parallel Graphs. [Citation Graph (, )][DBLP]


  42. Preserving Privacy versus Data Retention. [Citation Graph (, )][DBLP]


  43. Susceptible Two-Party Quantum Computations. [Citation Graph (, )][DBLP]


  44. A Cryptographically t-Private Auction System. [Citation Graph (, )][DBLP]


  45. Using Quantum Oblivious Transfer to Cheat Sensitive Quantum Bit Commitment. [Citation Graph (, )][DBLP]


Search in 0.003secs, Finished in 0.004secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002