The following pages link to Hiroshi Imai (Q583231):
Displayed 50 items.
- Item:Q583231 (redirect page) (← links)
- How to construct efficient signcryption schemes on elliptic curves (Q293455) (← links)
- A construction method of matroidal networks (Q362156) (← links)
- Internal state recovery of keystream generator LILI-128 based on a novel weakness of the employed Boolean function (Q456133) (← links)
- Distinguishability measures and entropies for general probabilistic theories (Q540802) (← links)
- Computing simple circuits from a set of line segments (Q583232) (← links)
- Matroid enumeration for incidence geometry (Q664549) (← links)
- \(\varepsilon\)-approximations of \(k\)-label spaces (Q674408) (← links)
- An improvement of discrete Tardos fingerprinting codes (Q735039) (← links)
- Locating a robot with angle measurements (Q751327) (← links)
- Error-correcting codes and cryptography (Q937222) (← links)
- Semantic security for the McEliece cryptosystem without random oracles (Q1009060) (← links)
- Visibility of disjoint polygons (Q1087340) (← links)
- A multiplicative barrier function method for linear programming (Q1101008) (← links)
- Geometric relations among Voronoi diagrams (Q1101688) (← links)
- Computing the volume of the union of spheres (Q1104079) (← links)
- Shortest path between two simple polygons (Q1107993) (← links)
- On the convexity of the multiplicative version of Karmarkar's potential function (Q1111466) (← links)
- A linear-time algorithm for linear \(L_ 1\) approximation of points (Q1115605) (← links)
- Notes on oriented depth-first search and longest paths (Q1118610) (← links)
- Finding connected components of an intersection graph of squares in the Euclidean plane (Q1169296) (← links)
- Combination of decoding of error-correcting codes and equalization for channels with intersymbol interference (Q1180159) (← links)
- Enhanced \(A^{*}\) algorithms for multiple alignments: optimal alignments for several sequences and k-opt approximate alignments for large cases (Q1274606) (← links)
- Restriction, terms and nonlinearity of Boolean functions (Q1575850) (← links)
- FPT algorithms exploiting carving decomposition for Eulerian orientations and ice-type models (Q1641125) (← links)
- Parametric multiroute flow and its application to multilink-attack network (Q1751172) (← links)
- Quantum versus deterministic counter automata (Q1779306) (← links)
- One-way probabilistic reversible and quantum one-counter automata. (Q1853577) (← links)
- A new unifying heuristic algorithm for the undirected minimum cut problems using minimum range cut algorithms (Q1917270) (← links)
- Relating differential distribution tables to other properties of substitution boxes (Q1970570) (← links)
- FPT algorithms to enumerate and count acyclic and totally cyclic orientations (Q2132402) (← links)
- On combinatorial structures of line drawings of polyhedra (Q2266021) (← links)
- Efficient hybrid encryption from ID-based encryption (Q2267789) (← links)
- Orthogonal weightet linear \(L_ 1\) and \(L_ \infty\) approximation and applications (Q2367406) (← links)
- An approach for stream ciphers design based on joint computing over random and secret data (Q2390944) (← links)
- Generic cryptographic weakness of \(k\)-normal Boolean functions in certain stream ciphers and cryptanalysis of Grain-128 (Q2434149) (← links)
- Generating facets for the cut polytope of a graph by triangular elimination (Q2465651) (← links)
- (Q2707409) (← links)
- (Q2707435) (← links)
- Binary multilevel convolutional codes with unequal error protection capabilities (Q2714788) (← links)
- (Q2724458) (← links)
- (Q2724577) (← links)
- (Q2724598) (← links)
- (Q2741391) (← links)
- (Q2742597) (← links)
- (Q2742648) (← links)
- (Q2743802) (← links)
- (Q2766854) (← links)
- Proximity and Motion Planning on ℓ1-Rigid Planar Periodic Graphs (Q2868522) (← links)
- Reducing the Spread of Damage of Key Exposures in Key-Insulated Encryption (Q2876992) (← links)