Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
[1]
Hilfe
Suche: Author="Jakoby, Andreas"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Algorithmic meta theorems for circuit classes of constant and logarithmic depth
Michael Elberfeld
,
Andreas Jakoby
,
Till Tantau
Leibniz International Proceedings in Informatics (LIPIcs)
14
, 2012, pp. 66-77
Privacy in non-private environments
Markus Bläser
,
Andreas Jakoby
,
Maciej Liśkiewicz
,
Bodo Manthey
Theory of Computing Systems
48
(1), 2011, pp. 211-245
Improving the average delay of sorting
Andreas Jakoby
,
Maciej Liśkiewicz
,
Rüdiger Reischuk
,
Christian Schindelhauer
Theoretical Computer Science
410
(11), 2009, pp. 1030-1041
Communications in unknown networks: Preserving the secret of topology
Markus Hinkelmann
,
Andreas Jakoby
Theoretical Computer Science
384
(2-3), 2007, pp. 184-200
Logspace algorithms for computing shortest and longest paths in series-parallel graphs
Andreas Jakoby
,
Till Tantau
Lecture Notes in Computer Science
4855
, 2007, pp. 216-227
Space efficient algorithms for directed series-parallel graphs
Andreas Jakoby
,
Maciej Liśkiewicz
,
Rüdiger Reischuk
Journal of Algorithms
60
(2), 2006, pp. 85-114
Private computations in networks: Topology versus randomness
Andreas Jakoby
,
Maciej Liśkiewicz
,
Rüdiger Reischuk
Lecture Notes in Computer Science
2607
, 2003, pp. 121-132
Paths problems in symmetric logarithmic space
Andreas Jakoby
,
Maciej Liśkiewicz
Lecture Notes in Computer Science
2380
, 2002, pp. 269-280
Space efficient algorithms for series-parallel graphs
Andreas Jakoby
,
Maciej Liśkiewicz
,
Rüdiger Reischuk
Lecture Notes in Computer Science
2010
, 2001, pp. 339-352
Approximating schedules for dynamic graphs efficiently
Andreas Jakoby
,
Maciaj Liśkiewicz
,
Rüdiger Reischuk
Technical Report (TR01-038), 2001
Dynamic process graphs and the complexity of scheduling
Andreas Jakoby
,
Maciej Liskiewicz
,
Rüdiger Reischuk
Technical Report (TR01-090), 2001
The complexity of some basic problems for dynamic process graphs
Andreas Jakoby
,
Maciej Liśkiewicz
Lecture Notes in Computer Science
2223
, 2001, pp. 562-574
Efficient addition on field programmable gate arrays
Andreas Jakoby
,
Christian Schindelhauer
Lecture Notes in Computer Science
2245
, 2001, pp. 219-231
The expressive power and complexity of dynamic process graphs
Andreas Jakoby
,
Maciej Liśkiewicz
,
Rüdiger Reischuk
Lecture Notes in Computer Science
1928
, 2000, pp. 230-242
Average case complexity of unbounded fanin circuits
Andreas Jakoby
,
Rüdiger Reischuk
Proceedings of the 15th Annual IEEE Conference on Computational Complexity (Florence, Italy, July 4-7, 2000)
, 2000, pp. 170-185
Malign distributions for average case circuit complexity
Andreas Jakoby
,
Rüdiger Reischuk
,
Christian Schindelhauer
Information and Computation
150
(2), 1999, pp. 187-208
The average time complexity to compute prefix functions in processor networks
Andreas Jakoby
Lecture Notes in Computer Science
1563
, 1999, pp. 78-89
The non-recursive power of erroneous computation
Christian Schindelhauer
,
Andreas Jakoby
Lecture Notes in Computer Science
1738
, 1999, pp. 394-406
The complexity of broadcasting in planar and decomposable graphs
Andreas Jakoby
,
Rüdiger Reischuk
,
Christian Schindelhauer
Discrete Applied Mathematics
83
(1-3), 1998, pp. 179-206
Die Komplexität von Präfixfunktionen bezüglich ihres mittleren Zeitverhaltens
Andreas Jakoby
dissertation, 1998
Malign distributions for average case circuit complexity
Andreas Jakoby
,
Rüdiger Reischuk
,
Christian Schindelhauer
Lecture Notes in Computer Science
900
, 1995, pp. 628-639
The complexity of broadcasting in planar and decomposable graphs
Andreas Jakoby
,
Rüdiger Reischuk
,
Christian Schindelhauer
Technical Report (A-95-08), 1995, January
The complexity of broadcasting in planar and decomposable graphs
Andreas Jakoby
,
Rüdiger Reischuk
,
Christian Schindelhauer
Lecture Notes in Computer Science
903
, 1995, pp. 219-231
Data transmission in processor networks
Andreas Jakoby
,
Rüdiger Reischuk
Lecture Notes in Computer Science
972
, 1995, pp. 145-159
The average case complexity of the parallel prefix problem
Andreas Jakoby
,
Rüdiger Reischuk
,
Christian Schindelhauer
,
Stephan Weis
Lecture Notes in Computer Science
820
, 1994, pp. 593-604
Seiten 1
2
>