Gregory J. E. Rawlins

According to our database1, Gregory J. E. Rawlins authored at least 17 papers between 1985 and 2010.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2010
Glut: Mastering Information Through the Ages.
J. Assoc. Inf. Sci. Technol., 2010

2000
New Approaches to Information Management: Attribute-Centric Data Systems (invited paper).
Proceedings of the Seventh International Symposium on String Processing and Information Retrieval, 2000

1998
Efficient Matrix Chain Ordering in Polylog Time.
SIAM J. Comput., 1998

1995
Lower Bounds for the Matrix Chain Ordering Problem (Extended bstract).
Proceedings of the LATIN '95: Theoretical Informatics, 1995

1993
Searching in the Plane
Inf. Comput., October, 1993

Publishing Over the Next Decade.
J. Am. Soc. Inf. Sci., 1993

Pareto OptimalityGA-Easiness and Deception (Extended Abstract).
Proceedings of the 5th International Conference on Genetic Algorithms, 1993

Reverse HillclimbingGenetic Algorithms and the Busy Beaver Problem.
Proceedings of the 5th International Conference on Genetic Algorithms, 1993

1992
Syntactic Analysis of Convergence in Genetic Algorithms.
Proceedings of the Second Workshop on Foundations of Genetic Algorithms. Vail, 1992

Compared to what? - an introduction to the analysis of algorithms.
Principles of computer science series, Computer Science Press, ISBN: 978-0-7167-8243-8, 1992

1991
Restricted-oriented convex sets.
Inf. Sci., 1991

Designer Genetic Algorithms: Genetic Algorithms in Structure Design.
Proceedings of the 4th International Conference on Genetic Algorithms, 1991

A Generalization of Staircase Visibility.
Proceedings of the Computational Geometry, 1991

1988
Hole Problems for Rectangles in the Plane.
SIAM J. Discret. Math., 1988

Searching with Uncertainty (Extended Abstract).
Proceedings of the SWAT 88, 1988

1987
Optimal Computation of Finitely Oriented Convex Hulls
Inf. Comput., February, 1987

1985
Turtlegons: generating simple polygons for sequences of angles.
Proceedings of the First Annual Symposium on Computational Geometry, 1985


  Loading...