Ich stimme zu, dass diese Seite Cookies verwende. Weitere Informationen finden Sie unter unseren Datenschutzerklärungen .
X
Sarma, Jayalal
58  Ergebnisse:
Personensuche X
?
1

Energy and Output Patterns in Boolean Circuits:

, In: Lecture Notes in Computer Science; Theory and Applications of Models of Computation,
Sarma, Jayalal ; Uchizawa, Kei - p. 185-196 , 2024
Link: https://doi.org/10.1007/..
 
?
2

Separating Words Problem over Groups:

, In: Descriptional Complexity of Formal Systems; Lecture Notes in Computer Science,
Kuntewar, Neha ; Anoop, S. K. M. ; Sarma, Jayalal - p. 109-120 , 2023
Link: https://doi.org/10.1007/..
 
?
3

On pure space vs catalytic space:

Bisoyi, Sagar ; Dinesh, Krishnamoorthy ; Sarma, Jayalal
Theoretical Computer Science.  921 (2022)  - p. 112-126 , 2022
Link: https://doi.org/10.1016/..
 
?
4

Rotation Distance for Rank Bounded Trees:

, In: Lecture Notes in Computer Science; Computing and Combinatorics,
Anoop, S. K. M. ; Sarma, Jayalal - p. 529-536 , 2022
Link: https://doi.org/10.1007/..
 
?
5

On Alternation, VC-dimension and k-fold Union of Sets:

, In: Trends in Mathematics; Extended Abstracts EuroComb 2021,
Roy, Amit ; Sarma, Jayalal - p. 675-681 , 2021
Link: https://doi.org/10.1007/..
 
?
6

On the Computational Power of Programs over $$\mathsf {BA}_..:

, In: Language and Automata Theory and Applications; Lecture Notes in Computer Science,
Kulkarni, Manasi S. ; Sarma, Jayalal ; Sundaresan, Janani - p. 29-40 , 2021
Link: https://doi.org/10.1007/..
 
?
7

On Pure Space vs Catalytic Space:

, In: Lecture Notes in Computer Science; Theory and Applications of Models of Computation,
Bisoyi, Sagar ; Dinesh, Krishnamoorthy ; Sarma, Jayalal - p. 439-451 , 2020
Link: https://doi.org/10.1007/..
 
?
8

Power of Decision Trees with Monotone Queries:

, In: Lecture Notes in Computer Science; Computing and Combinatorics,
Amireddy, Prashanth ; Jayasurya, Sai ; Sarma, Jayalal - p. 287-298 , 2020
Link: https://doi.org/10.1007/..
 
?
9

New bounds for energy complexity of Boolean functions:

Dinesh, Krishnamoorthy ; Otiv, Samir ; Sarma, Jayalal
Theoretical Computer Science.  845 (2020)  - p. 59-75 , 2020
Link: https://doi.org/10.1016/..
 
?
10

Sensitivity, affine transforms and quantum communication co..:

Dinesh, Krishnamoorthy ; Sarma, Jayalal
Theoretical Computer Science.  838 (2020)  - p. 68-80 , 2020
Link: https://doi.org/10.1016/..
 
?
11

On the Mystery of Negations in Circuits: Structure vs Power:

, In: Lecture Notes in Computer Science; Computing and Combinatorics,
Amireddy, Prashanth ; Jayasurya, Sai ; Sarma, Jayalal - p. 566-577 , 2020
Link: https://doi.org/10.1007/..
 
?
12

Characterization and Lower Bounds for Branching Program Siz..:

Dinesh, Krishnamoorthy ; Koroth, Sajin ; Sarma, Jayalal
ACM Transactions on Computation Theory.  11 (2019)  2 - p. 1-22 , 2019
Link: https://doi.org/10.1145/..
 
?
13

Space complexity of reachability testing in labelled graphs:

Ramaswamy, Vidhya ; Sarma, Jayalal ; Sunil, K.S.
Journal of Computer and System Sciences.  105 (2019)  - p. 40-53 , 2019
Link: https://doi.org/10.1016/..
 
?
14

Sensitivity, Affine Transforms and Quantum Communication Co..:

, In: Lecture Notes in Computer Science; Computing and Combinatorics,
Dinesh, Krishnamoorthy ; Sarma, Jayalal - p. 140-152 , 2019
Link: https://doi.org/10.1007/..
 
?
15

Alternation, sparsity and sensitivity: Bounds and exponenti..:

Dinesh, Krishnamoorthy ; Sarma, Jayalal
Theoretical Computer Science.  771 (2019)  - p. 71-82 , 2019
Link: https://doi.org/10.1016/..
 
1-15