default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMaxim Gurevich
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2021
[j7]Maxim Gurevich
:
Quantum invariants for decomposition problems in type A rings of representations. J. Comb. Theory A 180: 105431 (2021)
2010 – 2019
- 2013
- [j6]Alexander Shraer, Maxim Gurevich, Marcus Fontoura, Vanja Josifovski:
Top-k Publish-Subscribe for Social Annotation of News. Proc. VLDB Endow. 6(6): 385-396 (2013) - [c13]Maxim Gurevich, Tamás Sarlós:
Permutation indexing: fast approximate retrieval from large corpora. CIKM 2013: 1771-1776 - 2012
- [c12]Anirban Dasgupta, Maxim Gurevich, Liang Zhang, Belle L. Tseng, Achint Oommen Thomas:
Overcoming browser cookie churn with clustering. WSDM 2012: 83-92 - [c11]Deepak Agarwal, Maxim Gurevich:
Fast top-k retrieval for model based recommendation. WSDM 2012: 483-492 - 2011
- [j5]Ziv Bar-Yossef, Maxim Gurevich:
Efficient Search Engine Measurements. ACM Trans. Web 5(4): 18:1-18:48 (2011) - [c10]Marcus Fontoura, Maxim Gurevich, Vanja Josifovski, Sergei Vassilvitskii:
Efficiently encoding term co-occurrences in inverted indexes. CIKM 2011: 307-316 - [c9]George Beskales, Marcus Fontoura, Maxim Gurevich, Sergei Vassilvitskii, Vanja Josifovski:
Factorization-based lossless compression of inverted indices. CIKM 2011: 327-332 - [c8]Andrea Vattani, Deepayan Chakrabarti, Maxim Gurevich:
Preserving Personalized Pagerank in Subgraphs. ICML 2011: 793-800 - [c7]Anirban Dasgupta, Maxim Gurevich, Kunal Punera:
Enhanced email spam filtering through combining similarity graphs. WSDM 2011: 785-794 - [i1]George Beskales, Marcus Fontoura, Maxim Gurevich, Sergei Vassilvitskii, Vanja Josifovski:
Factorization-based Lossless Compression of Inverted Indices. CoRR abs/1108.1956 (2011) - 2010
- [j4]Maxim Gurevich, Idit Keidar:
Correctness of Gossip-Based Membership under Message Loss. SIAM J. Comput. 39(8): 3830-3859 (2010)
2000 – 2009
- 2009
- [j3]Edward Bortnikov, Maxim Gurevich, Idit Keidar, Gabriel Kliot, Alexander Shraer:
Brahms: Byzantine resilient random membership sampling. Comput. Networks 53(13): 2340-2359 (2009) - [c6]Maxim Gurevich, Idit Keidar:
Correctness of gossip-based membership under message loss. PODC 2009: 151-160 - [c5]Ziv Bar-Yossef, Maxim Gurevich:
Estimating the impressionrank of web pages. WWW 2009: 41-50 - 2008
- [j2]Ziv Bar-Yossef, Maxim Gurevich:
Random sampling from a search engine's index. J. ACM 55(5): 24:1-24:74 (2008) - [j1]Ziv Bar-Yossef, Maxim Gurevich:
Mining search engine query logs via suggestion sampling. Proc. VLDB Endow. 1(1): 54-65 (2008) - [c4]Edward Bortnikov, Maxim Gurevich, Idit Keidar, Gabriel Kliot, Alexander Shraer:
Brahms: byzantine resilient random membership sampling. PODC 2008: 145-154 - 2007
- [c3]Ziv Bar-Yossef, Maxim Gurevich:
Efficient search engine measurements. WWW 2007: 401-410 - 2006
- [c2]Ziv Bar-Yossef, Maxim Gurevich:
Random sampling from a search engine's index. WWW 2006: 367-376 - 2003
- [c1]Gadi Haber, Moshe Klausner, Vadim Eisenberg, Bilha Mendelson, Maxim Gurevich:
Optimization Opportunities Created by Global Data Reordering. CGO 2003: 228-240
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-06-10 21:23 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
