default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAmitai Regev
Person information
- affiliation: Weizmann Institute of Science, Rehovot, Israel
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2000 – 2009
- 2009
[j17]Yuri A. Bahturin, Amitai Regev, Doron Zeilberger:
Commutation relations and Vandermonde determinants. Eur. J. Comb. 30(5): 1271-1276 (2009)- 2007
- [j16]Amitai Regev:
Expected lengths and distribution functions for Young diagrams in the hook. Adv. Appl. Math. 38(3): 357-381 (2007) - [j15]Dan Bernstein, Anne Henke, Amitai Regev:
Maximal Projective Degrees for Strict Partitions. Electron. J. Comb. 14(1) (2007) - 2005
- [j14]Amitai Regev, Yuval Roichman:
Generalized statistics on Sn and pattern avoidance. Eur. J. Comb. 26(1): 29-57 (2005) - [j13]Ron M. Adin, Amitai Regev, Yuval Roichman:
Preface. Eur. J. Comb. 26(6): 783-784 (2005) - 2004
- [j12]Amitai Regev, Yuval Roichman:
Permutation statistics on the alternating group. Adv. Appl. Math. 33(4): 676-709 (2004) - 2003
- [j11]Amitai Regev:
On a class of algebras defined by partitions. Adv. Appl. Math. 31(3): 544-561 (2003) - [c1]Amitai Regev, Ehud Shapiro:
Cells as Computation. CMSB 2003: 1-3 - 2002
- [j10]Amitai Regev, Tamar Seeman:
Shuffle Invariance of the Super-RSK Algorithm. Adv. Appl. Math. 28(1): 59-81 (2002) - 2000
- [j9]Amitai Regev:
Generalized Hook and Content Numbers Identities. Eur. J. Comb. 21(7): 949-957 (2000) - [j8]Amitai Regev:
Generalized Hook and Content Numbers Identities--The Projective Case. Eur. J. Comb. 21(7): 959-966 (2000)
1990 – 1999
- 1998
- [j7]Amitai Regev:
Asymptotics of the Number of k-words With An l-descent. Electron. J. Comb. 5 (1998) - [j6]Amitai Regev:
Maximal Degrees for Young Diagrams in the (k, l) Hook. Eur. J. Comb. 19(6): 721-726 (1998) - 1997
- [j5]Amitai Regev, Anatoly M. Vershik:
Asymptotics of Young Diagrams and Hook Numbers. Electron. J. Comb. 4(1) (1997) - 1996
- [j4]William Beckner, Amitai Regev:
Coefficients in some Young Derived Sequences. Eur. J. Comb. 17(8): 689-697 (1996) - 1991
- [j3]Amitai Regev:
A transposition factorization of walk-permutations in graphs. J. Comb. Theory A 56(1): 160-165 (1991)
1980 – 1989
- 1988
- [j2]Paula S. Cohen, Amitai Regev:
On Maximal Degrees for Young Diagrams. Eur. J. Comb. 9(6): 607-610 (1988) - 1984
- [j1]Richard Askey, Amitai Regev:
Maximal Degrees for Young Diagrams in a Strip. Eur. J. Comb. 5(3): 189-191 (1984)
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-06-10 21:22 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:
