Growing community of inventors

Berkeley, CA, United States of America

Christopher Robert Harrelson

Average Co-Inventor Count = 3.60

ph-index = 5

The patent ph-index is calculated by counting the number of publications for which an author has been cited by other authors at least that same number of times.

Forward Citations = 181

Christopher Robert HarrelsonMatthew Robert Simpson (7 patents)Christopher Robert HarrelsonWillem Van Lancker (7 patents)Christopher Robert HarrelsonAmanda Marie Leicht Moore (6 patents)Christopher Robert HarrelsonEvan Hardesty Parker (1 patent)Christopher Robert HarrelsonAndrew V Goldberg (1 patent)Christopher Robert HarrelsonAmanda Marie Leicht (1 patent)Christopher Robert HarrelsonJoshua Harrison (1 patent)Christopher Robert HarrelsonPablo Rademacher (1 patent)Christopher Robert HarrelsonChristopher Robert Harrelson (9 patents)Matthew Robert SimpsonMatthew Robert Simpson (31 patents)Willem Van LanckerWillem Van Lancker (15 patents)Amanda Marie Leicht MooreAmanda Marie Leicht Moore (6 patents)Evan Hardesty ParkerEvan Hardesty Parker (23 patents)Andrew V GoldbergAndrew V Goldberg (17 patents)Amanda Marie LeichtAmanda Marie Leicht (3 patents)Joshua HarrisonJoshua Harrison (1 patent)Pablo RademacherPablo Rademacher (1 patent)
..
Inventor’s number of patents
..
Strength of working relationships

Company Filing History:

1. Google Inc. (8 from 32,429 patents)

2. Microsoft Technology Licensing, LLC (1 from 54,638 patents)


9 patents:

1. 10921969 - Interface for navigating imagery

2. 10719212 - Interface for navigation imagery

3. 10338791 - Interface for navigating imagery

4. D806748 - Portion of a display panel with a graphical user interface for navigating imagery

5. D806749 - Portion of a display panel with a graphical user interface for navigating imagery

6. D806750 - Portion of a display panel with a transitional graphical user interface for navigating imagery

7. 9569066 - Interface for navigating imagery

8. 8656020 - Delta compression of files in web applications

9. 7603229 - Efficiently finding shortest paths using landmarks for computing lower-bound distance estimates

Please report any incorrect information to support@idiyas.com
idiyas.com
as of
12/3/2025
Loading…