#### Filter Results:

- Full text PDF available (24)

#### Publication Year

1975

2016

- This year (0)
- Last five years (10)

#### Publication Type

#### Co-author

#### Publication Venue

#### Key Phrases

Learn More

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

- George Markowsky
- 2006

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

- George Markowsky
- 1999

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

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)

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

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

- Zeev Barzilai, Jacob Savir, George Markowsky, Merlin G. Smith
- IEEE Trans. Computers
- 1981

- 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)