Stop the war!

Остановите войну!

for scientists:

default search action

combined dblp search
author search
venue search
publication search

ask others

Shuichi Hirahara

Name: dblp XML data dump
Creator: Schloss Dagstuhl - Leibniz Center for Informatics
Published: 1993
License: https://creativecommons.org/publicdomain/zero/1.0/
Keywords: dblp, XML, computer science, scholarly publications, metadata

◀ ▶ joint publications with John Gouwar

> Home > Persons > Shuichi Hirahara

Publications

2023
[j6]
- view
  authority control:
- export record
  dblp key:
  - journals/tcs/AllenderGHR23
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/tcs/AllenderGHR23
Eric Allender, John Gouwar, Shuichi Hirahara, Caleb Robelle:
Cryptographic hardness under projections for time-bounded Kolmogorov complexity. Theor. Comput. Sci. 940(Part): 206-224 (2023)
2021
[c21]
- view
  - electronic edition via DOI (open access)
  - references & citations
  authority control:
- export record
  dblp key:
  - conf/isaac/AllenderGHR21
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/isaac/AllenderGHR21
Eric Allender, John Gouwar, Shuichi Hirahara, Caleb Robelle:
Cryptographic Hardness Under Projections for Time-Bounded Kolmogorov Complexity. ISAAC 2021: 54:1-54:17
[i19]
- view
  - electronic edition @ weizmann.ac.il (open access)
  - no references & citations available
- export record
  dblp key:
  - journals/eccc/AllenderGHR21
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/eccc/AllenderGHR21
Eric Allender, John Gouwar, Shuichi Hirahara, Caleb Robelle:
Cryptographic Hardness under Projections for Time-Bounded Kolmogorov Complexity. Electron. Colloquium Comput. Complex. TR21 (2021)

a service of

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.