Dubrovnik / New York / Washington / DC / Berlin / Copenhagen / London / /
Company
ACM Press / Duxbury Press / /
Country
Croatia / United States / United Kingdom / /
Currency
USD / / /
Event
Product Issues / /
Facility
USA Computer Science Dept. Stanford University / /
IndustryTerm
power law fits / post-processing step / information exploration tool / minimal per-workload post-processing / suffix tree algorithm / tricky algorithm / cluster power law fit observations / linear-time algorithm / large systems / depth-first search / power law fit observations / post-processing / cluster accounting / generic and convenient tool / output cluster power law fit / linear search / /
MarketIndex
SET 100 / /
NaturalFeature
Joseph Dale / /
Organization
National Science Foundation / UC Berkeley / Stanford University / IEEE Computer Society / /
Person
Matt Harren / Alex S. Aiken / Karl Chen / Armando Solar-Lezama / Robert Johnson / Johnathon Jamison / John Kodumal / Adam Chlipala / Daniel S. Wilkerson California / Jonathan Traupman / Scott McPeak / Jeremy Condit / Jimmy Su / Simon F. Goldsmith∗ Alex / / /
Position
Performance Measures General / realistic model for parallel computation / representative for the cluster SIZE / author / automatic complexity evaluator / cluster representative / representative / programmer / /
Product
Pentax K-x Digital Camera / implementations / /
ProgrammingLanguage
Java / C / Perl / DC / C++ / /
ProvinceOrState
New York / Manitoba / /
PublishedMedium
Lecture Notes in Computer Science / /
Technology
functional programming / clustering algorithm / tricky algorithm / Perl / operating system / Technology of Object-Oriented Languages / Java / suffix tree algorithm / simulation / linear-time algorithm / same algorithm / Parallel Processing / /
Measuring Empirical Computational Complexity Simon F. Goldsmith∗ Alex S. Aiken Computer Science Dept.