Skip to search formSkip to main content>Semantic Scholar Semantic Scholar's Logo

Search

You are currently offline. Some features of the site may not work correctly.

Semantic Scholar uses AI to extract papers important to this topic.

Highly Cited

2010

Highly Cited

2010

Preface to the Third Edition List of Abbreviations 1 Introduction 1.1 Automatic Identification Systems 1.2 A Comparison of… Expand

Highly Cited

2008

Highly Cited

2008

We use the Islamic holy month of Ramadan as a natural experiment in fasting and fetal health. In Michigan births 1989-2006, we… Expand

Highly Cited

2003

Highly Cited

2003

One of the challenges in 3D shape matching arises from the fact that in many applications, models should be considered to be the… Expand

Highly Cited

1997

Highly Cited

1997

COMBINATORIAL AND DISCRETE GEOMETRY Finite Point Configurations, J. Pach Packing and Covering, G. Fejes Toth Tilings, D… Expand

Highly Cited

1996

Highly Cited

1996

nursing students? J Nurs Educ. 2004;43(7):305-312. [PMID: 15303583] 2. Figley CR, ed. Compassion Fatigue: Coping With Secondary… Expand

Highly Cited

1989

Highly Cited

1989

We develop a representation for the topological structure of subdivided manifolds (with and without boundary) of dimension… Expand

Highly Cited

1983

Highly Cited

1983

A topological method is given for obtaining lower bounds for the height of algebraic computation trees, and algebraic decision… Expand

Highly Cited

1982

Highly Cited

1982

Let P be a simple polygon with N vertices, each being assigned a weight ∈ {0,1}, and let C, the weight of P, be the added weight… Expand

Highly Cited

1982

Highly Cited

1982

A topological method is given for obtaining lower bounds for the height of algebraic decision trees. The method is applied to the… Expand

1979

1979

The objective of this note is to show that the problem of recognizing whether or not two graphs are isomorphic and the problem of… Expand