@article{Csirik-Johnson-Kenyon-Orlin-Shor-Weber/06,
AUTHOR = {Csirik, Janos and Johnson, David S. and Kenyon, Claire and Orlin, James B. and Shor, Peter W. and Weber, Richard R.},
TITLE = {On the sum-of-squares algorithm for bin packing},
JOURNAL = {J. ACM},
VOLUME = {53},
NUMBER = {1},
PAGES = {1-65},
YEAR = {2006},
EDITOR = {Raghavan, Prabhakar},
URL = {http://portal.acm.org/citation.cfm?id=1120582},
PUBLISHER = {ACM Press},
ADDRESS = {New York},
}
@article{Bulatov/06,
AUTHOR = {Bulatov, Andrei A.},
TITLE = {A dichotomy theorem for constraint satisfaction problems on a 3-element set},
JOURNAL = {J. ACM},
VOLUME = {53},
NUMBER = {1},
PAGES = {66-120},
YEAR = {2006},
EDITOR = {Raghavan, Prabhakar},
URL = {http://portal.acm.org/citation.cfm?id=1120582.1120584},
PUBLISHER = {ACM Press},
ADDRESS = {New York},
}
@article{Scharbrodt-Schickinger-Steger/06,
AUTHOR = {Scharbrodt, Mark and Schickinger, Thomas and Steger, Angelika},
TITLE = {A new average case analysis for completion time scheduling},
JOURNAL = {J. ACM},
VOLUME = {53},
NUMBER = {1},
PAGES = {121-146},
YEAR = {2006},
EDITOR = {Raghavan, Prabhakar},
URL = {http://portal.acm.org/citation.cfm?id=1120582.1120585},
PUBLISHER = {ACM Press},
ADDRESS = {New York},
}
@article{Flajolet-Szpankowski-Vallee/06,
AUTHOR = {Flajolet, Philippe and Szpankowski, Wojciech and Vall{\'{e}}e, Brigitte},
TITLE = {Hidden word statistics},
JOURNAL = {J. ACM},
VOLUME = {53},
NUMBER = {1},
PAGES = {147-183},
YEAR = {2006},
EDITOR = {Raghavan, Prabhakar},
URL = {http://portal.acm.org/citation.cfm?id=1120582.1120586},
PUBLISHER = {ACM Press},
ADDRESS = {New York},
}
@article{Nayak-Salzman/06,
AUTHOR = {Nayak, Ashwin and Salzman, Julia},
TITLE = {Limits on the ability of quantum states to convey classical messages},
JOURNAL = {J. ACM},
VOLUME = {53},
NUMBER = {1},
PAGES = {184-206},
YEAR = {2006},
EDITOR = {Raghavan, Prabhakar},
URL = {http://portal.acm.org/citation.cfm?id=1120582.1120587},
PUBLISHER = {ACM Press},
ADDRESS = {New York},
}
@article{Atserias-Dawar-Kolaitis/06,
AUTHOR = {Atserias, Albert and Dawar, Anuj and Kolaitis, Phokion G.},
TITLE = {On preservation under homomorphisms and unions of conjunctive queries},
JOURNAL = {J. ACM},
VOLUME = {53},
NUMBER = {2},
PAGES = {208-237},
YEAR = {2006},
EDITOR = {Raghavan, Prabhakar},
URL = {http://portal.acm.org/citation.cfm?id=1131342.1131344},
PUBLISHER = {ACM Press},
ADDRESS = {New York},
}
@article{Gottlob-Koch-Schulz/06,
AUTHOR = {Gottlob, Georg and Koch, Christoph and Schulz, Klaus U.},
TITLE = {Conjunctive queries over trees},
JOURNAL = {J. ACM},
VOLUME = {53},
NUMBER = {2},
PAGES = {238-272},
YEAR = {2006},
EDITOR = {Raghavan, Prabhakar},
URL = {http://portal.acm.org/citation.cfm?id=1131342.1131345},
PUBLISHER = {ACM Press},
ADDRESS = {New York},
}
@article{Benedikt-Kuijpers-Loding-Van_den_Bussche-Wilke/06,
AUTHOR = {Benedikt, Michael and Kuijpers, Bart and L{\"{o}}ding, Christof and Van den Bussche, Jan and Wilke, Thomas},
TITLE = {A characterization of first-order topological properties of planar spatial data},
JOURNAL = {J. ACM},
VOLUME = {53},
NUMBER = {2},
PAGES = {273-305},
YEAR = {2006},
EDITOR = {Raghavan, Prabhakar},
URL = {http://portal.acm.org/citation.cfm?id=1131342.1131346},
PUBLISHER = {ACM Press},
ADDRESS = {New York},
}
@article{Indyk/06,
AUTHOR = {Indyk, Piotr},
TITLE = {Stable distributions, pseudorandom generators, embeddings, and data stream computation},
JOURNAL = {J. ACM},
VOLUME = {53},
NUMBER = {3},
PAGES = {307-323},
YEAR = {2006},
EDITOR = {Raghavan, Prabhakar},
URL = {http://portal.acm.org/citation.cfm?id=1147954},
PUBLISHER = {ACM Press},
ADDRESS = {New York},
}
@article{Gandhi-Khuller-Parthasarathy-Srinivasan/06,
AUTHOR = {Gandhi, Rajiv and Khuller, Samir and Parthasarathy, Srinivasan and Srinivasan, Aravind},
TITLE = {Dependent rounding and its applications to approximation algorithms},
JOURNAL = {J. ACM},
VOLUME = {53},
NUMBER = {3},
PAGES = {324-360},
YEAR = {2006},
EDITOR = {Raghavan, Prabhakar},
URL = {http://portal.acm.org/citation.cfm?id=1147954.1147956},
PUBLISHER = {ACM Press},
ADDRESS = {New York},
}
@article{Ban-Edelsbrunner-Rudolph/06,
AUTHOR = {Ban, Yih-En Andrew and Edelsbrunner, Herbert and Rudolph, Johannes},
TITLE = {Interface surfaces for protein-protein complexes},
JOURNAL = {J. ACM},
VOLUME = {53},
NUMBER = {3},
PAGES = {361-378},
YEAR = {2006},
EDITOR = {Raghavan, Prabhakar},
URL = {http://portal.acm.org/citation.cfm?id=1147954.1147957},
PUBLISHER = {ACM Press},
ADDRESS = {New York},
}
@article{Shalev-Shavit/06,
AUTHOR = {Shalev, Ori and Shavit, Nir},
TITLE = {Split-ordered lists: Lock-free extensible hash tables},
JOURNAL = {J. ACM},
VOLUME = {53},
NUMBER = {3},
PAGES = {379-405},
YEAR = {2006},
EDITOR = {Raghavan, Prabhakar},
URL = {http://portal.acm.org/citation.cfm?id=1147954.1147958},
PUBLISHER = {ACM Press},
ADDRESS = {New York},
}
@article{Nederhof-Satta/06,
AUTHOR = {Nederhof, Mark-Jan and Satta, Giorgio},
TITLE = {Probabilistic parsing strategies},
JOURNAL = {J. ACM},
VOLUME = {53},
NUMBER = {3},
PAGES = {406-436},
YEAR = {2006},
EDITOR = {Raghavan, Prabhakar},
URL = {http://portal.acm.org/citation.cfm?id=1147954.1147959},
PUBLISHER = {ACM Press},
ADDRESS = {New York},
}
@article{Sitters-Stougie/06,
AUTHOR = {Sitters, Ren{\'{e}} A. and Stougie, Leen},
TITLE = {The generalized two-server problem},
JOURNAL = {J. ACM},
VOLUME = {53},
NUMBER = {3},
PAGES = {437-458},
YEAR = {2006},
EDITOR = {Raghavan, Prabhakar},
URL = {http://portal.acm.org/citation.cfm?id=1147954.1147960},
PUBLISHER = {ACM Press},
ADDRESS = {New York},
}
@article{Pitts/06,
AUTHOR = {Pitts, Andrew M.},
TITLE = {Alpha-structural recursion and induction},
JOURNAL = {J. ACM},
VOLUME = {53},
NUMBER = {3},
PAGES = {459-506},
YEAR = {2006},
EDITOR = {Raghavan, Prabhakar},
URL = {http://portal.acm.org/citation.cfm?id=1147954.1147961},
PUBLISHER = {ACM Press},
ADDRESS = {New York},
}
@article{Ambainis-Schulman-Vazirani/06,
AUTHOR = {Ambainis, Andris and Schulman, Leonard J. and Vazirani, Umesh},
TITLE = {Computing with highly mixed states},
JOURNAL = {J. ACM},
VOLUME = {53},
NUMBER = {3},
PAGES = {507-531},
YEAR = {2006},
EDITOR = {Raghavan, Prabhakar},
URL = {http://portal.acm.org/citation.cfm?id=1147954.1147962},
PUBLISHER = {ACM Press},
ADDRESS = {New York},
}
@article{Xu-Berger/06,
AUTHOR = {Xu, Jinbo and Berger, Bonnie},
TITLE = {Fast and accurate algorithms for protein side-chain packing},
JOURNAL = {J. ACM},
VOLUME = {53},
NUMBER = {4},
PAGES = {533-557},
YEAR = {2006},
EDITOR = {Raghavan, Prabhakar},
URL = {http://portal.acm.org/citation.cfm?id=1162349},
PUBLISHER = {ACM Press},
ADDRESS = {New York},
}
@article{Goldreich-Sudan/06,
AUTHOR = {Goldreich, Oded and Sudan, Madhu},
TITLE = {Locally testable codes and PCPs of almost-linear length},
JOURNAL = {J. ACM},
VOLUME = {53},
NUMBER = {4},
PAGES = {558-655},
YEAR = {2006},
EDITOR = {Raghavan, Prabhakar},
URL = {http://portal.acm.org/citation.cfm?id=1162349.1162351},
PUBLISHER = {ACM Press},
ADDRESS = {New York},
}
@article{Vitter-Hutchinson/06,
AUTHOR = {Vitter, Jeffrey Scott and Hutchinson, David Alexander},
TITLE = {Distribution sort with randomized cycling},
JOURNAL = {J. ACM},
VOLUME = {53},
NUMBER = {4},
PAGES = {656-680},
YEAR = {2006},
EDITOR = {Raghavan, Prabhakar},
URL = {http://portal.acm.org/citation.cfm?id=1162349.1162352},
PUBLISHER = {ACM Press},
ADDRESS = {New York},
}
@article{Ben-Amram-Petersen/06,
AUTHOR = {Ben-Amram, Amir M. and Petersen, Holger},
TITLE = {Backing up in singly linked lists},
JOURNAL = {J. ACM},
VOLUME = {53},
NUMBER = {4},
PAGES = {681-705},
YEAR = {2006},
EDITOR = {Raghavan, Prabhakar},
URL = {http://portal.acm.org/citation.cfm?id=1162349.1162353},
PUBLISHER = {ACM Press},
ADDRESS = {New York},
}
@article{Chuzhoy-Naor/06,
AUTHOR = {Chuzhoy, Julia and Naor, Joseph (Seffi)},
TITLE = {New hardness results for congestion minimization and machine scheduling},
JOURNAL = {J. ACM},
VOLUME = {53},
NUMBER = {5},
PAGES = {707-721},
YEAR = {2006},
EDITOR = {Raghavan, Prabhakar},
URL = {http://portal.acm.org/citation.cfm?id=1183907},
PUBLISHER = {ACM Press},
ADDRESS = {New York},
}
@article{Chor-Tuller/06,
AUTHOR = {Chor, Benny and Tuller, Tamir},
TITLE = {Finding a maximum likelihood tree is hard},
JOURNAL = {J. ACM},
VOLUME = {53},
NUMBER = {5},
PAGES = {722-744},
YEAR = {2006},
EDITOR = {Raghavan, Prabhakar},
URL = {http://portal.acm.org/citation.cfm?id=1183907.1183909},
PUBLISHER = {ACM Press},
ADDRESS = {New York},
}
@article{Andrews-Zhang/06,
AUTHOR = {Andrews, Matthew and Zhang, Lisa},
TITLE = {Logarithmic hardness of the undirected edge-disjoint paths problem},
JOURNAL = {J. ACM},
VOLUME = {53},
NUMBER = {5},
PAGES = {745-761},
YEAR = {2006},
EDITOR = {Raghavan, Prabhakar},
URL = {http://portal.acm.org/citation.cfm?id=1183907.1183910},
PUBLISHER = {ACM Press},
ADDRESS = {New York},
}
@article{De_Farias-Megiddo/06,
AUTHOR = {De Farias, Daniela Pucci and Megiddo, Nimrod},
TITLE = {Combining expert advice in reactive environments},
JOURNAL = {J. ACM},
VOLUME = {53},
NUMBER = {5},
PAGES = {762-799},
YEAR = {2006},
EDITOR = {Raghavan, Prabhakar},
URL = {http://portal.acm.org/citation.cfm?id=1183907.1183911},
PUBLISHER = {ACM Press},
ADDRESS = {New York},
}
@article{Gabow/06,
AUTHOR = {Gabow, Harold N.},
TITLE = {Using expander graphs to find vertex connectivity},
JOURNAL = {J. ACM},
VOLUME = {53},
NUMBER = {5},
PAGES = {800-844},
YEAR = {2006},
EDITOR = {Raghavan, Prabhakar},
URL = {http://portal.acm.org/citation.cfm?id=1183907.1183912},
PUBLISHER = {ACM Press},
ADDRESS = {New York},
}
@article{Blum-Sandholm-Zinkevich/06,
AUTHOR = {Blum, Avrim and Sandholm, Tuomas and Zinkevich, Martin},
TITLE = {Online algorithms for market clearing},
JOURNAL = {J. ACM},
VOLUME = {53},
NUMBER = {5},
PAGES = {845-879},
YEAR = {2006},
EDITOR = {Raghavan, Prabhakar},
URL = {http://portal.acm.org/citation.cfm?id=1183907.1183913},
PUBLISHER = {ACM Press},
ADDRESS = {New York},
}
@article{Lindell-Lysyanskaya-Rabin/06,
AUTHOR = {Lindell, Yehuda and Lysyanskaya, Anna and Rabin, Tal},
TITLE = {On the composition of authenticated Byzantine agreement},
JOURNAL = {J. ACM},
VOLUME = {53},
NUMBER = {6},
PAGES = {881-917},
YEAR = {2006},
EDITOR = {Raghavan, Prabhakar},
URL = {http://portal.acm.org/citation.cfm?id=1217856},
PUBLISHER = {ACM Press},
ADDRESS = {New York},
}
@article{Karkkainen-Sanders-Burkhardt/06,
AUTHOR = {K{\"{a}}rkk{\"{a}}inen, Juha and Sanders, Peter and Burkhardt, Stefan},
TITLE = {Linear work suffix array construction},
JOURNAL = {J. ACM},
VOLUME = {53},
NUMBER = {6},
PAGES = {918-936},
YEAR = {2006},
EDITOR = {Raghavan, Prabhakar},
URL = {http://portal.acm.org/citation.cfm?id=1217856.1217858},
PUBLISHER = {ACM Press},
ADDRESS = {New York},
}
@article{Nieuwenhuis-Oliveras-Tinelli/06,
AUTHOR = {Nieuwenhuis, Robert and Oliveras, Albert and Tinelli, Cesare},
TITLE = {Solving SAT and SAT Modulo Theories: From an abstract Davis-Putnam-Logemann-Loveland Procedure to DPLL$(T)$},
JOURNAL = {J. ACM},
VOLUME = {53},
NUMBER = {6},
PAGES = {937-977},
YEAR = {2006},
EDITOR = {Raghavan, Prabhakar},
URL = {http://portal.acm.org/citation.cfm?id=1217856.1217859},
PUBLISHER = {ACM Press},
ADDRESS = {New York},
}
@article{Shmoys-Swamy/06,
AUTHOR = {Shmoys, David B. and Swamy, Chaitanya},
TITLE = {An approximation scheme for stochastic linear programming and its application to stochastic integer programs},
JOURNAL = {J. ACM},
VOLUME = {53},
NUMBER = {6},
PAGES = {978-1012},
YEAR = {2006},
EDITOR = {Raghavan, Prabhakar},
URL = {http://portal.acm.org/citation.cfm?id=1217856.1217860},
PUBLISHER = {ACM Press},
ADDRESS = {New York},
}