The following pages link to László Kozma (Q396882):
Displaying 26 items.
- Shattering, graph orientations, and connectivity (Q396883) (← links)
- Finding and counting permutations via CSPs (Q2041985) (← links)
- Hamiltonicity below Dirac's condition (Q2301533) (← links)
- Minimum Average Distance Triangulations (Q2912886) (← links)
- Greedy Is an Almost Optimal Deque (Q3449813) (← links)
- Self-Adjusting Binary Search Trees: What Makes Them Tick? (Q3452794) (← links)
- Maximum Scatter TSP in Doubling Metrics (Q4575744) (← links)
- Hitting Set for hypergraphs of low VC-dimension (Q4606292) (← links)
- Time- and Space-optimal Algorithm for the Many-visits TSP (Q4987455) (← links)
- Pairing heaps: the forward variant. (Q5005110) (← links)
- (Q5009581) (← links)
- Multi-Finger Binary Search Trees (Q5091047) (← links)
- Smooth Heaps and a Dual View of Self-Adjusting Data Structures (Q5130842) (← links)
- Smooth heaps and a dual view of self-adjusting data structures (Q5230339) (← links)
- A time- and space-optimal algorithm for the many-visits TSP (Q5236290) (← links)
- Finding and Counting Permutations via CSPs (Q5875533) (← links)
- Pattern-avoiding access in binary search trees (Q6263911) (← links)
- Binary search trees and rectangulations (Q6271893) (← links)
- Improved bounds for multipass pairing heaps and path-balanced binary search trees (Q6303370) (← links)
- Hamiltonicity below Dirac's condition (Q6313629) (← links)
- Finding and counting permutations via CSPs (Q6323601) (← links)
- Geometric group testing (Q6339738) (← links)
- Splay trees on trees (Q6350392) (← links)
- Fixed-point cycles and EFX allocations (Q6388838) (← links)
- Fast approximation of search trees on trees with centroid trees (Q6411021) (← links)
- Optimization with pattern-avoiding input (Q6454059) (← links)
