default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDGregory J. E. Rawlins
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Books and Theses
- 1992
[b1]Gregory J. E. Rawlins:
Compared to what? - an introduction to the analysis of algorithms. Principles of computer science series, Computer Science Press 1992, ISBN 978-0-7167-8243-8, pp. I-XXVI, 1-536
Journal Articles
- 2010
- [j7]Gregory J. E. Rawlins:
Glut: Mastering Information Through the Ages. J. Assoc. Inf. Sci. Technol. 61(1): 207 (2010) - 1998
- [j6]Phillip G. Bradford, Gregory J. E. Rawlins, Gregory E. Shannon:
Efficient Matrix Chain Ordering in Polylog Time. SIAM J. Comput. 27(2): 466-490 (1998) - 1993
- [j5]Ricardo A. Baeza-Yates
, Joseph C. Culberson, Gregory J. E. Rawlins:
Searching in the Plane. Inf. Comput. 106(2): 234-252 (1993) - [j4]Gregory J. E. Rawlins:
Publishing Over the Next Decade. J. Am. Soc. Inf. Sci. 44(8): 474-479 (1993) - 1991
- [j3]Gregory J. E. Rawlins, Derick Wood:
Restricted-oriented convex sets. Inf. Sci. 54(3): 263-281 (1991) - 1988
- [j2]Gregory J. E. Rawlins, Peter Widmayer, Derick Wood:
Hole Problems for Rectangles in the Plane. SIAM J. Discret. Math. 1(1): 86-97 (1988) - 1987
- [j1]Gregory J. E. Rawlins, Derick Wood:
Optimal Computation of Finitely Oriented Convex Hulls. Inf. Comput. 72(2): 150-166 (1987)
Conference and Workshop Papers
- 2000
- [c10]Ricardo A. Baeza-Yates, Terry Jones, Gregory J. E. Rawlins:
New Approaches to Information Management: Attribute-Centric Data Systems (invited paper). SPIRE 2000: 17-27 - 1995
- [c9]Phillip G. Bradford, Venkatesh Choppella, Gregory J. E. Rawlins:
Lower Bounds for the Matrix Chain Ordering Problem (Extended bstract). LATIN 1995: 112-130 - 1994
- [c8]Phillip G. Bradford, Gregory J. E. Rawlins, Gregory E. Shannon:
Efficient Matrix Chain Ordering in Polylog Time. IPPS 1994: 234-241 - 1993
- [c7]Terry Jones, Gregory J. E. Rawlins:
Reverse HillclimbingGenetic Algorithms and the Busy Beaver Problem. ICGA 1993: 70-75 - [c6]Sushil J. Louis, Gregory J. E. Rawlins:
Pareto OptimalityGA-Easiness and Deception (Extended Abstract). ICGA 1993: 118-123 - 1992
- [c5]Sushil J. Louis, Gregory J. E. Rawlins:
Syntactic Analysis of Convergence in Genetic Algorithms. FOGA 1992: 141-151 - 1991
- [c4]Sven Schuierer, Gregory J. E. Rawlins, Derick Wood:
A Generalization of Staircase Visibility. Workshop on Computational Geometry 1991: 277-287 - [c3]Sushil J. Louis, Gregory J. E. Rawlins:
Designer Genetic Algorithms: Genetic Algorithms in Structure Design. ICGA 1991: 53-60 - 1988
- [c2]Ricardo A. Baeza-Yates, Joseph C. Culberson, Gregory J. E. Rawlins:
Searching with Uncertainty (Extended Abstract). SWAT 1988: 176-189 - 1985
- [c1]Joseph C. Culberson, Gregory J. E. Rawlins:
Turtlegons: generating simple polygons for sequences of angles. SCG 1985: 305-310
Editorship
- 1991
- [e1]Gregory J. E. Rawlins:
Proceedings of the First Workshop on Foundations of Genetic Algorithms. Bloomington Campus, Indiana, USA, July 15-18 1990. Morgan Kaufmann 1991, ISBN 978-1-55860-170-3 [contents]
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 22:51 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
