#### Filter Results:

- Full text PDF available (12)

#### Publication Year

1946

2013

- This year (0)
- Last 5 years (1)
- Last 10 years (6)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

- Marcin Kik, Miroslaw Kutylowski, Grzegorz Stachowiak
- STACS
- 1994

Comparator networks of constant depth can be used for sorting in the following way. The computation consists of a number of iterations, say t, each iteration being a single run through the comparator network. The output of a round j (j < t) is used as the input for the round j + 1. The output of the round t is the output of the computation. In such a way,â€¦ (More)

- Christina E. M. Voorter, Marcin Kik, Ella P M van den Berg-Loonen
- Tissue antigens
- 1998

The ideal high-resolution typing strategy for polymorphic genes is sequence-based typing. SBT of genomic DNA has been developed for the HLA class II genes DRB1, DRB3/4/5 and DPB1. For the DQB1 gene the sequence-based typing method was shown to cause a number of problems. To resolve those problems, different primers to amplify and sequence exon 2 of DQB1â€¦ (More)

- Marcin Kik
- Euro-Par
- 2000

- Marcin Kik
- ArXiv
- 2011

We propose a protocol (called RBO) for broadcasting long streams of single-packet messages over radio channel for tiny, battery powered, receivers. The messages are labeled by the keys from some linearly ordered set. The sender repeatedly broadcasts a sequence of many (possibly millions) of messages, while each receiver is interested in reception of aâ€¦ (More)

- Marcin Kik
- ArXiv
- 2012

This report contains revision and extension of some results about RBO from [14]. RBO is a simple and efficient broadcast scheduling of n = 2 uniform frames for battery powered radio receivers. Each frame contains a key from some arbitrary linearly ordered universe. The broadcast cycle â€“ a sequence of frames sorted by the keys and permuted by k-bit reversalâ€¦ (More)

- Marcin Kik
- MFCS
- 2006

- Marcin Kik
- 1997

Suppose that there is a sorted sequence and at most k elements change their values, for some k n. We present a comparator network of depth 4 log n + O((log k log log n) 2) that makes the sequence sorted again.

- Marcin Kik, Miroslaw Kutylowski, Marek PiotrÃ³w
- ICPP
- 1999

We consider the problem of sorting sequences obtained from a sorted sequence of n keys by changing the values of at most k keys at some unknown positions. Since even for k = 1 a lower bound Î©(logn) on the number of parallel comparison steps applies, any comparator network solving this problem cannot be asymptotically faster than the AKS sorting network. Weâ€¦ (More)

- Marcin Kik
- FCT
- 2009

By k-disturbed sequence we mean a sequence obtained from a sorted sequence by changing the values of at most k elements. We present an algorithm for single-hop radio networks that sorts a k-disturbed sequence of length n (where each station stores single key) in time 4n+ k Â· (âŒˆlg kâŒ‰+âŒˆlg(nâˆ’k+1)âŒ‰+6âŒˆlg kâŒ‰)âˆ’2 with energetic cost 3Â·âŒˆ (âŒˆlg kâŒ‰+1)(âŒˆlg kâŒ‰+2) 2âŒŠn/kâŒ‹â€¦ (More)

- BY MARGARZT, F R Smith, Marcin Kik
- 2003

Most of the methods described in t,he literature for the determination of fatty acids require much larger amounts of blood than could be supplied by small experimental animals without injuring them for chemical investigabion. The gravimetric method (1) by which lipid constituents are isolated and weighed is tedious, and the large amount of blood which isâ€¦ (More)