default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSinai Robins
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2021
[j12]Cristina G. Fernandes
, José Coelho de Pina, Jorge Luis Ramírez Alfonsín, Sinai Robins:
Cubic Graphs, Their Ehrhart Quasi-Polynomials, and a Scissors Congruence Phenomenon. Discret. Comput. Geom. 65(1): 227-243 (2021)- 2020
- [j11]Alexander Kolpakov, Sinai Robins:
Spherical tetrahedra with rational volume, and spherical Pythagorean triples. Math. Comput. 89(324): 2031-2046 (2020) - 2019
- [j10]Quang Nhat Le, Sinai Robins, Christophe Vignat, Tanay V. Wakhare:
A Continuous Analogue of Lattice Path Enumeration. Electron. J. Comb. 26(3): 3 (2019) - 2016
- [j9]Romanos-Diogenes Malikiosis, Sinai Robins, Yichi Zhang:
Polyhedral Gauss sums, and polytopes with symmetry. J. Comput. Geom. 7(1): 149-170 (2016) - 2013
- [j8]Nick Gravin, Mihail N. Kolountzakis, Sinai Robins, Dmitry Shiryaev:
Structure Results for Multiple Tilings in 3D. Discret. Comput. Geom. 50(4): 1033-1050 (2013) - 2012
- [j7]Nick Gravin, Sinai Robins, Dmitry Shiryaev:
Translational tilings by a polytope, with multiplicity. Comb. 32(6): 629-649 (2012) - [j6]Nick Gravin, Jean B. Lasserre, Dmitrii V. Pasechnik, Sinai Robins:
The Inverse Moment Problem for Convex Polytopes. Discret. Comput. Geom. 48(3): 596-621 (2012) - 2011
- [j5]David Feldman, James Propp, Sinai Robins:
Tiling Lattices with Sublattices, I. Discret. Comput. Geom. 46(1): 184-186 (2011) - [j4]Lenny Fukshansky, Sinai Robins:
Bounds for solid angles of lattices of rank three. J. Comb. Theory A 118(2): 690-701 (2011) - 2007
- [j3]Lenny Fukshansky, Sinai Robins:
Frobenius Problem and the Covering Radius of a Lattice. Discret. Comput. Geom. 37(3): 471-483 (2007) - 2006
- [j2]Matthias Beck, Sinai Robins, Shelemyahu Zacks:
Higher-dimensional Dedekind sums and their bounds arising from the discrete diagonal of the n-cube. Adv. Appl. Math. 36(1): 1-29 (2006) - 2002
- [j1]Matthias Beck, Sinai Robins:
Explicit and Efficient Formulas for the Lattice Point Count in Rational Polygons Using Dedekind - Rademacher Sums. Discret. Comput. Geom. 27(4): 443-459 (2002)
Conference and Workshop Papers
- 2000
- [c1]Matthias Beck, Sinai Robins:
Dedekind sums: a combinatorial-geometric viewpoint. Unusual Applications of Number Theory 2000: 25-35
Informal and Other Publications
- 2021
- [i3]Cristina G. Fernandes, José Coelho de Pina, Jorge L. Ramírez Alfonsín, Sinai Robins:
On the period collapse of a family of Ehrhart quasi-polynomials. CoRR abs/2104.11025 (2021) - 2018
- [i2]Cristina G. Fernandes, José Coelho de Pina, Jorge Luis Ramírez Alfonsín, Sinai Robins:
Cubic graphs, their Ehrhart quasi-polynomials, and a scissors congruence phenomenon. CoRR abs/1802.07164 (2018) - 2011
- [i1]Nick Gravin, Jean B. Lasserre, Dmitrii V. Pasechnik, Sinai Robins:
The inverse moment problem for convex polytopes. CoRR abs/1106.5723 (2011)
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-10-07 22:14 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:
