The Algorithm Auction is the world's first auction of computer algorithms. Created by Ruse Laboratories, the initial auction featured seven lots and was held at the Cooper Hewitt, Smithsonian Design Museum on March 27, 2015. Five lots were physical representations of famous code or algorithms, including a signed, handwritten copy of the original Hello, World! C program by its creator Brian Kernighan on dot-matrix printer paper, a printed copy of 5,000 lines of Assembly code comprising the earliest known version of Turtle Graphics, signed by its creator Hal Abelson, a necktie containing the six-line qrpff algorithm capable of decrypting content on a commercially produced DVD video disc, and a pair of drawings representing OKCupid’s original Compatibility Calculation algorithm, signed by the company founders. The qrpff lot sold for $2,500. Two other lots were “living algorithms,” including a set of JavaScript tools for building applications that are accessible to the visually impaired and the other is for a program that converts lines of software code into music. Winning bidders received, along with artifacts related to the algorithms, a full intellectual property license to use, modify, or open-source the code. All lots were sold, with Hello World receiving the most bids. Exhibited alongside the auction lots were a facsimile of the Plimpton 322 tablet on loan from Columbia University, and Nigella, an art-world facing computer virus named after Nigella Lawson and created by cypherpunk and hacktivist Richard Jones. Sebastian Chan, Director of Digital & Emerging Media at the Cooper–Hewitt, attended the event remotely from Milan, Italy via a Beam Pro telepresence robot. (Wikipedia).
Build a Heap - Intro to Algorithms
This video is part of an online course, Intro to Algorithms. Check out the course here: https://www.udacity.com/course/cs215.
From playlist Introduction to Algorithms
Introduction to Algorithms - What are they and how are they useful?
#3B1B #SoMe2 This is my submission for this year's SoME, SoME2!! I hope you enjoy, and please feel free to leave any comments. Any feedback is hugely appreciated~! ーーーーーーーーーーーーーーーーーーーーーーー Time Stamps: 00:00 Intro 00:37 Introduction to Algorithms 03:47 Exploring Algorithms - Binary Searc
From playlist Summer of Math Exposition 2 videos
Heap Sort - Intro to Algorithms
This video is part of an online course, Intro to Algorithms. Check out the course here: https://www.udacity.com/course/cs215.
From playlist Introduction to Algorithms
Greedy Algorithm | What Is Greedy Algorithm? | Introduction To Greedy Algorithms | Simplilearn
This video on the Greedy Algorithm will acquaint you with all the fundamentals of greedy programming paradigm. In this tutorial, you will learn 'What Is Greedy Algorithm?' with the help of suitable examples. And finally, you will also discover few important applications of greedy algorithm
From playlist Data Structures & Algorithms [2022 Updated]
Intro to Graph Search Animation - Intro to Algorithms
This video is part of an online course, Intro to Algorithms. Check out the course here: https://www.udacity.com/course/cs215.
From playlist Introduction to Algorithms
Algorithms Explained: What is an Algorithm?
This video defines what an algorithm is, distinguishes algorithms from recipes and functions and gives some examples of algorithms. This is the first video in an "Algorithms Explained" series that discusses algorithms at a conceptual level. Videos in this series that discuss specific algo
From playlist Algorithms Explained
Function Comparision - Intro to Algorithms
This video is part of an online course, Intro to Algorithms. Check out the course here: https://www.udacity.com/course/cs215.
From playlist Introduction to Algorithms
Searching and Sorting Algorithms (part 4 of 4)
Introductory coverage of basic searching and sorting algorithms, as well as a rudimentary overview of Big-O algorithm analysis. Part of a larger series teaching programming at http://codeschool.org
From playlist Searching and Sorting Algorithms
Intractability in Algorithmic Game Theory - Tim Roughgarden
Tim Roughgarden Stanford University March 11, 2013 We discuss three areas of algorithmic game theory that have grappled with intractability. The first is the complexity of computing game-theoretic equilibria, like Nash equilibria. There is an urgent need for new ideas on this topic, to ena
From playlist Mathematics
GORUCO 2015: Nadia Odunayo: Keynote Playing games in the clouds
@nodunayo What does haggling at a garage sale have to do with load balancing in distributed systems? How does bidding in an art auction relate to cloud service orchestration? Familiarity with the ideas and technologies involved in cloud computing is becoming ever more important for develop
From playlist GORUCO 2015
Measuring Time Solution - Intro to Algorithms
This video is part of an online course, Intro to Algorithms. Check out the course here: https://www.udacity.com/course/cs215.
From playlist Introduction to Algorithms
Theoretical Computer Science and Economics - Tim Roughgarden
Lens of Computation on the Sciences - November 22, 2014 Theoretical Computer Science and Economics - Tim Roughgarden, Stanford University Theoretical computer science offers a number of tools to reason about economic problems in novel ways. For example, complexity theory sheds new light
From playlist Lens of Computation on the Sciences
Elias Koutsoupias: Game Theory 2/2 🎲 CERN
This lecture series will present the main directions of Algorithmic Game Theory, a new field that has emerged in the last two decades at the interface of Game Theory and Computer Science, because of the unprecedented growth in size, complexity, and impact of the Internet and the Web. These
From playlist CERN Academic Lectures
Algorithmic Game Theory: Two Vignettes
(March 11, 2009) Tim Roughgarden talks about algorithmic game theory and illustrates two of the main themes in the field via specific examples: performance guarantees for systems with autonomous users, illustrated by selfish routing in communication networks; and algorithmic mechanism desi
From playlist Engineering
Overview and Recent Results in Combinatorial Auctions - Matt Weinberg
Computer Science/Discrete Mathematics Seminar II Topic: Overview and Recent Results in Combinatorial Auctions Speaker: Matt Weinberg Affiliation: Princeton University Date: February 7, 2023 In this talk, I'll first give a broad overview of the history of combinatorial auctions within TCS
From playlist Mathematics
RailsConf 2015 - Playing Games In The Clouds
By, Nadia Odunayo What does haggling at a garage sale have to do with load balancing in distributed systems? How does bidding in an art auction relate to cloud service orchestration? Familiarity with the ideas and technologies involved in cloud computing is becoming ever more important for
From playlist RailsConf 2015
Michael Joswig: Generalized permutahedra and optimal auctions
We study a family of convex polytopes, called SIM-bodies, which were introduced by Giannakopoulos and Koutsoupias (2018) to analyze so-called Straight-Jacket Auctions. First, we show that the SIM-bodies belong to the class of generalized permutahedra. Second, we prove an optimality result
From playlist Workshop: Tropical geometry and the geometry of linear programming
Optimization and Tropical Combinatorics (Lecture 4) by Michael Joswig
PROGRAM COMBINATORIAL ALGEBRAIC GEOMETRY: TROPICAL AND REAL (HYBRID) ORGANIZERS Arvind Ayyer (IISc, India), Madhusudan Manjunath (IITB, India) and Pranav Pandit (ICTS-TIFR, India) DATE: 27 June 2022 to 08 July 2022 VENUE: Madhava Lecture Hall and Online Algebraic geometry is the study of
From playlist Combinatorial Algebraic Geometry: Tropical and Real (HYBRID)
How to Critically Read Deep Learning Papers
Not all deep learning papers are legitimate! Let's take a look at a deep reinforcement learning paper that wouldn't pass peer review in a top tier journal. There is a fair amount of specificity in the knowledge required to parse the paper, but you can glean two useful nuggets here: Always
From playlist AI For Beginners
Heap Sort Performance - Intro to Algorithms
This video is part of an online course, Intro to Algorithms. Check out the course here: https://www.udacity.com/course/cs215.
From playlist Introduction to Algorithms