#### Filter Results:

- Full text PDF available (22)

#### Publication Year

1975

2016

- This year (0)
- Last 5 years (11)
- Last 10 years (25)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Lawrence T. Kou, George Markowsky, Leonard Berman
- Acta Informatica
- 1981

Given an undirected distance graph G=(V, E, d) and a set S, where V is the set of vertices in G, E is the set of edges in G, d is a distance function which maps E into the set of nonnegative numbers and S⊑V is a subset of the vertices of V, the Steiner tree problem is to find a tree of G that spans S with minimal total distance on its edges. In this paper,… (More)

- George Markowsky
- 2006

Let a poset P be called chain-complete when every chain, including the empty chain, has a sup in P. Many authors have investigated properties of posets satisfying some sort of chain-completeness condition (see [,11, [-31, [6], I-71, [17], [,181, ['191, [,211, [,221), and used them in a variety of applications. In this paper we study the notion of… (More)

In this paper we consider the question of how much space is needed to represent a set. Given a finite universe U and some subset V (called the vocabulary), an <underline>exact membership tester</underline> is a procedure that for each element s in U determines if s is in V. An <underline>approximate membership tester</underline> is allowed to make mistakes:… (More)

- Lawrence T. Kou, George Markowsky
- IBM Journal of Research and Development
- 1977

- Ashok K. Chandra, George Markowsky
- Discrete Mathematics
- 1978

- Ashok K. Chandra, Lawrence T. Kou, George Markowsky, Shmuel Zaks
- Acta Informatica
- 1983

Given a set, S, of Boolean n-vectors, one can choose k of the n coordinate positions and consider the set of k-vectors which results by keeping only the designated k positions of each vector, i.e., from k-projecting S. In this paper, we study the question of finding sets S as small as possible such that every k-projection of S yields all the 2 k possible… (More)

- Alfredo De Santis, George Markowsky, Mark N. Wegman
- COLT
- 1988

- George Markowsky, Barry K. Rosen
- 16th Annual Symposium on Foundations of Computer…
- 1975

Given partially ordered sets (posets) P and Q, it is often useful to construct maps g:P→Q which are chain-continuous: least upper bounds (supremums) of nonempty linearly ordered subsets are preserved. Chaincontinuity is analogous to topological continuity and is generally much more difficult to verify than isotonicity: the preservation of the order… (More)

- George Markowsky, Larry Carter, Mark N. Wegman
- MFCS
- 1978

- H. Raymond Strong, George Markowsky, Ashok K. Chandra
- J. ACM
- 1979

Three famdies of strategies for orgamzmg an index of ordered keys are investigated It ~s assumed either that the index is small enough to fit m mam memory or that some superstrategy orgamzes the index into pages and that search within a page is being studied Examples of strategies within the three families are B-tree Search, Binary Search, and Square Root… (More)