The following pages link to Mihai Pǎtraşcu (Q489744):
Displaying 43 items.
- Picture-hanging puzzles (Q489745) (← links)
- Necklaces, convolutions, and \(X+Y\) (Q517795) (← links)
- (Q834600) (redirect page) (← links)
- Order statistics in the Farey sequences in sublinear time and counting primitive lattice points in polygons (Q834601) (← links)
- On dynamic bit-probe complexity (Q2373742) (← links)
- Subquadratic algorithms for 3SUM (Q2482729) (← links)
- Changing base without losing space (Q2875186) (← links)
- Towards polynomial lower bounds for dynamic problems (Q2875187) (← links)
- Time-space trade-offs for predecessor search (Q2931388) (← links)
- (Q2934638) (← links)
- Dynamic Connectivity: Connecting to Networks and Geometry (Q3020009) (← links)
- Unifying the Landscape of Cell-Probe Lower Bounds (Q3093625) (← links)
- Finding the Median (Obliviously) with Bounded Space (Q3448777) (← links)
- De Dictionariis Dynamicis Pauco Spatio Utentibus (Q3525772) (← links)
- (Q3549594) (← links)
- (Q3549595) (← links)
- Transdichotomous Results in Computational Geometry, I: Point Location in Sublogarithmic Time (Q3558019) (← links)
- Higher Lower Bounds for Near-Neighbor and Further Rich Problems (Q3558020) (← links)
- (Q3579381) (← links)
- Lower bounds for dynamic connectivity (Q3580993) (← links)
- On dynamic range reporting in one dimension (Q3581419) (← links)
- Lower bounds for asymmetric communication channels and distributed source coding (Q3581533) (← links)
- On the k-Independence Required by Linear Probing and Minwise Independence (Q3587421) (← links)
- Tight bounds for dynamic convex hull queries (again) (Q3602893) (← links)
- (Q4633860) (← links)
- On the <i>k</i> -Independence Required by Linear Probing and Minwise Independence (Q4962205) (← links)
- Algorithms and Data Structures (Q5394269) (← links)
- The Power of Simple Tabulation Hashing (Q5395685) (← links)
- Orthogonal range searching on the RAM, revisited (Q5404401) (← links)
- (Q5417611) (← links)
- (Q5417615) (← links)
- (Q5417617) (← links)
- (Q5417690) (← links)
- Distance Oracles beyond the Thorup--Zwick Bound (Q5419041) (← links)
- Don't rush into a union (Q5419126) (← links)
- Dynamic Optimality—Almost (Q5454250) (← links)
- Algorithmic Number Theory (Q5465636) (← links)
- Logarithmic Lower Bounds in the Cell-Probe Model (Q5470720) (← links)
- (Q5501238) (← links)
- (Q5501303) (← links)
- Automata, Languages and Programming (Q5716844) (← links)
- Twisted Tabulation Hashing (Q5741724) (← links)
- (Q5743421) (← links)
