The following pages link to Yannis C. Stamatiou (Q215099):
Displaying 37 items.
- On a new edge function on complete weighted graphs and its application for locating Hamiltonian cycles of small weight (Q315484) (← links)
- (Q870118) (redirect page) (← links)
- Applying evolutionary computation methods for the cryptanalysis of Feistel ciphers (Q870119) (← links)
- Evolutionary computation based cryptanalysis: a first study (Q999604) (← links)
- On parallel partial solutions and approximation schemes for local consistency in networks of constraints (Q1579084) (← links)
- A note on the non-colorability threshold of a random graph (Q1978060) (← links)
- On the derivation of a closed-form expression for the solutions of a subclass of generalized Abel differential equations (Q2247854) (← links)
- Assessing the effectiveness of artificial neural networks on problems related to elliptic curve cryptography (Q2470209) (← links)
- The unsatisfiability threshold revisited (Q2643297) (← links)
- (Q2741367) (← links)
- (Q2741515) (← links)
- Locating Information with Uncertainty in Fully Interconnected Networks with Applications to World Wide Web Information Retrieval (Q2765224) (← links)
- (Q2766883) (← links)
- A Method for Creating Private and Anonymous Digital Territories Using Attribute-Based Credential Technologies (Q2790441) (← links)
- Partiality and approximation schemes for local consistency in networks of constraints (Q2956684) (← links)
- On the equivalence between random graph models (Q3078467) (← links)
- (Q3395974) (← links)
- An Interactive, Similarity Increasing Algorithm for Random Strings with Applications to Key Agreement in ad hoc Networks (Q3560190) (← links)
- (Q3597153) (← links)
- (Q3597154) (← links)
- Approximating the unsatisfiability threshold of random formulas (Q4240602) (← links)
- (Q4411396) (← links)
- (Q4415039) (← links)
- (Q4425717) (← links)
- Locating information with uncertainty in fully interconnected networks: The case of nondistributed memory (Q4432766) (← links)
- Secure information hiding based on computationally intractable problems (Q4440673) (← links)
- (Q4448374) (← links)
- Bounding the unsatisfiability threshold of random 3-SAT (Q4511484) (← links)
- An identity derived from the solution of a class of differential equations for the evolution of a key agreement protocol (Q4648988) (← links)
- Upper Bounds and Asymptotics for the <i>q</i>‐Binomial Coefficients (Q4784734) (← links)
- The Ubiquitous Lambert Function and its Classes in Sciences and Engineering (Q5359545) (← links)
- An asymptotic expansion for the<i>q</i>-binomial series using singularity analysis for generating functions (Q5421198) (← links)
- Progress in Cryptology - INDOCRYPT 2003 (Q5429137) (← links)
- Generating Prime Order Elliptic Curves: Difficulties and Efficiency Considerations (Q5450906) (← links)
- Information Security (Q5493158) (← links)
- Random constraint satisfaction: A more accurate picture (Q5949018) (← links)
- On the efficient generation of prime-order elliptic curves (Q5962222) (← links)
