Danilo Bruschi

Available identifiers

Publication	Date of Publication	Type
Lower bounds for the broadcast problem in mobile radio networks	2020-12-02	Paper
String distances and intrusion detection: Bridging the gap between formal languages and computer security	2007-04-10	Paper
A logarithmic lower bound for time-spread multiple-access (TSMA) protocols	2003-01-23	Paper
https://portal.mardi4nfdi.de/entity/Q4266544	1999-10-03	Paper
On the difficulty of finding walks of length k	1998-08-03	Paper
Random parallel algorithms for finding exact branchings, perfect matchings, and cycles	1995-05-30	Paper
The complexity of computing maximal word functions	1994-05-08	Paper
On the existence of minimum asynchronous automata and on the equivalence problem for unambiguous regular trace languages	1994-01-01	Paper
Strong separations of the polynomial hierarchy with oracles: Constructive separations by immune and simple sets	1993-01-16	Paper
Ranking and formal power series	1991-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q3787509	1988-01-01	Paper

This page was built for person: Danilo Bruschi