Permalink
Switch branches/tags
Nothing to show
Find file
Fetching contributors…
Cannot retrieve contributors at this time
457 lines (418 sloc) 14.8 KB
@article{gmr98a,
author = {Phillip B. Gibbons and
Yossi Matias and
Vijaya Ramachandran},
title = {{The Queue-Read Queue-Write PRAM Model: Accounting for Contention in Parallel Algorithms}},
journal = {SIAM J. Comput.},
volume = {28},
number = {2},
year = {1998},
pages = {733-769},
ee = {http://dx.doi.org/10.1137/S009753979427491},
doi = {10.1137/S009753979427491},
}
@techreport{vcl06,
author = {Uzi Vishkin and George C. Caragea and Bryant Lee},
title = {{Models for Advancing PRAM and Other Algorithms into Parallel Programs for a PRAM-On-Chip Platform}},
institution = {University of Maryland},
year = {2006},
month = {April},
}
@inproceedings{vdbn98,
author = {Uzi Vishkin and Shlomit Dascal and Efraim Berkovich and Joseph Nuzman},
title = {{Explicit Multi-Threading (XMT) Bridging Models for Instruction Parallelism}},
booktitle = {Proc. 10th ACM Symposium on Parallel Algorithms and Architectures (SPAA},
year = {1998},
pages = {140--151},
publisher = {ACM Press}
}
@article{vishkin83,
title = "Implementation of simultaneous memory address access in models that forbid it",
journal = "Journal of Algorithms",
volume = "4",
number = "1",
pages = "45--50",
year = "1983",
issn = "0196-6774",
doi = "10.1016/0196-6774(83)90033-0",
url = "http://www.sciencedirect.com/science/article/pii/0196677483900330",
author = "Uzi Vishkin"
}
@inproceedings{gmr98b,
author = {Phillip B. Gibbons and Yossi Matias and Vijaya Ramachandran},
title = {{The Queue-Read Queue-Write Asynchronous PRAM Model}},
booktitle = {Euro-Par'96 Parallel Processing, Lecture Notes in Computer Science},
year = {1998},
pages = {279--292},
publisher = {Springer}
}
@article{zcsm07,
author = {Zhang, Yunquan and Chen, Guoliang and Sun, Guangzhong and Miao, Qiankun},
affiliation = {Chinese Academy of Sciences Laboratory of Parallel Computing, Institute of Software Beijing 100080 China},
title = {Models of parallel computation: a survey and classification},
journal = {Frontiers of Computer Science in China},
publisher = {Higher Education Press, co-published with Springer-Verlag GmbH},
issn = {1673-7350},
keyword = {Computer Science},
pages = {156--165},
volume = {1},
issue = {2},
url = {http://dx.doi.org/10.1007/s11704-007-0016-1},
note = {10.1007/s11704-007-0016-1},
year = {2007}
}
@article{gmr99,
author = {Gibbons, P. B. and Matias, Y. and Ramachandran, V.},
affiliation = {Information Sciences Research Center, Bell Laboratories (Lucent Technologies), 600 Mountain Avenue, Murray Hill, NJ 07974, USA},
title = {{Can a Shared-Memory Model Serve as a Bridging Model for Parallel Computation?}},
journal = {Theory of Computing Systems},
publisher = {Springer New York},
issn = {1432--4350},
keyword = {Computer Science},
pages = {327-359},
volume = {32},
issue = {3},
url = {http://dx.doi.org/10.1007/s002240000121},
doi = {10.1007/s002240000121},
year = {1999}
}
%% preliminary version of gmr99
@inproceedings{gmr97,
author = {Gibbons, Phillip B. and Matias, Yossi and Ramachandran, Vijaya},
title = {Can a shared-memory model serve as a bridging model for parallel computation?},
booktitle = {Proceedings of the ninth annual ACM symposium on Parallel algorithms and architectures},
series = {SPAA '97},
year = {1997},
isbn = {0-89791-890-8},
location = {Newport, Rhode Island, United States},
pages = {72--83},
numpages = {12},
url = {http://doi.acm.org/10.1145/258492.258500},
doi = {10.1145/258492.258500},
acmid = {258500},
publisher = {ACM},
address = {New York, NY, USA},
}
@phdthesis{zhang00,
author = {Yunquan Zhang},
title = {{Performance Optimizations on Parallel Numerical Software Package and Studys on Memory Complexity}},
year = {2000},
month = {June},
school = {Institute of Software, Chinese Academy of Sciences},
address = {Beijing},
}
@phdthesis{tiskin98,
author = {Alexandre Tiskin},
title = {{The Design and Analysis of Bulk-Synchronous Parallel Algorithms}},
year = {1998},
school = {Oxford University},
}
@incollection{valiant89,
title = {Bulk-synchronous parallel computers},
booktitle = {Parallel processing and artificial intelligence},
chapter = {2},
pages = {15--22},
author = {L. G. Valiant},
editor = {Reeve, M. and Zenith, S.E.},
isbn = {9780471924975},
lccn = {89016532},
series = {Wiley communicating process architecture},
url = {http://books.google.com/books?id=tWUlAAAAMAAJ},
year = {1989},
publisher = {Wiley}
}
@inproceedings{zstc98,
author = {Yunquan Zhang and Jiachang Sun and Zhimin Tang and Xuebin Chi},
title = {{Memory Complexity in High Performance Computing}},
booktitle = {{Proceedings of the Third International Conference on High Performance Computing in Asia-Pacific Region}},
pages = {142--151},
address = {Singapore},
month = {September},
year = {1998}
}
%% this is the conference for zstc98
@proceedings{hpcasia98,
title = {{Proceedings of HPC Asia '98: 3rd High Performance Computing Asia Conference}},
isbn = {9789810406349},
url = {http://books.google.com/books?id=Q-8xQwAACAAJ},
month = {September},
year = {1998},
publisher = {Institute of High Performance Computing},
address = {Singapore}
}
@inproceedings{mr98,
author = {MacKenzie, Philip D. and Ramachandran, Vijaya},
title = {Computational bounds for fundamental problems on general-purpose parallel models},
booktitle = {Proceedings of the tenth annual ACM symposium on Parallel algorithms and architectures},
series = {SPAA '98},
year = {1998},
isbn = {0-89791-989-0},
location = {Puerto Vallarta, Mexico},
pages = {152--163},
numpages = {12},
url = {http://doi.acm.org/10.1145/277651.277681},
doi = {10.1145/277651.277681},
acmid = {277681},
publisher = {ACM},
address = {New York, NY, USA},
}
@book{smith93,
title = {{The Design and Analysis of Parallel Algorithms}},
author = {Justin R. Smith},
year = {1993},
publisher = {Oxford University Press, Inc.},
address = {New York, NY, USA}
}
@book{savage98,
author = {John E. Savage},
title = {Models of Computation: Exploring the Power of Computing},
year = {1998},
publisher = {Addison-Wesley}
}
%% Definition of the PRO model.
@inproceedings{glgt02,
author = {Assefaw Hadish Gebremedhin and Isabelle Gu\'{e}rin Lassous and Jens Gustedt and Jan Arne Telle},
title = {{PRO: a model for Parallel Resource-Optimal computation}},
booktitle = {16th Annual International Symposium on High Performance Computing Systems and Applications},
year = {2002},
pages = {106--113},
publisher = {}
}
@article{borodin77,
author = {Allan Borodin},
title = {{On Relating Time and Space to Size and Depth}},
journal = {SIAM J. Comput.},
volume = {6},
number = {4},
year = {1977},
pages = {733--744},
ee = {http://dx.doi.org/10.1137/0206054},
bibsource = {DBLP, http://dblp.uni-trier.de}
}
@article{hmrrrs98,
title = {{NC-Approximation Schemes for NP- and PSPACE-Hard Problems for Geometric Graphs}},
journal = "Journal of Algorithms",
volume = "26",
number = "2",
pages = {238--274},
year = "1998",
issn = "0196-6774",
doi = "10.1006/jagm.1997.0903",
url = "http://www.sciencedirect.com/science/article/pii/S0196677497909032",
author = "Harry B Hunt III and Madhav V Marathe and Venkatesh Radhakrishnan and S.S Ravi and Daniel J Rosenkrantz and Richard E Stearns",
}
@article{tantau07,
author = {Till Tantau},
title = {{Logspace Optimization Problems and Their Approximability
Properties}},
journal = {Theory Comput. Syst.},
volume = {41},
number = {2},
year = {2007},
pages = {327--350},
doi = {10.1007/s00224-007-2011-1},
url = {http://dx.doi.org/10.1007/s00224-007-2011-1},
}
@book{dsst97,
author = {D{\'i}az, J. and Serna, M. and Spirakis, P. and Tor{\'a}n, J.},
isbn = {9780521117920},
lccn = {96051778},
title = {Paradigms for fast parallel approximability},
series = {Cambridge International Series on Parallel Computation},
url = {http://books.google.com/books?id=tC9gCQ2lmVcC},
publisher = {Cambridge University Press},
year = {1997}
}
@article{bt06,
author = {Andrej Bogdanov and
Luca Trevisan},
title = {{Average-Case Complexity}},
journal = {CoRR},
volume = {abs/cs/0606037},
year = {2006},
ee = {http://arxiv.org/abs/cs/0606037},
bibsource = {DBLP, http://dblp.uni-trier.de}
}
@phdthesis{yamakami97,
author = {Tomoyuki Yamakami},
title = {{Average Case Computational Complexity Theory}},
year = {1997},
school = {University of Toronto},
address = {Toronto, Canada}
}
@inproceedings{bcgl89,
author = {Shai Ben-David and
Benny Chor and
Oded Goldreich and
Michael Luby},
title = {{On the Theory of Average Case Complexity}},
booktitle = {STOC},
year = {1989},
pages = {204-216},
ee = {http://doi.acm.org/10.1145/73007.73027},
doi = {10.1145/73007.73027},
crossref = {stoc21},
bibsource = {DBLP, http://dblp.uni-trier.de}
}
@proceedings{stoc21,
editor = {David S. Johnson},
title = {{Proceedings of the 21st Annual ACM Symposium on Theory of
Computing}},
booktitle = {STOC},
publisher = {ACM},
month = {May},
day = {14--17},
year = {1989},
address = {Seattle, Washington, USA},
isbn = {0-89791-307-8},
bibsource = {DBLP, http://dblp.uni-trier.de}
}
@techreport{pz91,
title = {{On the Average Case Complexity of Parallel Sublist Selection}},
author = {G. Pucci and W. Zimmerman},
year = {1991},
month = {March},
institution = {International Computer Science Institute},
school = {University of California, Berkeley},
}
@article{an99,
author = {Andreou, Maria and Nikolopoulos, Stavros D.},
title = {{NC Coloring Algorithms for Permutation Graphs}},
journal = {Nordic J. of Computing},
issue_date = {Winter 1999},
volume = {6},
number = {4},
month = dec,
year = {1999},
issn = {1236-6064},
pages = {422--445},
numpages = {24},
url = {http://dl.acm.org/citation.cfm?id=642160.642164},
acmid = {642164},
publisher = {Publishing Association Nordic Journal of Computing},
address = {Finland},
keywords = {coloring problem, directed acyclic graphs, longest paths, parallel algorithms, perfect graphs, permutation graphs},
}
@phdthesis{meyer02,
author = {Ulrich Meyer},
title = {{Design and Analysis of Sequential and Parallel Single-Source
Shortest-Paths Algorithms}},
year = {2002},
school = {Saarland University},
address = {Saarbr\"{u}cken},
bibsource = {DBLP, http://dblp.uni-trier.de}
}
@article{rs92,
author = {John H. Reif and
Paul G. Spirakis},
title = {{Expected Parallel Time and Sequential Space Complexity of
Graph and Digraph Problems}},
journal = {Algorithmica},
volume = {7},
number = {5{\&}6},
year = {1992},
pages = {597--630},
doi = {10.1007/BF01758779},
ee = {http://dx.doi.org/10.1007/BF01758779},
bibsource = {DBLP, http://dblp.uni-trier.de}
}
@misc{hc,
author = {Timothy J. Harris and Murray I. Cole},
title = {The Parameterized PRAM},
year = {}
}
@inproceedings{abn99,
author = {Agbaria, Adnan and Ben-Asher, Yosi and Newman, Ilan},
title = {{Communication-processor tradeoffs in limited resources PRAM}},
booktitle = {{Proceedings of the eleventh annual ACM symposium on Parallel algorithms and architectures}},
series = {SPAA '99},
year = {1999},
isbn = {1-58113-124-0},
location = {Saint Malo, France},
pages = {74--82},
numpages = {9},
url = {http://doi.acm.org/10.1145/305619.305628},
doi = {10.1145/305619.305628},
acmid = {305628},
publisher = {ACM},
address = {New York, NY, USA},
}
@article{sx99,
title = {{On the average case complexity of some P-complete problems}},
author = {Maria Serna and Fatos Xhafa},
journal = {{Informatique Th\'{e}orique et Applications}},
volume = {33},
issue = {1},
year = {1999},
pages = {33--45}
}
@incollection{cd98,
author = {Cesati, Marco and Di Ianni, Miriam},
affiliation = {Univ. .Tor Vergata. Dip. di Informatica, Sistemi e Produzione via di Tor Vergata I-00133 Roma Italy via di Tor Vergata I-00133 Roma Italy},
title = {Parameterized parallel complexity},
booktitle = {Euro-Par.98 Parallel Processing},
series = {Lecture Notes in Computer Science},
editor = {Pritchard, David and Reeve, Jeff},
publisher = {Springer Berlin / Heidelberg},
isbn = {978-3-540-64952-6},
keyword = {Computer Science},
pages = {892--896},
volume = {1470},
url = {http://dx.doi.org/10.1007/BFb0057945},
doi = {10.1007/BFb0057945},
year = {1998}
}
@article{marx07,
author = {Marx, D\'{a}niel},
title = {{Parameterized Complexity and Approximation Algorithms}},
volume = {51},
number = {1},
pages = {60--78},
year = {2007},
doi = {10.1093/comjnl/bxm048},
abstract = {Approximation algorithms and parameterized complexity are usually considered to be two separate ways of dealing with hard algorithmic problems. In this paper, our aim is to investigate how these two fields can be combined to achieve better algorithms than what any of the two theories could offer. We discuss the different ways parameterized complexity can be extended to approximation algorithms, survey results of this type and propose directions for future research.},
url = {http://comjnl.oxfordjournals.org/content/51/1/60.abstract},
eprint = {http://comjnl.oxfordjournals.org/content/51/1/60.full.pdf+html},
journal = {The Computer Journal}
}
@article{ch10,
author = {Cai, Liming and Huang, Xiuzhen},
affiliation = {The University of Georgia Department of Computer Science Athens GA 30605 USA},
title = {{Fixed-Parameter Approximation: Conceptual Framework and Approximability Results}},
journal = {Algorithmica},
publisher = {Springer New York},
issn = {0178-4617},
keyword = {Computer Science},
pages = {398--412},
volume = {57},
issue = {2},
url = {http://dx.doi.org/10.1007/s00453-008-9223-x},
doi = {10.1007/s00453-008-9223-x},
year = {2010}
}
@unpublished{finkelstein13,
author = {Jef{}frey Finkelstein},
title = {Highly parallel approximations for inherently sequential problems},
year = {2013},
note = {Unpublished manuscript},
url = {https://github.com/jfinkels/ncapproximation}
}
@article{av88,
title = {The input/output complexity of sorting and related problems},
author = {Aggarwal, Alok and Vitter, Jeffrey},
journal = {Communications of the ACM},
volume = 31,
number = 9,
pages = {1116--1127},
year = 1988,
publisher = {ACM}
}
@misc{demaine07,
author = {Erik Demaine},
title = {{Advanced Data Structure, Lecture 19}},
month = apr,
day = 25,
year = 2007,
howpublished = {\url{http://courses.csail.mit.edu/6.851/spring07/scribe/lec19.pdf}},
note = {{Accessed April 15, 2014}}
}