Science Explorer Back to mapMap

Most cited papers from On Time Systems (United States)

What are the most cited papers from On Time Systems (United States)?

The most cited paper from On Time Systems (United States) is "Generalizing Boolean satisfiability I: Background and survey of existing work" (Heidi E. Dixon, Matthew L. Ginsberg, Andrew J. Parkes, 2004), with 44 citations. Next come "A psychological typology and its relationship to entrepreneurial success" (40) and "An effective algorithm for project scheduling with arbitrary temporal constraints" (26).

Showing 22 of 22 papers. Every paper is listed.

Most cited papers, sortable by citations and release date
#Paper
1 Generalizing Boolean satisfiability I: Background and survey of existing work Heidi E. Dixon, Matthew L. Ginsberg, Andrew J. Parkes 2004 44
2 A psychological typology and its relationship to entrepreneurial success John B. Miner · Entrepreneurship and Regional Development 1997 40
3 An effective algorithm for project scheduling with arbitrary temporal constraints Tristan B. Smith, John M. Pyle 25 Jul 2004 26
4 Generalizing Boolean Satisfiability II: Theory H. E. Dixon, Matthew L. Ginsberg, Eugene M. Luks et al. · Journal of Artificial Intelligence Research Open access Dec 2004 24
5 Green Driver: AI in a Microcosm J. Apple, P Chang, Aran Clauson et al. · Proceedings of the AAAI Conference on Artificial Intelligence Conference paperOpen access 4 Aug 2011 22
6 Generalizing Boolean Satisfiability I: Background and Survey of Existing Work H. E. Dixon, M. L. Ginsberg, A. J. Parkes · Journal of Artificial Intelligence Research Open access Feb 2004 19
7 Development and Validation of the Occupational Self-Assessment–Short Form (OSA–SF) Evguenia S. Popova, Rikki K. Ostrowski, Jennifer J. Wescott et al. · American Journal of Occupational Therapy 26 Apr 2019 17
8 Dr.Fill: Crosswords and an Implemented Solver for Singly Weighted CSPs Matthew L. Ginsberg · arXiv (Cornell University) PreprintOpen access 18 Jan 2014 17
9 Generalizing Boolean Satisfiability III: Implementation H. E. Dixon, Matthew L. Ginsberg, Daniel Hofer et al. · Journal of Artificial Intelligence Research Open access Apr 2005 15
10 Relativisticaly Consistent Faster-than-Light (FTL) Communication Using Self-Referential Quantum States Allan Goff, Dale Lehmann, Joel G. Siegel Conference paper 7 Jul 2002 11
11 Quantum Tic-Tac-Toe, Spooky-Coins & Magic-Envelopes, as Metaphors for Relativistic Quantum Physics Allan Goff, Dale Lehmann, Joel G. Siegel Conference paper 7 Jul 2002 10
12 The complexity of optimal planning and a more efficient method for finding solutions Katrina J. Ray, Matthew L. Ginsberg 14 Sep 2008 9
13 Implementing a generalized version of resolution H. E. Dixon, Matthew L. Ginsberg, David K. Hofer et al. 25 Jul 2004 7
14 Stochastic Shipyard Simulation with Simyard Oliver Dain, Matthew L. Ginsberg, Erin Keenan et al. Conference paper Dec 2006 6
15 Life Cycle Climate Performance of MAC Systems in Battery Electric Vehicles James Carow, Dennis Nasuta, Michael Lippy · SAE technical papers on CD-ROM/SAE technical paper series Conference paper 11 Apr 2023 3
16 Exponentially Many Hadamard Designs Eric Merchant · Designs Codes and Cryptography 13 Jan 2006 3
17 Expression of Concern: Total ammonia aeration control (TAAC) theory – An innovative ammonia-based aeration controller Gregory Budzynski · AQUA - Water Infrastructure Ecosystems and Society Open access 16 Feb 2024 2
18 Structure and automorphism groups of Hadamard designs Eric Merchant · Journal of Algebraic Combinatorics Open access 10 Jul 2006 1
19 In situ binding: a modal analysis Michael Moortgat · Proceedings of the Amsterdam Colloquium Open access Dec 1995 0
20 Derecho a la educación e interculturalidad. La lucha por la educación en la sierra ecuatoriana: SEEIC y Jatari Unancha Adrián Rodríguez Brochado · Voces y Silencios Revista Latinoamericana de Educación Open access Aug 2020 0
21 Satsisfiability and Systematicity Matthew L. Ginsberg · Journal of Artificial Intelligence Research Open access 30 Jul 2015 0
22 Of Mousetraps and Men: A Cautionary Tale MATT GINSBERG · Lecture notes in computer science Conference paper 9 Oct 2007 0

Citations are OpenAlex's own counts, from its 2026-09-23 snapshot, so the ranking can differ from Google Scholar or Web of Science. A paper is listed for an institution when any of its authors gave it as an affiliation; retracted papers and papers whose citation count cannot be traced to citing works are left out, and a preprint and the article it became are shown once. Release dates are OpenAlex's: where a source gave only a month or a year, that is what is shown. How the lists are chosen.