Mittagsseminar (in cooperation with A. Steger, D. Steurer and B. Sudakov)

Date and Time: Tuesday, May 04, 2010, 12:15 pm

Duration: This information is not available in the database

Location: OAT S15/S16/S17

Speaker: Mohammad Torabi Dashti (D-INFK - Information Security)

Constructing and recognizing permutation-complete words

Permutation-complete words contain all the permutations of 1 .. N, for some positive natural N. Here w contains w' iff w' can be found by erasing zero or more letters from w. In 1972, Karp [1] posed the problem of finding the length of a shortest permutation-complete word, given a positive natural N. The problem is still open.

Recently, Mauw, Radomirovic and Torabi Dashti [2] proved that the message complexity of N-party contract signing protocols is tightly related to the length of shortest permutation-complete words. This result in particular implies that efficient algorithms for constructing (resp. recognizing) permutation-complete words can be used for designing (resp. debugging) N-party contract signing protocols. The talk will give an overview on the combinatorial aspects of constructing and recognizing permutation-complete words.

References:
[1] Vaclav Chvátal, David Klarner, Donald Knuth: Selected Combinatorial Research Problems. Technical Report: CS-TR-72-292. Stanford University, 1972.
[2] Sjouke Mauw, Sasa Radomirovic, Mohammad Torabi Dashti: Minimal Message Complexity of Asynchronous Multi-party Contract Signing. CSF 2009, IEEE Computer Society.

Upcoming talks     |     All previous talks     |     Talks by speaker     |     Upcoming talks in iCal format (beta version!)

Previous talks by year:   2023  2022  2021  2020  2019  2018  2017  2016  2015  2014  2013  2012  2011  2010  2009  2008  2007  2006  2005  2004  2003  2002  2001  2000  1999  1998  1997  1996  

Information for students and suggested topics for student talks

Automatic MiSe System Software Version 1.4803M   |   admin login