Solomon W. Golomb
- Computational Theory and Mathematics top 0.2%
- Cellular Automata and Applications 32
- Artificial Intelligence top 0.2%
- Coding theory and cryptography 53
- Algorithms and Data Compression 8
- Signal Processing top 1%
- Computer Networks and Communications top 0.5%
- Wireless Communication Networks Research 12
-
- graph theory and CDMA systems 53
- Advanced Wireless Communication Techniques 10
-
- DNA and Biological Computing 12
-
- Mathematics and Applications 9
Solomon W. Golomb
153 papers receiving 5.9k citations
Hit Papers
Peers
Comparison fields: 5 of 148
- Computational Theory and Mathematics 1.7k
- Discrete Mathematics and Combinatorics 327
- Artificial Intelligence 2.8k
- Signal Processing 700
- Computer Networks and Communications 1.4k
Countries citing papers authored by Solomon W. Golomb
This map shows the geographic impact of Solomon W. Golomb'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 Solomon W. Golomb with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Solomon W. Golomb more than expected).
Fields of papers citing papers by Solomon W. Golomb
This network shows the impact of papers produced by Solomon W. Golomb. 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 Solomon W. Golomb. The network helps show where Solomon W. Golomb may publish in the future.
Co-authorship network
The 25 scholars most cited alongside Solomon W. Golomb, linked wherever they have co-authored with each other. Click a name or a connecting line to browse the papers they share.
All Works
| # | Work | ||
|---|---|---|---|
| 1 | Sequences, subsequences, and consequences : International workshop, SSC 2007 Los Angeles, CA, USA, May 31-June 2, 2007 : revised invited papers | 2007 | 3 |
| 2 | 2007 | 4 | |
| 3 | On the Classification of Cyclic Hadamard Sequences( Sequence Design and its Application in Communications) | 2006 | 1 |
| 4 | 2002 | 4 | |
| 5 | 2000 | 2 | |
| 6 | The Polynomial Model in the Study of Counterexamples to S. Piccard's Theorem. | 1998 | 1 |
| 7 | 1989 | 0 | |
| 8 | Optical disk error correction | 1986 | 5 |
| 9 | Rubik's Cube and Quarks | 1982 | 2 |
| 10 | 1980 | 9 | |
| 11 | Faculty Consulting: Should It Be Curtailed?. | 1979 | 3 |
| 12 | 1973 | 4 | |
| 13 | 1970 | 40 | |
| 14 | 1970 | 5 | |
| 15 | 1970 | 18 | |
| 16 | 1968 | 1 | |
| 17 | Run-length encodings.breakdown → | 1966 | 485 |
| 18 | 1966 | 7 | |
| 19 | 1965 | 0 | |
| 20 | 1964 | 35 |
About Solomon W. Golomb
Solomon W. Golomb is a scholar working on Theoretical Computer Science, Discrete Mathematics and Combinatorics and Computational Theory and Mathematics, having authored 166 papers that have together received 6.5k indexed citations. Recurring topics across this work include Coding theory and cryptography (53 papers), graph theory and CDMA systems (53 papers), Cellular Automata and Applications (32 papers), Wireless Communication Networks Research (12 papers), DNA and Biological Computing (12 papers), Advanced Wireless Communication Techniques (10 papers), Mathematics and Applications (9 papers) and Algorithms and Data Compression (8 papers). The work is most often cited by research in Computational Theory and Mathematics (1.7k citations), Discrete Mathematics and Combinatorics (327 citations) and Artificial Intelligence (2.8k citations). Solomon W. Golomb has collaborated with scholars based in United States, Canada and South Korea. Frequent co-authors include Guang Gong, Branko Grünbaum, L. D. Baumert, Herbert Taylor, Gary S. Bloom, R.A. Scholtz, L. R. Welch, Heekwan Lee, Basil Gordon and Hong‐Yeop Song. Their work appears in journals such as Nature, Science and Physics Today.
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.