Search results for "Dijkstra"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
18	Tae-Hwan Kim, In-Cheol Park	Implementation of a High-Throughput and Area-Efficient MIMO Detector Based on Modified Dijkstra's Search.	GLOBECOM	2009	DBLP DOI BibTeX RDF
18	Fuhao Zhang, Jiping Liu	An Algorithm of Shortest Path Based on Dijkstra for Huge Data.	FSKD (4)	2009	DBLP DOI BibTeX RDF
18	Konstantinos Nikas, Nikos Anastopoulos, Georgios I. Goumas, Nectarios Koziris	Employing Transactional Memory and Helper Threads to Speedup Dijkstra's Algorithm.	ICPP	2009	DBLP DOI BibTeX RDF
18	M. Gloria Sánchez-Torrubia, Carmen Torres-Blanc, M. A. López-Martínez	PathFinder: A Visualization eMathTeacher for Actively Learning Dijkstra's Algorithm.	PVW	2008	DBLP DOI BibTeX RDF
18	Jaime Bohórquez V.	Intuitionistic Logic according to Dijkstra's Calculus of Equational Deduction.	Notre Dame J. Formal Log.	2008	DBLP DOI BibTeX RDF
18	Alvaro H. Salas	Acerca del Algoritmo de Dijkstra	CoRR	2008	DBLP BibTeX RDF
18	Atsushi Okawado, Ryutaroh Matsumoto, Tomohiko Uyematsu	Near ML detection using Dijkstra's algorithm with bounded list size over MIMO channels	CoRR	2008	DBLP BibTeX RDF
18	Atsushi Okawado, Ryutaroh Matsumoto, Tomohiko Uyematsu	Near ML detection using Dijkstra's algorithm with bounded list size over MIMO channels.	ISIT	2008	DBLP DOI BibTeX RDF
18	Youming Li, Ardian N. Greca, James Harris	On Dijkstra's Algorithm for Deadlock Detection.	SCSS (2)	2008	DBLP DOI BibTeX RDF
18	Ahmed Hatem, Amin Nassar	Modified Dijkstra-like search algorithm for English to Arabic machine translation system.	EAMT	2008	DBLP BibTeX RDF
18	Jayasri Banerjee, Anup Kumar Bandyopadhyay, Ajit Kumar Mandal	Some investigations on deadlock freedom issues of a cyclically connected system using Dijkstra's weakest precondition calculus.	ACM SIGPLAN Notices	2007	DBLP DOI BibTeX RDF	weakest precondition, program specification, deadlock freedom, program correctness
18	M. H. Xu, Y. Q. Liu, Q. L. Huang, Y. X. Zhang, G. F. Luan	An improved Dijkstra's shortest path algorithm for sparse network.	Appl. Math. Comput.	2007	DBLP DOI BibTeX RDF
18	Camilo Rocha, José Meseguer 0001	A Rewriting Decision Procedure for Dijkstra-Scholten's Syllogistic Logic with Complements.	Rev. Colomb. de Computación	2007	DBLP DOI BibTeX RDF
18	Markus Myllylä, Markku J. Juntti, Joseph R. Cavallaro	A List Sphere Detector based on Dijkstra's Algorithm for MIMO-OFDM Systems.	PIMRC	2007	DBLP DOI BibTeX RDF
18	Hugh Gibbons	Definite Descriptions and Dijkstra's Odd Powers of Odd Integers Problem.	MFCSIT	2006	DBLP DOI BibTeX RDF
18	Daniel C. Lee 0001	Proof of a modified Dijkstra's algorithm for computing shortest bundle delay in networks with deterministically time-varying links.	IEEE Commun. Lett.	2006	DBLP DOI BibTeX RDF
18	Jon Sneyers, Tom Schrijvers, Bart Demoen	Dijkstra's Algorithm with Fibonacci Heaps: An Executable Description in CHR.	WLP	2006	DBLP BibTeX RDF
18	Rolf H. Möhring, Heiko Schilling, Birk Schütz, Dorothea Wagner, Thomas Willhalm	Partitioning Graphs to Speed Up Dijkstra's Algorithm.	WEA	2005	DBLP DOI BibTeX RDF
18	Domenico Cantone, Simone Faro	Two-Levels-Greedy: a generalization of Dijkstra's shortest path algorithm.	Electron. Notes Discret. Math.	2004	DBLP DOI BibTeX RDF
18	Domenico Cantone, Simone Faro	Two-Levels-Greedy: A Generalized of Dijkstra's Shortest Path Algorithm.	CTW	2004	DBLP BibTeX RDF
18	Friedrich L. Bauer, Manfred Broy	Edsger W. Dijkstra - Acta Informatica and Marktoberdorf.	Acta Informatica	2003	DBLP DOI BibTeX RDF
18	Yusuke Fujita, Yoshihiko Nakamura, Zvi Shiller	Dual Dijkstra search for paths with different topologies.	ICRA	2003	DBLP DOI BibTeX RDF
18	G. Alan Creak	Edsger W. Dijkstra.	ACM SIGPLAN Notices	2002	DBLP DOI BibTeX RDF
18		Obituary for Ole-Johan Dahl (1931-2002), Edsger Wybe Dijkstra (1930-2002), and Kristen Nygaard (1926-2002).	IEEE Trans. Software Eng.	2002	DBLP DOI BibTeX RDF
18	Krzysztof R. Apt	Edsger Wybe Dijkstra (1930 - 2002): A Portrait of a Genius	CoRR	2002	DBLP BibTeX RDF
18	Amir R. Soltani, Hissam Tawfik, John Yannis Goulermas, Terrence Fernando	Path planning in construction sites: performance evaluation of the Dijkstra, A*, and GA search algorithms.	Adv. Eng. Informatics	2002	DBLP DOI BibTeX RDF
18	George M. Adelson-Velsky, Eugene Levner	Project Scheduling in AND-OR Graphs: A Generalization of Dijkstra's Algorithm.	Math. Oper. Res.	2002	DBLP DOI BibTeX RDF
18	Peter P. Chen	From Goto-less to Structured Programming: The Legacy of Edsger W. Dijkstra.	IEEE Softw.	2002	DBLP DOI BibTeX RDF
18	Robert S. Boyer, W. H. J. Feijen, David Gries, C. A. R. Hoare, Jayadev Misra, J. Moore, H. Richards	In memoriam: Edsger W. Dijkstra 1930-2002.	Commun. ACM	2002	DBLP DOI BibTeX RDF
18	Manfred Broy	Ole-John Dahl 1931-2002, Kristen Nygaard 1926-2002, Edsger Wyve Dijkstra 1930-2002 (Historische Notizen).	Inform. Spektrum	2002	DBLP DOI BibTeX RDF
18		In memoriam: Edsgar Dijkstra (1930-2002).	Ubiquity	2002	DBLP DOI BibTeX RDF
18	Jayadev Misra	A walk over the shortest path: Dijkstra's Algorithm viewed as fixed-point computation.	Inf. Process. Lett.	2001	DBLP DOI BibTeX RDF
18	Shlomi Dolev, Ted Herman	Dijkstra's Self-Stabilizing Algorithm in Unsupportive Environments	CoRR	2001	DBLP BibTeX RDF
18	A. S. Nepomniaschaya, Maria A. Dvoskina	A Simple Implementation of Dijkstra's Shortest Path Algorithm on Associative Parallel Processors.	Fundam. Informaticae	2000	DBLP DOI BibTeX RDF
18	Frank Schulz 0001, Dorothea Wagner, Karsten Weihe	Dijkstra's Algorithm On-Line: An Empirical Case Study from Public Railroad Transport.	ACM J. Exp. Algorithmics	2000	DBLP DOI BibTeX RDF
18	Masato Noto, Hiroaki Sato	A method for the shortest path search by extended Dijkstra algorithm.	SMC	2000	DBLP DOI BibTeX RDF
18	Jerzy Brzezinski, Dariusz Wawrzyniak	Consistency Requirements of Distributed Shared Memory for Dijkstra's Mutual Exclusion Algorithm.	ICDCS	2000	DBLP DOI BibTeX RDF	distributed shared memory, mutual exclusion, consistency models
18	Rudolf Berghammer	Combining Relational Calculus and the Dijkstra-Gries Method for Deriving Relational Programs.	Inf. Sci.	1999	DBLP DOI BibTeX RDF
18	Michael Barbehenn	A Note on the Complexity of Dijkstra's Algorithm for Graphs with Weighted Vertices.	IEEE Trans. Computers	1998	DBLP DOI BibTeX RDF	data structures, Analysis of algorithms, combinatorial problems
18	Andrea Borella, Franco Chiaraluce	Multicast routing in BMSNs through greedy, weighted greedy, and Dijkstra algorithms: a comparative analysis.	SYBEN	1998	DBLP DOI BibTeX RDF
18	Ewa Madalinska-Bugaj	How to Solve Qualification and Ramification Using Dijkstra's Semantics for Programming Languages.	AI*IA	1997	DBLP DOI BibTeX RDF
18	A. S. Nepomniaschaya	Representations of the Prim-Dijkstra Algorithm on Associative Parallel Processors.	Parcella	1996	DBLP BibTeX RDF
18	Rudolf Berghammer, Birgit Elbl, Ulf R. Schmerl	Formalizing Dijkstra's Predicate Transformer wp in Weak Second-Order Logic.	Theor. Comput. Sci.	1995	DBLP DOI BibTeX RDF
18	Jeffrey L. Solka, James C. Perry, Brian R. Poellinger, George W. Rogers	Fast computation of optimal paths using a parallel Dijkstra algorithm with embedded constraints.	Neurocomputing	1995	DBLP DOI BibTeX RDF
18	Wim H. Hesselink	Angelic Termination in Dijkstra's Calculus.	MPC	1995	DBLP DOI BibTeX RDF
18	Witold Lukaszewicz, Ewa Madalinska-Bugaj	Reasoning about Action and Change Using Dijkstra's Semantics for Programming Languages: Preliminary Report.	IJCAI	1995	DBLP BibTeX RDF
18	Richard V. Helgason, Jeffery L. Kennington, B. Douglas Stewart	The one-to-one shortest-path problem: An empirical analysis with the two-tree Dijkstra algorithm.	Comput. Optim. Appl.	1993	DBLP DOI BibTeX RDF
18	Robert B. Terwilliger	An Example of Process Verification: The Gries/Dijkstra Design Method.	ACM SIGSOFT Softw. Eng. Notes	1993	DBLP BibTeX RDF
18	Robert B. Terwilliger	Toward tools to support the Gries/Dijkstra design process.	ACM SIGSOFT Softw. Eng. Notes	1993	DBLP DOI BibTeX RDF
18	Frank Ng, Gregory Butler	Specialised Theorem-Proving in an Intelligent Tutoring System for the Dijkstra-Gries Programming Methodology.	ICCI	1993	DBLP BibTeX RDF
18	Charles J. Alpert, T. C. Hu, Jen-Hsin Huang, Andrew B. Kahng	A Direct Combination of the Prim and Dijkstra Constructions for Improved Performance-driven Global Routing.	ISCAS	1993	DBLP BibTeX RDF
18	D. Ince	Beauty is our business - a birthday salute to Edsger Dijkstra (Springer-Verlag texts and monographs in Computer Science) : W H J Feijen, A J M van Gasteren, D Gries and J Misra (eds) Springer-Verlag (1990) 453 pp £35.00 ISBN 0 994 40520 2.	Inf. Softw. Technol.	1992	DBLP DOI BibTeX RDF
18	Antonio Cau, Ruurd Kuiper 0001, Willem-Paul de Roever	Formalising Dijkstra's Development Strategy within Stark's Formalism.	Refine	1992	DBLP DOI BibTeX RDF
18	Robert B. Terwilliger	Simulating the Gries/Dijkstra design process.	KBSE	1992	DBLP DOI BibTeX RDF
18	J. A. Rose	A Method of Programming, by Edger W. Dijkstra & W.H.J. Feijen Addison-Wesley Publishing Company, Wokingham, England, 188 pages including index, 1988 (£15.95).	Robotica	1989	DBLP DOI BibTeX RDF
18	Greg Nelson	A Generalization of Dijkstra's Calculus.	ACM Trans. Program. Lang. Syst.	1989	DBLP DOI BibTeX RDF
18	Fred B. Schneider, Leslie Lamport	On E. W. Dijkstra's position paper on "fairness: ".	ACM SIGSOFT Softw. Eng. Notes	1988	DBLP DOI BibTeX RDF
18	Paul A. Bailes	Static Checking of Variable Handling in Dijkstra's Guarded Commands Language.	Comput. Lang.	1986	DBLP DOI BibTeX RDF
18	Jean Bovet	Une amelioration de la methode de Dijkstra pour la recherche d'un plus court chemin dans un reseau.	Discret. Appl. Math.	1986	DBLP DOI BibTeX RDF
18	Ulrich Derigs	An Efficient Dijkstra-like Labeling Method for Computing Shortest Odd/Even Paths.	Inf. Process. Lett.	1985	DBLP DOI BibTeX RDF
18	Kohei Noshita	A Theorem on the Expected Complexity of Dijkstra's Shortest Path Algorithm.	J. Algorithms	1985	DBLP DOI BibTeX RDF
18	Edward Reid	Fighting the disease: more comments after Dijkstra and Tompking.	ACM SIGPLAN Notices	1983	DBLP DOI BibTeX RDF
18	Robert B. K. Dewar, Susan M. Merritt, Micha Sharir	Some Modified Algorithms for Dijkstra's Longest Upsequence Problem.	Acta Informatica	1982	DBLP DOI BibTeX RDF
18	Neil D. Jones, Steven S. Muchnick	Complexity of Flow Analysis, Inductive Assertion Synthesis and a Language Due to Dijkstra	FOCS	1980	DBLP DOI BibTeX RDF
18	Haim Kilov	Letter on Parnas' view of Dijkstra vs. deMillo, Lipton and Perlis.	ACM SIGSOFT Softw. Eng. Notes	1979	DBLP DOI BibTeX RDF
18	Kohei Noshita, Etsuo Masuda, Hajime Machida	On the Expected Behaviors of the Dijkstra's Shortest Path Algorithm for Complete Graphs.	Inf. Process. Lett.	1978	DBLP DOI BibTeX RDF
18	H. J. Jeffrey	On Dijkstra's position paper on software reliability.	ACM SIGSOFT Softw. Eng. Notes	1978	DBLP DOI BibTeX RDF
18	David Lorge Parnas	Another view of the Dijkstra-dMLP controversy.	ACM SIGSOFT Softw. Eng. Notes	1978	DBLP DOI BibTeX RDF
18	Roger Van Ghent	Letter on real software, regarding the commentary by Dijkstra and the reply by DeMillo, Lipton and Perlis.	ACM SIGSOFT Softw. Eng. Notes	1978	DBLP DOI BibTeX RDF
18	Donald E. Knuth	A Generalization of Dijkstra's Algorithm.	Inf. Process. Lett.	1977	DBLP DOI BibTeX RDF
18	Leslie Lamport	A New Solution of Dijkstra's Concurrent Programming Problem.	Commun. ACM	1974	DBLP DOI BibTeX RDF
18	F. R. A. Hopgood	"Structured Programming, " by O.-J. Dahl, E. W. Dijkstra and C. A. R. Hoare (Book Review).	Int. J. Man Mach. Stud.	1974	DBLP DOI BibTeX RDF
18	S. Rao Kosaraju	Limitations of Dijkstra's Semaphore Primitives and Petri Nets.	SOSP	1973	DBLP DOI BibTeX RDF
18	Hendrik Vantilborgh, Axel van Lamsweerde	On an Extension of Dijkstra's Semaphore Primitives.	Inf. Process. Lett.	1972	DBLP DOI BibTeX RDF
18	Robert J. Du Works, Stephen W. Smoliar	The arrogant programmer: Dijkstra and Wegner considered harmful.	ACM SIGCSE Bull.	1972	DBLP DOI BibTeX RDF
18	Murray A. Eisenberg, Michael R. McGuire	Further Comments on Dijkstra's Concurrent Programming Control Problem.	Commun. ACM	1972	DBLP DOI BibTeX RDF
18	H. James Gawlik	MIRFAC: a reply to Professor Dijkstra.	Commun. ACM	1964	DBLP DOI BibTeX RDF
10	Stéphanie Vanhove, Veerle Fack	Applications of graph algorithms in GIS.	ACM SIGSPATIAL Special	2010	DBLP DOI BibTeX RDF
10	Frédéric Vogels, Bart Jacobs 0002, Frank Piessens	A machine-checked soundness proof for an efficient verification condition generator.	SAC	2010	DBLP DOI BibTeX RDF	soundness proof, verification conditions
10	Yi-Ju Ho, Jing-Sin Liu	Simulated annealing based algorithm for smooth robot path planning with different kinematic constraints.	SAC	2010	DBLP DOI BibTeX RDF	curvature constraint, smooth path planning, optimization, simulated annealing, shortest path, Voronoi diagram, Bezier curve
10	Abderrahmane Lakas, Moumena Chaqfeh	A novel method for reducing road traffic congestion using vehicular communication.	IWCMC	2010	DBLP DOI BibTeX RDF	geocast protocol, road traffic congestion, VANET, IVC
10	Moshe Babaioff, Robert D. Kleinberg, Aleksandrs Slivkins	Truthful mechanisms with implicit payment computation.	EC	2010	DBLP DOI BibTeX RDF	single-parameter mechanism design, truthful auctions, multi-armed bandits
10	Sashka Davis, Russell Impagliazzo	Models of Greedy Algorithms for Graph Problems.	Algorithmica	2009	DBLP DOI BibTeX RDF	Graph optimization problems, Greedy algorithms, Priority algorithms
10	Edward P. F. Chan, Yaya Yang	Shortest Path Tree Computation in Dynamic Graphs.	IEEE Trans. Computers	2009	DBLP DOI BibTeX RDF
10	Anup Kumar Bandyopadhyay	Fairness and conspiracy concepts in concurrent systems.	ACM SIGSOFT Softw. Eng. Notes	2009	DBLP DOI BibTeX RDF	conspiracy, fairness, concurrent systems, starvation
10	Christoph Lenzen 0001, Jukka Suomela, Roger Wattenhofer	Local Algorithms: Self-stabilization on Speed.	SSS	2009	DBLP DOI BibTeX RDF
10	K. Rustan M. Leino, Rosemary Monahan	Reasoning about comprehensions with first-order SMT solvers.	SAC	2009	DBLP DOI BibTeX RDF	Spec#, matching triggers, quantifiers, SMT solvers
10	Matthias Kirschner, Philipp Schengbier, Tobias Tscheuschner	Speed-Up Techniques for the Selfish Step Algorithm in Network Congestion Games.	SEA	2009	DBLP DOI BibTeX RDF	selfish step algorithm, network congestion games, game theory, shortest paths, Nash equilibria, speed-up techniques
10	Daniel Delling, Dorothea Wagner	Pareto Paths with SHARC.	SEA	2009	DBLP DOI BibTeX RDF
10	Quansheng Guan, Quanlong Ding, Shengming Jiang	A minimum energy path topology control algorithm for wireless multihop networks.	IWCMC	2009	DBLP DOI BibTeX RDF	minimum energy path, topology control, energy-saving
10	Andrew Tsui, Zoë J. Wood	Energetic Path Finding across Massive Terrain Data.	ISVC (2)	2009	DBLP DOI BibTeX RDF
10	Dagmar Kainmueller, Hans Lamecker, Heiko Seim, Max Zinser, Stefan Zachow	Automatic Extraction of Mandibular Nerve and Bone from Cone-Beam CT Data.	MICCAI (1)	2009	DBLP DOI BibTeX RDF
10	Daniel Delling, Peter Sanders 0001, Dominik Schultes, Dorothea Wagner	Engineering Route Planning Algorithms.	Algorithmics of Large and Complex Networks	2009	DBLP DOI BibTeX RDF
10	Ugur Demiryurek, Farnoush Banaei Kashani, Cyrus Shahabi	Efficient Continuous Nearest Neighbor Query in Spatial Networks Using Euclidean Restriction.	SSTD	2009	DBLP DOI BibTeX RDF
10	Reinhard Bauer, Gianlorenzo D'Angelo, Daniel Delling, Dorothea Wagner	The Shortcut Problem - Complexity and Approximation.	SOFSEM	2009	DBLP DOI BibTeX RDF
10	Jason J. Holdsworth, Siu Man Lui	GPS-enabled mobiles for learning shortest paths: a pilot study.	FDG	2009	DBLP DOI BibTeX RDF	GPS-enabled mobile phones, mobile learning, problem-based learning, shortest paths algorithm
10	Anand Rangarajan 0001, Karthik S. Gurumoorthy	A Schrödinger Wave Equation Approach to the Eikonal Equation: Application to Image Analysis.	EMMCVPR	2009	DBLP DOI BibTeX RDF
10	Jason MacGregor, Steve Leung	Pathfinding Strategy for Multiple Non-Playing Characters in 2.5 D Game Worlds.	Edutainment	2009	DBLP DOI BibTeX RDF	Pathfinding Algorithms, Game AI
10	Eliécer Gutiérrez, Andrés L. Medaglia	Labeling algorithm for the shortest path problem with turn prohibitions with application to large-scale road networks.	Ann. Oper. Res.	2008	DBLP DOI BibTeX RDF	Turn prohibitions, Geographic information systems (GIS), Combinatorial optimization, Road networks, Shortest path problem
10	Haim Kaplan, Robert Endre Tarjan	Thin heaps, thick heaps.	ACM Trans. Algorithms	2008	DBLP DOI BibTeX RDF	binomial queue, decrease key operation, fibonacci heap, melding, thick heap, thin heap, Data structure, priority queue, heap