Bruno Loff

Bruno Loff

Universidade do Porto

H-index: 15

Europe-Portugal

About Bruno Loff

Bruno Loff, With an exceptional h-index of 15 and a recent h-index of 9 (since 2020), a distinguished researcher at Universidade do Porto, specializes in the field of Computational Complexity.

His recent articles reflect a diverse array of research interests and contributions to the field:

Smoothed analysis of deterministic discounted and mean-payoff games

State preparation by shallow circuits using feed forward

Memory compression with quantum random-access gates

Limits of quantum speed-ups for computational geometry and other problems: Fine-grained complexity via quantum walks

Hardness of constant-round communication complexity

Lower Bounds for Semi-adaptive Data Structures via Corruption

NP-hardness of circuit minimization for multi-output functions

The computational power of parsing expression grammars

Bruno Loff Information

University

Position

and INESC-Tec

Citations(all)

562

Citations(since 2020)

271

Cited By

390

hIndex(all)

15

hIndex(since 2020)

9

i10Index(all)

19

i10Index(since 2020)

9

Email

University Profile Page

Universidade do Porto

Google Scholar

View Google Scholar Profile

Bruno Loff Skills & Research Interests

Computational Complexity

Top articles of Bruno Loff

Title

Journal

Author(s)

Publication Date

Smoothed analysis of deterministic discounted and mean-payoff games

arXiv preprint arXiv:2402.03975

Bruno Loff

Mateusz Skomra

2024/2/6

State preparation by shallow circuits using feed forward

arXiv preprint arXiv:2307.14840

Harry Buhrman

Marten Folkertsma

Bruno Loff

Niels MP Neumann

2023/7/27

Memory compression with quantum random-access gates

arXiv preprint arXiv:2203.05599

Harry Buhrman

Bruno Loff

Subhasree Patro

Florian Speelman

2022/3/10

Limits of quantum speed-ups for computational geometry and other problems: Fine-grained complexity via quantum walks

arXiv preprint arXiv:2106.02005

Harry Buhrman

Bruno Loff

Subhasree Patro

Florian Speelman

2021/6/3

Hardness of constant-round communication complexity

Shuichi Hirahara

Rahul Ilango

Bruno Loff

2021

Lower Bounds for Semi-adaptive Data Structures via Corruption

arXiv preprint arXiv:2005.02238

Pavel Dvořák

Bruno Loff

2020/5/5

NP-hardness of circuit minimization for multi-output functions

CCC'20: Proceedings of the 35th Computational Complexity Conference

Rahul Ilango

Bruno Loff

Igor Carboni Oliveira

2020

The computational power of parsing expression grammars

Journal of Computer and System Sciences

Bruno Loff

Nelma Moreira

Rogério Reis

2020/8/1

See List of Professors in Bruno Loff University(Universidade do Porto)

Co-Authors

H-index: 48
Lance Fortnow

Lance Fortnow

Illinois Institute of Technology

H-index: 44
Eric Allender

Eric Allender

Rutgers, The State University of New Jersey

H-index: 44
Richard Cleve

Richard Cleve

University of Waterloo

H-index: 26
Edwin Beggs

Edwin Beggs

Swansea University

H-index: 22
Michal Koucky

Michal Koucky

Univerzita Karlova

H-index: 20
John Hitchcock

John Hitchcock

University of Wyoming

academic-engine