Oren Patashnik

4.0k citations
11 papers · 2.5k indexed · 2 hit papers · h-index 7

Impact in

Papers in

Oren Patashnik

11 papers receiving 2.3k citations

Hit Papers

Concrete Mathematics: A Foundation for Computer Science. 1991 · 980 citations
98019892026200120134008001.2k

Peers

Oren Patashnik
Comparison fields: 5 of 123
  • Discrete Mathematics and Combinatorics 433
  • Algebra and Number Theory 391
  • Computational Theory and Mathematics 664
  • Geometry and Topology 266
  • Theoretical Computer Science 32
Replace Steven Roman with:
Steven Roman United States
N.G. de Bruijn Netherlands
John Riordan United States
Richard K. Guy Canada
Solomon W. Golomb United States
Ivan Niven United States
Henryk Minc United States
Leo Moser Canada
J. H. van Lint Netherlands
Robert Sedgewick United States
Oren Patashnik relative to Steven Roman United States Steven Roman's profile →
Citations per field
00.5×1.6×
Steven Roman · 1×
Citations per year

Countries citing papers authored by Oren Patashnik

Since Specialization
Citations

This map shows the geographic impact of Oren Patashnik's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Oren Patashnik with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Oren Patashnik more than expected).

Fields of papers citing papers by Oren Patashnik

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Oren Patashnik. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Oren Patashnik. The network helps show where Oren Patashnik may publish in the future.

Co-authors

The 8 scholars most cited alongside Oren Patashnik, linked wherever they have co-authored with each other. Click a name or a connecting line to browse the papers they share.

Border = papers with Oren Patashnik Line = papers co-authored together Oren Patashnik links everyone, so they are left out of the graph.

All Works

11 of 11 papers shown
#Work
1
BibT E X yesterday, today, and tomorrow
20032
2 199619
3 199539
4 19944
5 19943
6
Concrete Mathematics: A Foundation for Computer Science.
Hit paper breakdown →
1991980
7
Optimal circuit segmentation for pseudo-exhaustive testing
19908
8
Concrete Mathematics: A Foundation for Computer Science
Hit paper breakdown →
19891452
9
Concrete Math
19886
10 19809
11 198014

About Oren Patashnik

Oren Patashnik is a scholar working on Discrete Mathematics and Combinatorics, Numerical Analysis, Hardware and Architecture, Computational Theory and Mathematics and Geometry and Topology, having authored 11 papers that have together received 2.5k indexed citations. Recurring topics across this work include graph theory and CDMA systems (2 papers), VLSI and FPGA Design Techniques (1 paper), Computability, Logic, AI Algorithms (1 paper), Mathematics and Applications (1 paper), Machine Learning and Algorithms (1 paper), Digital Humanities and Scholarship (1 paper), Coding theory and cryptography (1 paper) and Mathematics, Computing, and Information Processing (1 paper). The work is most often cited by research in Discrete Mathematics and Combinatorics (433 citations), Algebra and Number Theory (391 citations), Computational Theory and Mathematics (664 citations), Geometry and Topology (266 citations) and Theoretical Computer Science (32 citations). Oren Patashnik has collaborated with scholars based in United States. Frequent co-authors include Donald E. Knuth, Ronald Graham, Stanley Yung‐Chuan Liu, Edward A. Bender, Greg Kuperberg, Daniel M. Gordon, Joel Spencer and Howard Rumsey. Their work appears in journals such as Journal of Combinatorial Theory Series A, Journal of Combinatorial Designs, Computers in Physics, American Mathematical Monthly and Mathematics Magazine.

Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.

Explore authors with similar magnitude of impact

Rankless by CCL
2026