Остановите войну!
for scientists:
default search action
Barbara Geissmann
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2021
- [j5]Barbara Geissmann, Lukas Gianinazzi:
Parallel Minimum Cuts in Near-linear Work and Low Depth. ACM Trans. Parallel Comput. 8(2): 8:1-8:20 (2021) - 2020
- [j4]Barbara Geissmann, Stefano Leucci, Chih-Hung Liu, Paolo Penna:
Optimal Dislocation with Persistent Errors in Subquadratic Time. Theory Comput. Syst. 64(3): 508-521 (2020) - [j3]Barbara Geissmann:
Longest Increasing Subsequence under Persistent Comparison Errors. Theory Comput. Syst. 64(4): 662-680 (2020) - [j2]Andreas Bärtschi, Jérémie Chalopin, Shantanu Das, Yann Disser, Barbara Geissmann, Daniel Graf, Arnaud Labourel, Matús Mihalák:
Collaborative delivery with energy-constrained mobile robots. Theor. Comput. Sci. 810: 2-14 (2020)
2010 – 2019
- 2019
- [j1]Tomas Gavenciak, Barbara Geissmann, Johannes Lengler:
Sorting by Swaps with Noisy Comparisons. Algorithmica 81(2): 796-827 (2019) - [c14]Barbara Geissmann, Lukas Gianinazzi:
Routing in Stochastic Public Transit Networks. ATMOS 2019: 4:1-4:18 - [c13]Barbara Geissmann, Stefano Leucci, Chih-Hung Liu, Paolo Penna:
Optimal Sorting with Persistent Comparison Errors. ESA 2019: 49:1-49:14 - [c12]Barbara Geissmann, Stefano Leucci, Chih-Hung Liu, Paolo Penna, Guido Proietti:
Dual-Mode Greedy Algorithms Can Save Energy. ISAAC 2019: 64:1-64:18 - 2018
- [b1]Barbara Geissmann:
From Sorting to Optimization: Coping with Error-Prone Comparisons. ETH Zurich, Zürich, Switzerland, 2018 - [c11]Barbara Geissmann, Paolo Penna:
Inversions from Sorting with Distance-Based Errors. SOFSEM 2018: 508-522 - [c10]Barbara Geissmann, Lukas Gianinazzi:
Parallel Minimum Cuts in Near-linear Work and Low Depth. SPAA 2018: 1-11 - [c9]Barbara Geissmann, Stefano Leucci, Chih-Hung Liu, Paolo Penna:
Optimal Dislocation with Persistent Errors in Subquadratic Time. STACS 2018: 36:1-36:13 - [c8]Barbara Geissmann:
Longest Increasing Subsequence Under Persistent Comparison Errors. WAOA 2018: 259-276 - [i9]Tomas Gavenciak, Barbara Geissmann, Johannes Lengler:
Sorting by Swaps with Noisy Comparisons. CoRR abs/1803.04509 (2018) - [i8]Barbara Geissmann, Stefano Leucci, Chih-Hung Liu, Paolo Penna:
Optimal Sorting with Persistent Comparison Errors. CoRR abs/1804.07575 (2018) - [i7]Barbara Geissmann, Lukas Gianinazzi:
Parallel Minimum Cuts in Near-linear Work and Low Depth. CoRR abs/1807.09524 (2018) - [i6]Barbara Geissmann:
Longest Increasing Subsequence under Persistent Comparison Errors. CoRR abs/1808.03307 (2018) - 2017
- [c7]Barbara Geissmann, Lukas Gianinazzi:
Cache Oblivious Minimum Cut. CIAC 2017: 285-296 - [c6]Tomas Gavenciak, Barbara Geissmann, Johannes Lengler:
Sorting by swaps with noisy comparisons. GECCO 2017: 1375-1382 - [c5]Barbara Geissmann, Stefano Leucci, Chih-Hung Liu, Paolo Penna:
Sorting with Recurrent Comparison Errors. ISAAC 2017: 38:1-38:12 - [i5]Barbara Geissmann, Stefano Leucci, Chih-Hung Liu, Paolo Penna:
Sorting with Recurrent Comparison Errors. CoRR abs/1709.07249 (2017) - 2016
- [c4]Andreas Bärtschi, Barbara Geissmann, Daniel Graf, Tomas Hruz, Paolo Penna, Thomas Tschager:
On Computing the Total Displacement Number via Weighted Motzkin Paths. IWOCA 2016: 423-434 - [c3]Andreas Bärtschi, Jérémie Chalopin, Shantanu Das, Yann Disser, Barbara Geissmann, Daniel Graf, Arnaud Labourel, Matús Mihalák:
Collaborative Delivery with Energy-Constrained Mobile Robots. SIROCCO 2016: 258-274 - [i4]Andreas Bärtschi, Barbara Geissmann, Daniel Graf, Tomas Hruz, Paolo Penna, Thomas Tschager:
On computing the total displacement number via weighted Motzkin paths. CoRR abs/1606.05538 (2016) - [i3]Andreas Bärtschi, Jérémie Chalopin, Shantanu Das, Yann Disser, Barbara Geissmann, Daniel Graf, Arnaud Labourel, Matús Mihalák:
Collaborative Delivery with Energy-Constrained Mobile Robots. CoRR abs/1608.08500 (2016) - [i2]Barbara Geissmann, Paolo Penna:
Sort well with energy-constrained comparisons. CoRR abs/1610.09223 (2016) - 2015
- [c2]Barbara Geissmann, Matús Mihalák, Peter Widmayer:
Recurring Comparison Faults: Sorting and Finding the Minimum. FCT 2015: 227-239 - 2014
- [c1]Barbara Geissmann, Rastislav Srámek:
Finding Robust Minimum Cuts. AAIM 2014: 124-136 - 2013
- [i1]Barbara Geissmann, Rastislav Srámek:
Counting small cuts in a graph. CoRR abs/1304.7632 (2013)
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 02:06 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint