no way to compare when less than two revisions
Differences
This shows you the differences between two versions of the page.
| — | events:individual_past_events:poughkeepsie_acm_speaker_jon_bentley [2010/03/16 11:53] (current) – created - external edit 127.0.0.1 | ||
|---|---|---|---|
| Line 1: | Line 1: | ||
| + | /* If you have not already done so, please begin the heading below | ||
| + | with a date in YYYY-MM-DD format followed by a short description. | ||
| + | This is what will appear in the event listing and the event list | ||
| + | | ||
| + | |||
| + | ==== 2010-03-15 Poughkeepsie ACM Speaker Jon Bentley ==== | ||
| + | |||
| + | |||
| + | |||
| + | //Reposted here from [[http:// | ||
| + | |||
| + | Poughkeepsie Chapter of the Association For Computing Machinery | ||
| + | |||
| + | aaa | ||
| + | a | ||
| + | aa | ||
| + | aaaaaaaaa | ||
| + | | ||
| + | aa | ||
| + | | ||
| + | |||
| + | |||
| + | **Program: | ||
| + | |||
| + | **Speaker: | ||
| + | |||
| + | **About the Topic:** | ||
| + | |||
| + | For half a century, the fastest comparison-based sort functions | ||
| + | have been variants of Hoare’s classic Quicksort. | ||
| + | which variants are best on today’s machines? | ||
| + | experiments to search for the fastest possible implementation of | ||
| + | Quicksort; our hunt is a celebration of the Joy of Programming. | ||
| + | We were surprised by the results: some old champions are now | ||
| + | painfully slow, while long-discarded variants have become | ||
| + | lightning fast. Along the way, we discovered a desperate need | ||
| + | for a new cost model for sorting, and we laid the foundation for | ||
| + | the Dual-Pivot Quicksort we wrote for Java Development Kit 7. We | ||
| + | found that explicitly considering a large family (or product | ||
| + | line) of algorithms is a powerful approach. | ||
| + | joint work with Vladimir Yaroslavskiy and Joshua Bloch.) | ||
| + | |||
| + | **About the Speaker:** | ||
| + | |||
| + | Jon Bentley is a computer scientist at Avaya Labs Research. | ||
| + | His interests include programming techniques, algorithm design, | ||
| + | and the design of software tools and interfaces. | ||
| + | three books on programming and articles on a variety of topics, | ||
| + | ranging from the theory of algorithms to software engineering. | ||
| + | |||
| + | Possibly his best known work is the book " | ||
| + | (see www.cs.bell-labs.com/ | ||
| + | columns he wrote in the 1980's for the Communications of the ACM. | ||
| + | |||
| + | Bentley received a B.S. at Stanford in 1974 and an M.S. and | ||
| + | Ph.D. from the University of North Carolina in 1976; he then | ||
| + | taught Computer Science at Carnegie Mellon for six years. | ||
| + | joined Bell Labs in 1982, and retired in 2001 to join Avaya Labs. | ||
| + | |||
| + | Jon has hiked the Catskill 3500 peaks nine times (including | ||
| + | once solo in the winter), the 46 4000-foot peaks in the | ||
| + | Adirondacks, | ||
| + | the five 4000-footers in Vermont' | ||
| + | numerous rock climbing ascents, both frontcountry and | ||
| + | backcountry, | ||
| + | Technician rankings, many of them relating to Wilderness EMT. | ||
| + | |||
| + | **When: | ||
| + | |||
| + | **Where: | ||
| + | Marist College, Route 9, Poughkeepsie, | ||
| + | (Donnelly Hall is Building 6 on the Marist campus map at www.marist.edu/ | ||
| + | |||
| + | **Parking: | ||
| + | |||
| + | **Cost: | ||
| + | |||
| + | **Dinner: | ||
| + | **Menu:** www.thepalacediner.com/ | ||
| + | |||
| + | All are welcome to join us for dinner. | ||
| + | Arterial to the St. Francis Hospital exit, turn right, turn | ||
| + | right again. | ||
| + | |||
| + | We thank Marist College for hosting the chapter' | ||
| + | |||
| + | Refreshments are served after the meeting. | ||
| + | information, | ||
| + | |||
| + | Site Map. This page is available on the web at http:// | ||