Zobrazeno 1 - 10
of 27
pro vyhledávání: '"Rohit Gurjar"'
Publikováno v:
Journal of Graph Algorithms and Applications. 26:1-14
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::2dede12571242b3d09fe8e55756ae8ad
https://doi.org/10.7155/jgaa.00578
https://doi.org/10.7155/jgaa.00578
Publikováno v:
Lecture Notes in Electrical Engineering ISBN: 9789811903113
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::1987fe8a5433f5e6519ea448cd29ba49
https://doi.org/10.1007/978-981-19-0312-0_21
https://doi.org/10.1007/978-981-19-0312-0_21
Publikováno v:
Progress In Electromagnetics Research C. 107:81-96
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::f913c98cfa28cd8cde8c0f867799a3ab
https://doi.org/10.2528/pierc20091809
https://doi.org/10.2528/pierc20091809
Autor:
Ben Lee Volk, Rohit Gurjar
Publikováno v:
ACM Transactions on Computation Theory. 12:1-12
We construct a pseudorandom generator that fools known-order read- k oblivious branching programs and, more generally, any linear length oblivious branching program. For polynomial width branching programs, the seed lengths in our constructions are
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::3d9ec8d3b703aa4eff422319b7857090
https://doi.org/10.1145/3378663
https://doi.org/10.1145/3378663
Publikováno v:
International Journal of RF and Microwave Computer-Aided Engineering. 32
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::706dc635f2c9d153318be2c264d648da
https://doi.org/10.1002/mmce.23101
https://doi.org/10.1002/mmce.23101
Autor:
Yogesh Kumar Verma, Laxman Singh, Varun Mishra, Rohit Gurjar, Prateek Kishor Verma, Sudhnit Kaur, Akhil Sevda, Mrityunjay Kumar Jha, Santosh Kumar Gupta
Publikováno v:
Intelligent Circuits and Systems ISBN: 9781003129103
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::fb534ff8fb6fb367e15b741e506e83b7
https://doi.org/10.1201/9781003129103-17
https://doi.org/10.1201/9781003129103-17
Publikováno v:
Communications of the ACM. 62:109-115
A fundamental quest in the theory of computing is to understand the power of randomness. It is not known whether every problem with an efficient randomized algorithm also has one that does not use randomness. One of the extensively studied problems u
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::0257f104d3d3d2f2d4d31da231baaebc
https://doi.org/10.1145/3306208
https://doi.org/10.1145/3306208
Autor:
Thomas Thierauf, Rohit Gurjar
Publikováno v:
STOC
Given two matroids on the same ground set, the matroid intersection problem asks to find a common independent set of maximum size. In case of linear matroids, the problem had a randomized parallel algorithm but no deterministic one. We give an almost
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::7e3b18d00a7aae75ac518e8ec036ed7e
https://doi.org/10.1007/s00037-020-00200-z
https://doi.org/10.1007/s00037-020-00200-z
Publikováno v:
ACM Transactions on Computation Theory. 9:1-20
A red-blue graph is a graph where every edge is colored either red or blue. The exact perfect matching problem asks for a perfect matching in a red-blue graph that has exactly a given number of red edges. We show that for complete and bipartite compl
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::e42cfdfa75f61957023cf34190857724
https://doi.org/10.1145/3041402
https://doi.org/10.1145/3041402