Result 1 to 20 of 22 total
Asynchronous deterministic rendezvous on the line. (English)
Nielsen, Mogens (ed.) et al., SOFSEM 2009: Theory and practice of computer science. 35th conference on current trends in theory and practice of computer science, Špindlerův Mlýn, Czech Republic, January 24‒30, 2009. Proceedings. Berlin: Springer (ISBN 978-3-540-95890-1/pbk). Lecture Notes in Computer Science 5404, 497-508 (2009).
1
Collecting weighted items from a dynamic queue (English)
SODA, 1126-1135 (2009).
2
Asynchronous deterministic rendezvous on the line (English)
SOFSEM, 497-508 (2009).
3
Generalized whac-a-mole. (English)
Comput. Res. Repos. 2008, Article No. 0802.1685 (2008).
4
Proofs of knowledge with several challenge values (English)
IACR Cryptology ePrint Archive 2008, 181 (2008).
5
Unlinkable divisible digital cash without trusted third party (English)
IACR Cryptology ePrint Archive 2007, 216 (2007).
6
Fast periodic correction networks. (English)
Theor. Comput. Sci. 354, No. 3, 354-366 (2006).
7
Probabilistic algorithms for the wake-up problem in single-hop radio networks. (English)
Theory Comput. Syst. 38, No. 3, 347-367 (2005).
8
Fast periodic correction networks. (English)
Lingas, Andrzej (ed.) et al., Fundamentals of computation theory. 14th international symposium, FCT 2003, Malmö, Sweden, August 12‒15, 2003. Proceedings. Berlin: Springer (ISBN 3-540-40543-7/pbk). Lect. Notes Comput. Sci. 2751, 144-156 (2003).
9
Lower bounds on correction networks. (English)
Ibaraki, Toshihide (ed.) et al., Algorithms and computation. 14th international symposium, ISAAC 2003, Kyoto, Japan, December 15‒17, 2003. Proceedings. Berlin: Springer (ISBN 3-540-20695-7/pbk). Lect. Notes Comput. Sci. 2906, 221-229 (2003).
10
Fast periodic correction networks (English)
FCT, 144-156 (2003).
11
Lower bounds on correction networks (English)
ISAAC, 221-229 (2003).
12
Probabilistic algorithms for the wakeup problem in single-hop radio networks. (English)
Bose, Prosenjit (ed.) et al., Algorithms and computation. 13th international symposium, ISAAC 2002, Vancouver, BC, Canada, November 21-23, 2002. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 2518, 535-549 (2002).
13
Probabilistic algorithms for the wakeup problem in single-hop radio networks (English)
ISAAC, 535-549 (2002).
14
Fibonacci correction networks. (English)
Halldórsson, Magnús M. (ed.), Algorithm theory - SWAT 2000. 7th Scandinavian workshop, Bergen, Norway, July 5-7, 2000. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 1851, 535-548 (2000).
15
Fibonacci correction networks (English)
SWAT, 535-548 (2000).
16
Finding parity difference by involutions. (English)
Discrete Math. 163, No.1-3, 139-151 (1997).
17
On a long cycle in the graph of all linear extensions of a poset consisting of two disjoint chains. (English)
Discrete Math. 131, No.1-3, 375-378 (1994).
18
Periodic constant depth sorting networks (English)
STACS, 201-212 (1994).
19
Hamilton paths in graphs of linear extensions for unions of posets. (English)
SIAM J. Discrete Math. 5, No.2, 199-206 (1992).
20
Result 1 to 20 of 22 total
Start
Contact
Print
General Help
