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

Jeff Edmonds

Papers on DiSC'02


Mining for Empty Rectangles in Large Data Sets

Publications


Note: Links lead to the DBLP on the Web.

Jeff Edmonds

19 Jeff Edmonds, Jarek Gryz , Dongming Liang , Renée J. Miller : Mining for Empty Rectangles in Large Data Sets. ICDT 2001 : 174-188

18 Jeff Edmonds, Russell Impagliazzo , Steven Rudich , Jiri Sgall : Communication complexity towards lower bounds on circuit depth. Computational Complexity 10 (3): 210-246 (2001)

17 Jeff Edmonds: Scheduling in the dark. TCS 235 (1): 109-141 (2000)

16 Jeff Edmonds: Scheduling in the Dark. STOC 1999 : 179-188

15 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)

14 Paul Beame , Stephen Cook , Jeff Edmonds, Russell Impagliazzo , Toniann Pitassi : The Relative Complexity of NP Search Problems. JCSS 57 (1): 3-19 (1998)

13 Greg Barnes , Jeff Edmonds: Time-Space Lower Bounds for Directed st-Connectivity on Graph Automata Models. SIAM J. Comput. 27 (4): 1190-1202 (1998)

12 Jeff Edmonds: Time-Space Tradeoffs For Undirected st -Connectivity on a Graph Automata. SIAM J. Comput. 27 (5): 1492-1513 (1998)

11 Jeff Edmonds, Donald D. Chinn , Tim Brecht , Xiaotie Deng : Non-clairvoyant Multiprocessor Scheduling of Jobs with Changing Execution Characteristics (Extended Abstract). STOC 1997 : 120-129

10 Jeff Edmonds: Removing Ramsey Theory: Lower Bounds With Smaller Domain Size. TCS 172 (1-2): 1-41 (1997)

9 Matthew Clegg , Jeff Edmonds, Russell Impagliazzo : Using the Groebner Basis Algorithm to Find Proofs of Unsatisfiability. STOC 1996 : 174-183

8 Noga Alon , Jeff Edmonds, Michael Luby : Linear Time Erasure Codes with Nearly Optimal Recovery (Extended Abstract). FOCS 1995 : 512-519

7 Jeff Edmonds, Chung Keung Poon : A nearly optimal time-space lower bound for directed st -connectivity on the NNJAG model. STOC 1995 : 147-156

6 Paul Beame , Stephen Cook , Jeff Edmonds, Russell Impagliazzo , Toniann Pitassi : The relative complexity of NP search problems. STOC 1995 : 303-314

5 Andres Albanese , Johannes Blömer , Jeff Edmonds, Michael Luby , Madhu Sudan : Priority Encoding Transmission. FOCS 1994 : 604-612

4 Greg Barnes , Jeff Edmonds: Time-Space Bounds for Directed s-t Connectivity on JAG Models (Extended Abstract). FOCS 1993 : 228-237

3 Jeff Edmonds: Time-Space Trade-Offs for Undirected ST-Connectivity on a JAG. STOC 1993 : 718-727

2 Jeff Edmonds, Steven Rudich , Russell Impagliazzo , Jiri Sgall : Communication Complexity Towards Lower Bounds on Circuit Depth. FOCS 1991 : 249-257

1 Jeff Edmonds: Lower Bounds with Smaller Domain Size On Concurrent Write Parallel Machines. Structure in Complexity Theory Conference 1991 : 322-331




DiSC'02 © 2003 Association for Computing Machinery