The following pages link to Jozef Vyskoč (Q587571):
Displaying 50 items.
- A survey on tree edit distance and related problems (Q557823) (← links)
- The intractability of computing the Hamming distance (Q557834) (← links)
- (Q686137) (redirect page) (← links)
- Four results on randomized incremental constructions (Q686138) (← links)
- Tail estimates for the efficiency of randomized incremental algorithms for line segment intersection (Q686143) (← links)
- Additive cellular automata and algebraic series (Q688164) (← links)
- Sequences with controllable linear complexity profile (Q751620) (← links)
- A note on Boolean matrix multiplication (Q761038) (← links)
- Secure multiparty protocols and zero-knowledge proof systems tolerating a faulty minority (Q809588) (← links)
- A deterministic algorithm for modular knapsack problems (Q809609) (← links)
- Reducing the seed length in the Nisan-Wigderson generator (Q879167) (← links)
- Error linear complexity measures for multisequences (Q883329) (← links)
- Corrigendum: An \(O(n^{lg\,k}\cdot 2^{n/2})\) time and \(O(k\cdot s^{n/k})\) space algorithm for certain NP-complete problems (Q914372) (← links)
- Making bubblesort recursive (Q917276) (← links)
- The derivation of systolic computations (Q921907) (← links)
- Subtree isomorphism is in random NC (Q922707) (← links)
- Fully-dynamic min-cut (Q925139) (← links)
- An \(O(n^{lg\,k}\cdot 2^{n/2})\) time and \(O(k\cdot 2^{n/k})\) space algorithm for certain NP-complete problems (Q1101220) (← links)
- Partial information in public key cryptography (Q1105565) (← links)
- Minimum disclosure proofs of knowledge (Q1110348) (← links)
- Pushdown automata with reversal-bounded counters (Q1112611) (← links)
- A note on three-way two dimensional alternating Turing machines (Q1112612) (← links)
- Structural and behavioral equivalence relations in automata networks (Q1116701) (← links)
- Mechanical certification of systolic algorithms (Q1123588) (← links)
- Complexity of selection in \(X+Y\) (Q1124333) (← links)
- The black-box model for cryptographic primitives (Q1126893) (← links)
- New bounds and constructions for authentication/secrecy codes with splitting (Q1176594) (← links)
- Breaking a class of public-key cryptosystems with Euclid's algorithm (Q1179345) (← links)
- An introduction to randomized algorithms (Q1182319) (← links)
- Conditionally-perfect secrecy and a provably-secure randomized cipher (Q1184508) (← links)
- Foundations of data organization and algorithms. 3rd international conference, FODO 1989, Paris, France, June 21-23, 1989. Proceedings (Q1187671) (← links)
- Concrete and abstract Voronoi diagrams (Q1188589) (← links)
- Multi-oracle interactive protocols with constant space verifiers (Q1190986) (← links)
- Turing machines with few accepting computations and low sets for PP (Q1190987) (← links)
- Oracles for structural properties: The isomorphism problem and public-key cryptography (Q1190988) (← links)
- Regular languages in \(NC\) (Q1191027) (← links)
- Construction of Cartesian authentication codes from unitary geometry (Q1203950) (← links)
- How to avoid the cheaters succeeding in the key sharing scheme (Q1261009) (← links)
- Secret sharing over infinite domains (Q1261017) (← links)
- Almost-everywhere complexity hierarchies for nondeterministic time (Q1261465) (← links)
- A note on sparse sets and the polynomial-time hierarchy (Q1263964) (← links)
- Approximation algorithms for partitioning a rectangle with interior points (Q1263970) (← links)
- Heuristics for optimum binary search trees and minimum weight triangulation problems (Q1263993) (← links)
- Shared secret reconstruction (Q1265229) (← links)
- Unconditionally secure group authentication (Q1265236) (← links)
- Two-key triple encryption (Q1272336) (← links)
- Multiround unconditionally secure authentication (Q1273507) (← links)
- New combinatorial bounds for authentication codes and key predistribution schemes (Q1273509) (← links)
- How to build robust shared control systems (Q1273533) (← links)
- Efficient Rabin-type digital signature scheme (Q1283220) (← links)
