Thomas Pajor

Signal Processing · 2015

A researcher in the Science corpus: 1 paper; trusts 3 researchers and is trusted by 0 researchers here, as inferred from the citation graph.

Subfields

Whom Thomas Pajor trusts

Their strongest outbound trust, strongest first, inferred from their citations.

  1. Dominik Schultes (in Signal Processing)
  2. Peter Sanders (in Signal Processing)
  3. Mikkel Thorup (in Computational Theory and Mathematics)

Papers from Thomas Pajor's perspective

Ordered by how strongly the researchers Thomas Pajor trusts endorse each paper. Same corpus, a different order for every researcher.

  1. Reach-Based Routing: A New Approach to Shortest Path Algorithms Optimized for Road Networks (ALENEX/ANALC)
  2. A Formal Basis for the Heuristic Determination of Minimum Cost Paths
  3. Combining hierarchical and goal-directed speed-up techniques for dijkstra's algorithm
  4. Highway Hierarchies Hasten Exact Shortest Path Queries (Embedded Systems and Applications)
  5. PHAST: Hardware-Accelerated Shortest Path Trees
  6. Heuristic shortest path algorithms for transportation applications: State of the art (Computers & Operations Research)
  7. Distance labeling in graphs (ACM-SIAM Symposium on Discrete Algorithms)
  8. Reachability and distance queries via 2-hop labels
  9. ON A ROUTING PROBLEM (Probability in the engineering and informational sciences (Print))
  10. Compact oracles for reachability and approximate distances in planar digraphs (Proceedings IEEE International Conference on Cluster Computing)

Their papers