Остановите войну!
for scientists:
default search action
Search dblp
Full-text search
- > Home
Please enter a search query
- case-insensitive prefix search: default
e.g., sig matches "SIGIR" as well as "signal" - exact word search: append dollar sign ($) to word
e.g., graph$ matches "graph", but not "graphics" - boolean and: separate words by space
e.g., codd model - boolean or: connect words by pipe symbol (|)
e.g., graph|network
Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.
Author search results
Likely matches
- Marek Chrobak
University of California, Riverside, USA
Venue search results
no matches
Refine list
refine by author
- no options
- temporarily not available
refine by venue
- no options
- temporarily not available
refine by type
- no options
- temporarily not available
refine by access
- no options
- temporarily not available
refine by year
- no options
- temporarily not available
Publication search results
found 255 matches
- 2024
- Jordan Kuschner, Yugarshi Shashwat, Sarthak Yadav, Marek Chrobak:
On Permutation Selectors and their Applications in Ad-Hoc Radio Networks Protocols. CoRR abs/2402.10783 (2024) - Emily Clark, Chloe Georgiou, Katelyn Poon, Marek Chrobak:
On HTLC-Based Protocols for Multi-Party Cross-Chain Swaps. CoRR abs/2403.03906 (2024) - 2023
- Eric Chan, Marek Chrobak, Mohsen Lesani:
Cross-Chain Swaps with Preferences. CSF 2023: 261-275 - Marek Chrobak, Samuel Haney, Mehraneh Liaee, Debmalya Panigrahi, Rajmohan Rajaraman, Ravi Sundaram, Neal E. Young:
Online Paging with Heterogeneous Cache Slots. STACS 2023: 23:1-23:24 - Marek Chrobak, Neal E. Young:
Classification via Two-Way Comparisons (Extended Abstract). WADS 2023: 275-290 - Huong Luu, Marek Chrobak:
Better Hardness Results for the Minimum Spanning Tree Congestion Problem. WALCOM 2023: 167-178 - Marek Chrobak, Neal E. Young:
Classification via two-way comparisons. CoRR abs/2302.09692 (2023) - Sunny Atalig, Marek Chrobak, Erfan Mousavian, Jiri Sgall, Pavel Veselý:
Structural Properties of Search Trees with 2-way Comparisons. CoRR abs/2311.02224 (2023) - Sunny Atalig, Marek Chrobak:
A Tight Threshold Bound for Search Trees with 2-way Comparisons. CoRR abs/2312.03896 (2023) - Huong Luu, Marek Chrobak:
A Note on Local Convergence of Iterative Processes for Pipe Network Analysis. CoRR abs/2312.07681 (2023) - 2022
- Marek Chrobak, Mordecai J. Golin, J. Ian Munro, Neal E. Young:
On Huang and Wong's algorithm for generalized binary split trees. Acta Informatica 59(6): 687-708 (2022) - Pavel Veselý, Marek Chrobak, Lukasz Jez, Jirí Sgall:
A \(\boldsymbol{\phi }\) -Competitive Algorithm for Scheduling Packets with Deadlines. SIAM J. Comput. 51(5): 1626-1691 (2022) - Marek Chrobak, Mordecai J. Golin, J. Ian Munro, Neal E. Young:
A Simple Algorithm for Optimal Search Trees with Two-way Comparisons. ACM Trans. Algorithms 18(1): 2:1-2:11 (2022) - Marek Chrobak, Samuel Haney, Mehraneh Liaee, Debmalya Panigrahi, Rajmohan Rajaraman, Ravi Sundaram, Neal E. Young:
Online Paging with Heterogeneous Cache Slots. CoRR abs/2206.05579 (2022) - Huong Luu, Marek Chrobak:
Better Hardness Results for the Minimum Spanning Tree Congestion Problem. CoRR abs/2209.08219 (2022) - Eric Chan, Marek Chrobak, Mohsen Lesani:
Cross-chain Swaps with Preferences. CoRR abs/2210.11791 (2022) - 2021
- Marek Chrobak, Kevin P. Costello, Leszek Gasieniec:
Information gathering in ad-hoc radio networks. Inf. Comput. 281: 104769 (2021) - Marek Chrobak, Mordecai J. Golin, J. Ian Munro, Neal E. Young:
On the cost of unsuccessful searches in search trees with two-way comparisons. Inf. Comput. 281: 104707 (2021) - Marek Chrobak, Mordecai J. Golin, Tak Wah Lam, Dorian Nogneng:
Scheduling with gaps: new models and algorithms. J. Sched. 24(4): 381-403 (2021) - Marcin Bienkowski, Martin Böhm, Jaroslaw Byrka, Marek Chrobak, Christoph Dürr, Lukás Folwarczný, Lukasz Jez, Jirí Sgall, Kim Thang Nguyen, Pavel Veselý:
New results on multi-level aggregation. Theor. Comput. Sci. 861: 133-143 (2021) - Marek Chrobak, Mordecai J. Golin, J. Ian Munro, Neal E. Young:
On the Cost of Unsuccessful Searches in Search Trees with Two-way Comparisons. CoRR abs/2103.01052 (2021) - Marek Chrobak, Mordecai J. Golin, J. Ian Munro, Neal E. Young:
A Simple Algorithm for Optimal Search Trees with Two-Way Comparisons. CoRR abs/2103.01084 (2021) - 2020
- Marek Chrobak, Christoph Dürr, Aleksander Fabijan, Bengt J. Nilsson:
Online Clique Clustering. Algorithmica 82(4): 938-965 (2020) - Marcin Bienkowski, Martin Böhm, Jaroslaw Byrka, Marek Chrobak, Christoph Dürr, Lukás Folwarczný, Lukasz Jez, Jirí Sgall, Kim Thang Nguyen, Pavel Veselý:
Online Algorithms for Multilevel Aggregation. Oper. Res. 68(1): 214-232 (2020) - Miguel Coviello Gonzalez, Marek Chrobak:
A Waste-Efficient Algorithm for Single-Droplet Sample Preparation on Microfluidic Chips. ACM J. Exp. Algorithmics 25: 1-22 (2020) - Miguel Coviello Gonzalez, Marek Chrobak:
Towards a theory of mixing graphs: A characterization of perfect mixability. Theor. Comput. Sci. 845: 98-121 (2020) - Huong Luu, Marek Chrobak:
Modeling Fluid Mixing in Microfluidic Grids. CSC 2020: 149-159 - Miguel Coviello Gonzalez, Marek Chrobak:
A Waste-Efficient Algorithm for Single-Droplet Sample Preparation on Microfluidic Chips. WALCOM 2020: 55-68 - Qi Fu, Elizabeth Bent, James Borneman, Marek Chrobak, Neal E. Young:
Algorithmic approaches to selecting control clones in DNA array hybridization experiments. CoRR abs/2005.13645 (2020) - 2019
- Martin Böhm, Marek Chrobak, Lukasz Jez, Fei Li, Jirí Sgall, Pavel Veselý:
Online packet scheduling with bounded delay and lookahead. Theor. Comput. Sci. 776: 95-113 (2019)
skipping 225 more matches
loading more results
failed to load more results, please try again later
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.
retrieved on 2024-04-25 15:12 CEST from data curated by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint