Daily Weekly Monthly

Daily Shaarli

All links of one day in a single page.
Next day

March 9, 2020

I don't know anything, but I do know that everything is interesting if you go into it deeply enough.

(Richard Feynman, Omni interview, “The Smartest Man in the World”)

— https://en.wikiquote.org/wiki/Richard_Feynman#The_Pleasure_of_Finding_Things_Out_(1999)

quotes
Android Camera2 Example
programming/android
Understanding Android camera capture sessions and requests
thumbnail
programming/android
Hyrum's Law
computer-science/software-engineering/principles
CollabQueue
thumbnail

Shared music queue for Spotify

tools
Competitive Programming Book
computer-science/competition/books books
Advent of Code
computer-science/competition
OpenStreetMap
thumbnail
maps
Christofides algorithm
computer-science/problems/travelling-salesman
Complexity Zoo
computer-science/complexity research tools
Entry and field types in .bib files
writing/processors/latex
Spurious Correlations
thumbnail
maths/statistics
Google Scholar
research/bibliography tools
Aevol

Genetic evolution simulation

computer-science/bioinformatics
Every one of us is, in the cosmic perspective, precious. If a human disagrees with you, let him live. In a hundred billion galaxies, you will not find another.

(Carl Sagan, Cosmos)

— https://en.wikiquote.org/wiki/Carl_Sagan#Cosmos_(1980)

quotes
Kotlin Coroutines in Android
programming/android
Kotlin Reference
programming/android
From Java to Kotlin
programming/android
JVM Minimal Survival Guide
programming/android
Introduction to Svelte
thumbnail
programming/frameworks
Exportify

Export Spotify playlists to CSV

tools
Identifont

Identify fonts by appearance

writing/typography tools
Magic Ink: Information Software and the Graphical Interface
computer-science/human-computer-interface design
Codeforces
computer-science/competition
OpenLevelUp!
maps
LearnOSM
maps
Open Charge Map - The global public registry of electric vehicle charging locations
maps
Minesweeper is NP-complete
computer-science/problems/minesweeper
“How do I construct reductions between problems to prove a problem is NP-complete?”
thumbnail
computer-science/complexity
Conference Ranks
research/bibliometrics tools
Science is what we understand well enough to explain to a computer. Art is everything else we do.

(Donald E. Knuth, Foreword of A=B)

— https://en.wikiquote.org/wiki/Donald_Knuth
— https://www.math.upenn.edu/~wilf/AeqB.html

quotes
Coroutines on Android (part I): Getting the background
thumbnail
programming/android
History and effective use of Vim
thumbnail
systems/editors
Mathematics for the adventurous self-learner
maths/learn
Competitive Programming Books
computer-science/competition/books books
SWERC
computer-science/competition
Project Euler
computer-science/competition
Overpass API Documentation
maps
Openrouteservice Maps
maps
OSM Buildings
maps
OpenPoiMap
maps
Learnable Programming
teaching programming
Lin–Kernighan heuristic
computer-science/problems/travelling-salesman
Scheduling Zoo
computer-science/scheduling research tools
Graph Classes and their Inclusions
computer-science/graphs tools research
Scimago Journal & Country Rank
research/bibliometrics tools
ResearchGate
research/bibliography tools
Microsoft Academic
research/bibliography tools
Semantic Scholar
thumbnail
research/bibliography tools