The following pages link to Mirosław Kutyłowski (Q688152):
Displaying 50 items.
- Stack versus sensitivity for one-way automata (Q688153) (← links)
- (Q714771) (redirect page) (← links)
- Energy efficient alert in single-hop networks of extremely weak devices (Q714773) (← links)
- From key predistribution to key redistribution (Q714775) (← links)
- Remarks on sorting and one-way multihead finite automata (Q917328) (← links)
- Adaptive initialization algorithm for ad hoc radio networks with carrier sensing (Q936527) (← links)
- A generalized Grzegorczyk hierarchy and low complexity classes (Q1098838) (← links)
- Multihead one-way finite automata (Q1183574) (← links)
- Periodic merging networks (Q1271276) (← links)
- Exact lower time bounds for computing Boolean functions on CREW PRAMs (Q1329159) (← links)
- A formal concept of domain pseudonymous signatures (Q1631851) (← links)
- Hard invalidation of electronic signatures (Q1631937) (← links)
- On crossroads of privacy protection (Q1744999) (← links)
- Chip authentication for e-Passports: PACE with chip authentication mapping v2 (Q1799192) (← links)
- Limits on the power of parallel random access machines with weak forms of write conflict resolution (Q1816745) (← links)
- Retrieval of scattered information by EREW, CREW, and CRCW PRAMs (Q1904664) (← links)
- Fast integer merging on the EREW PRAM (Q2365176) (← links)
- Step-out group signatures (Q2390951) (← links)
- Controlled randomness -- a defense against backdoors in cryptographic devices (Q2412228) (← links)
- Provable unlinkability against traffic analysis with low message overhead (Q2516530) (← links)
- (Q2764240) (← links)
- Pseudonymous Signature on eIDAS Token – Implementation Based Privacy Threats (Q2817829) (← links)
- Optimizing Segment Based Document Protection (Q2891390) (← links)
- Probabilistic Admissible Encoding on Elliptic Curves - Towards PACE with Generalized Integrated Mapping (Q2938116) (← links)
- Periodification scheme (Q2947000) (← links)
- Stamp and Extend – Instant But Undeniable Timestamping Based on Lazy Trees (Q2957109) (← links)
- Private Information Retrieval with a Trusted Hardware Unit – Revisited (Q3019940) (← links)
- Efficient simulation of synchronous systems by multi-speed systems (Q3025325) (← links)
- Reversal Complexity Classes for Alternating Turing Machines (Q3034821) (← links)
- Time Complexity of Boolean Functions on CREW PRAM<scp>s</scp> (Q3358235) (← links)
- (Q3359752) (← links)
- (Q3368997) (← links)
- (Q3421459) (← links)
- (Q3421475) (← links)
- (Q3421476) (← links)
- Supervised Usage of Signature Creation Devices (Q3454148) (← links)
- Stand-by Attacks on E-ID Password Authentication (Q3454602) (← links)
- Distributed Verification of Mixing - Local Forking Proofs Model (Q3511157) (← links)
- Step-Out Ring Signatures (Q3599147) (← links)
- Anonymity and k-Choice Identities (Q3600341) (← links)
- (Q3613098) (← links)
- Restricted Collection and Comprehension Schemata in Weak Set Theories (Q3720588) (← links)
- A Note on “ℰ*0 = ℰ*2?” Problem (Q3731591) (← links)
- Small Grzegorczyk Classes (Q3781751) (← links)
- Finite automata, real time processes and counting problems in bounded arithmetics (Q3791138) (← links)
- Boolean operations over measure algebras (Q3791392) (← links)
- (Q3795237) (← links)
- (Q4252298) (← links)
- (Q4281540) (← links)
- Weak communication in single‐hop radio networks: adjusting algorithms to industrial standards (Q4432747) (← links)
