default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMarni Mishna
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c5]Benjamin Buckley, Marni Mishna:
Uniform Sampling and Visualization of 3D Reluctant Walks. GASCom 2024: 66-72- [i6]Frédéric Chyzak, Marni Mishna:
Differential equations satisfied by generating functions of 5-, 6-, and 7-regular labelled graphs: a reduction-based approach. CoRR abs/2406.04753 (2024) - 2023
- [j19]Jason P. Bell, Haggai Liu, Marni Mishna
:
Cogrowth series for free products of finite groups. Int. J. Algebra Comput. 33(2): 237-260 (2023) - 2021
- [c4]Cédric Chauve, Marni Mishna, France Paquet-Nadeau:
Refined Upper Bounds on the Size of the Condensed Neighbourhood of Sequences. Stringology 2021: 30-40 - 2020
- [j18]Marni Mishna, Samuel Simon:
The asymptotics of reflectable weighted walks in arbitrary dimension. Adv. Appl. Math. 118: 102043 (2020) - [j17]Mathilde Bouvel, Marni Mishna, Cyril Nicaud:
Some Families of Trees Arising in Permutation Analysis. Electron. J. Comb. 27(2): 2 (2020)
2010 – 2019
- 2019
- [e1]Marni Mishna, J. Ian Munro:
Proceedings of the Sixteenth Workshop on Analytic Algorithmics and Combinatorics, ANALCO 2019, San Diego, CA, USA, January 6, 2019. SIAM 2019 [contents] - 2018
- [j16]Samuel Johnson, Marni Mishna, Karen A. Yeats:
A combinatorial understanding of lattice path asymptotics. Adv. Appl. Math. 92: 144-163 (2018) - [j15]Marni Mishna:
Regularity in Weighted Graphs a Symmetric Function Approach. Contributions Discret. Math. 13(2) (2018) - [j14]Julien Courtiel, Éric Fusy, Mathias Lepoutre, Marni Mishna:
Bijections for Weyl Chamber walks ending on an axis, using arc diagrams and Schnyder woods. Eur. J. Comb. 69: 126-142 (2018) - 2017
- [j13]Jérémie O. Lumbroso, Marni Mishna, Yann Ponty:
Taming reluctant random walks in the positive quadrant. Electron. Notes Discret. Math. 59: 99-114 (2017) - [j12]Julien Courtiel, Éric Fusy, Mathias Lepoutre, Marni Mishna:
Bijections for walks ending on an axis, using open arc diagrams. Electron. Notes Discret. Math. 61: 301-307 (2017) - [j11]Julien Courtiel, Stephen Melczer, Marni Mishna, Kilian Raschel:
Weighted lattice walks and universality classes. J. Comb. Theory A 152: 255-302 (2017) - [c3]Marni Mishna:
Algorithmic Approaches for Lattice Path Combinatorics. ISSAC 2017: 9-10 - 2016
- [j10]Stephen Melczer, Marni Mishna:
Asymptotic Lattice Path Enumeration Using Diagonals. Algorithmica 75(4): 782-811 (2016) - [j9]Sophie Burrill, Julien Courtiel, Éric Fusy, Stephen Melczer, Marni Mishna:
Tableau sequences, open diagrams, and Baxter families. Eur. J. Comb. 58: 144-165 (2016) - [i5]Julien Courtiel, Éric Fusy, Mathias Lepoutre, Marni Mishna:
Bijections for Weyl Chamber walks ending on an axis, using arc diagrams. CoRR abs/1611.04489 (2016) - 2014
- [j8]Stephen Melczer, Marni Mishna:
Singularity Analysis Via the Iterated Kernel Method. Comb. Probab. Comput. 23(5): 861-888 (2014) - 2013
- [j7]Jared Adams, Eric Freden, Marni Mishna:
From indexed grammars to generating functions. RAIRO Theor. Informatics Appl. 47(4): 325-350 (2013) - 2012
- [i4]Mathilde Bouvel, Cédric Chauve, Marni Mishna, Dominique Rossin:
Average-case analysis of perfect sorting by reversals (Journal Version). CoRR abs/1201.0940 (2012) - 2011
- [j6]Mathilde Bouvel, Cédric Chauve, Marni Mishna, Dominique Rossin:
Average-Case Analysis of Perfect Sorting by Reversals. Discret. Math. Algorithms Appl. 3(3): 369-392 (2011) - [i3]Jared Adams, Eric Freden, Marni Mishna:
From indexed grammars to generating functions. CoRR abs/1102.1779 (2011)
2000 – 2009
- 2009
- [j5]Marni Mishna:
Classifying lattice walks restricted to the quarter plane. J. Comb. Theory A 116(2): 460-477 (2009) - [j4]Marni Mishna, Andrew Rechnitzer:
Two non-holonomic lattice walks in the quarter plane. Theor. Comput. Sci. 410(38-40): 3616-3630 (2009) - [c2]Mathilde Bouvel, Cédric Chauve, Marni Mishna, Dominique Rossin:
Average-Case Analysis of Perfect Sorting by Reversals. CPM 2009: 314-325 - [i2]Mathilde Bouvel, Cédric Chauve, Marni Mishna, Dominique Rossin:
Average-case analysis of perfect sorting by reversals. CoRR abs/0901.2847 (2009) - 2008
- [c1]Marni Mishna, Mike Zabrocki:
Analytic aspects of the shuffle product. STACS 2008: 561-572 - [i1]Marni Mishna, Mike Zabrocki:
Analytic aspects of the shuffle product. CoRR abs/0802.2844 (2008) - 2005
- [j3]Frédéric Chyzak, Marni Mishna, Bruno Salvy:
Effective scalar products of D-finite symmetric functions. J. Comb. Theory A 112(1): 1-43 (2005) - 2003
- [j2]Marni Mishna:
Attribute grammars and automatic complexity analysis. Adv. Appl. Math. 30(1-2): 189-207 (2003) - 2002
- [j1]Brian Alspach, Marni Mishna:
Enumeration of Cayley graphs and digraph. Discret. Math. 256(3): 527-539 (2002)
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-09-06 00:39 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:
