Stop the war!

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

for scientists:

default search action

combined dblp search
author search
venue search
publication search

ask others

Andreas Goerdt

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 Frank Schädlich

> Home > Persons > Andreas Goerdt

Publications

2004
[j15]
- view
  - electronic edition via DOI (open access)
  - references & citations
  authority control:
- export record
  dblp key:
  - journals/tcs/Coja-OghlanGLS04
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/tcs/Coja-OghlanGLS04
Amin Coja-Oghlan, Andreas Goerdt, André Lanka, Frank Schädlich:
Techniques from combinatorial approximation algorithms yield efficient algorithms for random 2k-SAT. Theor. Comput. Sci. 329(1-3): 1-45 (2004)
2003
[c23]
- view
  authority control:
- export record
  dblp key:
  - conf/fct/Coja-OghlanGLS03
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/fct/Coja-OghlanGLS03
Amin Coja-Oghlan, Andreas Goerdt, André Lanka, Frank Schädlich:
Certifying Unsatisfiability of Random 2k-SAT Formulas Using Approximation Techniques. FCT 2003: 15-26
[i1]
- view
  - electronic edition @ weizmann.ac.il (open access)
  - no references & citations available
- export record
  dblp key:
  - journals/eccc/ECCC-TR03-030
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/eccc/ECCC-TR03-030
Amin Coja-Oghlan, Andreas Goerdt, André Lanka, Frank Schädlich:
Certifying Unsatisfiability of Random 2k-SAT Formulas using Approximation Techniques. Electron. Colloquium Comput. Complex. TR03 (2003)

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.