default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAnna Huber
Person information
- affiliation: Max Planck Institute for Informatics, Saarbrücken, Germany
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2021
[i4]Michael Kaufmann, Gabriel Stechschulte, Anna Huber:
Efficient and Accurate In-Database Machine Learning with SQL Code Generation in Python. CoRR abs/2104.03224 (2021)
2010 – 2019
- 2014
- [j6]Anna Huber, Andrei A. Krokhin
, Robert Powell:
Skew Bisubmodularity and Valued CSPs. SIAM J. Comput. 43(3): 1064-1084 (2014) - [j5]Anna Huber, Andrei A. Krokhin:
Oracle Tractability of Skew Bisubmodular Functions. SIAM J. Discret. Math. 28(4): 1828-1837 (2014) - [c6]Marcello Trovati, Nik Bessis, Anna Huber, Asta Zelenkauskaite, Eleana Asimakopoulou:
Extraction, Identification, and Ranking of Network Structures from Data Sets. CISIS 2014: 331-337 - 2013
- [j4]Benjamin Doerr, Anna Huber, Ariel Levavi:
Strong robustness of randomized rumor spreading protocols. Discret. Appl. Math. 161(6): 778-793 (2013) - [c5]Anna Huber, Andrei A. Krokhin, Robert Powell:
Skew Bisubmodularity and Valued CSPs. SODA 2013: 1296-1305 - [i3]Anna Huber, Andrei A. Krokhin:
Oracle Tractability of Skew Bisubmodular Functions. CoRR abs/1308.6505 (2013) - [i2]Anna Huber, Vladimir Kolmogorov:
Towards Minimizing k-Submodular Functions. CoRR abs/1309.5469 (2013) - 2012
- [c4]Anna Huber, Vladimir Kolmogorov:
Towards Minimizing k-Submodular Functions. ISCO 2012: 451-462 - 2010
- [b1]Anna Huber:
Randomized rounding and rumor spreading with stochastic dependencies. Saarland University, 2010 - [c3]Nikolaos Fountoulakis, Anna Huber, Konstantinos Panagiotou:
Reliable Broadcasting in Random Networks and the Effect of Density. INFOCOM 2010: 2552-2560 - [i1]Benjamin Doerr, Anna Huber, Ariel Levavi:
Strong Robustness of Randomized Rumor Spreading Protocols. CoRR abs/1001.3056 (2010)
2000 – 2009
- 2009
- [j3]Spyros Angelopoulos, Benjamin Doerr, Anna Huber, Konstantinos Panagiotou:
Tight Bounds for Quasirandom Rumor Spreading. Electron. J. Comb. 16(1) (2009) - [j2]Anna Huber, Nikolaos Fountoulakis:
Quasirandom broadcasting on the complete graph is as fast as randomized broadcasting. Electron. Notes Discret. Math. 34: 553-559 (2009) - [j1]Nikolaos Fountoulakis, Anna Huber:
Quasirandom Rumor Spreading on the Complete Graph Is as Fast as Randomized Rumor Spreading. SIAM J. Discret. Math. 23(4): 1964-1991 (2009) - [c2]Benjamin Doerr, Anna Huber, Ariel Levavi:
Strong Robustness of Randomized Rumor Spreading Protocols. ISAAC 2009: 812-821 - [c1]Nikolaos Fountoulakis, Anna Huber, Konstantinos Panagiotou:
Brief Announcement: The Speed of Broadcasting in Random Networks - Density Does Not Matter. DISC 2009: 529-530
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 23:09 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:
