You cannot select more than 25 topics
Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
366 lines
10 KiB
BibTeX
366 lines
10 KiB
BibTeX
@book{Sedgewick:1996:IAA:227351,
|
|
author = {Sedgewick, Robert and Flajolet, Philippe},
|
|
title = {An introduction to the analysis of algorithms},
|
|
year = {1996},
|
|
isbn = {0-201-40009-X},
|
|
publisher = {Addison-Wesley Longman Publishing Co., Inc.},
|
|
address = {Boston, MA, USA},
|
|
}
|
|
|
|
|
|
@book{McConnell:2007:AA:1374801,
|
|
author = {McConnell, Jeffrey J.},
|
|
title = {Analysis of Algorithms},
|
|
year = {2007},
|
|
isbn = {9780763707828},
|
|
edition = {2},
|
|
publisher = {Jones and Bartlett Publishers, Inc.},
|
|
address = {USA},
|
|
}
|
|
|
|
|
|
@article{Sleator:1985:SBS:3828.3835,
|
|
author = {Sleator, Daniel Dominic and Tarjan, Robert Endre},
|
|
title = {Self-adjusting binary search trees},
|
|
journal = {J. ACM},
|
|
issue_date = {July 1985},
|
|
volume = {32},
|
|
number = {3},
|
|
month = jul,
|
|
year = {1985},
|
|
issn = {0004-5411},
|
|
pages = {652--686},
|
|
numpages = {35},
|
|
url = {http://doi.acm.org/10.1145/3828.3835},
|
|
doi = {10.1145/3828.3835},
|
|
acmid = {3835},
|
|
publisher = {ACM},
|
|
address = {New York, NY, USA},
|
|
}
|
|
|
|
@incollection{Bayer:2002:BDP:944331.944346,
|
|
author = {Bayer, Rudolf},
|
|
chapter = {B-trees and databases, past and future},
|
|
title = {Software pioneers},
|
|
editor = {Broy, Manfred and Denert, Ernst},
|
|
year = {2002},
|
|
isbn = {3-540-43081-4},
|
|
pages = {232--244},
|
|
numpages = {13},
|
|
url = {http://dl.acm.org/citation.cfm?id=944331.944346},
|
|
acmid = {944346},
|
|
publisher = {Springer-Verlag New York, Inc.},
|
|
address = {New York, NY, USA},
|
|
}
|
|
|
|
@article{Adelson-Velskii_Landis_1962,
|
|
title = {An algorithm for the organization of information},
|
|
volume = {3},
|
|
url = {http://en.scientificcommons.org/19884302},
|
|
number = {2},
|
|
journal = {Soviet Mathematics Doklady},
|
|
publisher = {JOINT PUBLICATIONS RESEARCH SERVICE WASHINGTON DC},
|
|
author = {Adelson-Velskii, G M and Landis, E M},
|
|
year={1962},
|
|
pages={263--266}
|
|
}
|
|
|
|
@article{Tan:1972:FIS:361573.361588,
|
|
author = {Tan, K. C.},
|
|
title = {On Foster's information storage and retrieval using AVL trees},
|
|
journal = {Commun. ACM},
|
|
issue_date = {Sept. 1972},
|
|
volume = {15},
|
|
number = {9},
|
|
month = sep,
|
|
year = {1972},
|
|
issn = {0001-0782},
|
|
pages = {843--},
|
|
url = {http://doi.acm.org/10.1145/361573.361588},
|
|
doi = {10.1145/361573.361588},
|
|
acmid = {361588},
|
|
publisher = {ACM},
|
|
address = {New York, NY, USA},
|
|
keywords = {binary trees, information retrieval, information storage, search trees},
|
|
}
|
|
|
|
@inproceedings{Wilson:1992:UGC:645648.664824,
|
|
author = {Wilson, Paul R.},
|
|
title = {Uniprocessor Garbage Collection Techniques},
|
|
booktitle = {Proceedings of the International Workshop on Memory Management},
|
|
series = {IWMM '92},
|
|
year = {1992},
|
|
isbn = {3-540-55940-X},
|
|
pages = {1--42},
|
|
numpages = {42},
|
|
url = {http://dl.acm.org/citation.cfm?id=645648.664824},
|
|
acmid = {664824},
|
|
publisher = {Springer-Verlag},
|
|
address = {London, UK, UK},
|
|
}
|
|
|
|
@book{Jones:2011:GCH:2025255,
|
|
author = {Jones, Richard and Hosking, Antony and Moss, Eliot},
|
|
title = {The Garbage Collection Handbook: The Art of Automatic Memory Management},
|
|
year = {2011},
|
|
isbn = {1420082795, 9781420082791},
|
|
edition = {1st},
|
|
publisher = {Chapman \& Hall/CRC},
|
|
}
|
|
|
|
@article{Andersson:1999:GBT:308088.308094,
|
|
author = {Andersson, Arne},
|
|
title = {General balanced trees},
|
|
journal = {J. Algorithms},
|
|
issue_date = {Jan. 1999},
|
|
volume = {30},
|
|
number = {1},
|
|
month = jan,
|
|
year = {1999},
|
|
issn = {0196-6774},
|
|
pages = {1--18},
|
|
numpages = {18},
|
|
url = {http://dx.doi.org/10.1006/jagm.1998.0967},
|
|
doi = {10.1006/jagm.1998.0967},
|
|
acmid = {308094},
|
|
publisher = {Academic Press, Inc.},
|
|
address = {Duluth, MN, USA},
|
|
}
|
|
|
|
@article{Stout:1986:TRO:6592.6599,
|
|
author = {Stout, Q. F and Warren, B. L},
|
|
title = {Tree rebalancing in optimal time and space},
|
|
journal = {Commun. ACM},
|
|
issue_date = {Sept. 1986},
|
|
volume = {29},
|
|
number = {9},
|
|
month = sep,
|
|
year = {1986},
|
|
issn = {0001-0782},
|
|
pages = {902--908},
|
|
numpages = {7},
|
|
url = {http://doi.acm.org/10.1145/6592.6599},
|
|
doi = {10.1145/6592.6599},
|
|
acmid = {6599},
|
|
publisher = {ACM},
|
|
address = {New York, NY, USA},
|
|
}
|
|
|
|
@article{Waters:1992:UNC:1039991.1039996,
|
|
author = {Waters, Richard C.},
|
|
title = {Using the new common Lisp pretty printer},
|
|
journal = {SIGPLAN Lisp Pointers},
|
|
issue_date = {April-June 1992},
|
|
volume = {V},
|
|
number = {2},
|
|
month = apr,
|
|
year = {1992},
|
|
issn = {1045-3563},
|
|
pages = {27--34},
|
|
numpages = {8},
|
|
url = {http://doi.acm.org/10.1145/1039991.1039996},
|
|
doi = {10.1145/1039991.1039996},
|
|
acmid = {1039996},
|
|
publisher = {ACM},
|
|
address = {New York, NY, USA},
|
|
}
|
|
|
|
@INPROCEEDINGS{Waters89xp:a,
|
|
author = {Richard C. Waters},
|
|
title = {XP: A Common Lisp Pretty Printing System},
|
|
booktitle = {A.I. Memo 1102a, MIT Artificial Intelligence Laboratory},
|
|
year = {1989}
|
|
}
|
|
|
|
BibTeX | BibTeX (beta) | EndNote | ACM Ref
|
|
|
|
@techreport{Huang:1990:FSM:898863,
|
|
author = {Huang, Bing and Langston, Michael A.},
|
|
title = {Fast Stable Merging and Sorting in Constant Extra Space},
|
|
year = {1990},
|
|
source = {http://www.ncstrl.org:8900/ncstrl/servlet/search?formname=detail\&id=oai%3Ancstrlh%3Autk_cs%3Ancstrl.utk_cs%2F%2FUT-CS-90-106},
|
|
publisher = {University of Tennessee},
|
|
address = {Knoxville, TN, USA},
|
|
}
|
|
|
|
@article{Huang:1988:PIM:42392.42403,
|
|
author = {Huang, Bing-Chao and Langston, Michael A.},
|
|
title = {Practical in-place merging},
|
|
journal = {Commun. ACM},
|
|
issue_date = {March 1988},
|
|
volume = {31},
|
|
number = {3},
|
|
month = mar,
|
|
year = {1988},
|
|
issn = {0001-0782},
|
|
pages = {348--352},
|
|
numpages = {5},
|
|
url = {http://doi.acm.org/10.1145/42392.42403},
|
|
doi = {10.1145/42392.42403},
|
|
acmid = {42403},
|
|
publisher = {ACM},
|
|
address = {New York, NY, USA},
|
|
}
|
|
|
|
@article{Katajainen:1996:PIM:642136.642138,
|
|
author = {Katajainen, Jyrki and Pasanen, Tomi and Teuhola, Jukka},
|
|
title = {Practical in-place mergesort},
|
|
journal = {Nordic J. of Computing},
|
|
issue_date = {Spring 1996},
|
|
volume = {3},
|
|
number = {1},
|
|
month = mar,
|
|
year = {1996},
|
|
issn = {1236-6064},
|
|
pages = {27--40},
|
|
numpages = {14},
|
|
url = {http://dl.acm.org/citation.cfm?id=642136.642138},
|
|
acmid = {642138},
|
|
publisher = {Publishing Association Nordic Journal of Computing},
|
|
address = {Finland},
|
|
keywords = {in-place algorithms, mergesort, sorting},
|
|
}
|
|
|
|
@inproceedings{Clinger:1990:RFP:93542.93557,
|
|
author = {Clinger, William D.},
|
|
title = {How to read floating point numbers accurately},
|
|
booktitle = {Proceedings of the ACM SIGPLAN 1990 conference on Programming language design and implementation},
|
|
series = {PLDI '90},
|
|
year = {1990},
|
|
isbn = {0-89791-364-7},
|
|
location = {White Plains, New York, USA},
|
|
pages = {92--101},
|
|
numpages = {10},
|
|
url = {http://doi.acm.org/10.1145/93542.93557},
|
|
doi = {10.1145/93542.93557},
|
|
acmid = {93557},
|
|
publisher = {ACM},
|
|
address = {New York, NY, USA},
|
|
}
|
|
|
|
@inproceedings{Burger:1996:PFN:231379.231397,
|
|
author = {Burger, Robert G. and Dybvig, R. Kent},
|
|
title = {Printing floating-point numbers quickly and accurately},
|
|
booktitle = {Proceedings of the ACM SIGPLAN 1996 conference on Programming language design and implementation},
|
|
series = {PLDI '96},
|
|
year = {1996},
|
|
isbn = {0-89791-795-2},
|
|
location = {Philadelphia, Pennsylvania, USA},
|
|
pages = {108--116},
|
|
numpages = {9},
|
|
url = {http://doi.acm.org/10.1145/231379.231397},
|
|
doi = {10.1145/231379.231397},
|
|
acmid = {231397},
|
|
publisher = {ACM},
|
|
address = {New York, NY, USA},
|
|
keywords = {floating-point printing, run-time systems},
|
|
}
|
|
|
|
@TECHREPORT{Gay90correctlyrounded,
|
|
author = {David M. Gay},
|
|
title = {Correctly Rounded Binary-Decimal and Decimal-Binary Conversions},
|
|
institution = {Numerical Analysis Manuscript 90-10, AT\&T Bell Laboratories},
|
|
year = {1990}
|
|
}
|
|
|
|
@inproceedings{Doligez:1993:CGG:158511.158611,
|
|
author = {Doligez, Damien and Leroy, Xavier},
|
|
title = {A concurrent, generational garbage collector for a multithreaded implementation of ML},
|
|
booktitle = {Proceedings of the 20th ACM SIGPLAN-SIGACT symposium on Principles of programming languages},
|
|
series = {POPL '93},
|
|
year = {1993},
|
|
isbn = {0-89791-560-7},
|
|
location = {Charleston, South Carolina, USA},
|
|
pages = {113--123},
|
|
numpages = {11},
|
|
url = {http://doi.acm.org/10.1145/158511.158611},
|
|
doi = {10.1145/158511.158611},
|
|
acmid = {158611},
|
|
publisher = {ACM},
|
|
address = {New York, NY, USA},
|
|
}
|
|
|
|
@book{Kiczales:1991:AMP:574212,
|
|
author = {Kiczales, Gregor and Rivieres, Jim Des},
|
|
title = {The Art of the Metaobject Protocol},
|
|
year = {1991},
|
|
isbn = {0262111586},
|
|
publisher = {MIT Press},
|
|
address = {Cambridge, MA, USA},
|
|
}
|
|
|
|
@article{Kermany:2006:CCI:1133255.1134023,
|
|
author = {Kermany, Haim and Petrank, Erez},
|
|
title = {The Compressor: Concurrent, Incremental, and Parallel Compaction},
|
|
journal = {SIGPLAN Not.},
|
|
issue_date = {June 2006},
|
|
volume = {41},
|
|
number = {6},
|
|
month = jun,
|
|
year = {2006},
|
|
issn = {0362-1340},
|
|
pages = {354--363},
|
|
numpages = {10},
|
|
url = {http://doi.acm.org/10.1145/1133255.1134023},
|
|
doi = {10.1145/1133255.1134023},
|
|
acmid = {1134023},
|
|
publisher = {ACM},
|
|
address = {New York, NY, USA},
|
|
keywords = {compaction, concurrent garbage collection, garbage collection, memory management, runtime systems},
|
|
}
|
|
|
|
@inproceedings{Kermany:2006:CCI:1133981.1134023,
|
|
author = {Kermany, Haim and Petrank, Erez},
|
|
title = {The Compressor: Concurrent, Incremental, and Parallel Compaction},
|
|
booktitle = {Proceedings of the 2006 ACM SIGPLAN Conference on Programming Language Design and Implementation},
|
|
series = {PLDI '06},
|
|
year = {2006},
|
|
isbn = {1-59593-320-4},
|
|
location = {Ottawa, Ontario, Canada},
|
|
pages = {354--363},
|
|
numpages = {10},
|
|
url = {http://doi.acm.org/10.1145/1133981.1134023},
|
|
doi = {10.1145/1133981.1134023},
|
|
acmid = {1134023},
|
|
publisher = {ACM},
|
|
address = {New York, NY, USA},
|
|
keywords = {compaction, concurrent garbage collection, garbage collection, memory management, runtime systems},
|
|
}
|
|
|
|
@article{Barroso:2017:AKM:3069398.3015146,
|
|
author = {Barroso, Luiz and Marty, Mike and Patterson, David and Ranganathan, Parthasarathy},
|
|
title = {Attack of the Killer Microseconds},
|
|
journal = {Commun. ACM},
|
|
issue_date = {April 2017},
|
|
volume = {60},
|
|
number = {4},
|
|
month = mar,
|
|
year = {2017},
|
|
issn = {0001-0782},
|
|
pages = {48--54},
|
|
numpages = {7},
|
|
url = {http://doi.acm.org/10.1145/3015146},
|
|
doi = {10.1145/3015146},
|
|
acmid = {3015146},
|
|
publisher = {ACM},
|
|
address = {New York, NY, USA},
|
|
}
|
|
|
|
@article{Waddington:2018:SCC:3289258.3186331,
|
|
author = {Waddington, Daniel and Harris, Jim},
|
|
title = {Software Challenges for the Changing Storage Landscape},
|
|
journal = {Commun. ACM},
|
|
issue_date = {November 2018},
|
|
volume = {61},
|
|
number = {11},
|
|
month = oct,
|
|
year = {2018},
|
|
issn = {0001-0782},
|
|
pages = {136--145},
|
|
numpages = {10},
|
|
url = {http://doi.acm.org/10.1145/3186331},
|
|
doi = {10.1145/3186331},
|
|
acmid = {3186331},
|
|
publisher = {ACM},
|
|
address = {New York, NY, USA},
|
|
} |