Dijkstra's algorithm revisited: the dynamic programming connexion
Moshe Sniedovich (2006)
Control and Cybernetics
Similarity:
Displaying similar documents to “On Certain Approaches for Analysis and Design of Cryptographic Techniques”
Dijkstra's algorithm revisited: the dynamic programming connexion
Hybrid search for optimum in a small implicitly defined region
A. Žilinskas (2004)
Control and Cybernetics
Similarity:
Coleman integration versus Schneider integration on semistable curves.
de Shalit, Ehud (2007)
Documenta Mathematica
Similarity:
A possibilistic view on set and multiset comparison
Antoon Bronselaer, Axel Hallez, Guy De Tré (2009)
Control and Cybernetics
Similarity:
Interface and mixed boundary value problems on -dimensional polyhedral domains.
Bacuta, C., Mazzucato, A.L., Nistor, V., Zikatanov, L. (2010)
Documenta Mathematica
Similarity:
Second order freeness and fluctuations of random matrices. III: Higher order freeness and free cumulants.
Collins, Benoît, Mingo, James A., Śniady, Piotr, Speicher, Roland (2007)
Documenta Mathematica
Similarity:
Almost proper GIT-stacks and discriminant avoidance.
Starr, Jason, De Jong, Johan (2010)
Documenta Mathematica
Similarity:
Efficient, proximity-preserving node overlap removal.
Gansner, Emden, Hu, Yifan (2010)
Journal of Graph Algorithms and Applications
Similarity:
Faces of generalized permutohedra.
Postnikov, Alex, Reiner, Victor, Williams, Lauren (2008)
Documenta Mathematica
Similarity:
A note on the von Neumann algebra underlying some universal compact quantum groups.
De Commer, Kenny (2009)
Banach Journal of Mathematical Analysis [electronic only]
Similarity:
Density in approximation theory.
Pinkus, Allan (2005)
Surveys in Approximation Theory (SAT)[electronic only]
Similarity: