( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
New Sublinear Algorithms and Lower Bounds for LIS Estimation.

, и . ICALP, том 198 из LIPIcs, стр. 100:1-100:20. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2021)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed.

Ilan Moradi

Dragutin Ilan i

Ilan Katz

Ilan Wolff

Ilan Shtrikman

 

Другие публикации лиц с тем же именем

An exact almost optimal algorithm for target set selection in social networks., , , и . EC, стр. 355-362. ACM, (2009)Testing of matrix properties., и . STOC, стр. 286-295. ACM, (2001)Public vs. Private Coin Flips in One Round Communication Games (Extended Abstract)., и . STOC, стр. 561-570. ACM, (1996)On the formula complexity of simple Boolean functions (על סבוכיות הנסחא של פונקציות בוליאניות פשוטות.).. Hebrew University of Jerusalem, Israel, (1991)Functions that have Read-Twice Constant Width Branching Programs are not Necessarily Testable., и . CCC, стр. 73-79. IEEE Computer Society, (2002)Search Problems in the Decision Tree Model (Preliminary Version), , , и . FOCS, стр. 576-585. IEEE Computer Society, (1991)Broadcasting on a budget in the multi-service communication model., , и . HiPC, стр. 163-170. IEEE Computer Society, (1998)Hard Metrics from Cayley Graphs of Abelian Groups., и . STACS, том 4393 из Lecture Notes in Computer Science, стр. 157-162. Springer, (2007)Geometric approach for optimal routing on mesh with buses., и . SPDP, стр. 145-152. IEEE, (1995)Regular Languages Are Testable with a Constant Number of Queries., , , и . FOCS, стр. 645-655. IEEE Computer Society, (1999)