( en | de | ru )

 

Disambiguation of "Evfimievski, Alexandre V."

Author of the publication

copydeleteadd this publication to your clipboard
MNC: Structure-Exploiting Sparsity Estimation for Matrix Expressions.

, , , , and . SIGMOD Conference, page 1607-1623. ACM, (2019)

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. You can also use the button next to the name to display some publications already assigned to the person.

V Geoffroy

V Saile

V Adams

V Fendrich

V Ustinov

 

Other publications of authors with the same name

Financial Analytics from Public Data., , , , , , and . DSMM, page 4:1-4:6. ACM, (2014)MNC: Structure-Exploiting Sparsity Estimation for Matrix Expressions., , , , and . SIGMOD Conference, page 1607-1623. ACM, (2019)MILO: Model-Agnostic Subset Selection Framework for Efficient Model Training and Tuning., , , , , and . CoRR, (2023)A Probabilistic Algorithm for Updating Files over a Communication Link.. SODA, page 300-305. ACM/SIAM, (1998)Limiting privacy breaches in privacy preserving data mining., , and . PODS, page 211-222. ACM, (2003)Table Extraction and Understanding for Scientific and Enterprise Applications., , , , and . Proc. VLDB Endow., 13 (12): 3433-3436 (2020)Efficient Data-Parallel Cumulative Aggregates for Large-Scale Machine Learning., , and . BTW, volume P-289 of LNI, page 267-286. Gesellschaft für Informatik, Bonn, (2019)Privacy preserving mining of association rules., , , and . Inf. Syst., 29 (4): 343-364 (2004)Epistemic privacy., , and . J. ACM, 58 (1): 2:1-2:45 (2010)A probabilistic algorithm for updating files over a communication link.. Theor. Comput. Sci., 233 (1-2): 191-199 (2000)