◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

Michael Anastos

2 papers here

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

author position
  • sole author2

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

fields
  • cs.DS1
  • math.CO1
ORCID 0000-0001-5475-6522
same name
  • Michael Anastos — 15 papers, h 7

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

most citedAn improved lower bound on the length of the longest cycle in random graphs

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

collaborators
Showing cs.DSShow all

1 paper · 1 filter

cs.DS2016

Purchasing a C_4 online

Michael Anastos

Let G be a graph with edge set (e1​,e2​,...eN​). We independently associate to each edge ei​ of G a cost xi​ that is drawn from a Uniform [0, 1] distribution. Suppose $…

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