◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

O. Verbitsky

11 papers hereh-index 19987 citations78 works total

Matching runs newest-first, so older work may not be attached to this profile yet.

author position
  • sole author3
  • last author8

Across the 11 of 11 papers where every author was matched, so the position is known.

fields
  • math.CO4
  • cs.CC3
  • math.LO3
  • cs.DM1

identity via Semantic Scholar / OpenAlex

activity
20012008
most citedDescriptive Complexity of Finite Structures: Saving the Quantifier Rank

1 citations · 2 across the 10 of their papers we have counts for

collaborators
Showing 2008 · cs.CCShow all

2 papers · 2 filters

cs.CC2008

Zero-Knowledge Proofs of the Conjugacy for Permutation Groups

Oleg Verbitsky

We design a perfect zero-knowledge proof system for recognition if two permutation groups are conjugate.

cs.CC2008

On the Double Coset Membership Problem for Permutation Groups

Oleg Verbitsky

We show that the Double Coset Membership problem for permutation groups possesses perfect zero-knowledge proofs.

◍wovepaper

Papers, researchers and institutions, woven together.

Explore
  • Search
  • Researchers
  • Institutions
Account
  • Library
  • Chat
Data
  • arXiv.org
  • Semantic Scholar
  • OpenAlex
  • Latest RSS
AboutContactPrivacyDevelopersllms.txtopenapi.json
Not affiliated with arXiv. Researcher data from Semantic Scholar (ODC-BY) and OpenAlex.