dblp.uni-trier.dewww.dagstuhl.dewww.uni-trier.de

Amin Coja-Oghlan (Selection)

List of publications from the DBLP Bibliography Server - FAQ
Ask others: ACM DL/Guide - CiteSeerX - CSB - MetaPress - Google - Bing - Yahoo

Ask others: ACM DL/Guide - CiteSeerX - CSB - MetaPress - Google - Bing - Yahoo


33Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLAmin Coja-Oghlan, Andreas Goerdt, André Lanka: Strong Refutation Heuristics for Random k-SAT. Combinatorics, Probability & Computing 16(1): 5-28 (2007)
26Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLAmin Coja-Oghlan, Andreas Goerdt, André Lanka: Spectral Partitioning of Random Graphs with Given Expected Degrees. IFIP TCS 2006: 271-282
16Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLAmin Coja-Oghlan, Andreas Goerdt, André Lanka: Strong Refutation Heuristics for Random k-SAT. APPROX-RANDOM 2004: 310-321
12Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLAmin 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)
11Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLAmin Coja-Oghlan, Andreas Goerdt, André Lanka, Frank Schädlich: Certifying Unsatisfiability of Random 2k-SAT Formulas Using Approximation Techniques. FCT 2003: 15-26
5Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLAmin Coja-Oghlan, Andreas Goerdt, André Lanka, Frank Schädlich: Certifying Unsatisfiability of Random 2k-SAT Formulas using Approximation Techniques Electronic Colloquium on Computational Complexity (ECCC) 10(030): (2003)

Selection of 6 from 71 records - Amin Coja-Oghlan has 34 coauthors

Last update 2012-09-10 CET by the DBLP TeamThis material is Open Data Content released under the ODC-BY 1.0 license — See also our legal information page