![](https://dblp.dagstuhl.de/img/logo.ua.320x120.png)
![](https://dblp.dagstuhl.de/img/dropdown.dark.16x16.png)
![](https://dblp.dagstuhl.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.dagstuhl.de/img/search.dark.16x16.png)
![search dblp](https://dblp.dagstuhl.de/img/search.dark.16x16.png)
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
Exact matches
- Michal Koucký
- Michal Koucký 0001
Charles University, Computer Science Institute, Prague, Czech Republic - Michal Koucký 0002
Charles University, Obstetrics and Gynaecology Clinic, Prague, Czech Republic
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 135 matches
- 2024
- Michal Koucký
, Michael E. Saks
:
Almost Linear Size Edit Distance Sketch. STOC 2024: 956-967 - Michael A. Bender, Alex Conway, Martín Farach-Colton, Hanna Komlós, Michal Koucký, William Kuszmaul, Michael E. Saks:
Nearly Optimal List Labeling. CoRR abs/2405.00807 (2024) - Michal Koucký, Michael Saks:
Almost Linear Size Edit Distance Sketch. CoRR abs/2406.11225 (2024) - Michal Koucký, Josef Matejka:
SquareSort: a cache-oblivious sorting algorithm. CoRR abs/2407.14801 (2024) - 2023
- Michal Koucký:
Automata and Formal Languages: Shall we let them go? Bull. EATCS 140 (2023) - Sudatta Bhattacharya, Michal Koucký:
Streaming k-Edit Approximate Pattern Matching via String Decomposition. ICALP 2023: 22:1-22:14 - Michal Koucký, Michael E. Saks:
Simple, deterministic, fast (but weak) approximations to edit distance and Dyck edit distance. SODA 2023: 5203-5219 - Sudatta Bhattacharya, Michal Koucký:
Locally Consistent Decomposition of Strings with Applications to Edit Distance Sketching. STOC 2023: 219-232 - Sudatta Bhattacharya, Michal Koucký:
Locally consistent decomposition of strings with applications to edit distance sketching. CoRR abs/2302.04475 (2023) - Sudatta Bhattacharya, Michal Koucký:
Streaming k-edit approximate pattern matching via string decomposition. CoRR abs/2305.00615 (2023) - 2021
- Harry Buhrman, Matthias Christandl, Michal Koucký
, Zvi Lotker, Boaz Patt-Shamir, Nikolai K. Vereshchagin
:
High Entropy Random Selection Protocols. Algorithmica 83(2): 667-694 (2021) - Michal Koucký:
Sorting Short Integers: The Exposition. Bull. EATCS 135 (2021) - Michal Koucký
, Vojtech Rödl, Navid Talebanfard
:
A Separator Theorem for Hypergraphs and a CSP-SAT Algorithm. Log. Methods Comput. Sci. 17(4) (2021) - Srinivasan Arunachalam, Sourav Chakraborty, Michal Koucký
, Nitin Saurabh, Ronald de Wolf:
Improved Bounds on Fourier Entropy and Min-entropy. ACM Trans. Comput. Theory 13(4): 22:1-22:40 (2021) - Michal Koucký:
Computing Edit Distance (Invited Talk). CPM 2021: 2:1-2:1 - Pavel Dvorák
, Michal Koucký
, Karel Král, Veronika Slívová:
Data Structures Lower Bounds and Popular Conjectures. ESA 2021: 39:1-39:15 - Michal Koucký
, Karel Král:
Sorting Short Integers. ICALP 2021: 88:1-88:17 - Pavel Dvorák
, Michal Koucký
:
Barrington Plays Cards: The Complexity of Card-Based Protocols. STACS 2021: 26:1-26:17 - Michal Koucký:
Circuit complexity of regular languages. Handbook of Automata Theory (I.) 2021: 493-523 - Pavel Dvorák, Michal Koucký, Karel Král, Veronika Slívová:
Data Structures Lower Bounds and Popular Conjectures. CoRR abs/2102.09294 (2021) - Michal Koucký, Karel Král:
Sorting Short Integers. CoRR abs/2102.10027 (2021) - Michal Koucký, Vojtech Rödl, Navid Talebanfard
:
A Separator Theorem for Hypergraphs and a CSP-SAT Algorithm. CoRR abs/2105.06744 (2021) - 2020
- Sam Buss, Valentine Kabanets, Antonina Kolokolova, Michal Koucký
:
Expander construction in VNC1. Ann. Pure Appl. Log. 171(7): 102796 (2020) - Diptarka Chakraborty
, Debarati Das, Elazar Goldenberg, Michal Koucký
, Michael E. Saks:
Approximating Edit Distance Within Constant Factor in Truly Sub-quadratic Time. J. ACM 67(6): 36:1-36:22 (2020) - Srinivasan Arunachalam, Sourav Chakraborty, Michal Koucký
, Nitin Saurabh, Ronald de Wolf:
Improved Bounds on Fourier Entropy and Min-Entropy. STACS 2020: 45:1-45:19 - Michal Koucký
, Michael E. Saks:
Constant factor approximations to edit distance on far input pairs in nearly linear time. STOC 2020: 699-712 - Pavel Dvorák, Michal Koucký:
Barrington Plays Cards: The Complexity of Card-based Protocols. CoRR abs/2010.08445 (2020) - 2019
- Arkadev Chattopadhyay, Michal Koucký
, Bruno Loff
, Sagnik Mukhopadhyay
:
Simulation Theorems via Pseudo-random Properties. Comput. Complex. 28(4): 617-659 (2019) - Martin Babka
, Jan Bulánek, Vladimír Cunát, Michal Koucký
, Michael E. Saks:
On Online Labeling with Large Label Set. SIAM J. Discret. Math. 33(3): 1175-1193 (2019) - Diptarka Chakraborty, Debarati Das, Michal Koucký
:
Approximate Online Pattern Matching in Sublinear Time. FSTTCS 2019: 10:1-10:15
skipping 105 more matches
loading more results
failed to load more results, please try again later
![](https://dblp.dagstuhl.de/img/cog.dark.24x24.png)
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-09-04 10:07 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