
The Library
Browse by Warwick Author
![]() | Up a level |
Jump to: Alfred P. Sloan Foundation | Deutsche Forschungsgemeinschaft | Deutsche Forschungsgemeinschaft (DFG) | EPSRC | ERC Starting Grant | Engineering and Physical Sciences Research Council (EPSRC) | European Research Council (ERC) | German-Israeli Foundation for Scientific Research and Development | Israel Science Foundation (ISF) | National Science Foundation (U.S.) (NSF) | Royal Society (Great Britain) | Universiṭat Tel-Aviv. Hermann Minkowski Minerva Center for Geometry
Number of items: 18.
Alfred P. Sloan Foundation
Achlioptas, Dimitris, Coja-Oghlan, Amin and Ricci-Tersenghi, F. (Federico) (2011) On the solution-space geometry of random constraint satisfaction problems. Random Structures & Algorithms, Volume 38 (Number 3). pp. 251-268. doi:10.1002/rsa.20323 ISSN 10429832.
Deutsche Forschungsgemeinschaft
Coja-Oghlan, Amin and Kang, Mihyun (2009) The evolution of the min–min random graph process. Discrete Mathematics, Vol.309 (No.13). pp. 4527-4544. doi:10.1016/j.disc.2009.02.015 ISSN 0012-365X.
Deutsche Forschungsgemeinschaft (DFG)
Achlioptas, Dimitris, Coja-Oghlan, Amin and Ricci-Tersenghi, F. (Federico) (2011) On the solution-space geometry of random constraint satisfaction problems. Random Structures & Algorithms, Volume 38 (Number 3). pp. 251-268. doi:10.1002/rsa.20323 ISSN 10429832.
Coja-Oghlan, Amin, Cooper, Colin and Frieze, Alan (2010) An efficient sparse regularity concept. SIAM Journal on Discrete Mathematics, Volume 23 (Number 4). pp. 2000-2034. doi:10.1137/080730160 ISSN 0895-4801.
Alon, Noga, Coja-Oghlan, Amin, Hàn, Hiêp, Kang, Mihyun, Rödl, Vojtěch and Schacht, Mathias (2010) Quasi-randomness and algorithmic regularity for graphs with general degree distributions. SIAM Journal on Computing, Vol.39 (No.6). pp. 2336-2362. doi:10.1137/070709529 ISSN 0097-5397.
Coja-Oghlan, Amin and Lanka, André (2009) Finding planted partitions in random graphs with general degree distributions. SIAM Journal on Discrete Mathematics, Volume 23 (Number 4). pp. 1682-1714. doi:10.1137/070699354 ISSN 0895-4801.
EPSRC
Coja-Oghlan, Amin and Panagiotou, Konstantinos (2011) Catching the k-NAESAT threshold. Coventry: ArXiv e-prints. (Unpublished)
ERC Starting Grant
Coja-Oghlan, Amin and Panagiotou, Konstantinos (2011) Catching the k-NAESAT threshold. Coventry: ArXiv e-prints. (Unpublished)
Engineering and Physical Sciences Research Council (EPSRC)
Coja-Oghlan, Amin (2010) A better algorithm for random k-SAT. SIAM Journal on Computing, Volume 39 (Number 7). pp. 2823-2864. doi:10.1137/09076516X ISSN 0097-5397.
European Research Council (ERC)
Achlioptas, Dimitris, Coja-Oghlan, Amin and Ricci-Tersenghi, F. (Federico) (2011) On the solution-space geometry of random constraint satisfaction problems. Random Structures & Algorithms, Volume 38 (Number 3). pp. 251-268. doi:10.1002/rsa.20323 ISSN 10429832.
Alon, Noga, Coja-Oghlan, Amin, Hàn, Hiêp, Kang, Mihyun, Rödl, Vojtěch and Schacht, Mathias (2010) Quasi-randomness and algorithmic regularity for graphs with general degree distributions. SIAM Journal on Computing, Vol.39 (No.6). pp. 2336-2362. doi:10.1137/070709529 ISSN 0097-5397.
German-Israeli Foundation for Scientific Research and Development
Alon, Noga, Coja-Oghlan, Amin, Hàn, Hiêp, Kang, Mihyun, Rödl, Vojtěch and Schacht, Mathias (2010) Quasi-randomness and algorithmic regularity for graphs with general degree distributions. SIAM Journal on Computing, Vol.39 (No.6). pp. 2336-2362. doi:10.1137/070709529 ISSN 0097-5397.
Israel Science Foundation (ISF)
Alon, Noga, Coja-Oghlan, Amin, Hàn, Hiêp, Kang, Mihyun, Rödl, Vojtěch and Schacht, Mathias (2010) Quasi-randomness and algorithmic regularity for graphs with general degree distributions. SIAM Journal on Computing, Vol.39 (No.6). pp. 2336-2362. doi:10.1137/070709529 ISSN 0097-5397.
National Science Foundation (U.S.) (NSF)
Achlioptas, Dimitris, Coja-Oghlan, Amin and Ricci-Tersenghi, F. (Federico) (2011) On the solution-space geometry of random constraint satisfaction problems. Random Structures & Algorithms, Volume 38 (Number 3). pp. 251-268. doi:10.1002/rsa.20323 ISSN 10429832.
Coja-Oghlan, Amin, Cooper, Colin and Frieze, Alan (2010) An efficient sparse regularity concept. SIAM Journal on Discrete Mathematics, Volume 23 (Number 4). pp. 2000-2034. doi:10.1137/080730160 ISSN 0895-4801.
Alon, Noga, Coja-Oghlan, Amin, Hàn, Hiêp, Kang, Mihyun, Rödl, Vojtěch and Schacht, Mathias (2010) Quasi-randomness and algorithmic regularity for graphs with general degree distributions. SIAM Journal on Computing, Vol.39 (No.6). pp. 2336-2362. doi:10.1137/070709529 ISSN 0097-5397.
Royal Society (Great Britain)
Coja-Oghlan, Amin, Cooper, Colin and Frieze, Alan (2010) An efficient sparse regularity concept. SIAM Journal on Discrete Mathematics, Volume 23 (Number 4). pp. 2000-2034. doi:10.1137/080730160 ISSN 0895-4801.
Universiṭat Tel-Aviv. Hermann Minkowski Minerva Center for Geometry
Alon, Noga, Coja-Oghlan, Amin, Hàn, Hiêp, Kang, Mihyun, Rödl, Vojtěch and Schacht, Mathias (2010) Quasi-randomness and algorithmic regularity for graphs with general degree distributions. SIAM Journal on Computing, Vol.39 (No.6). pp. 2336-2362. doi:10.1137/070709529 ISSN 0097-5397.
This list was generated on Tue Mar 28 02:39:35 2023 BST.