default search action
Krzysztof Diks
Person information
- affiliation: University of Warsaw, Poland
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2019
- [j37]Jurek Czyzowicz, Krzysztof Diks, Jean Moussi, Wojciech Rytter:
Energy-optimal broadcast and exploration in a tree using mobile agents. Theor. Comput. Sci. 795: 362-374 (2019) - 2018
- [c33]Jurek Czyzowicz, Krzysztof Diks, Jean Moussi, Wojciech Rytter:
Broadcast with Energy-Exchanging Mobile Agents Distributed on a Tree. SIROCCO 2018: 209-225 - 2017
- [c32]Jerzy Czyzowicz, Krzysztof Diks, Jean Moussi, Wojciech Rytter:
Energy-Optimal Broadcast in a Tree with Mobile Agents. ALGOSENSORS 2017: 98-113 - 2016
- [c31]Jurek Czyzowicz, Krzysztof Diks, Jean Moussi, Wojciech Rytter:
Communication Problems for Mobile Agents Exchanging Energy. SIROCCO 2016: 275-288 - 2015
- [i1]Jerzy Czyzowicz, Krzysztof Diks, Jean Moussi, Wojciech Rytter:
Algorithms for Communication Problems for Mobile Agents Exchanging Energy. CoRR abs/1511.05987 (2015) - 2010
- [c30]Krzysztof Diks, Piotr Stanczyk:
Perfect Matching for Biconnected Cubic Graphs in O(n log2n) Time. SOFSEM 2010: 321-333
2000 – 2009
- 2008
- [c29]Krzysztof Diks, Jan Madey:
From Top Coders to Top IT Professionals. ISSEP 2008: 31-40 - 2007
- [c28]Krzysztof Diks, Piotr Sankowski:
Dynamic Plane Transitive Closure. ESA 2007: 594-604 - 2006
- [j36]Krzysztof Diks, Stefan Dobrev, Andrzej Pelc:
Exploring Planar Graphs Using Unoriented Maps. J. Interconnect. Networks 7(3): 353-373 (2006) - 2004
- [j35]Krzysztof Diks, Pierre Fraigniaud, Evangelos Kranakis
, Andrzej Pelc:
Tree exploration with little memory. J. Algorithms 51(1): 38-63 (2004) - 2002
- [j34]Krzysztof Diks, Evangelos Kranakis
The impact of information on broadcasting time in linear radio networks. Theor. Comput. Sci. 287(2): 449-471 (2002) - [c27]Krzysztof Diks, Pierre Fraigniaud, Evangelos Kranakis, Andrzej Pelc:
Tree exploration with little memory. SODA 2002: 588-597 - [c26]Krzysztof Diks, Lukasz Kowalik, Maciej Kurowski:
A New 3-Color Criterion for Planar Graphs. WG 2002: 138-149 - [e1]Krzysztof Diks, Wojciech Rytter:
Mathematical Foundations of Computer Science 2002, 27th International Symposium, MFCS 2002, Warsaw, Poland, August 26-30, 2002, Proceedings. Lecture Notes in Computer Science 2420, Springer 2002, ISBN 3-540-44040-2 [contents] - 2000
- [j33]Krzysztof Diks, Andrzej Pelc:
Optimal Adaptive Broadcasting with a Bounded Fraction of Faulty Nodes. Algorithmica 28(1): 37-50 (2000) - [j32]Piotr Denejko, Krzysztof Diks, Andrzej Pelc, Marek Piotrów:
Reliable Minimum Finding Comparator Networks. Fundam. Informaticae 42(3-4): 235-249 (2000)
1990 – 1999
- 1999
- [j31]Krzysztof Diks, Andrzej Lingas, Andrzej Pelc:
An Optimal Algorithm for Broadcasting Multiple Messages in Trees. J. Parallel Distributed Comput. 59(3): 465-474 (1999) - [c25]Krzysztof Diks, Evangelos Kranakis
The Impact of Knowledge on Broadcasting Time in Radio Networks. ESA 1999: 41-52 - 1998
- [j30]Krzysztof Diks, Evangelos Kranakis
Perfect Broadcasting in Unlabeled Networks. Discret. Appl. Math. 87(1-3): 33-47 (1998) - [j29]Krzysztof Diks, Stefan Dobrev, Evangelos Kranakis, Andrzej Pelc, Peter Ruzicka:
Broadcasting in Unlabeled Hypercubes with a Linear Number of Messages. Inf. Process. Lett. 66(4): 181-186 (1998) - [j28]Krzysztof Diks, Evangelos Kranakis, Andrzej Pelc:
Broadcasting in Unlabeled Tori. Parallel Process. Lett. 8(2): 177-188 (1998) - [j27]Krzysztof Diks, Torben Hagerup:
More General Parallel Tree Contraction: Register Allocation and Broadcasting in a Tree. Theor. Comput. Sci. 203(1): 3-29 (1998) - [j26]Krzysztof Diks, Andrzej Pelc:
System Diagnosis with Smallest Risk of Error. Theor. Comput. Sci. 203(1): 163-173 (1998) - 1997
- [j25]Bogdan S. Chlebus, Krzysztof Diks, Andrzej Pelc:
Transition-Optimal Token Distribution. Fundam. Informaticae 32(3-4): 313-328 (1997) - [j24]Piotr Berman, Krzysztof Diks, Andrzej Pelc:
Reliable Broadcasting in Logarithmic Time with Byzantine Link Failures. J. Algorithms 22(2): 199-211 (1997) - [j23]Krzysztof Diks, Andrzej Pelc:
Globally Optimal Diagnosis in Systems with Random Faults. IEEE Trans. Computers 46(2): 200-204 (1997) - [c24]Krzysztof Diks, Andrzej Pelc:
Optimal Adaptive Broadcasting with a Bounded Fraction of Faulty Nodes (Extended Abstract). ESA 1997: 118-129 - [c23]Krzysztof Diks, Andrzej Lingas, Andrzej Pelc:
An Optimal Algorithm for Broadcasting Multiple Messages in Trees. SIROCCO 1997: 69-80 - 1996
- [j22]Bogdan S. Chlebus, Krzysztof Diks, Andrzej Pelc:
Reliable Broadcasting in Hypercubes with Random Link and Node Failures. Comb. Probab. Comput. 5: 337-350 (1996) - [j21]Artur Czumaj, Krzysztof Diks, Teresa M. Przytycka:
Parallel Maximum Independent Set in Convex Bipartite Graphs. Inf. Process. Lett. 59(6): 289-294 (1996) - [j20]Krzysztof Diks, Andrzej Pelc:
Broadcasting with universal lists. Networks 27(3): 183-196 (1996) - [j19]Krzysztof Diks, Andrzej Pelc:
Fault-Tolerant Linear Broadcasting. Nord. J. Comput. 3(2): 188-201 (1996) - [j18]Krzysztof Diks, Andrzej Pelc:
Efficient Gossiping by Packets in Networks with Random Faults. SIAM J. Discret. Math. 9(1): 7-18 (1996) - [j17]Krzysztof Diks, Andrzej Pelc:
Reliable Computations on Faulty EREW PRAM. Theor. Comput. Sci. 164(1&2): 107-122 (1996) - [c22]Krzysztof Diks, Torben Hagerup:
More General Parallel Tree Contraction: Register Allocation and Broadcasting in a Tree. WG 1996: 126-140 - [c21]Krzysztof Diks, Andrzej Pelc:
System Diagnosis with Smallest Risk of Error. WG 1996: 141-150 - 1995
- [j16]Bogdan S. Chlebus, Krzysztof Diks, Miroslaw Kowaluk:
O(log log n)-Time Integer Geometry on the CRCW PRAM. Algorithmica 14(1): 52-69 (1995) - [j15]Krzysztof Diks, Adam Malinowski, Andrzej Pelc:
Token Transfer in a Faulty Network. RAIRO Theor. Informatics Appl. 29(5): 383-400 (1995) - [j14]Krzysztof Diks, Evangelos Kranakis
Anonymous Wireless Rings. Theor. Comput. Sci. 145(1&2): 95-109 (1995) - [c20]Krzysztof Diks, Andrzej Pelc:
Broadcasting with universal lists. HICSS (2) 1995: 564-573 - 1994
- [j13]Bogdan S. Chlebus, Krzysztof Diks, Andrzej Pelc:
Fast gossiping with short unreliable messages. Discret. Appl. Math. 53(1-3): 15-24 (1994) - [j12]Krzysztof Diks, Evangelos Kranakis
Optimal Coteries and Voting Schemes. Inf. Process. Lett. 51(1): 1-6 (1994) - [j11]Bogdan S. Chlebus, Krzysztof Diks, Andrzej Pelc:
Sparse Networks Supporting Efficient Reliable Broadcasting. Nord. J. Comput. 1(3): 332-345 (1994) - [j10]Krzysztof Diks, Adam Malinowski, Andrzej Pelc:
Reliable Token Despersal with Random Faults. Parallel Process. Lett. 4: 417-427 (1994) - [j9]Bogdan S. Chlebus, Krzysztof Diks, Andrzej Pelc:
Sorting on a Mesh-Connected Computer with Delaying Links. SIAM J. Discret. Math. 7(1): 119-132 (1994) - [c19]Krzysztof Diks, Andrzej Pelc:
Fault-Tolerant Linear Broadcasting. Canada-France Conference on Parallel and Distributed Computing 1994: 207-217 - [c18]Bogdan S. Chlebus, Krzysztof Diks, Andrzej Pelc:
Waking up an Anonymous Faulty Network from a Single Source. HICSS (2) 1994: 187-193 - [c17]Piotr Denejko, Krzysztof Diks, Andrzej Pelc, Marek Piotrów:
Reliable Minimum Finding Comparator Networks. MFCS 1994: 306-315 - [c16]Krzysztof Diks, Evangelos Kranakis, A. Malinowsky, Andrzej Pelc:
The Buffer Potential of a Network. SIROCCO 1994: 149-150 - 1993
- [j8]Krzysztof Diks, Oscar Garrido, Andrzej Lingas:
Parallel Algorithms for Finding Maximal k-Dependent Sets and Maximal f-Matchings. Int. J. Found. Comput. Sci. 4(2): 179-192 (1993) - [j7]Krzysztof Diks, Andrzej Pelc:
Fast Diagnosis of Multiprocessor Systems with Random Faults. RAIRO Theor. Informatics Appl. 27(5): 391-401 (1993) - [j6]Krzysztof Diks, Hristo N. Djidjev
Edge Separators of Planar and Outerplanar Graphs with Applications. J. Algorithms 14(2): 258-279 (1993) - [c15]Bogdan S. Chlebus, Krzysztof Diks, Andrzej Pelc:
Sparse Networks Supporting Efficient Reliable Broadcasting. ICALP 1993: 388-397 - 1992
- [j5]Krzysztof Diks, Andrzej Pelc:
Almost Safe Gossiping in Bounded Degree Networks. SIAM J. Discret. Math. 5(3): 338-344 (1992) - 1991
- [j4]P. C. P. Bhatt, Krzysztof Diks, Torben Hagerup, V. C. Prasad, Tomasz Radzik, Sanjeev Saxena:
Improved Deterministic Parallel Integer Sorting. Inf. Comput. 94(1): 29-47 (1991) - [j3]Krzysztof Diks, Wojciech Rytter:
On Optimal Parallel Computations for Sequences of Brackets. Theor. Comput. Sci. 87(2): 251-262 (1991) - [c14]Bogdan S. Chlebus, Krzysztof Diks, Andrzej Pelc:
Optimal Broadcasting in Faulty Hypercubes. FTCS 1991: 266-273 - [c13]Krzysztof Diks, Oscar Garrido, Andrzej Lingas:
Parallel Algorithms for Finding Maximal k-Dependent Sets and Maximal f-Matchings. ISA 1991: 385-395
1980 – 1989
- 1989
- [j2]Torben Hagerup, Marek Chrobak, Krzysztof Diks:
Optimal Parallel 5-Colouring of Planar Graphs. SIAM J. Comput. 18(2): 288-300 (1989) - [c12]Bogdan S. Chlebus, Krzysztof Diks, Torben Hagerup, Tomasz Radzik:
New Simulations between CRCW PRAMs. FCT 1989: 95-104 - [c11]Bogdan S. Chlebus, Krzysztof Diks, Wojciech Rytter, Tomasz Szymacha:
Parallel Complexity of Lexicographically First Order Problems for Tree-Structured Graphs (Extended Abstract). MFCS 1989: 185-195 - [c10]Krzysztof Diks, Torben Hagerup, Wojciech Rytter:
Optimal Parallel Algorithms For The Recognition And Colouring Outerplanar Graphs (Extended Abstract). MFCS 1989: 207-217 - [c9]Krzysztof Diks, Wojciech Rytter:
Optimal Parallel Computations for Halin Graphs. Optimal Algorithms 1989: 266-273 - 1988
- [c8]Bogdan S. Chlebus, Krzysztof Diks, Tomasz Radzik:
Testing Isomorphism of Outerplanar Graphs in Parallel. MFCS 1988: 220-230 - [c7]Bogdan S. Chlebus, Krzysztof Diks, Torben Hagerup, Tomasz Radzik:
Efficient Simulations Between Concurrent-Read Concurrent-Write PRAM Models. MFCS 1988: 231-239 - [c6]Krzysztof Diks, Hristo N. Djidjev, Ondrej Sýkora, Imrich Vrto:
Edge Separators for Planar Graphs and Their Applications. MFCS 1988: 280-290 - 1987
- [c5]Bogdan S. Chlebus, Marek Chrobak, Krzysztof Diks:
Saturating Flows in Networks. FCT 1987: 82-91 - [c4]Torben Hagerup, Marek Chrobak, Krzysztof Diks:
Parallel 5-Colouring of Planar Graphs. ICALP 1987: 304-313 - [c3]Krzysztof Diks:
Parallel Recognition of Outerplanar Graphs. Parallel Algorithms and Architectures 1987: 105-113 - 1986
- [c2]Krzysztof Diks:
A Fast Parallel Algorithm for Six-Colouring of Planar Graphs (Extended Abstract). MFCS 1986: 273-282 - 1985
- [j1]Krzysztof Diks:
Embeddings of Binary Trees in Lines. Theor. Comput. Sci. 36: 319-331 (1985) - 1984
- [c1]Krzysztof Diks:
A note on selection networks. Symposium on Computation Theory 1984: 54-57
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-05-08 21:04 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: