StackRating

An Elo-based rating system for Stack Overflow
Home   |   About   |   Stats and Analysis   |   Get a Badge
Rating Stats for

jbapple

Rating
1513.43 (50,951st) 		Reputation
2,452 (68,798th)
Page: 1 2
Title Δ
How to load zmm1 with "1" (AVX-512) 0.00
Does every node in a randomized treap has balance factor between (-... 0.00
When does type information flow backwards in C++? -2.20
Pattern Matching with Even and Odd Cases +4.06
Internal storage of a std::map as a red-black tree 0.00
Time Complexity of Piece Table and Rope 0.00
Efficient data structure for a set of integers 0.00
Why is a template<typename...> not recognized as instantiatab... +6.23
Cuckoo Filters: Why exactly 7 counts? (As in "limited count&qu... 0.00
Find all anagrams in a string O(n) solution -1.81
How to force pointer returned by new operator to be 32-byte aligned +2.26
Median of a Matrix with sorted rows -3.39
Median of a Matrix with sorted rows +0.61
Alternatives to Bloom Filter +3.91
Bloom filters for determining which sets in a family are subsets of... -3.39
Data structure for dynamic loaded dice? 0.00
Efficiently finding all points dominated by a point in 2D 0.00
How to initialize a const string as the concatenation of two string... -4.30
Compact structure for looking up the number of 1's before a giv... +3.88
Amortized analysis for incrementing fibonacci based integers +0.63
How to check what progress guarantee a concurrent program follows? 0.00
Defining an Impala table schema for partitioned data +4.01
impala support for arrays and maps 0.00
What is the actual name of a "random key dictionary" stru... +2.11
How to "help" a Dictionary performance with business logi... +1.23
What would be the most efficient way to remove a range of elements... 0.00
Data structures with nondeterministic components in Coq 0.00
Type that contains all functions of N elements in Coq -3.65
Optimal Way To Generate A Balanced Binary Search Tree From A Stream... +4.49
std::map Known-Position Erase Amortized Complexity And Number of Re... 0.00
Search tree with canonical layout 0.00
Can theorems in coq (or in general) be proven without the use of pr... -4.19
Why can't coq infer the that 0+n=n in this dependently typed pr... -3.69
Priority queue with O(1) delete-max, insert-min, and find-min and O... 0.00
I need help defining a concatenation in Coq -0.23
How to get impala queries 0.00
Bloom filter - using the number of elements as the number of hash f... 0.00
Rewriting a match in Coq 0.00
Hand-over-hand locking with Rust -0.08
Dependent type list concatenation in Coq +4.08
Applying tactics to local subgoals of a semicolon chain in Coq 0.00
What does `omega` really do here? +0.39
What does `omega` really do here? -3.35
Red black tree removal - why isn't this correct? 0.00
Using an hypothesis to remove cases in a match statement -4.18
persistent vs immutable data structure 0.00
Data-structural bootstrapping examples? 0.00
Persistent Hash Table Implementation +0.54
What is the most efficient data structure to store time series of p... 0.00
Implement an immutable deque as a balanced binary tree? +5.44