Shmuel Safra publications per year

The chart shows the history of publications by Shmuel Safra between 1985 and 2025, highlighting the no. of papers published in each year and offering an overview of the publication velocity of this scholar. Shmuel Safra published across 41 years, from 1985 to 2025, averaging 2.5 papers a year. Output peaked at 8 publications in 2006. 2 of the 103 publications appeared in the last two years.

No. of publications

2 4 6 8

1985 2025

103 publications in total across all disciplines

View publications per year as a table

Shmuel Safra: publications per year, 1985 to 2025
Year	Publications
1985	1
1986	3
1987	1
1988	3
1989	2
1990	0
1991	1
1992	3
1993	3
1994	2
1995	1
1996	3
1997	2
1998	4
1999	4
2000	1
2001	2
2002	6
2003	7
2004	1
2005	5
2006	8
2007	2
2008	2
2009	2
2010	1
2011	7
2012	2
2013	2
2014	0
2015	4
2016	2
2017	1
2018	2
2019	1
2020	4
2021	2
2022	1
2023	3
2024	0
2025	2
Total	103

Download as CSV

Shmuel Safra publication distribution in Computer Science in 2026

The chart shows the distribution of publications by all Research.com ranked scientists in the field of Computer Science in 2026. The highlighted bar marks where Shmuel Safra sits on this spectrum.

No. of scientists

200 400 600

32–41 publications 991+

This scientist: 90 publications — 6th percentile

6% of scientists in this discipline score the same or lower.

The last bar groups every scientist with 991 publications or more.

View publications distribution as a table

Number of Computer Science scientists by publication count, Research.com 2026 ranking edition. Based on 14,188 ranked scientists.
Publications	Scientists	This scientist
32–41	7
42–51	22
52–61	82
62–71	134
72–81	249
82–91	324	90
92–101	421
102–111	420
112–121	497
122–131	544
132–141	555
142–151	609
152–161	559
162–171	534
172–181	556
182–191	583
192–201	519
202–211	508
212–221	490
222–231	437
232–241	423
242–251	408
252–261	377
262–271	301
272–281	335
282–291	320
292–301	293
302–311	250
312–321	238
322–331	206
332–341	209
342–351	208
352–361	162
362–371	176
372–381	127
382–391	158
392–401	128
402–411	104
412–421	94
422–431	99
432–441	83
442–451	108
452–461	73
462–471	77
472–481	69
482–491	84
492–501	62
502–511	54
512–521	57
522–531	51
532–541	51
542–551	32
552–561	38
562–571	28
572–581	43
582–591	33
592–601	41
602–611	32
612–621	28
622–631	25
632–641	27
642–651	17
652–661	20
662–671	17
672–681	15
682–691	14
692–701	21
702–711	13
712–721	12
722–731	19
732–741	14
742–751	12
752–761	10
762–771	10
772–781	11
782–791	10
792–801	11
802–811	8
812–821	8
822–831	7
832–841	11
842–851	10
852–861	5
862–871	9
872–881	4
882–891	6
892–901	3
902–911	6
912–921	3
922–931	2
932–941	2
942–951	2
952–961	3
962–971	3
972–981	3
982–990	5
991+	100

Download as CSV

Shmuel Safra D-index placement in Computer Science in 2026

The chart shows the D-index (discipline H-index) distribution of Computer Science scientists ranked by Research.com in 2026. The highlighted bar marks where Shmuel Safra sits on this spectrum.

No. of scientists

200 400 600 800

30–31 D-Index 131+

This scientist: 39 D-Index — 33rd percentile

33% of scientists in this discipline score the same or lower.

The last bar groups every scientist with 131 D-Index or more.

View D-Index distribution as a table

Number of Computer Science scientists by D-index, Research.com 2026 ranking edition. Based on 14,188 ranked scientists.
D-Index	Scientists	This scientist
30–31	879
32–33	983
34–35	918
36–37	990
38–39	968	39
40–41	907
42–43	821
44–45	763
46–47	689
48–49	543
50–51	543
52–53	518
54–55	500
56–57	458
58–59	400
60–61	337
62–63	308
64–65	292
66–67	249
68–69	213
70–71	192
72–73	189
74–75	165
76–77	139
78–79	119
80–81	121
82–83	113
84–85	88
86–87	87
88–89	75
90–91	69
92–93	57
94–95	46
96–97	38
98–99	34
100–101	36
102–103	27
104–105	37
106–107	18
108–109	31
110–111	19
112–113	16
114–115	12
116–117	20
118–119	15
120–121	5
122–123	20
124–125	8
126–127	5
128–129	7
130	3
131+	98

Download as CSV

Best Publications

Probabilistic checking of proofs: a new characterization of NP

Sanjeev Arora;Shmuel Safra

2016
Citations
A sub-constant error-probability low-degree test, and a sub-constant error-probability PCP characterization of NP

Ran Raz;Shmuel Safra

1089
Citations
Approximating clique is almost NP-complete

U. Feige;S. Goldwasser;L. Lovasz;S. Safra

597
Citations
Interactive proofs and the hardness of approximating cliques

Uriel Feige;Shafi Goldwasser;Laszlo Lovász;Shmuel Safra

566
Citations
On the complexity of omega -automata

Unknown

508
Citations
On Data Structures and Asymmetric Communication Complexity

Peter Bro Miltersen;Noam Nisan;Shmuel Safra;Avi Wigderson

390
Citations
Algorithmic construction of sets for k-restrictions

Noga Alon;Dana Moshkovitz;Shmuel Safra

353
Citations
The importance of being biased

Irit Dinur;Shmuel Safra

321
Citations
Approximating CVP to Within Almost-Polynomial Factors is NP-Hard

I. Dinur;G. Kindler;R. Raz;S. Safra

293
Citations
Inapproximability of Vertex Cover and Independent Set in Bounded Degree Graphs

Per Austrin;Subhash Khot;Muli Safra

234
Citations
Probabilistic checking of proofs; a new characterization of NP

S. Arora;S. Safra

230
Citations
On the complexity of approximating k -set packing

Elad Hazan;Shmuel Safra;Oded Schwartz

213
Citations
On the complexity of equilibria

Xiaotie Deng;Christos Papadimitriou;Shmuel Safra

207
Citations
Approximating shortest lattice vectors is not harder than approximating closet lattice vectors

O. Goldreich;D. Micciancio;S. Safra;J. P. Seifert

207
Citations
On the hardness of approximating the chromatic number

S. Khanna;N. Linial;S. Safra

200
Citations
Pseudorandom Sets in Grassmann Graph Have Near-Perfect Expansion

Unknown

165
Citations
Proving hard-core predicates using list decoding

A. Akavia;S. Goldwasser;S. Safra

148
Citations
Testing juntas

Eldar Fischer;Guy Kindler;Dana Ron;Shmuel Safra

141
Citations
Extractors from Reed-Muller codes

Amnon Ta-Shma;David Zuckerman;Shmuel Safra

135
Citations
Inapproximability of Vertex Cover and Independent Set in Bounded Degree Graphs

Per Austrin;Subhash Khot;Muli Safra

113
Citations