Search results for "paths"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
29	Donatella Merlini, Renzo Sprugnoli, M. Cecilia Verri	The Area Determined by Underdiagonal Lattice Paths.	CAAP	1996	DBLP DOI BibTeX RDF	underdiagonal lattice paths, average area, first passage decomposition, generating functions, context-free grammars
29	Joseph S. B. Mitchell, Christos H. Papadimitriou	The Weighted Region Problem: Finding Shortest Paths Through a Weighted Planar Subdivision.	J. ACM	1991	DBLP DOI BibTeX RDF	terrain navigation, weighted distance functions, shortest paths, Voronoi diagrams, Dijkstra's algorithm
29	Shuo Zhou, Bo Yao, Hongyu Chen, Yi Zhu 0002, Chung-Kuan Cheng, Michael D. Hutton	Efficient static timing analysis using a unified framework for false paths and multi-cycle paths.	ASP-DAC	2006	DBLP DOI BibTeX RDF	biclique covering, false subgraphs, multi-cycle subgraphs, static timing analysis, time shifting
29	Liam Roditty, Uri Zwick	Replacement Paths and k Simple Shortest Paths in Unweighted Directed Graphs.	ICALP	2005	DBLP DOI BibTeX RDF
29	Manish Sharma, Janak H. Patel	What Does Robust Testing a Subset of Paths, Tell us about the Untested Paths in the Circuit?	VTS	2004	DBLP DOI BibTeX RDF
28	John Hershberger 0001, Subhash Suri, Amit M. Bhosle	On the difficulty of some shortest path problems.	ACM Trans. Algorithms	2007	DBLP DOI BibTeX RDF	k shortest simple paths, replacement path, lower bound, shortest path
28	Julia Chuzhoy, Venkatesan Guruswami, Sanjeev Khanna, Kunal Talwar	Hardness of routing with congestion in directed graphs.	STOC	2007	DBLP DOI BibTeX RDF	all-or-nothing flow, hardness of approximation, multicommodity flow, edge-disjoint paths, integrality gap, congestion minimization
28	Gábor Rétvári, József Bíró, Tibor Cinkler	On Improving the Accuracy of OSPF Traffic Engineering.	Networking	2006	DBLP DOI BibTeX RDF	linear programming, shortest paths, traffic engineering, OSPF
28	Unmil Karadkar, Luis Francisco-Revilla, Richard Furuta, Frank M. Shipman III, Avital Arora, Suvendu Dash, Pratik Dave, Emily Luke	Metadocuments supporting digital library information discovery.	Int. J. Digit. Libr.	2004	DBLP DOI BibTeX RDF	Waldens Paths, Metadocuments, Digital library services, Hypertext, Path maintenance
28	David Wessels, Jon C. Muzio	The dangers of simplistic delay models.	J. Electron. Test.	1996	DBLP DOI BibTeX RDF	critical paths, Delay models, path sensitization, circuit delays
28	Ken-ichi Kawarabayashi, Bruce A. Reed	A nearly linear time algorithm for the half integral parity disjoint paths packing problem.	SODA	2009	DBLP DOI BibTeX RDF
28	Yuan Tian 0019, Ken C. K. Lee, Wang-Chien Lee	Monitoring minimum cost paths on road networks.	GIS	2009	DBLP DOI BibTeX RDF	path search and updates, location-based services, road networks, monitoring system
28	Sourabh Bhattacharya, Rafael Murrieta-Cid, Seth Hutchinson 0001	Optimal Paths for Landmark-Based Navigation by Differential-Drive Vehicles With Field-of-View Constraints.	IEEE Trans. Robotics	2007	DBLP DOI BibTeX RDF
28	Torsten Tholey	Solving the 2-Disjoint Paths Problem in Nearly Linear Time.	Theory Comput. Syst.	2006	DBLP DOI BibTeX RDF
28	Sangman Moh, Sang Jun Lee, Chansu Yu	Tree-Based Multicast Meshes with Variable Density of Redundant Paths on Mobile Ad Hoc Networks.	WASA	2006	DBLP DOI BibTeX RDF
28	Yigal Bejerano, Yuri Breitbart, Ariel Orda, Rajeev Rastogi, Alexander Sprintson	Algorithms for computing QoS paths with restoration.	IEEE/ACM Trans. Netw.	2005	DBLP DOI BibTeX RDF	restricted shortest path, approximation algorithms, QoS routing, restoration
28	Wankang Zhao, William C. Kreahling, David B. Whalley, Christopher A. Healy, Frank Mueller 0001	Improving WCET by Optimizing Worst-Case Paths.	IEEE Real-Time and Embedded Technology and Applications Symposium	2005	DBLP DOI BibTeX RDF
28	Yinzhen Li, Ruichun He, Linzhong Liu, Yaohuang Guo	Genetic Algorithms for Dissimilar Shortest Paths Based on Optimal Fuzzy Dissimilar Measure and Applications.	FSKD (1)	2005	DBLP DOI BibTeX RDF
28	Gábor Rétvári, Róbert Szabó, József Bíró	On the Representability of Arbitrary Path Sets as Shortest Paths: Theory, Algorithms, and Complexity.	NETWORKING	2004	DBLP DOI BibTeX RDF	routing, linear programming, Traffic engineering, OSPF
28	Hiroshi Mamitsuka, Yasushi Okuno	A Hierarchical Mixture of Markov Models for Finding Biologically Active Metabolic Paths Using Gene Expression and Protein Classes.	CSB	2004	DBLP DOI BibTeX RDF
28	Yuanyuan Yang 0001, Jianchao Wang	Routing Permutations on Optical Baseline Networks with Node-Disjoint Paths.	ICPADS	2004	DBLP DOI BibTeX RDF
28	Torsten Tholey	Solving the 2-Disjoint Paths Problem in Nearly Linear Time.	STACS	2004	DBLP DOI BibTeX RDF
28	Gilles Pokam, François Bodin	An Offline Approach for Whole-Program Paths Analysis Using Suffix Arrays.	LCPC	2004	DBLP DOI BibTeX RDF
28	Ann Nowé, Katja Verbeeck, Peter Vrancx	Multi-type Ant Colony: The Edge Disjoint Paths Problem.	ANTS Workshop	2004	DBLP DOI BibTeX RDF
28	Ian J. Hayes	Programs as Paths: An Approach to Timing Constraint Analysis.	ICFEM	2003	DBLP DOI BibTeX RDF
28	Sergei Bespamyatnikh	Computing homotopic shortest paths in the plane.	SODA	2003	DBLP BibTeX RDF
28	Scott Seongwook Lee, Mario Gerla	Fault Tolerance and Load Balancing in QoS Provisioning with Multiple MPLS Paths.	IWQoS	2001	DBLP DOI BibTeX RDF
28	Thomas Erlebach, Klaus Jansen	Implementation of Approximation Algorithms for Weighted and Unweighted Edge-Disjoint Paths in Bidirected Trees.	WAE	2000	DBLP DOI BibTeX RDF
28	Luisa Gargano, Pavol Hell, Stephane Perennes	Colouring Paths in Directed Symmetric Trees with Applications to WDM Routing.	ICALP	1997	DBLP DOI BibTeX RDF
28	Timothy M. Burks, Karem A. Sakallah, Trevor N. Mudge	Critical paths in circuits with level-sensitive latches.	IEEE Trans. Very Large Scale Integr. Syst.	1995	DBLP DOI BibTeX RDF
26	Kranthi K. Mamidisetty, Minlan Duan, Shivakumar Sastry, P. S. Sastry	Multipath Dissemination in Regular Mesh Topologies.	IEEE Trans. Parallel Distributed Syst.	2009	DBLP DOI BibTeX RDF
26	Gerold Schneider, Kaarel Kaljurand, Fabio Rinaldi 0001	Detecting Protein-Protein Interactions in Biomedical Texts Using a Parser and Linguistic Resources.	CICLing	2009	DBLP DOI BibTeX RDF
26	Xing Jin, Wanqing Tu, S.-H. Gary Chan	Traceroute-Based Topology Inference without Network Coordinate Estimation.	ICC	2008	DBLP DOI BibTeX RDF
26	Gábor Rétvári, József Bíró, Tibor Cinkler	On shortest path representation.	IEEE/ACM Trans. Netw.	2007	DBLP DOI BibTeX RDF	linear programming, traffic engineering, shortest path routing
26	Jianxi Fan, Xiaola Lin, Xiaohua Jia	Optimal Path Embedding in Crossed Cubes.	IEEE Trans. Parallel Distributed Syst.	2005	DBLP DOI BibTeX RDF	optimal embedding, interconnection network, graph embedding, Crossed cube, parallel computing system
26	Xiang Lu, Zhuo Li 0001, Wangqi Qiu, D. M. H. Walker, Weiping Shi	Longest-path selection for delay test under process variation.	IEEE Trans. Comput. Aided Des. Integr. Circuits Syst.	2005	DBLP DOI BibTeX RDF
26	Matthew Andrews, Antonio Fernández 0001, Ashish Goel, Lisa Zhang	Source routing and scheduling in packet networks.	J. ACM	2005	DBLP DOI BibTeX RDF	Adversarial queuing theory, packet scheduling, packet routing, end-to-end delay, network stability
26	Kapil Vaswani, Matthew J. Thazhuthaveetil, Y. N. Srikant	A Programmable Hardware Path Profiler.	CGO	2005	DBLP DOI BibTeX RDF
26	David W. Griffith, SuKyoung Lee	Dynamic Expansion of M : N Protection Groups in GMPLS Optical Networks.	ICPP Workshops	2002	DBLP DOI BibTeX RDF
26	Shmuel Zaks	Duality in ATM Layout Problems.	CIAC	2000	DBLP DOI BibTeX RDF
26	Mary Lou Soffa	Tutorial: Techniques to Improve the Scalability and Precision of Data Flow Analysis.	SAS	1999	DBLP DOI BibTeX RDF
26	Glenn Ammons, James R. Larus	Improving Data-flow Analysis with Path Profiles.	PLDI	1998	DBLP DOI BibTeX RDF
26	Glenn Ammons, James R. Larus	Improving data-flow analysis with path profiles (with retrospective)	Best of PLDI	1998	DBLP DOI BibTeX RDF
26	Rajiv Gupta 0001, David A. Berson, Jesse Zhixi Fang	Path Profile Guided Partial Redundancy Elimination Using Speculation.	ICCL	1998	DBLP DOI BibTeX RDF
26	Sitaran Yadavalli, Irith Pomeranz, Sudhakar M. Reddy	MUSTC-Testing: Multi-Stage-Combinational Test scheduling at the Register-Transfer Level.	VLSI Design	1995	DBLP DOI BibTeX RDF	MUSTC-testing, multi-stage-combinational test, control paths, signal types, module level pre-computed test sets, scheduling, logic testing, integrated circuit testing, combinational circuits, automatic testing, automatic test, register-transfer level, test scheduling, data-paths
26	Shigang Chen, Meongchul Song, Sartaj Sahni	Two techniques for fast computation of constrained shortest paths.	IEEE/ACM Trans. Netw.	2008	DBLP DOI BibTeX RDF	approximation algorithms, QoS routing, constrained shortest paths
26	Francesco Bruera, Serafino Cicerone, Gianlorenzo D'Angelo, Gabriele Di Stefano, Daniele Frigioni	Dynamic Multi-level Overlay Graphs for Shortest Paths.	Math. Comput. Sci.	2008	DBLP DOI BibTeX RDF	Shortest paths algorithms, speed-up techniques
26	Abdelfattah Abouelaoualim, Kinkar Chandra Das, Luérbio Faria, Yannis Manoussakis, Carlos A. J. Martinhon, Rachid Saad	Paths and Trails in Edge-Colored Graphs.	LATIN	2008	DBLP DOI BibTeX RDF	properly edge-colored paths, trails and cycles, connectivity, Edge colored graphs
26	Frederic Kleinermann, Olga De Troyer, Christophe Creelle, Bram Pellens	Adding Semantic Annotations, Navigation Paths and Tour Guides to Existing Virtual Environments.	VSMM	2007	DBLP DOI BibTeX RDF	Virtual Reality, Semantic Annotations, Tour guides, Navigation Paths
26	Matthew Andrews, Lisa Zhang	Logarithmic hardness of the undirected edge-disjoint paths problem.	J. ACM	2006	DBLP DOI BibTeX RDF	Hardness of approximation, undirected graphs, edge-disjoint paths
26	Mathias Géry	Indexing "Reading Paths" for a Structured Information Retrieval at INEX 2006.	INEX	2006	DBLP DOI BibTeX RDF	Reading Paths, Indexation, Web Information Retrieval, Information Propagation, Web structure
26	Hsien-Jone Hsieh, Dyi-Rong Duh	Constructing Node-Disjoint Paths in Enhanced Pyramid Networks.	Asia-Pacific Computer Systems Architecture Conference	2006	DBLP DOI BibTeX RDF	Enhanced pyramid networks, pyramid networks, fault-tolerance, interconnection networks, container, node-disjoint paths, wide diameter
26	Elena Barcucci, Antonio Bernini, Luca Ferrari 0001, Maddalena Poneti	A Distributive Lattice Structure Connecting Dyck Paths, Noncrossing Partitions and 312-avoiding Permutations.	Order	2005	DBLP DOI BibTeX RDF	Dyck paths, noncrossing partitions, 312-avoiding permutations, Bell and Catalan numbers, strong Bruhat order, distributive lattice
26	Haruko Okamura	Two Paths Joining Given Vertices in 2k-Edge-Connected Graphs.	Graphs Comb.	2005	DBLP DOI BibTeX RDF	k-edge-connected, disjoint 2 paths, 2-reducible
26	Luciano Gualà, Guido Proietti	Efficient Truthful Mechanisms for the Single-Source Shortest Paths Tree Problem.	Euro-Par	2005	DBLP DOI BibTeX RDF	Equilibria in Distributed Systems, Single-Source Shortest Paths Tree, Algorithmic Mechanism Design, Selfish Agents, Truthful Mechanisms
26	Matthew Andrews, Lisa Zhang	Hardness of the undirected edge-disjoint paths problem.	STOC	2005	DBLP DOI BibTeX RDF	hardness of approximation, undirected graphs, edge-disjoint paths
26	Camil Demetrescu, Giuseppe F. Italiano	A new approach to dynamic all pairs shortest paths.	J. ACM	2004	DBLP DOI BibTeX RDF	shortest paths, Dynamic graph algorithms
26	Martin Preiß, Josef Stoer	Analysis of infeasible-interior-point paths arising with semidefinite linear complementarity problems.	Math. Program.	2004	DBLP DOI BibTeX RDF	infeasible interior-point-paths, semidefinite programming, linear complementarity problems
26	P. David Stotts, Richard Furuta	Language-theoretic classification of hypermedia paths.	Hypertext	2004	DBLP DOI BibTeX RDF	models, theory, automata, paths
26	Víctor M. Jiménez, Andrés Marzal, Vicente Palazón, Guillermo Peris	Computing the Cyclic Edit Distance for Pattern Classification by Ranking Edit Paths.	SSPR/SPR	2004	DBLP DOI BibTeX RDF	Cyclic strings, cyclic edit distance, Bunke and Bühler algorithm, OCR, string matching, K shortest paths, handwritten text recognition
26	Camil Demetrescu, Giuseppe F. Italiano	A new approach to dynamic all pairs shortest paths.	STOC	2003	DBLP DOI BibTeX RDF	shortest paths, dynamic graph algorithms
26	Roch Guérin, Ariel Orda	Computing shortest paths for any number of hops.	IEEE/ACM Trans. Netw.	2002	DBLP DOI BibTeX RDF	hop-restricted shortest paths, maximum bandwidth, minimum delay, networks, quality-of-service routing
26	Uri Zwick	All pairs shortest paths using bridging sets and rectangular matrix multiplication.	J. ACM	2002	DBLP DOI BibTeX RDF	shortest paths, Matrix multiplication
26	Xiaowei Li 0001, Toshimitsu Masuzawa, Hideo Fujiwara	Strong self-testability for data paths high-level synthesis.	Asian Test Symposium	2000	DBLP DOI BibTeX RDF	self-testability, testability constraints, interconnection assignment, test resources reusability, high level synthesis, high-level synthesis, design for testability, register transfer level, data flow graphs, data paths, register assignment
26	Toshimitsu Masuzawa, Minoru Izutsu, Hiroki Wada, Hideo Fujiwara	Single-control testability of RTL data paths for BIST.	Asian Test Symposium	2000	DBLP DOI BibTeX RDF	single-control testability, RTL data paths, BIST method, response analyzers, DFT method, high fault coverage, low hardware overhead, VLSI, logic testing, built-in self test, integrated circuit testing, design for testability, automatic test pattern generation, ATPG, test pattern generators, delay faults, VLSI circuits, at-speed testing, transition faults, digital integrated circuits, single stuck-at faults, hierarchical test
26	Giuseppe Di Battista, Roberto Tamassia, Luca Vismara	Output-Sensitive Reporting of Disjoint Paths.	Algorithmica	1999	DBLP DOI BibTeX RDF	Triconnected graph, Biconnected graph, Connectivity, Coloring, Graph drawing, Disjoint paths
26	Mikkel Thorup	Undirected Single-Source Shortest Paths with Positive Integer Weights in Linear Time.	J. ACM	1999	DBLP DOI BibTeX RDF	RAM algorithms, shortest paths
26	Uri Zwick	All Pairs Shortest Paths in Weighted Directed Graphs ¾ Exact and Almost Exact Algorithms.	FOCS	1998	DBLP DOI BibTeX RDF	Bridging sets, Randomized algorithms, Shortest paths, Matrix multiplication
26	Chotipat Pornavalai, Goutam Chakraborty, Norio Shiratori	QoS routing algorithms for pre-computed paths.	ICCCN	1997	DBLP DOI BibTeX RDF	pre-computed paths, QoS routing algorithms, multiple QoS constraints, QoSR/sub BF/ on-demand algorithm, flow specification parameters, routing table size reduction, bandwidth, NP-complete problem, telecommunication network routing
26	Qian-Ping Gu, Hisao Tamaki	Routing a Permutation in the Hypercube by Two Sets of Edge-Disjoint Paths.	IPPS	1996	DBLP DOI BibTeX RDF	algorithm, Permutation routing, edge-disjoint paths, circuit-switched networks
26	Apostolos A. Kountouris	Safe and efficient elimination of infeasible execution paths in WCET estimation.	RTCSA	1996	DBLP DOI BibTeX RDF	infeasible execution paths, WCET estimation, time critical systems, R/T programming language, Dynamic Graph representation, real-time systems, SIGNAL, timing properties, Worst Case Execution Time
26	B. Hamdi, Hakim Bederr, Michael Nicolaidis	A tool for automatic generation of self-checking data paths.	VTS	1995	DBLP DOI BibTeX RDF	self-checking data paths, ALUs, shifters, double rail checkers, logic testing, built-in self test, microprocessors, adders, circuit CAD, multipliers, microcontrollers, register files, circuit design, CAD tools, automatic generation, automatic test software, dividers, circuit testing, parity checkers
26	Esther M. Arkin, Christos H. Papadimitriou, Mihalis Yannakakis	Modularity of Cycles and Paths in Graphs.	J. ACM	1991	DBLP DOI BibTeX RDF	cycles and paths, graphs, modularity
25	Yangjun Chen, Donovan Cooke	XPath query evaluation based on the stack encoding.	C3S2E	2009	DBLP DOI BibTeX RDF	XML pattern matching, twig joins, trees, XML databases, paths
25	Wei Le, Mary Lou Soffa	Refining buffer overflow detection via demand-driven path-sensitive analysis.	PASTE	2007	DBLP DOI BibTeX RDF	path-sensitive, demand-driven, infeasible paths
25	Srecko Brlek, Gilbert Labelle, Annie Lacasse	A Note on a Result of Daurat and Nivat.	Developments in Language Theory	2005	DBLP DOI BibTeX RDF	Lattice paths, discrete regions, winding number, salient and reentrant points, polyominoes
25	Michael Elkin, Jian Zhang 0004	Efficient algorithms for constructing (1+, varepsilon;, beta)-spanners in the distributed and streaming models.	PODC	2004	DBLP DOI BibTeX RDF	almost shortest paths, streaming model, spanner
25	Letícia M. Peres, Silvia Regina Vergilio, Mário Jino, José Carlos Maldonado	Path Selection in the Structural Testing: Proposition, Implementation and Application of Strategies.	SCCC	2001	DBLP DOI BibTeX RDF	Structural Criteria, Selection of Test Paths, Software Testing, Software Metrics
25	Nian-Feng Tzeng, Hsing-Lung Chen	Fast Compaction in Hypercubes.	IEEE Trans. Parallel Distributed Syst.	1998	DBLP DOI BibTeX RDF	hypercubes, fragmentation, Compaction, disjoint paths, task migration, subcubes
25	Khaled Day, Abdel Elah Al-Ayyoub	Fault Diameter of k-ary n-cube Networks.	IEEE Trans. Parallel Distributed Syst.	1997	DBLP DOI BibTeX RDF	interconnection networks, torus, k-ary n-cube, node-disjoint paths, Fault diameter
25	Antonia Bertolino, Martina Marré	Automatic Generation of Path Covers Based on the Control Flow Analysis of Computer Programs.	IEEE Trans. Software Eng.	1994	DBLP DOI BibTeX RDF	program branch testing, program flowgraph, program inputs, ddgraph, graph theoretic principles, arc trees, unconstrained arcs, implied tree, recursive iteration, software analysis tool, automated testing tool, software tools, program testing, flexibility, trees (mathematics), dominance, program diagnostics, control flow analysis, simplicity, implication, program control structures, flow graphs, dominator tree, selection strategy, infeasible paths, software testing tool, path covers
25	John L. Schneiter, Thomas B. Sheridan	An Automated Tactile Sensing Strategy for Planar Object Recognition and Localization.	IEEE Trans. Pattern Anal. Mach. Intell.	1990	DBLP DOI BibTeX RDF	automated tactile sensing, planar object recognition, tactile exploration, point contact sensor, diagnostic measurements, sensor paths, pattern recognition, localization, tactile sensors
24	Olivier Coudert	An efficient algorithm to verify generalized false paths.	DAC	2010	DBLP DOI BibTeX RDF	co-sensitization, generalized false path, timing exception, formal verification, correctness, SAT, sensitization, false path, SDC
24	Mehmet Hakan Karaata, Rachid Hadid	Brief Announcement: A Stabilizing Algorithm for Finding Two Disjoint Paths in Arbitrary Networks.	SSS	2009	DBLP DOI BibTeX RDF
24	Lin Xie, Azadeh Davoodi	Bound-based identification of timing-violating paths under variability.	ASP-DAC	2009	DBLP DOI BibTeX RDF
24	Frank Kammer, Torsten Tholey	The k-Disjoint Paths Problem on Chordal Graphs.	WG	2009	DBLP DOI BibTeX RDF
24	Yuan Tian 0019, Ken C. K. Lee, Wang-Chien Lee	Finding skyline paths in road networks.	GIS	2009	DBLP DOI BibTeX RDF	query processing, location-based services, skyline query, path search
24	Ken-ichi Kawarabayashi, Yusuke Kobayashi 0001	The Induced Disjoint Paths Problem.	IPCO	2008	DBLP DOI BibTeX RDF
24	Esther M. Arkin, Joseph S. B. Mitchell, Valentin Polishchuk	Maximum thick paths in static and dynamic environments.	SCG	2008	DBLP DOI BibTeX RDF	approximation algorithms, motion planning
24	Partha Kanuparthy, Constantine Dovrolis, Mostafa H. Ammar	Spectral probing, crosstalk and frequency multiplexing in internet paths.	Internet Measurement Conference	2008	DBLP DOI BibTeX RDF	frequency multiplexing, signal processing, network management, fourier transform, active probing, distributed agents
24	Chee-Khian Sim, Gongyun Zhao	Underlying paths in interior point methods for the monotone semidefinite linear complementarity problem.	Math. Program.	2007	DBLP DOI BibTeX RDF
24	M. G. Karunambigai, Parvathi Rangasamy, Krassimir T. Atanassov, N. Palaniappan	An Intuitionistic Fuzzy Graph Method for Finding the Shortest Paths in Networks.	IFSA (2)	2007	DBLP DOI BibTeX RDF	Index Matrix (IM), Intuitionistic Fuzzy Graphs (IFGs), Dynamic programming (DP), Shortest path
24	Weidong Chen 0009, Wenjun Xiao, Behrooz Parhami	An Efficient Construction of Node Disjoint Paths in OTIS Networks.	APPT	2007	DBLP DOI BibTeX RDF
24	Ash Mohammad Abbas, Tehzeeb Ahmed Abbasi	An Improvement over Incremental Approach for Guaranteed Identification of Multiple Node-Disjoint Paths in Mobile Ad hoc Networks.	COMSWARE	2007	DBLP DOI BibTeX RDF
24	Martin Schläffer, Elisabeth Oswald	Searching for Differential Paths in MD4.	FSE	2006	DBLP DOI BibTeX RDF
24	Li (Erran) Li, Milind M. Buddhikot, Chandra Chekuri, Katherine Guo	Routing bandwidth guaranteed paths with local restoration in label switched networks.	IEEE J. Sel. Areas Commun.	2005	DBLP DOI BibTeX RDF
24	Qiankun Zhao, Sourav S. Bhowmick, Le Gruenwald	Mining conserved XML query paths for dynamic-conscious caching.	CIKM	2005	DBLP DOI BibTeX RDF	XML, query, cache strategy
24	Shiwen Mao, Shivendra S. Panwar, Yiwei Thomas Hou	On optimal partitioning of realtime traffic over multiple paths.	INFOCOM	2005	DBLP DOI BibTeX RDF
24	Farooq Anjum	TCP Algorithms and Multiple Paths: Considerations for the Future of the Internet.	Inf. Syst. Frontiers	2004	DBLP DOI BibTeX RDF	performance, TCP, multipath
24	Zvi Shiller, Yusuke Fujita, Dan Ophir, Yoshihiko Nakamura	Computing a Set of Local Optimal Paths through Cluttered Environments and over Open Terrain.	ICRA	2004	DBLP DOI BibTeX RDF