Daniel Padé

According to our database¹, Daniel Padé authored at least 4 papers between 2019 and 2025.

Collaborative distances:

Dijkstra number² of four.
Erdős number³ of four.

Timeline

Legend:

Book

In proceedings

Article

PhD thesis

Dataset

Other

Bibliography

2025

Tight bounds on depth-2 QAC-circuits computing parity.

[BibT_eX]

[DOI]

CoRR, April, 2025

2022

The complexity of regex crosswords.

[BibT_eX]

[DOI]

Stephen A. Fenner

Daniel Padé

Thomas Thierauf

Inf. Comput., 2022

2020

Depth-2 QAC circuits cannot simulate quantum parity.

[BibT_eX]

[DOI]

CoRR, 2020

2019

Complexity of Regex Crosswords.

[BibT_eX]

[DOI]

Stephen A. Fenner

Daniel Padé

Proceedings of the Language and Automata Theory and Applications, 2019

Daniel Padé

Timeline

Legend:

Links

On csauthors.net:

Bibliography

Loading...