Sign In
Sign Up
Fast parallel algorithms for graph matching problems
Marek Karpiński
1998
-
/
5
0 votes
Matching Theory
Algorithms
Parallel Algorithms
Algorithms to Live By
4.0
37 votes
A darker shade of magic
3.8
44 votes
Code
4.3
21 votes
Magician
4.1
45 votes
Clean Code
4.4
35 votes
Think Again
3.7
23 votes
The Subtle Knife
4.0
94 votes
Unseen Academicals
3.7
33 votes
The Amber Spyglass
3.9
92 votes
Nine Princes in Amber
4.0
34 votes
The elegant universe
4.0
22 votes
Jung's map of the soul
4.7
27 votes
Northern Lights
4.0
192 votes
The Signal and the Noise
3.9
48 votes
The Games People Play
4.0
39 votes
A Conjuring of Light
4.3
16 votes
The Drawing of the Three
4.2
78 votes
Wizard and Glass
4.1
60 votes
The Complete Robot
4.5
20 votes
The art of thinking clearly
4.2
16 votes
Marketing management
4.0
27 votes
The Sun Also Rises
3.8
21 votes
Artificial intelligence
4.2
20 votes
Jurassic Park
4.1
145 votes
For Whom the Bell Tolls
3.4
16 votes
We Should All Be Feminists
4.1
26 votes
Antifragile
4.1
33 votes
Rooster who set out to see the world
3.9
17 votes
A Farewell to Arms
3.7
47 votes
Fermat's Last Theorem
3.9
17 votes
A Room of One's Own
4.2
23 votes
The Visual Display of Quantitative Information
4.2
28 votes
The Grand Design
3.7
21 votes
Thinking in systems
4.4
22 votes
Ways of Seeing
3.9
16 votes
Utopia
3.2
18 votes
Men Explain Things To Me
3.9
23 votes
The Information
3.8
15 votes
The Code Book
4.0
35 votes
The selfish gene
4.4
60 votes
Einstein
4.2
23 votes
Lean In
3.6
16 votes
Συμπόσιον
4.2
25 votes
Nudge
3.7
21 votes
Freakonomics
3.9
161 votes
Harry Potter and the Philosopher's Stone
4.3
747 votes
The Girl on the Train
3.6
71 votes
Cress
4.3
24 votes
