N. Littlestone

3.1k total citations · 1 hit paper
13 papers, 1.7k citations indexed

About

N. Littlestone is a scholar working on Artificial Intelligence, Computer Networks and Communications and Management Science and Operations Research. According to data from OpenAlex, N. Littlestone has authored 13 papers receiving a total of 1.7k indexed citations (citations by other indexed papers that have themselves been cited), including 13 papers in Artificial Intelligence, 5 papers in Computer Networks and Communications and 3 papers in Management Science and Operations Research. Recurrent topics in N. Littlestone's work include Machine Learning and Algorithms (13 papers), Optimization and Search Problems (5 papers) and Machine Learning and Data Classification (5 papers). N. Littlestone is often cited by papers focused on Machine Learning and Algorithms (13 papers), Optimization and Search Problems (5 papers) and Machine Learning and Data Classification (5 papers). N. Littlestone collaborates with scholars based in United States, Austria and Singapore. N. Littlestone's co-authors include Manfred K. Warmuth, David Haussler, Philip M. Long, David P. Helmbold, Lisa Hellerstein and Avrim Blum and has published in prestigious journals such as Journal of Computer and System Sciences, Information and Computation and Computational Complexity.

In The Last Decade

N. Littlestone

12 papers receiving 1.5k citations

Hit Papers

align trajectories

What are hit papers?

Hit papers significantly outperform the citation benchmark for their cohort. A paper qualifies if it has ≥500 total citations, achieves ≥1.5× the top-1% citation threshold for papers in the same subfield and year (this is the minimum needed to enter the top 1%, not the average within it), or reaches the top citation threshold in at least one of its specific research topics.

The Weighted Majority Algorithm

1994 1.1k citations N. Littlestone, Manfred K. Warmuth Information and Computation profile →

Peers — A (Enhanced Table)

Peers by citation overlap · career bar shows stage (early→late) cites · hero ref

Name	h						Papers	Cites
N. Littlestone United States	10	1.2k	658	372	224	128	13	1.7k
Maria-Florina Balcan United States	23	1.0k 0.8×	458 0.7×	277 0.7×	210 0.9×	271 2.1×	86	1.6k
Alexander Rakhlin United States	21	896 0.7×	615 0.9×	277 0.7×	91 0.4×	121 0.9×	61	1.3k
Nick Littlestone United States	12	1.6k 1.3×	295 0.4×	262 0.7×	412 1.8×	223 1.7×	16	1.8k
Claudio Gentile Italy	20	1.4k 1.1×	630 1.0×	228 0.6×	75 0.3×	306 2.4×	66	1.8k
Alexander L. Strehl United States	20	1.3k 1.1×	345 0.5×	179 0.5×	209 0.9×	318 2.5×	28	1.8k
Alekh Agarwal United States	21	1.0k 0.8×	419 0.6×	366 1.0×	85 0.4×	248 1.9×	61	1.5k
Alina Beygelzimer United States	14	841 0.7×	165 0.3×	289 0.8×	92 0.4×	342 2.7×	36	1.4k
Philip Laird United States	10	1.0k 0.8×	270 0.4×	618 1.7×	237 1.1×	137 1.1×	21	1.5k
Ofer Dekel United States	22	2.1k 1.7×	541 0.8×	345 0.9×	93 0.4×	577 4.5×	40	2.7k
Dimitris K. Tasoulis Greece	17	1.1k 0.9×	144 0.2×	143 0.4×	409 1.8×	88 0.7×	53	1.5k

Countries citing papers authored by N. Littlestone

Since Specialization

Citations

This map shows the geographic impact of N. Littlestone'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 N. Littlestone with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites N. Littlestone more than expected).

Fields of papers citing papers by N. Littlestone

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by N. Littlestone. 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 N. Littlestone. The network helps show where N. Littlestone may publish in the future.

Co-authorship network of co-authors of N. Littlestone

This figure shows the co-authorship network connecting the top 25 collaborators of N. Littlestone. A scholar is included among the top collaborators of N. Littlestone based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with N. Littlestone. N. Littlestone is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

Sort: Min cites: Since: Top N: Style:

13 of 13 papers shown

1.

Helmbold, David P., N. Littlestone, & Philip M. Long. (2000). Apple tasting. Information and Computation. 161(2). 85–139. 25 indexed citations

2.

Helmbold, David P., N. Littlestone, & Philip M. Long. (2000). On-line learning with linear loss constraints. Information and Computation. 161(2). 140–171. 3 indexed citations

3.

Blum, Avrim, Lisa Hellerstein, & N. Littlestone. (1995). Learning in the Presence of Finitely or Infinitely Many Irrelevant Attributes. Journal of Computer and System Sciences. 50(1). 32–40. 36 indexed citations

4.

Littlestone, N., Manfred K. Warmuth, & Philip M. Long. (1995). On-line learning of linear functions. Computational Complexity. 5(1). 1–23. 25 indexed citations

5.

Haussler, David, N. Littlestone, & Manfred K. Warmuth. (1994). Predicting {0, 1}-Functions on Randomly Drawn Points. Information and Computation. 115(2). 248–292. 84 indexed citations

6.

Littlestone, N. & Manfred K. Warmuth. (1994). The Weighted Majority Algorithm. Information and Computation. 108(2). 212–261. 1065 indexed citations breakdown →

7.

Littlestone, N. & Philip M. Long. (1993). On-line learning with linear loss constraints. 412–421. 2 indexed citations

8.

Helmbold, David P., N. Littlestone, & Philip M. Long. (1992). Apple tasting and nearly one-sided learning. 493–502. 16 indexed citations

9.

Littlestone, N., Philip M. Long, & Manfred K. Warmuth. (1991). On-line learning of linear functions. 465–475. 28 indexed citations

10.

Littlestone, N.. (1990). Mistake bounds and logarithmic linear-threshold learning algorithms. 128 indexed citations

11.

Littlestone, N. & Manfred K. Warmuth. (1989). The weighted majority algorithm. 256–261. 184 indexed citations

12.

Haussler, David, N. Littlestone, & Manfred K. Warmuth. (1988). Predicting {0,1}-functions on randomly drawn points. Conference on Learning Theory. 280–296. 2 indexed citations

13.

Haussler, David, N. Littlestone, & Manfred K. Warmuth. (1988). Predicting (0, 1)-functions on randomly drawn points. 100–109. 63 indexed citations

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