I agree that this site is using cookies. You can find further informations
here
.
X
Login
My folder (
0
)
Home
About us
Home About us
Our history
Profile
Press & public relations
Friends
The library in figures
Exhibitions
Projects
Training, internships, careers
Films
Services & Information
Home Services & Information
Lending and interlibrary loans
Returns and renewals
Training and library tours
My Account
Library cards
New to the library?
Download Information
Opening hours
Learning spaces
PC, WLAN, copy, scan and print
Catalogs and collections
Home Catalogs and Collections
Rare books and manuscripts
Digital collections
Subject Areas
Our sites
Home Our sites
Central Library
Law Library (Juridicum)
BB Business and Economics (BB11)
BB Physics and Electrical Engineering
TB Engineering and Social Sciences
TB Economics and Nautical Sciences
TB Music
TB Art & Design
TB Bremerhaven
Contact the library
Home Contact the library
Staff Directory
Open access & publishing
Home Open access & publishing
Reference management: Citavi & RefWorks
Publishing documents
Open Access in Bremen
Show Desktop-Version
Toggle navigation
Komarath, Balagopal
26
results:
Search for persons
X
Format
Online (26)
Mediatypes
Articles (Online) (8)
Bookchapter (Online) (1)
OpenAccess-fulltext (17)
Sorted by: Relevance
Sorted by: Year
?
1
Monotone Arithmetic Complexity of Graph Homomorphism Polyno..:
Komarath, Balagopal
;
Pandey, Anurag
;
Rahul, C. S.
Algorithmica. 85 (2023) 9 - p. 2554-2579 , 2023
Link:
https://doi.org/10.1007/..
?
2
On the complexity of detecting hazards:
Komarath, Balagopal
;
Saurabh, Nitin
Information Processing Letters. 162 (2020) - p. 105980 , 2020
Link:
https://doi.org/10.1016/..
?
3
On the Complexity of Hazard-free Circuits:
Ikenmeyer, Christian
;
Komarath, Balagopal
;
Lenzen, Christoph
...
Journal of the ACM. 66 (2019) 4 - p. 1-20 , 2019
Link:
https://doi.org/10.1145/..
?
4
On the Complexity of Hazard-free Circuits:
Ikenmeyer, Christian
;
Komarath, Balagopal
;
Lenzen, Christoph
...
Journal of the ACM (JACM). 66 (2019) 4 - p. 1-20 , 2019
Link:
https://dl.acm.org/doi/1..
?
5
On the complexity of hazard-free circuits:
, In:
Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing
,
Ikenmeyer, Christian
;
Komarath, Balagopal
;
Lenzen, Christoph
... - p. 878-889 , 2018
Link:
https://dl.acm.org/doi/1..
?
6
Comparator Circuits over Finite Bounded Posets:
Komarath, Balagopal
;
Sarma, Jayalal
;
Sunil, K.S.
Information and Computation. 261 (2018) - p. 160-174 , 2018
Link:
https://doi.org/10.1016/..
?
7
Pebbling meets coloring: Reversible pebble game on trees:
Komarath, Balagopal
;
Sarma, Jayalal
;
Sawlani, Saurabh
Journal of Computer and System Sciences. 91 (2018) - p. 33-41 , 2018
Link:
https://doi.org/10.1016/..
?
8
Pebbling, Entropy, and Branching Program Size Lower Bounds:
Komarath, Balagopal
;
Sarma, Jayalal
ACM Transactions on Computation Theory. 7 (2015) 2 - p. 1-21 , 2015
Link:
https://doi.org/10.1145/..
?
9
Pebbling, Entropy, and Branching Program Size Lower Bounds:
Komarath, Balagopal
;
Sarma, Jayalal
ACM Transactions on Computation Theory (TOCT). 7 (2015) 2 - p. 1-21 , 2015
Link:
https://dl.acm.org/doi/1..
?
10
On the Power of Border Width-2 ABPs over Fields of Characte..:
Dutta, Pranjal
;
Ikenmeyer, Christian
;
Komarath, Balagopal
...
Is Part Of LIPIcs, Volume 289, 41st International Symposium on Theoretical Aspects of Computer Science (STACS 2024). , 2024
Link:
https://doi.org/10.4230/..
?
11
Finding and Counting Patterns in Sparse Graphs:
Komarath, Balagopal
;
Kumar, Anant
;
Mishra, Suchismita
.
http://arxiv.org/abs/2301.02569. , 2023
Link:
http://arxiv.org/abs/230..
?
12
Karchmer-Wigderson Games for Hazard-Free Computation:
Ikenmeyer, Christian
;
Komarath, Balagopal
;
Saurabh, Nitin
Is Part Of LIPIcs, Volume 251, 14th Innovations in Theoretical Computer Science Conference (ITCS 2023). , 2023
Link:
https://doi.org/10.4230/..
?
13
Finding and Counting Patterns in Sparse Graphs:
Komarath, Balagopal
;
Kumar, Anant
;
Mishra, Suchismita
.
Is Part Of LIPIcs, Volume 254, 40th International Symposium on Theoretical Aspects of Computer Science (STACS 2023). , 2023
Link:
https://doi.org/10.4230/..
?
14
Rabbits Approximate, Cows Compute Exactly!:
Komarath, Balagopal
;
Pandey, Anurag
;
Saurabh, Nitin
Is Part Of LIPIcs, Volume 241, 47th International Symposium on Mathematical Foundations of Computer Science (MFCS 2022). , 2022
Link:
https://doi.org/10.4230/..
?
15
Monotone Arithmetic Complexity of Graph Homomorphism Polyno..:
Komarath, Balagopal
;
Pandey, Anurag
;
Rahul, Chengot Sankaramenon
Is Part Of LIPIcs, Volume 229, 49th International Colloquium on Automata, Languages, and Programming (ICALP 2022). , 2022
Link:
https://doi.org/10.4230/..
1-15