The following pages link to Ádám D. Lelkes (Q1664121):
Displaying 5 items.
- On the computational complexity of MapReduce (Q1664122) (← links)
- Interactive Clustering of Linear Classes and Cryptographic Lower Bounds (Q2835625) (← links)
- Improved algorithms for splitting full matrix algebras (Q4929077) (← links)
- Network installation under convex costs (Q4985046) (← links)
- Biclique Coverings, Rectifier Networks and the Cost of ε-Removal (Q5496187) (← links)
