The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Krzysztof Diks: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Krzysztof Diks, Andrzej Pelc
    Fault-Tolerant Linear Broadcasting. [Citation Graph (0, 0)][DBLP]
    Canada-France Conference on Parallel and Distributed Computing, 1994, pp:207-217 [Conf]
  2. Krzysztof Diks, Evangelos Kranakis, Danny Krizanc, Andrzej Pelc
    The Impact of Knowledge on Broadcasting Time in Radio Networks. [Citation Graph (0, 0)][DBLP]
    ESA, 1999, pp:41-52 [Conf]
  3. Krzysztof Diks, Andrzej Pelc
    Optimal Adaptive Broadcasting with a Bounded Fraction of Faulty Nodes (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    ESA, 1997, pp:118-129 [Conf]
  4. Bogdan S. Chlebus, Marek Chrobak, Krzysztof Diks
    Saturating Flows in Networks. [Citation Graph (0, 0)][DBLP]
    FCT, 1987, pp:82-91 [Conf]
  5. Bogdan S. Chlebus, Krzysztof Diks, Torben Hagerup, Tomasz Radzik
    New Simulations between CRCW PRAMs. [Citation Graph (0, 0)][DBLP]
    FCT, 1989, pp:95-104 [Conf]
  6. Bogdan S. Chlebus, Krzysztof Diks, Andrzej Pelc
    Optimal Broadcasting in Faulty Hypercubes. [Citation Graph (0, 0)][DBLP]
    FTCS, 1991, pp:266-273 [Conf]
  7. Bogdan S. Chlebus, Krzysztof Diks, Andrzej Pelc
    Waking up an Anonymous Faulty Network from a Single Source. [Citation Graph (0, 0)][DBLP]
    HICSS (2), 1994, pp:187-193 [Conf]
  8. Krzysztof Diks, Andrzej Pelc
    Broadcasting with universal lists. [Citation Graph (0, 0)][DBLP]
    HICSS (2), 1995, pp:564-573 [Conf]
  9. Bogdan S. Chlebus, Krzysztof Diks, Andrzej Pelc
    Sparse Networks Supporting Efficient Reliable Broadcasting. [Citation Graph (0, 0)][DBLP]
    ICALP, 1993, pp:388-397 [Conf]
  10. Torben Hagerup, Marek Chrobak, Krzysztof Diks
    Parallel 5-Colouring of Planar Graphs. [Citation Graph (0, 0)][DBLP]
    ICALP, 1987, pp:304-313 [Conf]
  11. Krzysztof Diks, Oscar Garrido, Andrzej Lingas
    Parallel Algorithms for Finding Maximal k-Dependent Sets and Maximal f-Matchings. [Citation Graph (0, 0)][DBLP]
    ISA, 1991, pp:385-395 [Conf]
  12. Bogdan S. Chlebus, Krzysztof Diks, Torben Hagerup, Tomasz Radzik
    Efficient Simulations Between Concurrent-Read Concurrent-Write PRAM Models. [Citation Graph (0, 0)][DBLP]
    MFCS, 1988, pp:231-239 [Conf]
  13. Bogdan S. Chlebus, Krzysztof Diks, Tomasz Radzik
    Testing Isomorphism of Outerplanar Graphs in Parallel. [Citation Graph (0, 0)][DBLP]
    MFCS, 1988, pp:220-230 [Conf]
  14. Bogdan S. Chlebus, Krzysztof Diks, Wojciech Rytter, Tomasz Szymacha
    Parallel Complexity of Lexicographically First Order Problems for Tree-Structured Graphs (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    MFCS, 1989, pp:185-195 [Conf]
  15. 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]
  16. Krzysztof Diks
    A Fast Parallel Algorithm for Six-Colouring of Planar Graphs (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    MFCS, 1986, pp:273-282 [Conf]
  17. Krzysztof Diks, Hristo Djidjev, Ondrej Sýkora, Imrich Vrto
    Edge Separators for Planar Graphs and Their Applications. [Citation Graph (0, 0)][DBLP]
    MFCS, 1988, pp:280-290 [Conf]
  18. Krzysztof Diks, Torben Hagerup, Wojciech Rytter
    Optimal Parallel Algorithms For The Recognition And Colouring Outerplanar Graphs (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    MFCS, 1989, pp:207-217 [Conf]
  19. Krzysztof Diks, Wojciech Rytter
    Optimal Parallel Computations for Halin Graphs. [Citation Graph (0, 0)][DBLP]
    Optimal Algorithms, 1989, pp:266-273 [Conf]
  20. Krzysztof Diks
    Parallel Recognition of Outerplanar Graphs. [Citation Graph (0, 0)][DBLP]
    Parallel Algorithms and Architectures, 1987, pp:105-113 [Conf]
  21. Krzysztof Diks, Evangelos Kranakis, A. Malinowsky, Andrzej Pelc
    The Buffer Potential of a Network. [Citation Graph (0, 0)][DBLP]
    SIROCCO, 1994, pp:149-150 [Conf]
  22. Krzysztof Diks, Andrzej Lingas, Andrzej Pelc
    An Optimal Algorithm for Broadcasting Multiple Messages in Trees. [Citation Graph (0, 0)][DBLP]
    SIROCCO, 1997, pp:69-80 [Conf]
  23. Krzysztof Diks, Pierre Fraigniaud, Evangelos Kranakis, Andrzej Pelc
    Tree exploration with little memory. [Citation Graph (0, 0)][DBLP]
    SODA, 2002, pp:588-597 [Conf]
  24. Krzysztof Diks, Andrzej Pelc
    System Diagnosis with Smallest Risk of Error. [Citation Graph (0, 0)][DBLP]
    WG, 1996, pp:141-150 [Conf]
  25. Krzysztof Diks, Lukasz Kowalik, Maciej Kurowski
    A New 3-Color Criterion for Planar Graphs. [Citation Graph (0, 0)][DBLP]
    WG, 2002, pp:138-149 [Conf]
  26. Krzysztof Diks, Torben Hagerup
    More General Parallel Tree Contraction: Register Allocation and Broadcasting in a Tree. [Citation Graph (0, 0)][DBLP]
    WG, 1996, pp:126-140 [Conf]
  27. Bogdan S. Chlebus, Krzysztof Diks, Miroslaw Kowaluk
    O(log log n)-Time Integer Geometry on the CRCW PRAM. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 1995, v:14, n:1, pp:52-69 [Journal]
  28. Krzysztof Diks, Andrzej Pelc
    Optimal Adaptive Broadcasting with a Bounded Fraction of Faulty Nodes. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2000, v:28, n:1, pp:37-50 [Journal]
  29. Bogdan S. Chlebus, Krzysztof Diks, Andrzej Pelc
    Reliable Broadcasting in Hypercubes with Random Link and Node Failures. [Citation Graph (0, 0)][DBLP]
    Combinatorics, Probability & Computing, 1996, v:5, n:, pp:337-350 [Journal]
  30. Bogdan S. Chlebus, Krzysztof Diks, Andrzej Pelc
    Fast gossiping with short unreliable messages. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1994, v:53, n:1-3, pp:15-24 [Journal]
  31. Krzysztof Diks, Evangelos Kranakis, Andrzej Pelc
    Perfect Broadcasting in Unlabeled Networks. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1998, v:87, n:1-3, pp:33-47 [Journal]
  32. Bogdan S. Chlebus, Krzysztof Diks, Andrzej Pelc
    Transition-Optimal Token Distribution. [Citation Graph (0, 0)][DBLP]
    Fundam. Inform., 1997, v:32, n:3-4, pp:313-328 [Journal]
  33. 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]
  34. P. C. P. Bhatt, Krzysztof Diks, Torben Hagerup, V. C. Prasad, Tomasz Radzik, Sanjeev Saxena
    Improved Deterministic Parallel Integer Sorting [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 1991, v:94, n:1, pp:29-47 [Journal]
  35. Krzysztof Diks, Oscar Garrido, Andrzej Lingas
    Parallel Algorithms for Finding Maximal k-Dependent Sets and Maximal f-Matchings. [Citation Graph (0, 0)][DBLP]
    Int. J. Found. Comput. Sci., 1993, v:4, n:2, pp:179-192 [Journal]
  36. Artur Czumaj, Krzysztof Diks, Teresa M. Przytycka
    Parallel Maximum Independent Set in Convex Bipartite Graphs. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1996, v:59, n:6, pp:289-294 [Journal]
  37. Krzysztof Diks, Stefan Dobrev, Evangelos Kranakis, Andrzej Pelc, Peter Ruzicka
    Broadcasting in Unlabeled Hypercubes with a Linear Number of Messages. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1998, v:66, n:4, pp:181-186 [Journal]
  38. Krzysztof Diks, Evangelos Kranakis, Danny Krizanc, Bernard Mans, Andrzej Pelc
    Optimal Coteries and Voting Schemes. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1994, v:51, n:1, pp:1-6 [Journal]
  39. Krzysztof Diks, Adam Malinowski, Andrzej Pelc
    Token Transfer in a Faulty Network. [Citation Graph (0, 0)][DBLP]
    ITA, 1995, v:29, n:5, pp:383-400 [Journal]
  40. Krzysztof Diks, Andrzej Pelc
    Fast Diagnosis of Multiprocessor Systems with Random Faults. [Citation Graph (0, 0)][DBLP]
    ITA, 1993, v:27, n:5, pp:391-401 [Journal]
  41. Piotr Berman, Krzysztof Diks, Andrzej Pelc
    Reliable Broadcasting in Logarithmic Time with Byzantine Link Failures. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1997, v:22, n:2, pp:199-211 [Journal]
  42. Krzysztof Diks, Hristo Djidjev, Ondrej Sýkora, Imrich Vrto
    Edge Separators of Planar and Outerplanar Graphs with Applications. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1993, v:14, n:2, pp:258-279 [Journal]
  43. Krzysztof Diks, Pierre Fraigniaud, Evangelos Kranakis, Andrzej Pelc
    Tree exploration with little memory. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 2004, v:51, n:1, pp:38-63 [Journal]
  44. Krzysztof Diks, Andrzej Lingas, Andrzej Pelc
    An Optimal Algorithm for Broadcasting Multiple Messages in Trees. [Citation Graph (0, 0)][DBLP]
    J. Parallel Distrib. Comput., 1999, v:59, n:3, pp:465-474 [Journal]
  45. Krzysztof Diks, Andrzej Pelc
    Broadcasting with universal lists. [Citation Graph (0, 0)][DBLP]
    Networks, 1996, v:27, n:3, pp:183-196 [Journal]
  46. Krzysztof Diks, Andrzej Pelc
    Fault-Tolerant Linear Broadcasting. [Citation Graph (0, 0)][DBLP]
    Nord. J. Comput., 1996, v:3, n:2, pp:188-201 [Journal]
  47. Bogdan S. Chlebus, Krzysztof Diks, Andrzej Pelc
    Sparse Networks Supporting Efficient Reliable Broadcasting. [Citation Graph (0, 0)][DBLP]
    Nord. J. Comput., 1994, v:1, n:3, pp:332-345 [Journal]
  48. Krzysztof Diks, Evangelos Kranakis, Andrzej Pelc
    Broadcasting in Unlabeled Tori. [Citation Graph (0, 0)][DBLP]
    Parallel Processing Letters, 1998, v:8, n:2, pp:177-188 [Journal]
  49. Krzysztof Diks, Adam Malinowski, Andrzej Pelc
    Reliable Token Despersal with Random Faults. [Citation Graph (0, 0)][DBLP]
    Parallel Processing Letters, 1994, v:4, n:, pp:417-427 [Journal]
  50. Torben Hagerup, Marek Chrobak, Krzysztof Diks
    Optimal Parallel 5-Colouring of Planar Graphs. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1989, v:18, n:2, pp:288-300 [Journal]
  51. Bogdan S. Chlebus, Krzysztof Diks, Andrzej Pelc
    Sorting on a Mesh-Connected Computer with Delaying Links. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 1994, v:7, n:1, pp:119-132 [Journal]
  52. Krzysztof Diks, Andrzej Pelc
    Almost Safe Gossiping in Bounded Degree Networks. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 1992, v:5, n:3, pp:338-344 [Journal]
  53. Krzysztof Diks, Andrzej Pelc
    Globally Optimal Diagnosis in Systems with Random Faults. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Computers, 1997, v:46, n:2, pp:200-204 [Journal]
  54. Krzysztof Diks
    Embeddings of Binary Trees in Lines. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1985, v:36, n:, pp:319-331 [Journal]
  55. Krzysztof Diks, Torben Hagerup
    More General Parallel Tree Contraction: Register Allocation and Broadcasting in a Tree. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1998, v:203, n:1, pp:3-29 [Journal]
  56. Krzysztof Diks, Evangelos Kranakis, Danny Krizanc, Andrzej Pelc
    The impact of information on broadcasting time in linear radio networks. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2002, v:287, n:2, pp:449-471 [Journal]
  57. Krzysztof Diks, Evangelos Kranakis, Adam Malinowski, Andrzej Pelc
    Anonymous Wireless Rings. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1995, v:145, n:1&2, pp:95-109 [Journal]
  58. Krzysztof Diks, Andrzej Pelc
    Reliable Computations on Faulty EREW PRAM. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1996, v:164, n:1&2, pp:107-122 [Journal]
  59. Krzysztof Diks, Andrzej Pelc
    System Diagnosis with Smallest Risk of Error. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1998, v:203, n:1, pp:163-173 [Journal]
  60. Krzysztof Diks, Wojciech Rytter
    On Optimal Parallel Computations for Sequences of Brackets. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1991, v:87, n:2, pp:251-262 [Journal]
  61. Krzysztof Diks, Piotr Sankowski
    Dynamic Plane Transitive Closure. [Citation Graph (0, 0)][DBLP]
    ESA, 2007, pp:594-604 [Conf]

  62. From Top Coders to Top IT Professionals. [Citation Graph (, )][DBLP]


  63. Perfect Matching for Biconnected Cubic Graphs in O(n log2n) Time. [Citation Graph (, )][DBLP]


Search in 0.424secs, Finished in 0.428secs
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
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002