◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

I. Potapov

29 papers hereh-index 17881 citations110 works total

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

author position
  • first author3
  • middle author7
  • last author19

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

fields
  • cs.FL9
  • cs.DS5
  • cs.DM4
  • cs.CC2
  • math.CO2
  • cs.CG1
same name
  • I. Potapov — 4 papers, h 3
  • I. Potapov — 2 papers, h 1

Either other researchers who publish under this name, or the same person where the external sources have not merged their records.

identity via Semantic Scholar / OpenAlex

activity
20042026
most citedTemporal logic with predicate abstraction

18 citations · 28 across the 25 of their papers we have counts for

collaborators
Showing 2021Show all

4 papers · 1 filter

cs.DS2021

Distributed Transformations of Hamiltonian Shapes based on Line Moves

Abdullah Almethen, Othon Michail, Igor Potapov

We consider a discrete system of n simple indistinguishable devices, called \emph{agents}, forming a \emph{connected} shape SI​ on a two-dimensional square grid. Agents are equ…

cs.DC2021

Centralised Connectivity-Preserving Transformations for Programmable Matter: A Minimal Seed Approach

Matthew Connor, Othon Michail, Igor Potapov

We study a model of programmable matter systems consisting of n devices lying on a 2-dimensional square grid which are able to perform the minimal mechanical operation of rotatin…

math.CO2021

Combinatorial Algorithms for Multidimensional Necklaces

Duncan Adamson, Argyrios Deligkas, Vladimir V. Gusev +1

A necklace is an equivalence class of words of length n over an alphabet under the cyclic shift (rotation) operation. As a classical object, there have been many algorithmic resu…

math.CO2021

Ranking Bracelets in Polynomial Time

Duncan Adamson, Argyrios Deligkas, Vladimir V. Gusev +1

The main result of the paper is the first polynomial-time algorithm for ranking bracelets. The time-complexity of the algorithm is O(k^2 n^4), where k is the size of the alphabet a…

◍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.