Krzysztof Diks

72 papers A* 3A 3B 18C 1Journal 38Unranked 9

Year	Rank	Type	Title / Venue / Authors
2019	J	`jnl`	Energy-optimal broadcast and exploration in a tree using mobile agents. Theor. Comput. Sci. Jurek Czyzowicz, Krzysztof Diks, Jean Moussi, Wojciech Rytter
2018	B	`conf`	Broadcast with Energy-Exchanging Mobile Agents Distributed on a Tree. SIROCCO Jurek Czyzowicz, Krzysztof Diks, Jean Moussi, Wojciech Rytter
2017	C	`conf`	Energy-Optimal Broadcast in a Tree with Mobile Agents. ALGOSENSORS Jerzy Czyzowicz, Krzysztof Diks, Jean Moussi, Wojciech Rytter
2016	B	`conf`	Communication Problems for Mobile Agents Exchanging Energy. SIROCCO Jurek Czyzowicz, Krzysztof Diks, Jean Moussi, Wojciech Rytter
2015	J	`jnl`	Algorithms for Communication Problems for Mobile Agents Exchanging Energy. CoRR Jerzy Czyzowicz, Krzysztof Diks, Jean Moussi, Wojciech Rytter
2010	B	`conf`	Perfect Matching for Biconnected Cubic Graphs in SOFSEM Krzysztof Diks, Piotr Stanczyk
2008	—	`conf`	From Top Coders to Top IT Professionals. ISSEP Krzysztof Diks, Jan Madey
2007	A	`conf`	Dynamic Plane Transitive Closure. ESA Krzysztof Diks, Piotr Sankowski
2006	J	`jnl`	Exploring Planar Graphs Using Unoriented Maps. J. Interconnect. Networks Krzysztof Diks, Stefan Dobrev, Andrzej Pelc
2004	J	`jnl`	Tree exploration with little memory. J. Algorithms Krzysztof Diks, Pierre Fraigniaud, Evangelos Kranakis, Andrzej Pelc
2002	B	`conf`	A New 3-Color Criterion for Planar Graphs. WG Krzysztof Diks, Lukasz Kowalik, Maciej Kurowski
2002	B	`ed.`	Mathematical Foundations of Computer Science 2002, 27th International Symposium, MFCS 2002, Warsaw, Poland, August 26-30, 2002, Proceedings MFCS Krzysztof Diks, Wojciech Rytter
2002	J	`jnl`	The impact of information on broadcasting time in linear radio networks. Theor. Comput. Sci. Krzysztof Diks, Evangelos Kranakis, Danny Krizanc, Andrzej Pelc
2002	A*	`conf`	Tree exploration with little memory. SODA Krzysztof Diks, Pierre Fraigniaud, Evangelos Kranakis, Andrzej Pelc
2000	J	`jnl`	Optimal Adaptive Broadcasting with a Bounded Fraction of Faulty Nodes. Algorithmica Krzysztof Diks, Andrzej Pelc
2000	J	`jnl`	Reliable Minimum Finding Comparator Networks. Fundam. Informaticae Piotr Denejko, Krzysztof Diks, Andrzej Pelc, Marek Piotrów
1999	J	`jnl`	An Optimal Algorithm for Broadcasting Multiple Messages in Trees. J. Parallel Distributed Comput. Krzysztof Diks, Andrzej Lingas, Andrzej Pelc
1999	A	`conf`	The Impact of Knowledge on Broadcasting Time in Radio Networks. ESA Krzysztof Diks, Evangelos Kranakis, Danny Krizanc, Andrzej Pelc
1998	J	`jnl`	Broadcasting in Unlabeled Hypercubes with a Linear Number of Messages. Inf. Process. Lett. Krzysztof Diks, Stefan Dobrev, Evangelos Kranakis, Andrzej Pelc, Peter Ruzicka
1998	J	`jnl`	Broadcasting in Unlabeled Tori. Parallel Process. Lett. Krzysztof Diks, Evangelos Kranakis, Andrzej Pelc
1998	J	`jnl`	More General Parallel Tree Contraction: Register Allocation and Broadcasting in a Tree. Theor. Comput. Sci. Krzysztof Diks, Torben Hagerup
1998	J	`jnl`	Perfect Broadcasting in Unlabeled Networks. Discret. Appl. Math. Krzysztof Diks, Evangelos Kranakis, Andrzej Pelc
1998	J	`jnl`	System Diagnosis with Smallest Risk of Error. Theor. Comput. Sci. Krzysztof Diks, Andrzej Pelc
1997	B	`conf`	An Optimal Algorithm for Broadcasting Multiple Messages in Trees. SIROCCO Krzysztof Diks, Andrzej Lingas, Andrzej Pelc
1997	J	`jnl`	Globally Optimal Diagnosis in Systems with Random Faults. IEEE Trans. Computers Krzysztof Diks, Andrzej Pelc
1997	A	`conf`	Optimal Adaptive Broadcasting with a Bounded Fraction of Faulty Nodes (Extended Abstract). ESA Krzysztof Diks, Andrzej Pelc
1997	J	`jnl`	Reliable Broadcasting in Logarithmic Time with Byzantine Link Failures. J. Algorithms Piotr Berman, Krzysztof Diks, Andrzej Pelc
1997	J	`jnl`	Transition-Optimal Token Distribution. Fundam. Informaticae Bogdan S. Chlebus, Krzysztof Diks, Andrzej Pelc
1996	J	`jnl`	Broadcasting with universal lists. Networks Krzysztof Diks, Andrzej Pelc
1996	J	`jnl`	Efficient Gossiping by Packets in Networks with Random Faults. SIAM J. Discret. Math. Krzysztof Diks, Andrzej Pelc
1996	J	`jnl`	Fault-Tolerant Linear Broadcasting. Nord. J. Comput. Krzysztof Diks, Andrzej Pelc
1996	B	`conf`	More General Parallel Tree Contraction: Register Allocation and Broadcasting in a Tree. WG Krzysztof Diks, Torben Hagerup
1996	J	`jnl`	Parallel Maximum Independent Set in Convex Bipartite Graphs. Inf. Process. Lett. Artur Czumaj, Krzysztof Diks, Teresa M. Przytycka
1996	J	`jnl`	Reliable Broadcasting in Hypercubes with Random Link and Node Failures. Comb. Probab. Comput. Bogdan S. Chlebus, Krzysztof Diks, Andrzej Pelc
1996	J	`jnl`	Reliable Computations on Faulty EREW PRAM. Theor. Comput. Sci. Krzysztof Diks, Andrzej Pelc
1996	B	`conf`	System Diagnosis with Smallest Risk of Error. WG Krzysztof Diks, Andrzej Pelc
1995	J	`jnl`	Anonymous Wireless Rings. Theor. Comput. Sci. Krzysztof Diks, Evangelos Kranakis, Adam Malinowski, Andrzej Pelc
1995	—	`conf`	Broadcasting with universal lists. HICSS (2) Krzysztof Diks, Andrzej Pelc
1995	J	`jnl`	O(log log n)-Time Integer Geometry on the CRCW PRAM. Algorithmica Bogdan S. Chlebus, Krzysztof Diks, Miroslaw Kowaluk
1995	J	`jnl`	Token Transfer in a Faulty Network. RAIRO Theor. Informatics Appl. Krzysztof Diks, Adam Malinowski, Andrzej Pelc
1994	J	`jnl`	Fast gossiping with short unreliable messages. Discret. Appl. Math. Bogdan S. Chlebus, Krzysztof Diks, Andrzej Pelc
1994	—	`conf`	Fault-Tolerant Linear Broadcasting. Canada-France Conference on Parallel and Distributed Computing Krzysztof Diks, Andrzej Pelc
1994	J	`jnl`	Optimal Coteries and Voting Schemes. Inf. Process. Lett. Krzysztof Diks, Evangelos Kranakis, Danny Krizanc, Bernard Mans, Andrzej Pelc
1994	B	`conf`	Reliable Minimum Finding Comparator Networks. MFCS Piotr Denejko, Krzysztof Diks, Andrzej Pelc, Marek Piotrów
1994	J	`jnl`	Reliable Token Despersal with Random Faults. Parallel Process. Lett. Krzysztof Diks, Adam Malinowski, Andrzej Pelc
1994	J	`jnl`	Sorting on a Mesh-Connected Computer with Delaying Links. SIAM J. Discret. Math. Bogdan S. Chlebus, Krzysztof Diks, Andrzej Pelc
1994	J	`jnl`	Sparse Networks Supporting Efficient Reliable Broadcasting. Nord. J. Comput. Bogdan S. Chlebus, Krzysztof Diks, Andrzej Pelc
1994	B	`conf`	The Buffer Potential of a Network. SIROCCO Krzysztof Diks, Evangelos Kranakis, A. Malinowsky, Andrzej Pelc
1994	—	`conf`	Waking up an Anonymous Faulty Network from a Single Source. HICSS (2) Bogdan S. Chlebus, Krzysztof Diks, Andrzej Pelc
1993	J	`jnl`	Edge Separators of Planar and Outerplanar Graphs with Applications. J. Algorithms Krzysztof Diks, Hristo N. Djidjev, Ondrej Sýkora, Imrich Vrto
1993	J	`jnl`	Fast Diagnosis of Multiprocessor Systems with Random Faults. RAIRO Theor. Informatics Appl. Krzysztof Diks, Andrzej Pelc
1993	J	`jnl`	Parallel Algorithms for Finding Maximal k-Dependent Sets and Maximal f-Matchings. Int. J. Found. Comput. Sci. Krzysztof Diks, Oscar Garrido, Andrzej Lingas
1993	A*	`conf`	Sparse Networks Supporting Efficient Reliable Broadcasting. ICALP Bogdan S. Chlebus, Krzysztof Diks, Andrzej Pelc
1992	J	`jnl`	Almost Safe Gossiping in Bounded Degree Networks. SIAM J. Discret. Math. Krzysztof Diks, Andrzej Pelc
1991	J	`jnl`	Improved Deterministic Parallel Integer Sorting Inf. Comput. P. C. P. Bhatt, Krzysztof Diks, Torben Hagerup, V. C. Prasad, Tomasz Radzik, Sanjeev Saxena
1991	J	`jnl`	On Optimal Parallel Computations for Sequences of Brackets. Theor. Comput. Sci. Krzysztof Diks, Wojciech Rytter
1991	—	`conf`	Optimal Broadcasting in Faulty Hypercubes. FTCS Bogdan S. Chlebus, Krzysztof Diks, Andrzej Pelc
1991	—	`conf`	Parallel Algorithms for Finding Maximal k-Dependent Sets and Maximal f-Matchings. ISA Krzysztof Diks, Oscar Garrido, Andrzej Lingas
1989	B	`conf`	New Simulations between CRCW PRAMs. FCT Bogdan S. Chlebus, Krzysztof Diks, Torben Hagerup, Tomasz Radzik
1989	J	`jnl`	Optimal Parallel 5-Colouring of Planar Graphs. SIAM J. Comput. Torben Hagerup, Marek Chrobak, Krzysztof Diks
1989	B	`conf`	Optimal Parallel Algorithms For The Recognition And Colouring Outerplanar Graphs (Extended Abstract). MFCS Krzysztof Diks, Torben Hagerup, Wojciech Rytter
1989	—	`conf`	Optimal Parallel Computations for Halin Graphs. Optimal Algorithms Krzysztof Diks, Wojciech Rytter
1989	B	`conf`	Parallel Complexity of Lexicographically First Order Problems for Tree-Structured Graphs (Extended Abstract). MFCS Bogdan S. Chlebus, Krzysztof Diks, Wojciech Rytter, Tomasz Szymacha
1988	B	`conf`	Edge Separators for Planar Graphs and Their Applications. MFCS Krzysztof Diks, Hristo N. Djidjev, Ondrej Sýkora, Imrich Vrto
1988	B	`conf`	Efficient Simulations Between Concurrent-Read Concurrent-Write PRAM Models. MFCS Bogdan S. Chlebus, Krzysztof Diks, Torben Hagerup, Tomasz Radzik
1988	B	`conf`	Testing Isomorphism of Outerplanar Graphs in Parallel. MFCS Bogdan S. Chlebus, Krzysztof Diks, Tomasz Radzik
1987	A*	`conf`	Parallel 5-Colouring of Planar Graphs. ICALP Torben Hagerup, Marek Chrobak, Krzysztof Diks
1987	—	`conf`	Parallel Recognition of Outerplanar Graphs. Parallel Algorithms and Architectures Krzysztof Diks
1987	B	`conf`	Saturating Flows in Networks. FCT Bogdan S. Chlebus, Marek Chrobak, Krzysztof Diks
1986	B	`conf`	A Fast Parallel Algorithm for Six-Colouring of Planar Graphs (Extended Abstract). MFCS Krzysztof Diks
1985	J	`jnl`	Embeddings of Binary Trees in Lines. Theor. Comput. Sci. Krzysztof Diks
1984	—	`conf`	A note on selection networks. Symposium on Computation Theory Krzysztof Diks