Stop the war!

Остановите войну!

for scientists:

default search action

combined dblp search
author search
venue search
publication search

ask others

Andreas Jakoby

Name: dblp XML data dump
Creator: Schloss Dagstuhl - Leibniz Center for Informatics
Published: 1993
License: https://creativecommons.org/publicdomain/zero/1.0/
Keywords: dblp, XML, computer science, scholarly publications, metadata

◀ ▷ joint publications with Till Tantau

> Home > Persons > Andreas Jakoby

Publications

2012
[c32]
- view
  - electronic edition via DOI (open access)
  - references & citations
  authority control:
- export record
  dblp key:
  - conf/stacs/ElberfeldJT12
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/stacs/ElberfeldJT12
Michael Elberfeld, Andreas Jakoby, Till Tantau:
Algorithmic Meta Theorems for Circuit Classes of Constant and Logarithmic Depth. STACS 2012: 66-77
2011
[i11]
- view
  - electronic edition @ weizmann.ac.il (open access)
  - no references & citations available
- export record
  dblp key:
  - journals/eccc/ElberfeldJT11
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/eccc/ElberfeldJT11
Michael Elberfeld, Andreas Jakoby, Till Tantau:
Algorithmic Meta Theorems for Circuit Classes of Constant and Logarithmic Depth. Electron. Colloquium Comput. Complex. TR11 (2011)
2010
[c31]
- view
  authority control:
- export record
  dblp key:
  - conf/focs/ElberfeldJT10
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/focs/ElberfeldJT10
Michael Elberfeld, Andreas Jakoby, Till Tantau:
Logspace Versions of the Theorems of Bodlaender and Courcelle. FOCS 2010: 143-152
[i10]
- view
  - electronic edition @ weizmann.ac.il (open access)
  - no references & citations available
- export record
  dblp key:
  - journals/eccc/ElberfeldJT10
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/eccc/ElberfeldJT10
Michael Elberfeld, Andreas Jakoby, Till Tantau:
Logspace Versions of the Theorems of Bodlaender and Courcelle. Electron. Colloquium Comput. Complex. TR10 (2010)
2007
[c27]
- view
  authority control:
- export record
  dblp key:
  - conf/fsttcs/JakobyT07
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/fsttcs/JakobyT07
Andreas Jakoby, Till Tantau:
Logspace Algorithms for Computing Shortest and Longest Paths in Series-Parallel Graphs. FSTTCS 2007: 216-227
2006
[i8]
- view
  - electronic edition @ dagstuhl.de (open access)
  - no references & citations available
- export record
  dblp key:
  - conf/dagstuhl/JakobyT06
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/dagstuhl/JakobyT06
Andreas Jakoby, Till Tantau:
Computing Shortest Paths in Series-Parallel Graphs in Logarithmic Space. Complexity of Boolean Functions 2006

a service of

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.