Theoretical Computer Science
jkff
  • GitHub
  • Mountain View, CA
  • Member for 11 years, 2 months
Profile Activity
Stats
8,529
reputation
154k
reached
8
answers
17
questions
Communities
View all
About

I'm Eugene Kirpichov and I work on Google Cloud Dataflow and Apache Beam.

Badges
View all badges
3
gold badges
21
silver badges
33
bronze badges
Top tags
View all 48 tags
6
Score
8
Posts
32
Posts %
6
Score
4
Posts
16
Posts %
6
Score
3
Posts
12
Posts %
3
Score
3
Posts
12
Posts %
1
Score
3
Posts
12
Posts %
0
Score
5
Posts
20
Posts %
Top posts
View all questions and answers
All Questions Answers
Votes Newest
593
What's new in purely functional data structures since Okasaki?
Sep 21 '10
48
Are there non-constructive algorithm existence proofs?
Jul 29 '12
36
Higher-order algorithms
Aug 22 '10
30
Complexity of applying a permutation in-place
May 24 '11
30
Binary search generalizations for posets?
Nov 11 '11
22
Can typed lambda calculi express *all* algorithms below a given complexity?
Dec 14 '14
13
Fast sparse boolean matrix chain product
Sep 9 '10
12
"Divide and conquer" data stream algorithms
Sep 14 '10
12
Fast sparse boolean matrix product with possible preprocessing
Oct 5 '10
10
Type systems preventing laziness-related memory leaks?
Feb 17 '15
Top network posts
View all
50
What tools do distributed programmers lack?
50
Why do I get the "Unhandled exception type IOException"?
44
What is the difference between DoFn.Setup and DoFn.StartBundle?
44
Efficiency of purely functional programming
43
Can regular languages be Turing complete?

Your privacy

By clicking “Accept all cookies”, you agree Stack Exchange can store cookies on your device and disclose information in accordance with our Cookie Policy.