◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

Abbas Mehrabian

24 papers hereh-index 161.5k citations42 works total

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

author position
  • sole author5
  • first author3
  • middle author10
  • last author6

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

fields
  • cs.LG4
  • math.CO4
  • math.PR3
  • math.ST3
  • cs.DC2
  • cs.DM2
same name
  • Abbas Mehrabian — 4 papers, h 5
  • Abbas Mehrabian — 3 papers, h 2
  • Abbas Mehrabian — 1 paper

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
20102019
most citedNearly-tight VC-dimension and pseudodimension bounds for piecewise linear neural networks

196 citations · 319 across the 19 of their papers we have counts for

collaborators
Showing math.COShow all

4 papers · 1 filter

math.CO2011★ 4 cited

On the density of nearly regular graphs with a good edge-labelling

Abbas Mehrabian

A good edge-labelling of a simple graph is a labelling of its edges with real numbers such that, for any ordered pair of vertices (u,v), there is at most one nondecreasing path fro…

math.CO2011

Cops and Robber Game with a Fast Robber on Expander Graphs and Random Graphs

Abbas Mehrabian

We consider a variant of the Cops and Robber game, in which the robber has unbounded speed, i.e. can take any path from her vertex in her turn, but she is not allowed to pass throu…

math.CO2010★ 27 cited

The capture time of grids

Abbas Mehrabian

We consider the game of Cops and Robber played on the Cartesian product of two trees. Assuming the players play perfectly, it is shown that if there are two cops in the game, then…

math.CO2010★ 14 cited

Lower Bounds for the Cop Number When the Robber is Fast

Abbas Mehrabian

We consider a variant of the Cops and Robbers game where the robber can move t edges at a time, and show that in this variant, the cop number of a d-regular graph with girth larger…

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