Welcome to DiSC 2002
SIGMOD 2001
PODS 2001
SIGMOD RECORD 2001
CIKM 2001
CoopIS 2001
DASFAA 2001
DASFAA 2000
DBPL 2001
Data Engineering Bul
DEXA_EC-WEB 2001
DMKD 2001
DPDJ 2001
HYPERTEXT 2001
ICDE 2001
ICDM 2001
ICDT 2001
JCDL 2001
KDD 2001
KDD_EXPLORATIONS 20
KRDB 2001
MDM 2001
MIR 2001
MIS 2001
RIDE 2001
SBBD 2001
SIGIR 2001
SIGIR FORUM 2001
SSDBM 2001
SSTD 2001
TODS 2001
TIME 2001
VLDB 2001
VLDBJ 2001
About DiSC 2002
Editorial Board
Acknowledgements
DiSC 2002 Production
ADVIS
DiSC'02 Feedback
DiSC'02 Sitemap
Search DiSC'02
<<<Author Index>>>
Copyright Notice

Dimitris Achlioptas

Papers on DiSC'02


Database-friendly random projections

Publications


Note: Links lead to the DBLP on the Web.

Dimitris Achlioptas

20 Dimitris Achlioptas, Jeong Han Kim , Michael Krivelevich , Prasad Tetali : Two-coloring random hypergraphs. Random Structures and Algorithms 20 (2): 249-259 (2002)

19 Dimitris Achlioptas, Amos Fiat , Anna R. Karlin , Frank McSherry : Web Search via Hub Synthesis. FOCS 2001 : 500-509

18 Henry A. Kautz , Yongshao Ruan , Dimitris Achlioptas, Carla P. Gomes , Bart Selman , Mark E. Stickel : Balance and Filtering in Structured Satisfiable Problems. IJCAI 2001 : 351-358

17 Dimitris Achlioptas: Database-friendly random projections. PODS 2001

16 Dimitris Achlioptas, Arthur D. Chtcherba , Gabriel Istrate , Christopher Moore : The phase transition in 1-in-k SAT and NAE 3-SAT. SODA 2001 : 721-722

15 Dimitris Achlioptas, Paul Beame , Michael S. O. Molloy : A sharp threshold in proof complexity. STOC 2001 : 337-346

14 Dimitris Achlioptas, Frank McSherry : Fast computation of low rank matrix. STOC 2001 : 611-618

13 Dimitris Achlioptas, Michael S. O. Molloy , Lefteris M. Kirousis , Yannis C. Stamatiou , Evangelos Kranakis , Danny Krizanc : Random Constraint Satisfaction: A More Accurate Picture. Constraints 6 (4): 329-344 (2001)

12 Dimitris Achlioptas, Lefteris M. Kirousis , Evangelos Kranakis , Danny Krizanc : Rigorous results for random (2+p)-SAT. TCS 265 (1-2): 109-129 (2001)

11 Dimitris Achlioptas: Lower bounds for random 3-SAT via differential equations. TCS 265 (1-2): 159-185 (2001)

10 Dimitris Achlioptas, Carla P. Gomes , Henry A. Kautz , Bart Selman : Generating Satisfiable Problem Instances. AAAI/IAAI 2000 : 256-261

9 Dimitris Achlioptas, Gregory B. Sorkin : Optimal myopic algorithms for random 3-SAT. FOCS 2000 : 590-600

8 Dimitris Achlioptas, J. H. Kim , Michael Krivelevich , Prasad Tetali : Two-coloring Random Hypergraphs. ICALP Satellite Workshops 2000 : 85-96

7 Dimitris Achlioptas: Setting 2 variables at a time yields a new lower bound for random 3-SAT (extended abstract). STOC 2000 : 28-37

6 Dimitris Achlioptas, Marek Chrobak , John Noga : Competitive analysis of randomized paging algorithms. TCS 234 (1-2): 203-218 (2000)

5 Dimitris Achlioptas, Ehud Friedgut : A Sharp Threshold for k-Colorability. Random Structures and Algorithms 14 (1): 63-70 (1999)

4 Jeff Edmonds , Chung Keung Poon , Dimitris Achlioptas: Tight Lower Bounds for st-Connectivity on the NNJAG Model. SIAM J. Comput. 28 (6): 2257-2284 (1999)

3 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 : 107-120

2 Dimitris Achlioptas, Michael S. O. Molloy : The Analysis of a List-Coloring Algorithm on a Random Graph. FOCS 1997 : 204-212

1 Dimitris Achlioptas, Marek Chrobak , John Noga : Competive Analysis of Randomized Paging Algorithms. ESA 1996 : 419-430




DiSC'02 © 2003 Association for Computing Machinery