Остановите войну!
for scientists:
default search action
Marius Zimand
- > Home > Persons > Marius Zimand
Publications
- 2023
- [j37]Bruno Bauwens, Marius Zimand:
Universal almost Optimal Compression and Slepian-wolf Coding in Probabilistic Polynomial Time. J. ACM 70(2): 9:1-9:33 (2023) - [j36]Alastair A. Abbott, Cezar Câmpeanu, Ludwig Staiger, Marius Zimand, Arto Salomaa:
Frontiers of Computability, Randomness, and Complexity (dedicated to the 70th birthday of Professor Cristian Calude). Theor. Comput. Sci. 952: 113819 (2023) - 2022
- [i38]Andrei E. Romashchenko, Alexander Shen, Marius Zimand:
27 Open Problems in Kolmogorov Complexity. CoRR abs/2203.15109 (2022) - [i37]Bruno Bauwens, Marius Zimand:
Hall-type theorems for fast almost dynamic matching and applications. CoRR abs/2204.01936 (2022) - 2021
- [j34]Andrei E. Romashchenko, Alexander Shen, Marius Zimand:
27 Open Problems in Kolmogorov Complexity. SIGACT News 52(4): 31-54 (2021) - 2020
- [i33]Bruno Bauwens, Marius Zimand:
Universal codes in the shared-randomness model for channels with general distortion capabilities. CoRR abs/2007.02330 (2020) - 2019
- [j33]Andrei E. Romashchenko, Marius Zimand:
An Operational Characterization of Mutual Information in Algorithmic Information Theory. J. ACM 66(5): 38:1-38:42 (2019) - [i32]Andrei E. Romashchenko, Marius Zimand:
On a conditional inequality in Kolmogorov complexity and its applications in communication complexity. CoRR abs/1905.00164 (2019) - [i30]Bruno Bauwens, Marius Zimand:
Universal almost optimal compression and Slepian-Wolf coding in probabilistic polynomial time. CoRR abs/1911.04268 (2019) - 2018
- [j32]Bruno Bauwens, Anton Makhlin, Nikolai K. Vereshchagin, Marius Zimand:
Short lists with short programs in short time. Comput. Complex. 27(1): 31-61 (2018) - [c28]Andrei E. Romashchenko, Marius Zimand:
An Operational Characterization of Mutual Information in Algorithmic Information Theory. ICALP 2018: 95:1-95:14 - [i29]Andrei E. Romashchenko, Marius Zimand:
An operational characterization of mutual information in algorithmic information theory. Electron. Colloquium Comput. Complex. TR18 (2018) - 2017
- [i27]Andrei E. Romashchenko, Marius Zimand:
An operational characterization of mutual information in algorithmic information theory. CoRR abs/1710.05984 (2017) - 2015
- [i24]Bruno Bauwens, Marius Zimand:
Linear list-approximation for short programs (or the power of a few random bits). Electron. Colloquium Comput. Complex. TR15 (2015) - 2014
- [c24]Bruno Bauwens, Marius Zimand:
Linear List-Approximation for Short Programs (or the Power of a Few Random Bits). CCC 2014: 241-247 - 2013
- [c23]Bruno Bauwens, Anton Makhlin, Nikolay K. Vereshchagin, Marius Zimand:
Short Lists with Short Programs in Short Time. CCC 2013: 98-108 - [i22]Bruno Bauwens, Anton Makhlin, Nikolay K. Vereshchagin, Marius Zimand:
Short lists with short programs in short time. CoRR abs/1301.1547 (2013) - [i19]Bruno Bauwens, Marius Zimand:
Linear list-approximation for short programs (or the power of a few random bits). CoRR abs/1311.7278 (2013) - [i18]Bruno Bauwens, Anton Makhlin, Nikolay K. Vereshchagin, Marius Zimand:
Short lists with short programs in short time. Electron. Colloquium Comput. Complex. TR13 (2013) - 2010
- [j25]Cristian S. Calude, Marius Zimand:
Algorithmically independent sequences. Inf. Comput. 208(3): 292-308 (2010) - 2008
- [c12]Cristian S. Calude, Marius Zimand:
Algorithmically Independent Sequences. Developments in Language Theory 2008: 183-195 - [i6]Cristian S. Calude, Marius Zimand:
Algorithmically independent sequences. CoRR abs/0802.0487 (2008) - 2007
- [j21]Gruia Calinescu, Ion I. Mandoiu, Alexander Zelikovsky, Marius Zimand:
Selected Papers from the 1st ACIS International Workshop on Self-Assembling Wireless Networks. J. Univers. Comput. Sci. 13(1): 1-3 (2007) - [j20]Cristian S. Calude, Gheorghe Stefanescu, Marius Zimand:
Combinatorics and Related Areas A Collection of Papers in Honour of the 65th Birthday of Ioan Tomescu. J. Univers. Comput. Sci. 13(11): 1498-1500 (2007) - 2006
- [j19]Lane A. Hemaspaandra, Mitsunori Ogihara, Mohammed J. Zaki, Marius Zimand:
The Complexity of Finding Top-Toda-Equivalence-Class Members. Theory Comput. Syst. 39(5): 669-684 (2006) - 2004
- [c7]Lane A. Hemaspaandra, Mitsunori Ogihara, Mohammed Javeed Zaki, Marius Zimand:
The Complexity of Finding Top-Toda-Equivalence-Class Members. LATIN 2004: 90-99 - 2002
- [j18]Edith Hemaspaandra, Lane A. Hemaspaandra, Marius Zimand:
Almost-Everywhere Superiority for Quantum Polynomial Time. Inf. Comput. 175(2): 171-181 (2002) - 1999
- [i1]Edith Hemaspaandra, Lane A. Hemaspaandra, Marius Zimand:
Almost-Everywhere Superiority for Quantum Computing. CoRR quant-ph/9910033 (1999) - 1998
- [j15]Lane A. Hemaspaandra, Kulathur S. Rajasethupathy, Prasanna Sethupathy, Marius Zimand:
Power Balance and Apportionment Algorithms for the United States Congress. ACM J. Exp. Algorithmics 3: 1 (1998) - 1996
- [j10]Lane A. Hemaspaandra, Marius Zimand:
Strong Self-Reducibility Precludes Strong Immunity. Math. Syst. Theory 29(5): 535-548 (1996) - [j9]Cristian Calude, Marius Zimand:
Effective Category and Measure in Abstract Complexity Theory. Theor. Comput. Sci. 154(2): 307-327 (1996) - 1995
- [j8]Lane A. Hemaspaandra, Ajit Ramachandran, Marius Zimand:
Worlds to die for. SIGACT News 26(4): 5-15 (1995) - [c1]Cristian Calude, Marius Zimand:
Effective Category and Measure in Abstract Complexity Theory (Extended Abstract). FCT 1995: 156-170 - 1994
- [j5]Ioan Tomescu, Marius Zimand:
Minimum Spanning Hypertrees. Discret. Appl. Math. 54(1): 67-76 (1994) - 1992
- [j3]Cristian S. Calude, Gabriel Istrate, Marius Zimand:
Recursive Baire Classification and Speedable Functions. Math. Log. Q. 38(1): 169-178 (1992)
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 2023-09-28 03:42 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint