Search results

Jump to: navigation, search
  • |who=Krzysztof Onak
    659 bytes (96 words) - 01:45, 30 September 2023
  • |who=Krzysztof Onak Guruswami and Onak {{cite|GuruswamiO-13}} showed that the following problems require roughly $
    2 KB (386 words) - 21:14, 26 June 2013
  • {{bibentry|AndoniO-09|Alexandr Andoni and Krzysztof Onak. ''Approximating edit distance in near-linear time.'' In ''ACM Symposium on {{bibentry|GuruswamiO-13|Venkatesan Guruswami and Krzysztof Onak. ''Superlinear lower bounds for multipass graph processing.'' In ''IEEE Con
    45 KB (5,687 words) - 02:01, 13 March 2023
  • ...iginal list of open problems] was scribed by Andrew McGregor and Krzysztof Onak. Further details can be found at [http://www2.cse.iitk.ac.in/~fsttcs/2009/w * Krzysztof Onak
    1 KB (168 words) - 19:58, 17 December 2019
  • * Krzysztof Onak
    2 KB (193 words) - 06:24, 19 January 2017
  • |who=Krzysztof Onak ...rtitioning oracle is defined in the paper of Hassidim, Kelner, Nguyen, and Onak {{cite|HassidimKNO-09}}, and an implicit construction of a partitioning ora
    1 KB (193 words) - 14:58, 12 March 2013
  • *Krzysztof Onak
    1 KB (181 words) - 01:47, 7 March 2013
  • * Krzysztof Onak
    1 KB (167 words) - 23:06, 13 June 2014
  • |who=Krzysztof Onak
    2 KB (299 words) - 18:41, 18 January 2016