default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDLionel Levine
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[i10]Wilson Wu, John X. Morris, Lionel Levine
:
Do language models plan ahead for future tokens? CoRR abs/2404.00859 (2024)
2010 – 2019
- 2019
- [j18]Alexander E. Holroyd, Lionel Levine, Peter Winkler:
Abelian Logic Gates. Comb. Probab. Comput. 28(3): 388-422 (2019) - 2018
- [j17]Wilfried Huss, Lionel Levine, Ecaterina Sava-Huss:
Interpolating between random walk and rotor walk. Random Struct. Algorithms 52(2): 263-282 (2018) - [i9]Swee Hong Chan, Lionel Levine:
Abelian networks IV. Dynamics of nonhalting networks. CoRR abs/1804.03322 (2018) - 2016
- [j16]Matthew Farrell, Lionel Levine:
Multi-Eulerian Tours of Directed Graphs. Electron. J. Comb. 23(2): 2 (2016) - [j15]Benjamin Bond, Lionel Levine:
Abelian Networks I. Foundations and Examples. SIAM J. Discret. Math. 30(2): 856-874 (2016) - [j14]Laura Florescu, Lionel Levine, Yuval Peres:
The Range of a Rotor Walk. Am. Math. Mon. 123(7): 627-642 (2016) - 2015
- [i8]Alexander E. Holroyd, Lionel Levine, Peter Winkler:
Abelian logic gates. CoRR abs/1511.00422 (2015) - 2014
- [j13]Lionel Levine, Yuval Peres:
The looping constant of ℤd. Random Struct. Algorithms 45(1): 1-13 (2014) - [j12]Laura Florescu, Shirshendu Ganguly, Lionel Levine, Yuval Peres:
Escape Rates for Rotor Walks in Zd. SIAM J. Discret. Math. 28(1): 323-334 (2014) - [i7]Benjamin Bond, Lionel Levine:
Abelian networks II. Halting on all inputs. CoRR abs/1409.0169 (2014) - [i6]Benjamin Bond, Lionel Levine:
Abelian networks III. The critical group. CoRR abs/1409.0170 (2014) - 2013
- [j11]Tobias Friedrich, Lionel Levine:
Fast simulation of large-scale growth models. Random Struct. Algorithms 42(2): 185-213 (2013) - [i5]Louis J. Billera, Lionel Levine, Karola Mészáros:
How to decompose a permutation into a pair of labeled Dyck paths by playing a game. CoRR abs/1306.6744 (2013) - [i4]Benjamin Bond, Lionel Levine:
Abelian networks: foundations and examples. CoRR abs/1309.3445 (2013) - 2012
- [j10]Giuliano Pezzolo Giacaglia, Lionel Levine, James Propp, Linda Zayas-Palmer:
Local-to-Global Principles for the Hitting Sequence of a Rotor Walk. Electron. J. Comb. 19(1): 5 (2012) - [j9]Lionel Levine, Katherine E. Stange:
How to Make the Most of a Shared Meal: Plan the Last Bite First. Am. Math. Mon. 119(7): 550-565 (2012) - 2011
- [j8]Lionel Levine:
Sandpile groups and spanning trees of directed line graphs. J. Comb. Theory A 118(2): 350-364 (2011) - [c1]Tobias Friedrich, Lionel Levine:
Fast Simulation of Large-Scale Growth Models. APPROX-RANDOM 2011: 555-566 - [i3]Lionel Levine, Katherine E. Stange:
How to make the most of a shared meal: plan the last bite first. CoRR abs/1104.0961 (2011) - [i2]Lionel Levine, Scott Sheffield, Katherine E. Stange:
A duality principle for selection games. CoRR abs/1110.2712 (2011) - 2010
- [j7]Wouter Kager, Lionel Levine:
Rotor-Router Aggregation on the Layered Square Lattice. Electron. J. Comb. 17(1) (2010) - [i1]Tobias Friedrich, Lionel Levine:
Fast simulation of large-scale growth models. CoRR abs/1006.1003 (2010)
2000 – 2009
- 2009
- [j6]Lionel Levine:
The sandpile group of a tree. Eur. J. Comb. 30(4): 1026-1035 (2009) - [j5]Itamar Daniel Landau, Lionel Levine:
The rotor-router model on regular trees. J. Comb. Theory A 116(2): 421-433 (2009) - 2008
- [j4]Christopher J. Hillar, Lionel Levine, Stephen C. Locke:
Snapshots for Velocities: 11223. Am. Math. Mon. 115(1): 75-76 (2008) - [j3]Christopher J. Hillar, Lionel Levine:
Problem 11377. Am. Math. Mon. 115(7): 664 (2008) - 2006
- [j2]Lionel Levine:
Fractal Sequences and Restricted Nim. Ars Comb. 80 (2006) - [j1]Christopher J. Hillar, Lionel Levine:
Problem 11123. Am. Math. Mon. 113(5): 459 (2006)
Coauthor Index
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-08-05 20:21 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
