Algorithms to Live By
Page 46
Thomas, Helen. Front Row at the White House: My Life and Times. New York: Simon & Schuster, 2000.
Thompson, William R. “On the Likelihood That One Unknown Probability Exceeds Another in View of the Evidence of Two Samples.” Biometrika 25 (1933): 285–294.
Thoreau, Henry David. “Walking.” Atlantic Monthly 9 (1862): 657–674.
Tibshirani, Robert. “Regression Shrinkage and Selection via the Lasso.” Journal of the Royal Statistical Society. Series B (Methodological) 58, no. 1 (1996): 267–288.
Tikhonov, A. N., and V. Y. Arsenin. Solution of Ill-Posed Problems. Washington, DC: Winston, 1977.
Todd, Peter M. “Coevolved Cognitive Mechanisms in Mate Search.” Evolution and the Social Mind: Evolutionary Psychology and Social Cognition (New York) 9 (2007): 145–159.
Todd, Peter M., and G. F. Miller. “From Pride and Prejudice to Persuasion: Satisficing in Mate Search.” In Simple Heuristics That Make Us Smart. Edited by G. Gigerenzer and P. M. Todd. New York: Oxford University Press, 1999, 287–308.
Tolins, Jackson, and Jean E. Fox Tree. “Addressee Backchannels Steer Narrative Development.” Journal of Pragmatics 70 (2014): 152–164.
Tracy, Brian. Eat That Frog! 21 Great Ways to Stop Procrastinating and Get More Done in Less Time. Oakland, CA: Berrett-Koehler, 2007.
Turing, Alan M. “On Computable Numbers, with an Application to the Entscheidungsproblem.” Read November 12, 1936. Proceedings of the London Mathematical Society s2-42, no. 1 (1937): 230–265.
______. “On Computable Numbers, with an Application to the Entscheidungsproblem: A Correction.” Proceedings of the London Mathematical Society s2-43, no. 1 (1938): 544–546.
Tversky, Amos, and Ward Edwards. “Information Versus Reward in Binary Choices.” Journal of Experimental Psychology 71 (1966): 680–683.
Ulam, Stanislaw M. Adventures of a Mathematician. New York: Scribner, 1976.
Ullman, Ellen. “Out of Time: Reflections on the Programming Life.” Educom Review 31 (1996): 53–59.
UK Collaborative ECMO Group. “The Collaborative UK ECMO Trial: Follow-up to 1 Year of Age.” Pediatrics 101, no. 4 (1998): e1.
Vazirani, Vijay V. Approximation Algorithms. New York: Springer, 2001.
Vickrey, William. “Counterspeculation, Auctions, and Competitive Sealed Tenders.” Journal of Finance 16, no. 1 (1961): 8–37.
Waitzman, David. A Standard for the Transmission of IP Datagrams on Avian Carriers. Technical report. RFC 1149, April 1990.
______. IP Over Avian Carriers with Quality of Service. Technical report. RFC 2549, April 1999.
Ware, James H. “Investigating Therapies of Potentially Great Benefit: ECMO.” Statistical Science 4 (1989): 298–306.
Ware, James H., and Michael F. Epstein. “Comments on ‘Extracorporeal Circulation in Neonatal Respiratory Failure: A Prospective Randomized Study’ by R. H. Bartlett et al.” Pediatrics 76, no. 5 (1985): 849–851.
Warhol, Andy. The Philosophy of Andy Warhol (from A to B and Back Again). New York: Harcourt Brace Jovanovich, 1975.
Weiss, Yair, Eero P. Simoncelli, and Edward H. Adelson. “Motion Illusions as Optimal Percepts.” Nature Neuroscience 5 (2002): 598–604.
Whittaker, Steve, and Candace Sidner. “Email Overload: Exploring Personal Information Management of Email.” In Proceedings of the SIGCHI Conference on Human Factors in Computing Systems, 1996, 276–283.
Whittaker, Steve, Tara Matthews, Julian Cerruti, Hernan Badenes, and John Tang. “Am I Wasting My Time Organizing Email? A Study of Email Refinding.” In Proceedings of the SIGCHI Conference on Human Factors in Computing Systems, 2011, 3449–3458.
Whittle, Peter. Optimization over Time: Dynamic Programming and Stochastic Control. New York: Wiley, 1982.
______. “Restless Bandits: Activity Allocation in a Changing World.” Journal of Applied Probability 25 (1988): 287–298.
Wigderson, Avi. “Knowledge, Creativity, and P versus NP.” http://www.math.ias.edu/~avi/PUBLICATIONS/MYPAPERS/AW09/AW09.pdf, 2009.
Wilkes, Maurice V. “Slave Memories and Dynamic Storage Allocation.” IEEE Transactions on Electronic Computers 14 (1965): 270–271.
Wright, J. W. “The Change-Making Problem.” Journal of the Association of Computing Machinery 22 (1975): 125–128.
Wulf, William Allan, and Sally A. McKee. “Hitting the Memory Wall: Implications of the Obvious.” ACM SIGARCH Computer Architecture News 23, no. 1 (1995): 20–24.
Xu, Fei, and Joshua B. Tenenbaum. “Word Learning as Bayesian Inference.” Psychological Review 114 (2007): 245–272.
Yang, Mark C. K. “Recognizing the Maximum of a Random Sequence Based on Relative Rank with Backward Solicitation.” Journal of Applied Probability 11 (1974): 504–512.
Yato, Takayuki, and Takahiro Seta. “Complexity and Completeness of Finding Another Solution and Its Application to Puzzles.” IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences 86, no. 5 (2003): 1052–1060.
Yngve, Victor H. “On Getting a Word in Edgewise.” In Chicago Linguistics Society, 6th Meeting, 1970, 567–578.
Zahniser, Rick. “Timeboxing for Top Team Performance.” Software Development 3, no. 3 (1995): 34–38.
Zapol, Warren M., Michael T. Snider, J. Donald Hill, Robert J. Fallat, Robert H. Bartlett, L. Henry Edmunds, Alan H. Morris, E. Converse Peirce, Arthur N. Thomas, Herbert J. Proctor, et al. “Extracorporeal Membrane Oxygenation in Severe Acute Respiratory Failure: A Randomized Prospective Study.” Journal of the American Medical Association 242, no. 20 (1979): 2193–2196.
Zelen, Marvin. “Play the Winner Rule and the Controlled Clinical Trial.” Journal of the American Statistical Association 64, no. 325 (1969): 131–146.
Zippel, Richard. “Probabilistic Algorithms for Sparse Polynomials.” In EUROSAM ’79 Proceedings of the International Symposium on Symbolic and Algebraic Computation. London: Springer, 1979, 216–226.
Index
The index that appeared in the print version of this title does not match the pages in your e-book. Please use the search function on your e-reading device to search for terms of interest. For your reference, the terms that appear in the print index are listed below.
Aalsmeer Flower Auction
Aaronson, Scott
Abramson, Norman
A/B testing
Ackley, Dave
acknowledgment packets (ACKs)
“Adaptive Design Clinical Trials”
Additive Increase, Multiplicative Decrease (AIMD)
Additive Rule
aging
Agrawal, Manindra
air travel
Akamai
algorithmic game theory. See also game theory
algorithms. See also specific algorithms and problems
defined
deterministic vs. randomized
everyday problems and
Alice’s Adventures in Wonderland (Carroll)
al-Jabr wa’l-Muqābala (al-Khwārizmī)
Allen, Nick
Alm, Steven
almond milk
ALOHAnet
Altman, Sam
Amazon
“Am I Wasting My Time Organizing Email?” (Whittaker)
anarchy, price of
Anderson, John
anecdotes, statistics vs.
anger
annealing
Annie (musical)
Annie Get Your Gun (musical)
Ansari, Aziz
anticipatory package shipping
ants
apartment hunting
applicant pool
Archimedes
architects
Aristotle
ARPANET
artificial neural networks
“Association of Illness with Prior Ingestion of Novel Foods” (Revusky and Bedarf)
Astley, Rick
AT&T
Atlantic Monthly
Atlas supercomputer
atomic bomb
auctions
Dut
ch or descending
English or ascending
information cascades and
sealed-bid first-price
sealed-bid second-price or Vickrey
Austen, Jane
Average Rule
AvtoVAZ company
backchannels
background noise
bacterial mutations
bandwidth, latency vs.
bandwidth drops
Baran, Paul
Barnard, Chester
Bartlett, Robert
basketball
batch processing
Bavelas, Janet
Bayes, Rev. Thomas
Bayes’s Rule
defined
BBC
BBC News
Beautiful Mind, A (Nasar)
beauty
Bedarf, Erwin
Bélády, László “Les”
Bélády’s Algorithm
Belew, Rik
Bell, Alexander Graham
bell curve
Bellman, Richard
Bellows, Meghan
Belmont Report
benchmarks
Berezovsky, Boris
Berkeley, Bishop George
Berlin Wall
Bernard, Claude
Berry, Don
best-case performance
Bezos, Jeff
big data
Big-O notation. See also constant time; exponential time; factorial time; linearithmic time; linear time; polynomial time; quadratic time
Big Ten conference
Bikhchandani, Sushil
bill-paying schedule
Bing
Binmore, Ken
births, male vs. female
Bitcoin
“Blind Variation and Selective Retention” (Campbell)
blocking
Bloom, Burton H.
Bloomberg Businessweek
Bloom filter
Blum, Avrim
Boguslavsky, Leonid
bookbinding
Booker, Christopher
bracket tournaments
Bradáč, Zdeněk
breaking symmetry
Brighton, Henry
bubbles, financial
Bubble Sort
Bucket Sort
bufferbloat
buffers
Buffon, George-Louis Leclerc, Comte de
burglar problem
Burks, Arthur
business. See also secretary problem
overfitting and
promotions
weekly meetings
Buxtun, Peter
Byzantine generals problem
Cabell, James Branch
cache eviction
cache misses
caches
defined
hierarchies of, and multitasking
speed of
caching
caching algorithms (replacement or eviction policies)
calculus
Callimachus
Campbell, Donald
cardinal numbers
career choices
Carroll, Lewis. See Dodgson, Charles Lutwidge
cars
accidents and
parking
self-driving
traffic and
Carstensen, Laura
Casino Royale
categorical imperative
Cawdrey, Robert
cell phone
Cerf, Vinton “Vint”
certainty. See also uncertainty
charity
Cheshire, Stuart
chess
childhood
Chomsky, Noam
Churchill, Winston
circuit switching
clairvoyance
clinical trials
closet, organizing
Cobham, Alan
Cobham-Edmonds thesis
Cockcroft, George (Luke Rhinehart)
coconut water
cognitive decline
coincidences
coins
denominations
two-headed tosses
collators
commitment problem
communications. See also language; networking; storytelling
confirmation
priors and
community-supported agriculture (CSA)
Comparison Counting Sort
comparison-shopping websites
complexity
penalizing
computation, defined by Turing
computational kindness
confidence interval
confirmation
congestion
avoidance of
price of anarchy and
Connection Machine
constant-time (O(1))
constrained optimization problems
constrained problem, preferences for
Constraint Relaxation
construction projects
content distribution networks (CDNs)
context switching
continuous optimization problems
Continuous Relaxation
control without hierarchy
Cooper, Martin
cooperation
Copernican Principle
Copernicus, Nicolaus
corporate marketing
cost-benefit analysis
Cramer, Jim
Cravath system
creativity
crêpe stand queue
Cross-Validation
cryptography
customer service hold times
Darwin, Charles
data. See also big data; small data
idolatry of
overfitting and
predicting from single point
dating. See love; marriage
Davis, Lydia
Dawkins, Richard
deadlines
Dead Poets Society (film)
Deal or No Deal (TV show)
debt avalanche
debt snowball
decentralized systems
decision-making
computational kindness and
Early Stopping and
overfitting and
real-world shortcuts
when to think less
decryption
decussation
defection
Defense Officer Personnel Management Act
denial of service attack
Denning, Peter
device buffers
Dice Man, The (Rhinehart)
dictionary attack
Dillard, Annie
discount function
discrete optimization
Discrete Relaxation Techniques (Henderson)
displacement
distributions. See also specific types
Dodgson, Charles Lutwidge (Lewis Carroll)
dominance hierarchies
dominant strategies
honesty as
prisoner’s dilemma and defection as
dropped balls
drug addiction
drug trials
Dupuis, Beth
Duvall, Bill
Dwan, Tom
dynamic allocation. See Gittins Index
dynamic hierarchies
“Dysfunctional Consequences of Performance Measurements” (Ridgway)
ear
Earliest Due Date
Early Stopping
Eat That Frog! (Tracy)
Ebbinghaus, Hermann
ECMO (extracorporeal membrane oxygenation)
economics. See also auctions; investment strategies; market behavior
bubbles
Nash equilibrium and
tragedy of commons and
Economist
Edmonds, Jack
educational evaluation
Edwards, Ward
efficient algorithm
efficient or tractable problem, defined
Egyptian pharaohs’ reigns
electrical memory
organ
elevator pitch
email
emotions
Engel, Joel
Eno, Brian
environmental movement
epidemiology
equality
equilibrium
Erlang, Agner Krarup
Erlang distribution
error bars
error tradeoff space
ethics
Evernote
eviction policies
evolution
constraints and
expected value
Explicit Congestion Notification (ECN)
explore/exploit tradeoff
Exponential Backoff
exponential time (O(2n))
Facebook
factorial time (O(n!))
fads
false positives
FBI
FCC spectrum auctions
FDA
feedback
fencing
filing
Finkel, Larry
Firefox
fire truck problem
First-In, First-Out (FIFO)
fitness
Fitzgerald, F. Scott
Flack, Jessica
flash memory
flat hierarchies
Flood, Merrill
flow control
food
fads
minimizing rotten
overfitting and
Forbes
forgetting curve
forgiveness
Forster, E. M.
Fortune 500 list
Frank, Robert
Franklin, Benjamin
Fredrickson, Barbara
Fried, Jason
full-information games
optimal stopping and
fundamental investors
future, discounted
Galileo
gambling
game theory
gaming
Gantt, Henry
Gantt charts
Gardner, Martin
Gaskell, R. E.
Gauss, Carl Friedrich
Gelatt, Dan
geography
geometric discounting
George, Sammy
German tanks problem
getting important things done
getting things done
Getting Things Done (Allen)
Gettys, Jim
Gigerenzer, Gerd
Gilbert, Daniel
Ginsberg, Allen
Gittins, John
Gittins index
GiveDirectly
Glassner, Barry
Gleason, Andrew
global maximum
goals, explicit
Godfather
Godfather, The (film)
Goethe, Johann Wolfgang von
Goldstine, Herman
“good enough” solutions
Google
Gopnik, Alison
Gordon, Deborah
Gott, J. Richard, III
Gould, Stephen Jay
government
“Great Men, Great Thoughts, and the Environment” (James)
greedy algorithm
Grellet, Stephen
Grossman, Dave
Guardian