Skip to main content

ResearchHubLoading navigation…

Loading ResearchHub…

Explore the network

Research, people, journals and institutions — all in one place.

Explore

01Research 02Smart search 03Researchers 04Journals 05Institutions 06RHR Rankings 07ResearchHub platform 08Events

Work together

Turn ideas into projects, questions and reusable datasets.

Connect

01Projects 02Questions 03Datasets

Stay informed

Follow trends, opportunities and your research library.

Insights

01Research trends 02Opportunities 03Library 04Research services 05ResearchHub Pro 06Pricing

ResearchHub

Explore ResearchHub.

Personal

01Recommended research 02Research intelligence

Home Search Network Library Log in

ResearchHub

Research, connected

Explore the graph

X

Download ResearchHub

GET IT ONGoogle PlayComing soonDownload on theApp StoreComing soonEXPLORE IT ONAppGalleryComing soon

Research

Research Researchers Journals Institutions RHR Rankings

Contribute

Projects Questions Datasets Opportunities

Platform

ResearchHub platform About Blog Community Help API Licensing

Shopping

Contact and support

Need help, have a question, or want to contact the ResearchHub team?

Contact and support support@aresearch.uk

© 2026 ResearchHub. Built for responsible scholarly connection.

Help Article feed Privacy Terms Cookies This work is licensed under Creative Commons Attribution 4.0 InternationalCC BY 4.0

Privacy-aware community infrastructure

Cited by — On lower bounds for read-k-times branching programs | ResearchHub - ResearchHub

Research graph

Cited by

Admitted local publications that cite On lower bounds for read-k-times branching programs.

No admitted local citation edges point to this work yet.