Krzysztof Diks

From MaRDI portal
Person:671424

Available identifiers

zbMath Open diks.krzysztofMaRDI QIDQ671424

List of research outcomes





PublicationDate of PublicationType
More general parallel tree contraction: register allocation and broadcasting in a tree2024-06-05Paper
System diagnosis with smallest risk of error2024-06-05Paper
Energy-Optimal Broadcast in a Tree with Mobile Agents2022-12-09Paper
Reliable minimum finding comparator networks2022-08-18Paper
Optimal adaptive broadcasting with a bounded fraction of faulty nodes (extended abstract)2021-12-20Paper
Energy-optimal broadcast and exploration in a tree using mobile agents2019-10-18Paper
Sparse networks supporting efficient reliable broadcasting2019-03-29Paper
Broadcast with energy-exchanging mobile agents distributed on a tree2019-01-30Paper
Communication Problems for Mobile Agents Exchanging Energy2016-12-01Paper
Perfect matching for biconnected cubic graphs in \(O(n \log ^{2} n)\) time2010-01-28Paper
Dynamic Plane Transitive Closure2008-09-25Paper
Broadcasting in unlabeled hypercubes with a linear number of messages.2006-01-17Paper
https://portal.mardi4nfdi.de/entity/Q48289872004-11-29Paper
Tree exploration with little memory2004-10-01Paper
https://portal.mardi4nfdi.de/entity/Q44144922003-07-25Paper
The impact of information on broadcasting time in linear radio networks.2003-01-21Paper
https://portal.mardi4nfdi.de/entity/Q45078602000-10-10Paper
https://portal.mardi4nfdi.de/entity/Q49387712000-03-27Paper
An optimal algorithm for broadcasting multiple messages in trees2000-03-19Paper
https://portal.mardi4nfdi.de/entity/Q42354341999-03-22Paper
More general parallel tree contraction: Register allocation and broadcasting in a tree1999-01-12Paper
System diagnosis with smallest risk of error1999-01-12Paper
Perfect broadcasting in unlabeled networks1998-11-03Paper
Reliable broadcasting in hypercubes with random link and node failures1997-05-22Paper
Anonymous wireless rings1997-02-28Paper
Reliable computations on faulty EREW PRAM1997-02-27Paper
Parallel maximum independent set in convex bipartite graphs1997-02-27Paper
Broadcasting with universal lists1996-11-25Paper
https://portal.mardi4nfdi.de/entity/Q48955451996-10-14Paper
Efficient Gossiping by Packets in Networks with Random Faults1996-06-05Paper
Token transfer in a faulty network1996-05-27Paper
\(O(\log \log n)\)-time integer geometry on the CRCW PRAM1995-07-24Paper
https://portal.mardi4nfdi.de/entity/Q47646271995-05-04Paper
Fast diagnosis of multiprocessor systems with random faults1995-01-02Paper
Fast gossiping with short unreliable messages1994-12-11Paper
Optimal coteries and voting schemes1994-08-03Paper
Sorting on a Mesh-Connected Computer with Delaying Links1994-05-12Paper
PARALLEL ALGORITHMS FOR FINDING MAXIMAL k-DEPENDENT SETS AND MAXIMAL f-MATCHINGS1994-03-27Paper
Almost Safe Gossiping in Bounded Degree Networks1993-01-16Paper
https://portal.mardi4nfdi.de/entity/Q39751421992-06-26Paper
https://portal.mardi4nfdi.de/entity/Q39748571992-06-26Paper
https://portal.mardi4nfdi.de/entity/Q39751401992-06-26Paper
Improved deterministic parallel integer sorting1992-06-25Paper
On optimal parallel computations for sequences of brackets1991-01-01Paper
https://portal.mardi4nfdi.de/entity/Q42064011990-01-01Paper
Optimal Parallel 5-Colouring of Planar Graphs1989-01-01Paper
https://portal.mardi4nfdi.de/entity/Q34843531989-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37952441988-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37835971987-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37799711987-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37716431987-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37357251986-01-01Paper
Embeddings of binary trees in lines1985-01-01Paper

Research outcomes over time

This page was built for person: Krzysztof Diks