Michael Soltys

0 Followers

strings ivona grzegroczyk michael soltys algorithms shuffle non-repetitive words complexity computer science algorithm security

Activity
About

Feasible proofs of matrix identities with csanky's algorithm - CSL 2005

10 years ago • 962 Views

Perceptions of Foundational Knowledge by CS students - WCCCE 2012

10 years ago • 764 Views

La, permutations, and the hajós calculus - ICALP 2004

10 years ago • 736 Views

The proof theoretic strength of the Steinitz exchange theorem - EACA 2006

10 years ago • 904 Views

Games on Posets - CiE 2008

10 years ago • 830 Views

The proof complexity of matrix algebra - Newton Institute, Cambridge 2006

10 years ago • 1027 Views

Unambiguous functions in logarithmic space - CiE 2009

10 years ago • 810 Views

Feasible Combinatorial Matrix Theory - LICS2013 presentation

10 years ago • 1160 Views

Circuit Complexity of Shuffle - IWOCA 2013

10 years ago • 966 Views

Feasible Combinatorial Matrix Theory - MFCS2013

10 years ago • 1673 Views

An algorithmic view of Computer Science

10 years ago • 1444 Views

How Safe is your Data?

9 years ago • 1065 Views

Fair ranking in competitive bidding procurement: a case analysis

9 years ago • 953 Views

Algorithms on Strings

9 years ago • 1640 Views

Intro to Cryptography

8 years ago • 1160 Views

A formal framework for Stringology

8 years ago • 1073 Views

Mechatronics Engineering

8 years ago • 1741 Views

Forced repetitions over alphabet lists

7 years ago • 807 Views

The Proof Complexity of Linear Algebra - LICS 2002

10 years ago • 903 Views

Boolean Programs and Quantified Propositional Proof System -

10 years ago • 2052 Views

What Scientists Really Believe

Sarah Salviander • 5 years ago