2022 Developer Survey is open! Take survey.
Theoretical Computer Science
user avatar
user avatar
user avatar
jkff
  • Member for 11 years, 9 months
  • Last seen more than a month ago
Profile Activity
Stats
8,641
reputation
158k
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 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
Score Newest
question
602
What's new in purely functional data structures since Okasaki?
Sep 21, 2010
question
48
Are there non-constructive algorithm existence proofs?
Jul 29, 2012
question
38
Higher-order algorithms
Aug 22, 2010
question
30
Complexity of applying a permutation in-place
May 24, 2011
question
30
Binary search generalizations for posets?
Nov 11, 2011
question
23
Can typed lambda calculi express *all* algorithms below a given complexity?
Dec 14, 2014
question
13
Fast sparse boolean matrix chain product
Sep 9, 2010
question
12
"Divide and conquer" data stream algorithms
Sep 14, 2010
question
12
Fast sparse boolean matrix product with possible preprocessing
Oct 5, 2010
question
9
Type systems preventing laziness-related memory leaks?
Feb 17, 2015
Top network posts
View all network posts
52
Why do I get the "Unhandled exception type IOException"?
49
What tools do distributed programmers lack?
47
What is the difference between DoFn.Setup and DoFn.StartBundle?
44
Can regular languages be Turing complete?
44
Efficiency of purely functional programming

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.