![](https://dblp1.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp1.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp1.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
default search action
Abbas Mehrabian
Person information
Refine list
![note](https://dblp1.uni-trier.de/img/note-mark.dark.12x12.png)
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2022
- [j24]Gábor Lugosi
, Abbas Mehrabian
:
Multiplayer Bandits Without Observing Collision Information. Math. Oper. Res. 47(2): 1247-1265 (2022) - 2020
- [j23]Omer Angel, Abbas Mehrabian, Yuval Peres:
The string of diamonds is nearly tight for rumour spreading. Comb. Probab. Comput. 29(2): 190-199 (2020) - [j22]Hassan Ashtiani, Shai Ben-David, Nicholas J. A. Harvey, Christopher Liaw, Abbas Mehrabian
, Yaniv Plan:
Near-optimal Sample Complexity Bounds for Robust Learning of Gaussian Mixtures via Compression Schemes. J. ACM 67(6): 32:1-32:42 (2020) - 2019
- [j21]Peter L. Bartlett, Nick Harvey, Christopher Liaw, Abbas Mehrabian:
Nearly-tight VC-dimension and Pseudodimension Bounds for Piecewise Linear Neural Networks. J. Mach. Learn. Res. 20: 63:1-63:17 (2019) - [j20]Luc Devroye, Vida Dujmovic, Alan M. Frieze, Abbas Mehrabian, Pat Morin
, Bruce A. Reed:
Notes on growing a tree in a graph. Random Struct. Algorithms 55(2): 290-312 (2019) - 2017
- [j19]Abbas Mehrabian:
Justifying the small-world phenomenon via random recursive trees. Random Struct. Algorithms 50(2): 201-224 (2017) - [j18]Hüseyin Acan, Andrea Collevecchio, Abbas Mehrabian, Nick Wormald:
On the Push&Pull Protocol for Rumor Spreading. SIAM J. Discret. Math. 31(2): 647-668 (2017) - [j17]Jeannette C. M. Janssen
, Abbas Mehrabian:
Rumors Spread Slowly in a Small-World Spatial Network. SIAM J. Discret. Math. 31(4): 2414-2428 (2017) - 2016
- [j16]Abbas Mehrabian, Nick Wormald:
It's a Small World for Random Surfers. Algorithmica 76(2): 344-380 (2016) - [j15]Andrea Collevecchio, Abbas Mehrabian, Nick Wormald:
Longest paths in random Apollonian networks and largest r-ary subtrees of random d-ary recursive trees. J. Appl. Probab. 53(3): 846-856 (2016) - [j14]Abbas Mehrabian, Ali Pourmiri
:
Randomized rumor spreading in poorly connected small-world networks. Random Struct. Algorithms 49(1): 185-208 (2016) - 2015
- [j13]Saieed Akbari, Akbar Daemi, Omid Hatami, Adel Javanmard, Abbas Mehrabian:
Nowhere-zero Unoriented Flows in Hamiltonian Graphs. Ars Comb. 120: 51-63 (2015) - [j12]Abbas Mehrabian:
The fast robber on interval and chordal graphs. Discret. Appl. Math. 180: 188-193 (2015) - [j11]Noga Alon, Abbas Mehrabian:
Chasing a Fast Robber on Planar Graphs and Random Graphs. J. Graph Theory 78(2): 81-96 (2015) - [j10]Shayan Ehsani, Saber Shokat Fadaee, MohammadAmin Fazli, Abbas Mehrabian, Sina Sadeghian Sadeghabad, Mohammad Ali Safari, Morteza Saghafian
:
A Bounded Budget Network Creation Game. ACM Trans. Algorithms 11(4): 34:1-34:25 (2015) - 2014
- [j9]Ehsan Ebrahimzadeh, Linda Farczadi, Pu Gao, Abbas Mehrabian, Cristiane M. Sato
, Nick Wormald, Jonathan Zung:
On longest paths and diameter in random apollonian network. Random Struct. Algorithms 45(4): 703-725 (2014) - 2013
- [j8]Abbas Mehrabian, Nick Wormald:
On the Stretch Factor of Randomly Embedded Random Graphs. Discret. Comput. Geom. 49(3): 647-658 (2013) - [j7]Ehsan Ebrahimzadeh, Linda Farczadi, Pu Gao, Abbas Mehrabian, Cristiane M. Sato
, Nick Wormald, Jonathan Zung:
On the Longest Paths and the Diameter in Random Apollonian Networks. Electron. Notes Discret. Math. 43: 355-365 (2013) - [j6]Abbas Mehrabian, Dieter Mitsche, Pawel Pralat:
On the Maximum Density of Graphs with Unique-Path Labelings. SIAM J. Discret. Math. 27(3): 1228-1233 (2013) - 2012
- [j5]Abbas Mehrabian:
On the Density of Nearly Regular Graphs with a Good Edge-Labeling. SIAM J. Discret. Math. 26(3): 1265-1268 (2012) - 2011
- [j4]Noga Alon, Abbas Mehrabian:
On a Generalization of Meyniel's Conjecture on the Cops and Robbers Game. Electron. J. Comb. 18(1) (2011) - [j3]Abbas Mehrabian:
Lower Bounds for the Cop Number when the Robber is Fast. Comb. Probab. Comput. 20(4): 617-621 (2011) - [j2]Abbas Mehrabian:
The capture time of grids. Discret. Math. 311(1): 102-105 (2011) - 2010
- [j1]Saieed Akbari
, Akbar Daemi, Omid Hatami, Adel Javanmard, Abbas Mehrabian:
Zero-Sum Flows in Regular Graphs. Graphs Comb. 26(5): 603-615 (2010)
Conference and Workshop Papers
- 2021
- [c15]Hossein Esfandiari, Amin Karbasi, Abbas Mehrabian, Vahab S. Mirrokni:
Regret Bounds for Batched Bandits. AAAI 2021: 7340-7348 - 2020
- [c14]Abbas Mehrabian, Etienne Boursier, Emilie Kaufmann, Vianney Perchet:
A Practical Algorithm for Multiplayer Bandits when Arm Means Vary Among Players. AISTATS 2020: 1211-1221 - [c13]Sharan Vaswani, Abbas Mehrabian, Audrey Durand, Branislav Kveton:
Old Dog Learns New Tricks: Randomized UCB for Bandit Problems. AISTATS 2020: 1988-1998 - 2018
- [c12]Hassan Ashtiani, Shai Ben-David, Abbas Mehrabian:
Sample-Efficient Learning of Mixtures. AAAI 2018: 2679-2686 - [c11]Hassan Ashtiani, Shai Ben-David, Nicholas J. A. Harvey, Christopher Liaw, Abbas Mehrabian, Yaniv Plan:
Nearly tight sample complexity bounds for learning mixtures of Gaussians via sample compression schemes. NeurIPS 2018: 3416-3425 - 2017
- [c10]Omer Angel
, Abbas Mehrabian, Yuval Peres:
The String of Diamonds Is Tight for Rumor Spreading. APPROX-RANDOM 2017: 26:1-26:9 - [c9]Nick Harvey, Christopher Liaw, Abbas Mehrabian:
Nearly-tight VC-dimension bounds for piecewise linear neural networks. COLT 2017: 1064-1068 - [c8]Petra Berenbrink, Peter Kling
, Christopher Liaw, Abbas Mehrabian:
Tight Load Balancing Via Randomized Local Search. IPDPS 2017: 192-201 - 2015
- [c7]Hüseyin Acan, Andrea Collevecchio, Abbas Mehrabian, Nick Wormald:
On the Push&Pull Protocol for Rumour Spreading: [Extended Abstract]. PODC 2015: 405-412 - [c6]Jeannette C. M. Janssen
, Abbas Mehrabian:
Rumours Spread Slowly in a Small World Spatial Network. WAW 2015: 107-118 - 2014
- [c5]Abbas Mehrabian, Nick Wormald:
It's a Small World for Random Surfers. APPROX-RANDOM 2014: 857-871 - [c4]Abbas Mehrabian, Ali Pourmiri:
Randomized Rumor Spreading in Poorly Connected Small-World Networks. DISC 2014: 346-360 - 2012
- [c3]Soroush Alamdari, Abbas Mehrabian:
On a DAG Partitioning Problem. WAW 2012: 17-28 - 2011
- [c2]Abbas Mehrabian:
A Randomly Embedded Random Graph is Not a Spanner. CCCG 2011 - [c1]Shayan Ehsani, MohammadAmin Fazli, Abbas Mehrabian, Sina Sadeghian Sadeghabad, MohammadAli Safari, Morteza Saghafian
, Saber ShokatFadaee:
On a bounded budget network creation game. SPAA 2011: 207-214
Informal and Other Publications
- 2023
- [i22]Abbas Mehrabian, Ankit Anand, Hyunjik Kim, Nicolas Sonnerat, Matej Balog, Gheorghe Comanici, Tudor Berariu, Andrew Lee, Anian Ruoss, Anna Bulanova, Daniel Toyama, Sam Blackwell, Bernardino Romera-Paredes, Petar Velickovic, Laurent Orseau, Joonkyung Lee, Anurag Murty Naredla, Doina Precup, Adam Zsolt Wagner:
Finding Increasingly Large Extremal Graphs with AlphaZero and Tabu Search. CoRR abs/2311.03583 (2023) - 2019
- [i21]Emilie Kaufmann, Abbas Mehrabian:
New Algorithms for Multiplayer Bandits when Arm Means Vary Among Players. CoRR abs/1902.01239 (2019) - [i20]Sharan Vaswani, Abbas Mehrabian, Audrey Durand, Branislav Kveton:
Old Dog Learns New Tricks: Randomized UCB for Bandit Problems. CoRR abs/1910.04928 (2019) - [i19]Hossein Esfandiari, Amin Karbasi, Abbas Mehrabian, Vahab S. Mirrokni:
Batched Multi-Armed Bandits with Optimal Regret. CoRR abs/1910.04959 (2019) - 2018
- [i18]Hassan Ashtiani, Abbas Mehrabian:
Some techniques in density estimation. CoRR abs/1801.04003 (2018) - [i17]Luc Devroye, Abbas Mehrabian, Tommy Reddad:
The Minimax Learning Rate of Normal and Ising Undirected Graphical Models. CoRR abs/1806.06887 (2018) - [i16]Gábor Lugosi, Abbas Mehrabian:
Multiplayer bandits without observing collision information. CoRR abs/1808.08416 (2018) - 2017
- [i15]Nick Harvey, Christopher Liaw, Abbas Mehrabian:
Nearly-tight VC-dimension bounds for piecewise linear neural networks. CoRR abs/1703.02930 (2017) - [i14]Omer Angel, Abbas Mehrabian, Yuval Peres:
The string of diamonds is tight for rumor spreading. CoRR abs/1704.00874 (2017) - [i13]Hassan Ashtiani, Shai Ben-David, Abbas Mehrabian:
Sample-Efficient Learning of Mixtures. CoRR abs/1706.01596 (2017) - [i12]Petra Berenbrink, Peter Kling, Christopher Liaw, Abbas Mehrabian:
Tight Load Balancing via Randomized Local Search. CoRR abs/1706.09997 (2017) - [i11]Luc Devroye, Vida Dujmovic, Alan M. Frieze, Abbas Mehrabian, Pat Morin, Bruce A. Reed:
Notes on Growing a Tree in a Graph. CoRR abs/1707.00083 (2017) - [i10]Hassan Ashtiani, Shai Ben-David, Abbas Mehrabian:
Agnostic Distribution Learning via Compression. CoRR abs/1710.05209 (2017) - 2016
- [i9]Christopher Liaw, Abbas Mehrabian, Yaniv Plan, Roman Vershynin:
A simple tool for bounding the deviation of random matrices on geometric sets. CoRR abs/1603.00897 (2016) - [i8]Jeannette C. M. Janssen, Abbas Mehrabian:
Rumours spread slowly in a small world spatial network. CoRR abs/1608.01697 (2016) - 2014
- [i7]Abbas Mehrabian, Nick Wormald:
It's a Small World for Random Surfers. CoRR abs/1404.7189 (2014) - [i6]Abbas Mehrabian:
Justifying the small-world phenomenon via random recursive trees. CoRR abs/1410.6397 (2014) - [i5]Abbas Mehrabian, Ali Pourmiri:
Randomized Rumor Spreading in Poorly Connected Small-World Networks. CoRR abs/1410.8175 (2014) - [i4]Hüseyin Acan, Andrea Collevecchio, Abbas Mehrabian, Nick Wormald:
On the push&pull protocol for rumour spreading. CoRR abs/1411.0948 (2014) - 2012
- [i3]Abbas Mehrabian, Nick Wormald:
On the Stretch Factor of Randomly Embedded Random Graphs. CoRR abs/1205.6252 (2012) - 2011
- [i2]Shayan Ehsani, MohammadAmin Fazli, Abbas Mehrabian, Sina Sadeghian Sadeghabad, MohammadAli Safari, Morteza Saghafian, Saber ShokatFadaee:
On a Bounded Budget Network Creation Game. CoRR abs/1111.0554 (2011) - 2010
- [i1]Abbas Mehrabian:
Pursuing a Superfast Robber in an Interval Graph. CoRR abs/1008.4210 (2010)
Coauthor Index
![](https://dblp1.uni-trier.de/img/cog.dark.24x24.png)
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.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 22:45 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint