The SCEAS System
Navigation Menu
Introduction
Collection Based
Clustering
Ranking
Paper Based
Journals
Conferences
DB Status
Statistics
Search

Search the dblp DataBase

Title:
Author:
Marek Piotrów: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Marcin Kik, Miroslaw Kutylowski, Marek Piotrów
    Correction Networks. [Citation Graph (0, 0)][DBLP]
    ICPP, 1999, pp:40-47 [Conf]
  2. Piotr Denejko, Krzysztof Diks, Andrzej Pelc, Marek Piotrów
    Reliable Minimum Finding Comparator Networks. [Citation Graph (0, 0)][DBLP]
    MFCS, 1994, pp:306-315 [Conf]
  3. Marek Piotrów
    On Complexity of Counting. [Citation Graph (0, 0)][DBLP]
    MFCS, 1988, pp:472-482 [Conf]
  4. Marek Piotrów
    Depth Optimal Sorting Networks Resistant to k Passive Faults. [Citation Graph (0, 0)][DBLP]
    SODA, 1996, pp:242-251 [Conf]
  5. Marek Piotrów
    Periodic, random-fault-tolerant correction networks. [Citation Graph (0, 0)][DBLP]
    SPAA, 2001, pp:298-305 [Conf]
  6. Artur Czumaj, Leszek Gasieniec, Marek Piotrów, Wojciech Rytter
    Parallel and Sequential Approximations of Shortest Superstrings. [Citation Graph (0, 0)][DBLP]
    SWAT, 1994, pp:95-106 [Conf]
  7. Piotr Denejko, Krzysztof Diks, Andrzej Pelc, Marek Piotrów
    Reliable Minimum Finding Comparator Networks. [Citation Graph (0, 0)][DBLP]
    Fundam. Inform., 2000, v:42, n:3-4, pp:235-249 [Journal]
  8. Marek Piotrów
    A note on constructing binary heaps with periodic networks. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2002, v:83, n:3, pp:129-134 [Journal]
  9. Artur Czumaj, Leszek Gasieniec, Marek Piotrów, Wojciech Rytter
    Sequential and Parallel Approximation of Shortest Superstrings. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1997, v:23, n:1, pp:74-100 [Journal]
  10. Marek Piotrów
    Depth Optimal Sorting Networks Resistant to k Passive Faults. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2004, v:33, n:6, pp:1484-1512 [Journal]
  11. Maciej Liskiewicz, Krzysztof Lorys, Marek Piotrów
    On Reversal Bounded Alternating Turing Machines. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1987, v:54, n:, pp:331-339 [Journal]
  12. Marek Piotrów
    On the Complexity of Counting in the Polynomial Hierarchy. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1991, v:81, n:1, pp:77-95 [Journal]

Search in 0.002secs, Finished in 0.002secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
Introduction Collection Based Clustering Ranking Paper Based Journals Conferences DB Status Statistics Search
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002