default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJevgenijs Vihrovs
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c13]Vladimirs Andrejevs, Aleksandrs Belovs, Jevgenijs Vihrovs:
Quantum Algorithms for Hopcroft's Problem. MFCS 2024: 9:1-9:16- [i15]Vladimirs Andrejevs, Aleksandrs Belovs, Jevgenijs Vihrovs:
Quantum algorithms for Hopcroft's problem. CoRR abs/2405.01160 (2024) - 2023
- [j4]Andris Ambainis, Kaspars Balodis, Janis Iraids, Kamil Khadiev
, Vladislavs Klevickis, Krisjanis Prusis, Yixin Shen, Juris Smotrovs, Jevgenijs Vihrovs:
Quantum bounds for 2D-grid and Dyck language. Quantum Inf. Process. 22(5): 194 (2023) - [c12]Andris Ambainis, Martins Kokainis, Jevgenijs Vihrovs:
Improved Algorithm and Lower Bound for Variable Time Quantum Search. TQC 2023: 7:1-7:18 - 2022
- [j3]Masaki Nakanishi, Kamil Khadiev, Krisjanis Prusis, Jevgenijs Vihrovs, Abuzer Yakaryilmaz:
Exact Affine Counter Automata. Int. J. Found. Comput. Sci. 33(3&4): 349-370 (2022) - [c11]Vladislavs Klevickis, Krisjanis Prusis, Jevgenijs Vihrovs:
Quantum Speedups for Treewidth. TQC 2022: 11:1-11:18 - [d1]Martins Kokainis, Krisjanis Prusis, Jevgenijs Vihrovs, Vyacheslavs Kashcheyevs, Andris Ambainis:
Dataset for "Strong dispersion property for the quantum walk on the hypercube". Zenodo, 2022
- [i14]Vladislavs Klevickis, Krisjanis Prusis, Jevgenijs Vihrovs:
Quantum speedups for treewidth. CoRR abs/2202.08186 (2022) - 2021
- [j2]Andris Ambainis, Martins Kokainis, Krisjanis Prusis, Jevgenijs Vihrovs, Aleksejs Zajakins:
All Classical Adversary Methods Are Equivalent for Total Functions. ACM Trans. Comput. Theory 13(1): 7:1-7:20 (2021) - [c10]Adam Glos, Martins Kokainis, Ryuhei Mori, Jevgenijs Vihrovs:
Quantum Speedups for Dynamic Programming on n-Dimensional Lattice Graphs. MFCS 2021: 50:1-50:23 - [i13]Adam Glos, Ryuhei Mori, Jevgenijs Vihrovs:
Quantum speedups for dynamic programming on n-dimensional lattice graphs. CoRR abs/2104.14384 (2021) - 2020
- [j1]Rahul Jain, Hartmut Klauck, Srijita Kundu, Troy Lee, Miklos Santha, Swagato Sanyal, Jevgenijs Vihrovs:
Quadratically Tight Relations for Randomized Query Complexity. Theory Comput. Syst. 64(1): 101-119 (2020) - [c9]Andris Ambainis, Kaspars Balodis, Janis Iraids, Kamil Khadiev, Vladislavs Klevickis, Krisjanis Prusis, Yixin Shen, Juris Smotrovs, Jevgenijs Vihrovs:
Quantum Lower and Upper Bounds for 2D-Grid and Dyck Language. MFCS 2020: 8:1-8:14 - [i12]Andris Ambainis, Kaspars Balodis, Janis Iraids, Kamil Khadiev, Vladislavs Klevickis, Krisjanis Prusis, Yixin Shen, Juris Smotrovs, Jevgenijs Vihrovs:
Quantum Lower and Upper Bounds for 2D-Grid and Dyck Language. CoRR abs/2007.03402 (2020)
2010 – 2019
- 2019
- [c8]Andris Ambainis, Kaspars Balodis, Janis Iraids, Martins Kokainis, Krisjanis Prusis, Jevgenijs Vihrovs:
Quantum Speedups for Exponential-Time Dynamic Programming Algorithms. SODA 2019: 1783-1793 - 2018
- [c7]Rahul Jain, Hartmut Klauck, Srijita Kundu, Troy Lee, Miklos Santha, Swagato Sanyal, Jevgenijs Vihrovs:
Quadratically Tight Relations for Randomized Query Complexity. CSR 2018: 207-219 - [c6]Balthazar Bauer, Jevgenijs Vihrovs, Hoeteck Wee:
On the Inner Product Predicate and a Generalization of Matching Vector Families. FSTTCS 2018: 41:1-41:13 - [c5]Andris Ambainis, Martins Kokainis, Krisjanis Prusis, Jevgenijs Vihrovs:
All Classical Adversary Methods are Equivalent for Total Functions. STACS 2018: 8:1-8:14 - [i11]Andris Ambainis, Kaspars Balodis, Janis Iraids, Martins Kokainis, Krisjanis Prusis, Jevgenijs Vihrovs:
Quantum Speedups for Exponential-Time Dynamic Programming Algorithms. CoRR abs/1807.05209 (2018) - [i10]Andris Ambainis, Krisjanis Prusis, Jevgenijs Vihrovs:
On Block Sensitivity and Fractional Block Sensitivity. CoRR abs/1810.02393 (2018) - [i9]Balthazar Bauer, Jevgenijs Vihrovs, Hoeteck Wee:
On the Inner Product Predicate and a Generalization of Matching Vector Families. CoRR abs/1810.02396 (2018) - [i8]Balthazar Bauer, Jevgenijs Vihrovs, Hoeteck Wee:
On the Inner Product Predicate and a Generalization of Matching Vector Families. IACR Cryptol. ePrint Arch. 2018: 945 (2018) - 2017
- [i7]Dmitry Gavinsky, Rahul Jain, Hartmut Klauck, Srijita Kundu, Troy Lee, Miklos Santha, Swagato Sanyal, Jevgenijs Vihrovs:
Quadratically Tight Relations for Randomized Query Complexity. CoRR abs/1708.00822 (2017) - [i6]Andris Ambainis, Martins Kokainis, Krisjanis Prusis, Jevgenijs Vihrovs:
All Classical Adversary Methods are Equivalent for Total Functions. CoRR abs/1709.08985 (2017) - [i5]Andris Ambainis, Martins Kokainis, Krisjanis Prusis, Jevgenijs Vihrovs:
All Classical Adversary Methods are Equivalent for Total Functions. Electron. Colloquium Comput. Complex. TR17 (2017) - [i4]Dmitry Gavinsky, Rahul Jain, Hartmut Klauck, Srijita Kundu, Troy Lee, Miklos Santha, Swagato Sanyal, Jevgenijs Vihrovs:
Quadratically Tight Relations for Randomized Query Complexity. Electron. Colloquium Comput. Complex. TR17 (2017) - 2016
- [c4]Andris Ambainis, Krisjanis Prusis, Jevgenijs Vihrovs:
Sensitivity Versus Certificate Complexity of Boolean Functions. CSR 2016: 16-28 - 2015
- [c3]Andris Ambainis, Jevgenijs Vihrovs:
Size of Sets with Small Sensitivity: A Generalization of Simon's Lemma. TAMC 2015: 122-133 - [i3]Andris Ambainis, Krisjanis Prusis, Jevgenijs Vihrovs:
Sensitivity versus Certificate Complexity of Boolean Functions. CoRR abs/1503.07691 (2015) - 2014
- [c2]Jevgenijs Vihrovs, Krisjanis Prusis, Karlis Freivalds, Peteris Rucevskis, Valdis Krebs:
An Inverse Distance-based Potential Field Function for Overlapping Point Set Visualization. IVAPP 2014: 29-38 - [c1]Jevgenijs Vihrovs, Krisjanis Prusis, Karlis Freivalds, Peteris Rucevskis, Valdis Krebs:
A Potential Field Function for Overlapping Point Set and Graph Cluster Visualization. VISIGRAPP (Selected Papers) 2014: 136-152 - [i2]Andris Ambainis, Jevgenijs Vihrovs:
Size of Sets with Small Sensitivity: a Generalization of Simon's Lemma. CoRR abs/1406.0073 (2014) - [i1]Andris Ambainis, Jevgenijs Vihrovs:
Size of Sets with Small Sensitivity: a Generalization of Simon's Lemma. Electron. Colloquium Comput. Complex. TR14 (2014)
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-10-10 22:14 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:
