default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBahman Bahmani
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2018
[c10]Parimarjan Negi, Prafull Sharma, Vivek Jain, Bahman Bahmani:
K-means++ vs. Behavioral Biometrics: One Loop to Rule Them All. NDSS 2018- 2014
- [c9]Bahman Bahmani, Ashish Goel, Kamesh Munagala:
Efficient Primal-Dual Graph Algorithms for MapReduce. WAW 2014: 59-78 - 2012
- [j4]Bahman Bahmani, Ravi Kumar, Sergei Vassilvitskii:
Densest Subgraph in Streaming and MapReduce. Proc. VLDB Endow. 5(5): 454-465 (2012) - [j3]Bahman Bahmani, Benjamin Moseley, Andrea Vattani, Ravi Kumar, Sergei Vassilvitskii:
Scalable K-Means++. Proc. VLDB Endow. 5(7): 622-633 (2012) - [j2]Bahman Bahmani, Aranyak Mehta, Rajeev Motwani:
Online Graph Edge-Coloring in the Random-Order Arrival Model. Theory Comput. 8(1): 567-595 (2012) - [c8]Bahman Bahmani, Ashish Goel, Rajendra Shinde:
Efficient distributed locality sensitive hashing. CIKM 2012: 2174-2178 - [c7]Bahman Bahmani, Ravi Kumar, Mohammad Mahdian, Eli Upfal
:
PageRank on an evolving graph. KDD 2012: 24-32 - [c6]Bahman Bahmani, Ashish Goel:
Partitioned multi-indexing: bringing order to social search. WWW 2012: 399-408 - [i4]Bahman Bahmani, Ravi Kumar, Sergei Vassilvitskii:
Densest Subgraph in Streaming and MapReduce. CoRR abs/1201.6567 (2012) - [i3]Bahman Bahmani, Benjamin Moseley, Andrea Vattani, Ravi Kumar, Sergei Vassilvitskii:
Scalable K-Means++. CoRR abs/1203.6402 (2012) - [i2]Bahman Bahmani, Ashish Goel, Rajendra Shinde:
Efficient Distributed Locality Sensitive Hashing. CoRR abs/1210.7057 (2012) - 2011
- [c5]Bahman Bahmani, Kaushik Chakrabarti, Dong Xin:
Fast personalized PageRank on MapReduce. SIGMOD Conference 2011: 973-984 - 2010
- [j1]Bahman Bahmani, Abdur Chowdhury, Ashish Goel:
Fast Incremental and Personalized PageRank. Proc. VLDB Endow. 4(3): 173-184 (2010) - [c4]Bahman Bahmani, Michael Kapralov:
Improved Bounds for Online Stochastic Matching. ESA (1) 2010: 170-181 - [c3]Bahman Bahmani, Aranyak Mehta, Rajeev Motwani:
A 1.43-Competitive Online Graph Edge Coloring Algorithm in the Random Order Arrival Model. SODA 2010: 31-39 - [i1]Bahman Bahmani, Abdur Chowdhury, Ashish Goel:
Fast Incremental and Personalized PageRank over Distributed Main Memory Databases. CoRR abs/1006.2880 (2010)
2000 – 2009
- 2005
- [c2]Massoud Babaie-Zadeh, Bahman Bahmani, Christian Jutten:
ICA by mutual information minimization: An approach for avoiding local minima. EUSIPCO 2005: 1-4 - [c1]Bahman Bahmani, Massoud Babaie-Zadeh, Christian Jutten:
A new method for estimating score function difference (SFD) and its application to Blind Source Separation. EUSIPCO 2005: 1-4
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-04-24 22:49 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:
