On the public citation graph

Rational functions with partial quotients of small degree in their continued fraction expansion

https://doi.org/10.1007/bf01318069
0 signed · 28 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.
Claim with ORCID
Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1007/bf01181074openalex-snapshot
Quadratische K�rper im Gebiete der h�heren Kongruenzen. I.
inferredcites →https://doi.org/10.1007/bf01559394openalex-snapshot
Dyadic fractions with small partial quotients
inferredcites →https://doi.org/10.1016/b978-0-12-775950-0.50009-1openalex-snapshot
La Méthode des “Bons Treillis” pour le Calcul des Intégrales Multiples
inferredcites →https://doi.org/10.1090/s0025-5718-1965-0184406-1openalex-snapshot
Random Numbers Generated by Linear Recurrence Modulo Two
inferredcites →https://doi.org/10.1137/0905057openalex-snapshot
The Performance of k -Step Pseudorandom Number Generators under the Uniformity Test
inferredcites →https://doi.org/10.2307/1970925openalex-snapshot
Badly Approximable Power Series in Characteristic 2
inferredcites →https://doi.org/10.2307/1970953openalex-snapshot
Continued Fractions of Algebraic Power Series in Characteristic 2
inferredcites →https://doi.org/10.2307/2317055openalex-snapshot
The Art of Computer Programming. Volume 2: Seminumerical Algorithms.
inferredcites →https://doi.org/10.24033/msmf.24openalex-snapshot
Approximations diophantiennes dans un corps local

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1006/ffta.1998.0227openalex-snapshot
Polynomials with Odd Orthogonal Multiplicity
inferred← citeshttps://doi.org/10.1006/jnth.1997.2201openalex-snapshot
Orthogonal Sequences of Polynomials over Arbitrary Fields
inferred← citeshttps://doi.org/10.1007/978-1-4612-1702-2_4openalex-snapshot
Digital Point Sets: Analysis and Application
inferred← citeshttps://doi.org/10.1007/978-1-4612-2552-2_4openalex-snapshot
Tables of (T, M, S)-Net and (T, 5)-Sequence Parameters
inferred← citeshttps://doi.org/10.1007/978-3-319-04696-9_9openalex-snapshot
Discrepancy Theory and Quasi-Monte Carlo Integration
inferred← citeshttps://doi.org/10.1007/bf02310104openalex-snapshot
Optimal characteristic polynomials for digital multistep pseudorandom numbers
inferred← citeshttps://doi.org/10.1007/bfb0096988openalex-snapshot
Pseudorandom numbers generated from shift register sequences
inferred← citeshttps://doi.org/10.1016/j.ffa.2020.101761openalex-snapshot
Perfect linear complexity profile and apwenian sequences
inferred← citeshttps://doi.org/10.1016/j.jnt.2006.11.009openalex-snapshot
Rational functions over finite fields having continued fraction expansions with linear partial quotients
inferred← citeshttps://doi.org/10.1016/j.jnt.2012.05.006openalex-snapshot
Low discrepancy polynomial lattice point sets
inferred← citeshttps://doi.org/10.1017/cbo9781139696456.002openalex-snapshot
Some highlights of Harald Niederreiter's work
inferred← citeshttps://doi.org/10.1070/rm1991v046n01abeh002725openalex-snapshot
On some problems in the theory of finite fields
inferred← citeshttps://doi.org/10.1090/s0002-9939-96-03394-1openalex-snapshot
The statistics of continued fractions for polynomials over a finite field
inferred← citeshttps://doi.org/10.1090/s0025-5718-1990-1011436-4openalex-snapshot
Figures of Merit for Digital Multistep Pseudorandom Numbers
inferred← citeshttps://doi.org/10.1090/s0025-5718-1993-1160278-0openalex-snapshot
Calculation of Fibonacci Polynomials for GFSR Sequences with Low Discrepancies
inferred← citeshttps://doi.org/10.1090/s0025-5718-1993-1182244-1openalex-snapshot
Good Parameters for a Class of Node Sets in Quasi-Monte Carlo Integration
inferred← citeshttps://doi.org/10.1145/167293.167397openalex-snapshot
Fast generation of low discrepancy points based on Fibonacci polynomials
inferred← citeshttps://doi.org/10.21136/cmj.1992.128322openalex-snapshot
Low-discrepancy point sets obtained by digital constructions over finite fields
inferred← citeshttps://doi.org/10.4064/aa-90-3-251-271openalex-snapshot
Continued fractions of Laurent series with partial quotients from a given set
Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.