default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJasmin Smula
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2018
[c9]Elisabet Burjons
, Fabian Frei, Jasmin Smula, David Wehner:
Length-Weighted Disjoint Path Allocation - Advice and Parametrization. Adventures Between Lower Bounds and Higher Altitudes 2018: 231-256- 2015
- [b1]Jasmin Smula:
Information content of online problems: advice versus determinism and randomization. ETH Zurich, Zürich, Switzerland, Cuvillier Verlag 2015, ISBN 978-3-7369-9073-9, pp. 1-158 - [c8]Heidi Gebauer, Dennis Komm, Rastislav Královic, Richard Královic, Jasmin Smula:
Disjoint Path Allocation with Sublinear Advice. COCOON 2015: 417-429 - [c7]Dennis Komm, Rastislav Královic, Richard Královic, Jasmin Smula:
Treasure Hunt with Advice. SIROCCO 2015: 328-341 - 2014
- [j2]Hans-Joachim Böckenhauer, Juraj Hromkovic, Dennis Komm, Sacha Krug, Jasmin Smula, Andreas Sprock:
The string guessing problem as a method to prove lower bounds on the advice complexity. Theor. Comput. Sci. 554: 95-108 (2014) - [c6]Kfir Barhum, Hans-Joachim Böckenhauer, Michal Forisek, Heidi Gebauer, Juraj Hromkovic, Sacha Krug, Jasmin Smula, Björn Steffen:
On the Power of Advice and Randomization for the Disjoint Path Allocation Problem. SOFSEM 2014: 89-101 - 2013
- [c5]Hans-Joachim Böckenhauer, Juraj Hromkovic, Dennis Komm, Sacha Krug, Jasmin Smula, Andreas Sprock:
The String Guessing Problem as a Method to Prove Lower Bounds on the Advice Complexity. COCOON 2013: 493-505 - 2012
- [j1]Stephan Holzer, Yvonne-Anne Pignolet, Jasmin Smula, Roger Wattenhofer:
Monitoring churn in wireless networks. Theor. Comput. Sci. 453: 29-43 (2012) - [i2]Yuval Emek, Jasmin Smula, Roger Wattenhofer:
Stone Age Distributed Computing. CoRR abs/1202.1186 (2012) - [i1]Hans-Joachim Böckenhauer, Juraj Hromkovic, Dennis Komm, Sacha Krug, Jasmin Smula, Andreas Sprock:
The String Guessing Problem as a Method to Prove Lower Bounds on the Advice Complexity. Electron. Colloquium Comput. Complex. TR12 (2012) - 2011
- [c4]Stephan Holzer, Yvonne-Anne Pignolet, Jasmin Smula, Roger Wattenhofer:
Time-optimal information exchange on multiple channels. FOMC 2011: 69-76 - [c3]Stephan Holzer, Yvonne-Anne Pignolet, Jasmin Smula, Roger Wattenhofer:
Information dissemination on multiple channels. PODC 2011: 219-220 - 2010
- [c2]Stephan Holzer, Yvonne-Anne Pignolet, Jasmin Smula, Roger Wattenhofer:
Monitoring Churn in Wireless Networks. ALGOSENSORS 2010: 118-133 - [c1]Stephan Holzer, Yvonne-Anne Pignolet, Jasmin Smula, Roger Wattenhofer:
Brief announcement: self-monitoring in dynamic wireless networks. PODC 2010: 129-130
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-25 05:51 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:
