| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Dimitris Achlioptas, Amin Coja-Oghlan, Federico Ricci-Tersenghi |
On the solution-space geometry of random constraint satisfaction problems.  |
Random Struct. Algorithms  |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Dimitris Achlioptas, Michael Molloy |
The solution space geometry of random linear equations |
CoRR |
2011 |
DBLP BibTeX RDF |
|
| 1 | Dimitris Achlioptas |
Algorithmic Barriers from Phase Transitions in Graphs. |
WG |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Dimitris Achlioptas, Aaron Clauset, David Kempe, Cristopher Moore |
On the bias of traceroute sampling: Or, power-law degree distributions in regular graphs. |
J. ACM |
2009 |
DBLP DOI BibTeX RDF |
sampling bias, Internet topology, traceroute |
| 1 | Dimitris Achlioptas, Federico Ricci-Tersenghi |
Random Formulas Have Frozen Variables. |
SIAM J. Comput. |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Dimitris Achlioptas |
Random Satisfiability. |
Handbook of Satisfiability |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Dimitris Achlioptas, Amin Coja-Oghlan |
Algorithmic Barriers from Phase Transitions. |
FOCS |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Dimitris Achlioptas, Frank McSherry |
Fast computation of low-rank matrix approximations. |
J. ACM |
2007 |
DBLP DOI BibTeX RDF |
sampling, Singular value decomposition, low rank approximation |
| 1 | Dimitris Achlioptas, Assaf Naor, Yuval Peres |
On the maximum satisfiability of random formulas. |
J. ACM |
2007 |
DBLP DOI BibTeX RDF |
Maximum satisfiability |
| 1 | Dimitris Achlioptas, Vladlen Koltun |
Special Section on Foundations of Computer Science. |
SIAM J. Comput. |
2007 |
DBLP BibTeX RDF |
|
| 1 | Dimitris Achlioptas, Federico Ricci-Tersenghi |
On the Solution-Space Geometry of Random Constraint Satisfaction Problems |
CoRR |
2006 |
DBLP BibTeX RDF |
|
| 1 | Dimitris Achlioptas, Cristopher Moore |
Random k-SAT: Two Moments Suffice to Cross a Sharp Threshold. |
SIAM J. Comput. |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Dimitris Achlioptas, Federico Ricci-Tersenghi |
On the solution-space geometry of random constraint satisfaction problems. |
STOC |
2006 |
DBLP DOI BibTeX RDF |
random formulas, survey propagation, satisfiability |
| 1 | Dimitris Achlioptas, Stefano Leonardi |
Special Issue on Algorithms and Models for the Web-Graph. |
Internet Mathematics |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Dimitris Achlioptas, Haixia Jia, Cristopher Moore |
Hiding Satisfying Assignments: Two are Better than One |
CoRR |
2005 |
DBLP BibTeX RDF |
|
| 1 | Dimitris Achlioptas, Aaron Clauset, David Kempe, Cristopher Moore |
On the Bias of Traceroute Sampling; or, Power-law Degree Distributions in Regular Graphs |
CoRR |
2005 |
DBLP BibTeX RDF |
|
| 1 | Dimitris Achlioptas, Haixia Jia, Cristopher Moore |
Hiding Satisfying Assignments: Two are Better than One. |
J. Artif. Intell. Res. (JAIR) |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Dimitris Achlioptas, Frank McSherry |
On Spectral Learning of Mixtures of Distributions. |
COLT |
2005 |
DBLP DOI BibTeX RDF |
learning mixtures of distributions, log-concave and concentrated distributions, singular value decomposition, spectral methods, gaussians mixtures |
| 1 | Dimitris Achlioptas, Aaron Clauset, David Kempe, Cristopher Moore |
On the bias of traceroute sampling: or, power-law degree distributions in regular graphs. |
STOC |
2005 |
DBLP DOI BibTeX RDF |
internet mapping, random graphs, power laws |
| 1 | Yi-Min Wang, Lili Qiu, Chad Verbowski, Dimitris Achlioptas, Gautam Das, Per-Åke Larson |
Summary-based routing for content-based event distribution networks. |
Computer Communication Review |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Dimitris Achlioptas, Paul Beame, Michael S. O. Molloy |
A sharp threshold in proof complexity yields lower bounds for satisfiability search. |
J. Comput. Syst. Sci. |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Dimitris Achlioptas |
Random Matrices in Data Analysis. |
PKDD |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Dimitris Achlioptas, Paul Beame, Michael Molloy |
Exponential bounds for DPLL below the satisfiability threshold. |
SODA |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Dimitris Achlioptas, Michael S. O. Molloy, Cristopher Moore, Frank Van Bussel |
Sampling Grid Colorings with Fewer Colors. |
LATIN |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Dimitris Achlioptas |
Random Matrices in Data Analysis. |
ECML |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Dimitris Achlioptas, Cristopher Moore |
The Chromatic Number of Random Regular Graphs. |
APPROX-RANDOM |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Dimitris Achlioptas, Assaf Naor |
The two possible values of the chromatic number of a random graph. |
STOC |
2004 |
DBLP DOI BibTeX RDF |
graph coloring, random graphs, chromatic number |
| 1 | Dimitris Achlioptas, Haixia Jia, Cristopher Moore |
Hiding Satisfying Assignments: Two Are Better than One. |
AAAI |
2004 |
DBLP BibTeX RDF |
|
| 1 | Dimitris Achlioptas, Yuval Peres |
The Threshold for Random k-SAT is 2kln2 - O(k) |
CoRR |
2003 |
DBLP BibTeX RDF |
|
| 1 | Dimitris Achlioptas, Cristopher Moore |
Random k-SAT: Two Moments Suffice to Cross a Sharp Threshold |
CoRR |
2003 |
DBLP BibTeX RDF |
|
| 1 | Dimitris Achlioptas, Cristopher Moore |
Almost all graphs with average degree 4 are 3-colorable. |
J. Comput. Syst. Sci. |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Dimitris Achlioptas |
Database-friendly random projections: Johnson-Lindenstrauss with binary coins. |
J. Comput. Syst. Sci. |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Dimitris Achlioptas, Assaf Naor, Yuval Peres |
On the Maximum Satisfiability of Random Formulas. |
FOCS |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Dimitris Achlioptas, Yuval Peres |
The threshold for random k-SAT is 2k (ln 2 - O(k)). |
STOC |
2003 |
DBLP DOI BibTeX RDF |
second moment method, satisfiability, phase transition |
| 1 | Dimitris Achlioptas, Jeong Han Kim, Michael Krivelevich, Prasad Tetali |
Two-coloring random hypergraphs. |
Random Struct. Algorithms |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Dimitris Achlioptas, Cristopher Moore |
On the 2-Colorability of Random Hypergraphs. |
RANDOM |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Dimitris Achlioptas, Cristopher Moore |
The Asymptotic Order of the Random k -SAT Threshold. |
FOCS |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Dimitris Achlioptas, Cristopher Moore |
Almost all graphs with average degree 4 are 3-colorable. |
STOC |
2002 |
DBLP DOI BibTeX RDF |
threshold phenomena, graph coloring, random graphs |
| 1 | Henry A. Kautz, Yongshao Ruan, Dimitris Achlioptas, Carla P. Gomes, Bart Selman, Mark E. Stickel |
Balance and Filtering in Structured Satisfiable Problems (Preliminary Report). |
Electronic Notes in Discrete Mathematics |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Dimitris Achlioptas, Lefteris M. Kirousis, Evangelos Kranakis, Danny Krizanc |
Rigorous results for random (2+p)-SAT. |
Theor. Comput. Sci. |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Dimitris Achlioptas |
Lower bounds for random 3-SAT via differential equations. |
Theor. Comput. Sci. |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Dimitris Achlioptas, Michael S. O. Molloy, Lefteris M. Kirousis, Yannis C. Stamatiou, Evangelos Kranakis, Danny Krizanc |
Random Constraint Satisfaction: A More Accurate Picture. |
Constraints |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Dimitris Achlioptas, Arthur D. Chtcherba, Gabriel Istrate, Cristopher Moore |
The phase transition in 1-in-k SAT and NAE 3-SAT. |
SODA |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Henry A. Kautz, Yongshao Ruan, Dimitris Achlioptas, Carla P. Gomes, Bart Selman, Mark E. Stickel |
Balance and Filtering in Structured Satisfiable Problems. |
IJCAI |
2001 |
DBLP BibTeX RDF |
|
| 1 | Dimitris Achlioptas, Amos Fiat, Anna R. Karlin, Frank McSherry |
Web Search via Hub Synthesis. |
FOCS |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Dimitris Achlioptas |
Database-friendly random projections. (PDF / PS) |
PODS |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Dimitris Achlioptas, Frank McSherry |
Fast computation of low rank matrix. |
STOC |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Dimitris Achlioptas, Paul Beame, Michael S. O. Molloy |
A sharp threshold in proof complexity. |
STOC |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Dimitris Achlioptas, Frank McSherry, Bernhard Schölkopf |
Sampling Techniques for Kernel Methods. |
NIPS |
2001 |
DBLP BibTeX RDF |
|
| 1 | Dimitris Achlioptas, Marek Chrobak, John Noga |
Competitive analysis of randomized paging algorithms. |
Theor. Comput. Sci. |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Dimitris Achlioptas, Jeong Han Kim, Michael Krivelevich, Prasad Tetali |
Two-coloring Random Hypergraphs. |
ICALP Satellite Workshops |
2000 |
DBLP BibTeX RDF |
|
| 1 | Dimitris Achlioptas, Gregory B. Sorkin |
Optimal myopic algorithms for random 3-SAT. |
FOCS |
2000 |
DBLP DOI BibTeX RDF |
optimal myopic algorithms, random 3-SAT formula, 3-clauses, unit-clause propagation extensions, expressible algorithms, max-density multiple-choice knapsack problem, optimal knapsack solution structure, lower bounds, optimisation, computability, satisfiability, differential equations, differential equations, optimization problem, randomised algorithms |
| 1 | Dimitris Achlioptas |
Setting 2 variables at a time yields a new lower bound for random 3-SAT (extended abstract). |
STOC |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Dimitris Achlioptas, Carla P. Gomes, Henry A. Kautz, Bart Selman |
Generating Satisfiable Problem Instances. |
AAAI/IAAI |
2000 |
DBLP BibTeX RDF |
|
| 1 | Dimitris Achlioptas, Michael Molloy |
Almost all graphs with 2.522 n edges are not 3-colorable. |
Electr. J. Comb. |
1999 |
DBLP BibTeX RDF |
|
| 1 | Dimitris Achlioptas, Ehud Friedgut |
A Sharp Threshold for k-Colorability. |
Random Struct. Algorithms |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Jeff Edmonds, Chung Keung Poon, Dimitris Achlioptas |
Tight Lower Bounds for st-Connectivity on the NNJAG Model. |
SIAM J. Comput. |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Dimitris Achlioptas, Jason I. Brown, Derek G. Corneil, Michael S. O. Molloy |
The existence of uniquely -G colourable graphs. |
Discrete Mathematics |
1998 |
DBLP DOI BibTeX RDF |
|
| 1 | Dimitris Achlioptas, Michael S. O. Molloy |
The Analysis of a List-Coloring Algorithm on a Random Graph. |
FOCS |
1997 |
DBLP DOI BibTeX RDF |
list-coloring algorithm, k-coloring algorithm, tight asymptotic analysis, performance, Markov chains, random graph, differential equations, graph colouring |
| 1 | Dimitris Achlioptas, Lefteris M. Kirousis, Evangelos Kranakis, Danny Krizanc, Michael S. O. Molloy, Yannis C. Stamatiou |
Random Constraint Satisfaction: A More Accurate Picture. |
CP |
1997 |
DBLP DOI BibTeX RDF |
|
| 1 | Dimitris Achlioptas, Marek Chrobak, John Noga |
Competive Analysis of Randomized Paging Algorithms. |
ESA |
1996 |
DBLP DOI BibTeX RDF |
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")