The FacetedDBLP logo    Search for: in:

Disable automatic phrases ?     Syntactic query expansion: ?

Searching for Paths with no syntactic query expansion in all metadata.

Publication years (Num. hits)
1959-1968 (15) 1969-1973 (21) 1974 (18) 1975-1976 (29) 1977-1978 (33) 1979 (22) 1980 (17) 1981 (23) 1982 (33) 1983 (44) 1984 (34) 1985 (47) 1986 (44) 1987 (37) 1988 (65) 1989 (113) 1990 (140) 1991 (118) 1992 (127) 1993 (144) 1994 (157) 1995 (205) 1996 (223) 1997 (276) 1998 (248) 1999 (307) 2000 (383) 2001 (440) 2002 (564) 2003 (682) 2004 (997) 2005 (1045) 2006 (1173) 2007 (1312) 2008 (1333) 2009 (989) 2010 (461) 2011 (363) 2012 (376) 2013 (395) 2014 (367) 2015 (417) 2016 (421) 2017 (467) 2018 (465) 2019 (444) 2020 (508) 2021 (481) 2022 (478) 2023 (508) 2024 (117)
Publication types (Num. hits)
article(7111) book(6) data(2) incollection(83) inproceedings(10429) phdthesis(95)
Venues (Conferences, Journals, ...)
GrowBag graphs for keyword ? (Num. hits/coverage)

Group by:
The graphs summarize 10473 occurrences of 4385 keywords

Results
Found 17726 publication records. Showing 17726 according to the selection in the facets
Hits ? Authors Title Venue Year Link Author keywords
58John Hershberger 0001, Matthew Maxel, Subhash Suri Finding the k shortest simple paths: A new algorithm and its implementation. Search on Bibsonomy ACM Trans. Algorithms The full citation details ... 2007 DBLP  DOI  BibTeX  RDF Loop-free paths, directed paths, path equivalence class, replacement paths
58Angela Krstic, Kwang-Ting Cheng Generation of high quality tests for functional sensitizable paths. Search on Bibsonomy VTS The full citation details ... 1995 DBLP  DOI  BibTeX  RDF high quality tests, functional sensitizable paths, long paths, untestable paths, faulty conditions, test derivation, logic testing, delays, timing, integrated circuit testing, combinational circuits, combinational circuits, automatic testing, delay testing, test vectors, timing information
54Huawei Li 0001, Zhongcheng Li, Yinghua Min Reduction of Number of Paths to be Tested in Delay Testing. Search on Bibsonomy J. Electron. Test. The full citation details ... 2000 DBLP  DOI  BibTeX  RDF linearly independent, analytical delay model, delay testing, path sensitization
50Stavroula Siachalou, Leonidas Georgiadis Precomputation of Constrained Widest Paths in Communication Networks. Search on Bibsonomy NETWORKING The full citation details ... 2004 DBLP  DOI  BibTeX  RDF Widest Paths, Bottleneck Paths, Graph Theory, QoS Routing, Precomputation
50Pratik Dave, Unmil Karadkar, Richard Furuta, Luis Francisco-Revilla, Frank M. Shipman III, Suvendu Dash, Zubin Dalal Browsing intricately interconnected paths. Search on Bibsonomy Hypertext The full citation details ... 2003 DBLP  DOI  BibTeX  RDF directed paths, navigation metaphors, path engine, path-centric browsing, Walden's paths
49Ching-Wen Chen, Chung-Ping Chung Designing A Disjoint Paths Interconnection Network with Fault Tolerance and Collision Solving. Search on Bibsonomy J. Supercomput. The full citation details ... 2005 DBLP  DOI  BibTeX  RDF gamma interconnection networks, rerouting hops, collision ratio, multistage interconnection networks, disjoint paths, dynamic rerouting
46Zhongtang Cai, Vibhore Kumar, Karsten Schwan IQ-Paths: Predictably High Performance Data Streams across Dynamic Network Overlays. Search on Bibsonomy HPDC The full citation details ... 2006 DBLP  DOI  BibTeX  RDF grid-FTP application, IQ-Paths, predictably high performance data stream, dynamic overlay network, middleware realization, online network monitoring, user-defined utility requirement, statistical analysis, scheduling algorithm, packet routing, data-intensive application, network bandwidth
46Anand Srinivas, Eytan H. Modiano Finding Minimum Energy Disjoint Paths in Wireless Ad-Hoc Networks. Search on Bibsonomy Wirel. Networks The full citation details ... 2005 DBLP  DOI  BibTeX  RDF distributed algorithmsa, energy efficiency, graph theory, wireless ad-hoc networks, multipath routing, disjoint paths
46Mark Lanthier, Anil Maheshwari, Jörg-Rüdiger Sack Shortest Anisotropic Paths on Terrains. Search on Bibsonomy ICALP The full citation details ... 1999 DBLP  DOI  BibTeX  RDF aniositropic paths, computational geometry, approximation, shortest path
44Chiun-Chieh Hsu, Da-Ren Chen, Hua-Yuan Ding An Efficient Algorithm for the Shortest Path Problem with Forbidden Paths. Search on Bibsonomy ICA3PP The full citation details ... 2009 DBLP  DOI  BibTeX  RDF Forbidden paths, Shortest paths, Network flows, Labeling algorithm
44Stavroula Siachalou, Leonidas Georgiadis Algorithms for precomputing constrained widest paths and multicast trees. Search on Bibsonomy IEEE/ACM Trans. Netw. The full citation details ... 2005 DBLP  DOI  BibTeX  RDF bottleneck paths, widest paths, widest trees, graph theory, QoS routing, multicast trees, precomputation
44Yuanyuan Yang 0001, Jianchao Wang Routing Permutations on Baseline Networks with Node-Disjoint Paths. Search on Bibsonomy IEEE Trans. Parallel Distributed Syst. The full citation details ... 2005 DBLP  DOI  BibTeX  RDF semipermutation, baseline network, link-disjoint paths, crosstalk-free, Routing, interconnects, permutation, optical interconnects, multistage networks, node-disjoint paths
42Shangming Zhu, Zhili Zhang, Xinhua Zhuang Modified Widest Disjoint Paths Algorithm for Multipath Routing. Search on Bibsonomy NPC The full citation details ... 2007 DBLP  DOI  BibTeX  RDF Widest disjoint paths, candidate path, width of path set, multipath routing
42Bing Yang 0001, S. Q. Zheng 0001 Finding Min-Sum Disjoint Shortest Paths from a Single Source to All Pairs of Destinations. Search on Bibsonomy TAMC The full citation details ... 2006 DBLP  DOI  BibTeX  RDF algorithm, routing, reliability, complexity, network, graph, shortest path, survival, disjoint paths
42Wuping Xu, Puliu Yan, Delin Xia, Ming Wu Load Balancing Based on Similarity Multi-paths Routing. Search on Bibsonomy ISPA The full citation details ... 2005 DBLP  DOI  BibTeX  RDF Traffic split, Load Balancing, Similarity, Multi-Paths Routing
42Jon M. Kleinberg, Éva Tardos Disjoint Paths in Densely Embedded Graphs. Search on Bibsonomy FOCS The full citation details ... 1995 DBLP  DOI  BibTeX  RDF densely embedded graphs, communication paths, nearly-Eulerian graphs, locally planar interconnection networks, constant-factor approximation algorithm, maximum disjoint paths, on-line setting, routing, computational geometry, heuristics, multiprocessor interconnection networks, trees (mathematics), high-speed networks, operations research, disjoint paths, two-dimensional mesh
41Amitabha Bagchi, Amitabh Chaudhary, Christian Scheideler, Petr Kolman Algorithms for fault-tolerant routing in circuit switched networks. Search on Bibsonomy SPAA The full citation details ... 2002 DBLP  DOI  BibTeX  RDF flow number, greedy algorithms, fault-tolerant routing, multicommodity flow, edge-disjoint paths
41Surender Baswana, Ramesh Hariharan, Sandeep Sen Maintaining all-pairs approximate shortest paths under deletion of edges. Search on Bibsonomy SODA The full citation details ... 2003 DBLP  BibTeX  RDF
40Yuanyuan Yang 0001, Jianchao Wang Routing Permutations with Link-Disjoint and Node-Disjoint Paths in a Class of Self-Routable Interconnects. Search on Bibsonomy IEEE Trans. Parallel Distributed Syst. The full citation details ... 2003 DBLP  DOI  BibTeX  RDF link-disjoint paths, crosstalk-free routing, Routing, interconnects, permutation, optical interconnects, multistage networks, node-disjoint paths, Latin square, all-to-all personalized exchange
40Yuanyuan Yang 0001, Jianchao Wang Routing Permutations with Link-Disjoint and Node-Disjoint Paths in a Class of Self-Routable Networks. Search on Bibsonomy ICPP The full citation details ... 2002 DBLP  DOI  BibTeX  RDF link-disjoint paths, crosstalk-free routing, Routing, interconnects, permutation, optical interconnects, multistage networks, node-disjoint paths, Latin square, all-to-all personalized exchange
40Qian-Ping Gu, Shietung Peng An efficient algorithm for set-to-set node-disjoint paths problem in hypercubes. Search on Bibsonomy ICPADS The full citation details ... 1996 DBLP  DOI  BibTeX  RDF set-to-set node-disjoint paths, interconnection networks, graph theory, hypercubes, Graph algorithms, hypercube networks, undirect graphs, node-disjoint paths
40Ben Kao, Hector Garcia-Molina, Daniel Barbará Aggressive Transmissions of Short Messages Over Redundant Paths. Search on Bibsonomy IEEE Trans. Parallel Distributed Syst. The full citation details ... 1994 DBLP  DOI  BibTeX  RDF shortmessages, replicated transmissions, fault tolerant computing, message passing, redundancy, packet switching, response time, deadlines, real time communications, packets, fault-tolerant computer systems, redundant paths, multiple paths
40Sriraman Tallam, Xiangyu Zhang 0001, Rajiv Gupta 0001 Extending Path Profiling across Loop Backedges and Procedure Boundaries. Search on Bibsonomy CGO The full citation details ... 2004 DBLP  DOI  BibTeX  RDF overlapping path profiles, profile guided optimization and instruction scheduling, path profiles
40How-Rern Lin, TingTing Hwang On determining sensitization criterion in an iterative gate sizing process. Search on Bibsonomy IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. The full citation details ... 1999 DBLP  DOI  BibTeX  RDF
40J. Paul Myers Jr. Adaptive approaches to structural software testing (abstract only). Search on Bibsonomy ACM Conference on Computer Science The full citation details ... 1987 DBLP  DOI  BibTeX  RDF
39Sun-Yuan Hsieh, Yu-Fen Weng Fault-Tolerant Embedding of Pairwise Independent Hamiltonian Paths on a Faulty Hypercube with Edge Faults. Search on Bibsonomy Theory Comput. Syst. The full citation details ... 2009 DBLP  DOI  BibTeX  RDF Pairwise independent Hamiltonian paths, Hypercubes, Hamiltonian, Graph-theoretic interconnection networks, Fault-tolerant embedding
39Naoki Sawada, Keiichi Kaneko, Shietung Peng Pairwise Disjoint Paths in Pancake Graphs. Search on Bibsonomy PDCAT The full citation details ... 2007 DBLP  DOI  BibTeX  RDF interconnection networks, polynomial time algorithm, disjoint paths
39Laurent D. Cohen, Thomas Deschamps Multiple Contour Finding and Perceptual Grouping as a Set of Energy Minimizing Paths. Search on Bibsonomy EMMCVPR The full citation details ... 2001 DBLP  DOI  BibTeX  RDF salient curve detection, weighted distance, medical imaging, reconstruction, level sets, active contours, energy minimization, Perceptual grouping, minimal paths, fast marching
39Richard Furuta, Frank M. Shipman III, Catherine C. Marshall, Donald Brenner, Hao-wei Hsieh Hypertext Paths and the World-Wide Web: Experiences with Walden's Paths. Search on Bibsonomy Hypertext The full citation details ... 1997 DBLP  DOI  BibTeX  RDF hypertext tours and paths, World Wide Web (WWW), educational applications, meta-structure, Walden's Paths
38Anand Srinivas, Eytan H. Modiano Minimum energy disjoint path routing in wireless ad-hoc networks. Search on Bibsonomy MobiCom The full citation details ... 2003 DBLP  DOI  BibTeX  RDF distributed algorithms, energy efficiency, wireless ad-hoc networks, multipath routing, disjoint paths, minimum energy
38Wei-Cheng Lai, Angela Krstic, Kwang-Ting Cheng On Testing the Path Delay Faults of a Microprocessor Using its Instruction Set. Search on Bibsonomy VTS The full citation details ... 2000 DBLP  DOI  BibTeX  RDF Microprocessor self-testing, Path delay fault classification, Functionally testable paths, Functional tests, Delay fault testing
38Therese C. Biedl, Michal Stern Edge-Intersection Graphs of k-Bend Paths in Grids. Search on Bibsonomy COCOON The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
38Peng Zhang 0008, Wenbo Zhao 0001 On the Complexity and Approximation of the Min-Sum and Min-Max Disjoint Paths Problems. Search on Bibsonomy ESCAPE The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
37Anne Vialard Geometrical parameters extraction from discrete paths. Search on Bibsonomy DGCI The full citation details ... 1996 DBLP  DOI  BibTeX  RDF Discrete Paths, Euclidean Paths, lenght estimation, curvature estimation
36Vivekananda M. Vedula, Jacob A. Abraham FACTOR: A Hierarchical Methodology for Functional Test Generation and Testability Analysis. Search on Bibsonomy DATE The full citation details ... 2002 DBLP  DOI  BibTeX  RDF
36Lei Shi, Vandana Pursnani Janeja Anomalous window discovery through scan statistics for linear intersecting paths (SSLIP). Search on Bibsonomy KDD The full citation details ... 2009 DBLP  DOI  BibTeX  RDF anomalous window discovery, intersecting paths, scan statistic, traffic accidents
36Petr A. Golovach, Dimitrios M. Thilikos Paths of Bounded Length and Their Cuts: Parameterized Complexity and Algorithms. Search on Bibsonomy IWPEC The full citation details ... 2009 DBLP  DOI  BibTeX  RDF Bounded length disjoint paths, Bounded length cuts, Parameterized Complexity, Parameterized Algorithms
36Patricia Mouy, Bruno Marre, Nicky Williams, Pascale Le Gall Generation of All-Paths Unit Test with Function Calls. Search on Bibsonomy ICST The full citation details ... 2008 DBLP  DOI  BibTeX  RDF all-paths unit test, unit test with function calls, unit test, constraint solving, structural testing, automatic generation, testing C programs
36Kapil Vaswani, Aditya V. Nori, Trishul M. Chilimbi Preferential path profiling: compactly numbering interesting paths. Search on Bibsonomy POPL The full citation details ... 2007 DBLP  DOI  BibTeX  RDF preferential paths, profiling, dynamic analysis, arithmetic coding
36Minh Ngoc Ngo, Hee Beng Kuan Tan Detecting large number of infeasible paths through recognizing their patterns. Search on Bibsonomy ESEC/SIGSOFT FSE The full citation details ... 2007 DBLP  DOI  BibTeX  RDF empirical properties, static analysis, structural testing, coverage analysis, infeasible paths
36Sun-Yuan Hsieh Fault-Free Pairwise Independent Hamiltonian Paths on Faulty Hypercubes. Search on Bibsonomy Asia-Pacific Computer Systems Architecture Conference The full citation details ... 2006 DBLP  DOI  BibTeX  RDF pairwise independent Hamiltonian paths, Interconnection networks, hypercubes, Hamiltonian, fault-tolerant embedding
36Bing Yang 0001, Mei Yang, Jianping Wang 0001, S. Q. Zheng 0001 Minimum Cost Paths Subject to Minimum Vulnerability for Reliable Communications. Search on Bibsonomy ISPAN The full citation details ... 2005 DBLP  DOI  BibTeX  RDF algorithm, reliability, complexity, Networks, graph, shortest path, survivability, network flow, protection, disjoint paths, minimum cost network flow
34Nastooh Taheri Javan, Mehdi Dehghan 0001 Reducing End-to-End Delay in Multi-path Routing Algorithms for Mobile Ad Hoc Networks. Search on Bibsonomy MSN The full citation details ... 2007 DBLP  DOI  BibTeX  RDF Zone-Disjoint Paths, MANET, Routing Algorithms, Multi-Path Routing
34Qian-Ping Gu, Shietung Peng Wavelengths Requirement for Permutation Routing in All-Optical Multistage Interconnection Networks. Search on Bibsonomy IPDPS The full citation details ... 2000 DBLP  DOI  BibTeX  RDF multistage interconnection networks, Permutation routing, all-optical networks, node-disjoint paths, wavelength routing, BPC permutations
34Yuval Emek, David Peleg, Liam Roditty A near-linear time algorithm for computing replacement paths in planar directed graphs. Search on Bibsonomy SODA The full citation details ... 2008 DBLP  BibTeX  RDF
34Zhongtang Cai, Vibhore Kumar, Karsten Schwan IQ-Paths: Predictably High Performance Data Streams Across Dynamic Network Overlays. Search on Bibsonomy J. Grid Comput. The full citation details ... 2007 DBLP  DOI  BibTeX  RDF Statistical prediction, Grid, Overlay network, High performance, Self-management, Available bandwidth, Data-intensive applications, Self-regulating
34I-De Huang, Sandeep K. Gupta 0001 Selection of Paths for Delay Testing. Search on Bibsonomy Asian Test Symposium The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
34Yun Shao 0002, Sudhakar M. Reddy, Irith Pomeranz, Seiji Kajihara On Selecting Testable Paths in Scan Designs. Search on Bibsonomy J. Electron. Test. The full citation details ... 2003 DBLP  DOI  BibTeX  RDF testable path, delay testing, delay fault, path delay fault, path selection
34Timothy Griffin, F. Bruce Shepherd, Gordon T. Wilfong The stable paths problem and interdomain routing. Search on Bibsonomy IEEE/ACM Trans. Netw. The full citation details ... 2002 DBLP  DOI  BibTeX  RDF path vector protocols, stable routing, BGP, Border Gateway Protocol, interdomain routing, internet routing
34Srihari Nelakuditi, Zhi-Li Zhang On Selection of Paths for Multipath Routing. Search on Bibsonomy IWQoS The full citation details ... 2001 DBLP  DOI  BibTeX  RDF
34Unmil Karadkar, Luis Francisco-Revilla, Richard Furuta, Frank M. Shipman III Structuring Access to a Dynamic Collection of Digital Documents: The Walden's Paths Vitual Directories. Search on Bibsonomy DDEP/PODDP The full citation details ... 2000 DBLP  DOI  BibTeX  RDF
34Seiji Kajihara, Kozo Kinoshita, Irith Pomeranz, Sudhakar M. Reddy A Method for Identifying Robust Dependent and Functionally Unsensitizable Paths. Search on Bibsonomy VLSI Design The full citation details ... 1997 DBLP  DOI  BibTeX  RDF robust dependent path, local circuit analysis, logic circuit testing, functionally unsensitizable path, timing, logic circuits
33Irith Pomeranz, Sudhakar M. Reddy Test enrichment for path delay faults using multiple sets of target faults. Search on Bibsonomy IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. The full citation details ... 2003 DBLP  DOI  BibTeX  RDF
33João L. Sobrinho Algebra and algorithms for QoS path computation and hop-by-hop routing in the internet. Search on Bibsonomy IEEE/ACM Trans. Netw. The full citation details ... 2002 DBLP  DOI  BibTeX  RDF quality of service, internet, Internet, routing, algebra
33Michael K. Reiter, Stuart G. Stubblebine Toward Acceptable Metrics of Authentication. Search on Bibsonomy S&P The full citation details ... 1997 DBLP  DOI  BibTeX  RDF authentication metrics design, trusted intermediaries, intersecting paths, key interdependencies, certificates, ambiguities, message authentication, large-scale system, confidence, acceptability, multiple paths
32Jason J. Holdsworth, Siu Man Lui GPS-enabled mobiles for learning shortest paths: a pilot study. Search on Bibsonomy FDG The full citation details ... 2009 DBLP  DOI  BibTeX  RDF GPS-enabled mobile phones, mobile learning, problem-based learning, shortest paths algorithm
32David Avis, Bohdan Kaluzny Computing monotone disjoint paths on polytopes. Search on Bibsonomy J. Comb. Optim. The full citation details ... 2008 DBLP  DOI  BibTeX  RDF Reverse search, Vertex enumeration, Holt-Klee, Linear programming, Network flow, Polytopes, Disjoint paths, Simplex method, Degeneracy
32Sungwoo Tak, E. K. Park Restoration performance study of k-shortest disjoint paths in WDM optical networks. Search on Bibsonomy Telecommun. Syst. The full citation details ... 2007 DBLP  DOI  BibTeX  RDF Shortest disjoint paths, Dynamic programming principle, Optimization, Restoration, WDM optical networks
32Michael Elkin Computing almost shortest paths. Search on Bibsonomy ACM Trans. Algorithms The full citation details ... 2005 DBLP  DOI  BibTeX  RDF almost shortest paths, Graph algorithms, spanners
32Lyudmil Aleksandrov, Anil Maheshwari, Jörg-Rüdiger Sack Determining approximate shortest paths on weighted polyhedral surfaces. Search on Bibsonomy J. ACM The full citation details ... 2005 DBLP  DOI  BibTeX  RDF weighted paths, approximation algorithms, computational geometry, shortest path problems, Design and analysis of algorithms, polyhedral surfaces
32Changming Sun, Ben Appleton Multiple Paths Extraction in Images Using a Constrained Expanded Trellis. Search on Bibsonomy IEEE Trans. Pattern Anal. Mach. Intell. The full citation details ... 2005 DBLP  DOI  BibTeX  RDF Multiple paths extraction, constrained expanded trellis, feature extraction, object segmentation
32Damien Joseph, Soon Ang, Sandra Slaughter Identifying the prototypical career paths of IT professionals: a sequence and cluster analysis. Search on Bibsonomy CPR The full citation details ... 2005 DBLP  DOI  BibTeX  RDF sequence analysis, longitudinal, IT profession, career paths
32Sergio Cabello, Yuanxin Liu, Andrea Mantler, Jack Snoeyink Testing Homotopy for Paths in the Plane. Search on Bibsonomy Discret. Comput. Geom. The full citation details ... 2004 DBLP  DOI  BibTeX  RDF Simple paths, Computational topology, Homotopy
32Xiao Zhou 0001, Syurei Tamura, Takao Nishizeki Finding Edge-Disjoint Paths in Partial k-Trees. Search on Bibsonomy Algorithmica The full citation details ... 2000 DBLP  DOI  BibTeX  RDF Polynomial-time algorithm, Edge-coloring, Edge-disjoint paths, Partial k -tree, Bounded treewidth
32Eugene Goldberg, Alexander Saldanha Timing Analysis with Implicitly Specified False Paths. Search on Bibsonomy VLSI Design The full citation details ... 2000 DBLP  DOI  BibTeX  RDF known false paths, implicit false path representation, timing analysis, breadth-first search
32Xiao Zhou 0001, Syurei Tamura, Takao Nishizeki Finding Edge-Disjoint Paths in Partial k-Trees (Extended Abstract). Search on Bibsonomy ISAAC The full citation details ... 1996 DBLP  DOI  BibTeX  RDF bounded tree-width, polynomial-time algorithm, edge-coloring, edge-disjoint paths, partial k-tree
31Ali Asghar Khavasi, Nastooh Taheri Javan Using zone-disjoint multi-path routing algorithm for video transmission over ad-hoc networks. Search on Bibsonomy ICIS The full citation details ... 2009 DBLP  DOI  BibTeX  RDF video multi-path transmission, zone-disjoint paths, MANET, multi-path routing
31Deepayan Chakrabarti, Rupesh R. Mehta The paths more taken: matching DOM trees to search logs for accurate webpage clustering. Search on Bibsonomy WWW The full citation details ... 2010 DBLP  DOI  BibTeX  RDF clustering, wrapper induction, search logs
31Yoshinori Kitatsuji, Masato Tsuru, Tetsuya Takine, Yuji Oie Flow assignment method with traffic characteristics over multiple paths for reducing queuing delay. Search on Bibsonomy Telecommun. Syst. The full citation details ... 2008 DBLP  DOI  BibTeX  RDF Flow assignment, Traffic engineering, Queuing delay, Traffic characteristics
31Antoine B. Bagula, Anthony E. Krzesinski Traffic Engineering Label Switched Paths in IP Networks using a Pre-Planned Flow Optimization Model. Search on Bibsonomy MASCOTS The full citation details ... 2001 DBLP  DOI  BibTeX  RDF
31R. Iris Bahar, Hyunwoo Cho, Gary D. Hachtel, Enrico Macii, Fabio Somenzi Symbolic timing analysis and resynthesis for low power of combinational circuits containing false paths. Search on Bibsonomy IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. The full citation details ... 1997 DBLP  DOI  BibTeX  RDF
31How-Rern Lin, TingTing Hwang Dynamical identification of critical paths for iterative gate sizing. Search on Bibsonomy ICCAD The full citation details ... 1994 DBLP  DOI  BibTeX  RDF
31Edith Cohen Fast algorithms for constructing t-spanners and paths with stretch t Search on Bibsonomy FOCS The full citation details ... 1993 DBLP  DOI  BibTeX  RDF pairwise-covers, t-spanners constructions, paths with stretch, minimum-weight path, weighted undirected graph, exact shortest paths algorithms, randomized algorithm, deterministic algorithm, vertices, weighted graph
31John Hershberger 0001, Subhash Suri Efficient Computation of Euclidean Shortest Paths in the Plane Search on Bibsonomy FOCS The full citation details ... 1993 DBLP  DOI  BibTeX  RDF plane computational geometry, polygonal obstacles, shortest paths, time complexity, Euclidean shortest paths, efficient computation, worst-case time
31David R. Karger, Daphne Koller, Steven J. Phillips Finding the Hidden Path: Time Bounds for All-Pairs Shortest Paths Search on Bibsonomy FOCS The full citation details ... 1991 DBLP  DOI  BibTeX  RDF path-comparison-based algorithm, hidden paths algorithm, edge weights, lower bound, time bounds, weighted graphs, all-pairs shortest paths
31Samir Khuller, Baruch Schieber Efficient Parallel Algorithms for Testing Connectivity and Finding Disjoint s-t Paths in Graphs (Extended Summary) Search on Bibsonomy FOCS The full citation details ... 1989 DBLP  DOI  BibTeX  RDF k-edge disjoint paths, testing connectivity, disjoint s-t paths, optimal speedup algorithm, k-vertex connectivity, parallel algorithms, graphs, CRCW PRAM
31Samir Khuller, Stephen G. Mitchell, Vijay V. Vazirani Processor Efficient Parallel Algorithms for the Two Disjoint Paths Problem, and for Finding a Kuratowski Homeomorph Search on Bibsonomy FOCS The full citation details ... 1989 DBLP  DOI  BibTeX  RDF disjoint paths problem, Kuratowski homeomorph, vertex-disjoint paths, NC planarity algorithms, processor-time product, routing, parallel algorithms, sequential algorithm, planar embedding, polylogarithmic factor
30Shun-Yen Lu, Pei-Ying Hsieh, Jing-Jia Liou Exploring linear structures of critical path delay faults to reduce test efforts. Search on Bibsonomy ICCAD The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
30Marwan A. Gharaybeh, Vishwani D. Agrawal, Michael L. Bushnell, Carlos G. Parodi False-Path Removal Using Delay Fault Simulation. Search on Bibsonomy J. Electron. Test. The full citation details ... 2000 DBLP  DOI  BibTeX  RDF design for testability, fault simulation, Delay testing, path delay faults, synthesis for testability, redundancy removal
30Shmuel Zaks On the Use of Duality and Geometry in Layouts for ATM Networks. Search on Bibsonomy MFCS The full citation details ... 2000 DBLP  DOI  BibTeX  RDF
30Christoph Albrecht, Bernhard Korte, Jürgen Schietke, Jens Vygen Cycle time and slack optimization for VLSI-chips. Search on Bibsonomy ICCAD The full citation details ... 1999 DBLP  DOI  BibTeX  RDF
30Huawei Li 0001, Zhongcheng Li, Yinghua Min Delay Testing with Double Observations. Search on Bibsonomy Asian Test Symposium The full citation details ... 1998 DBLP  DOI  BibTeX  RDF linearly independent, test generation, observation, delay testing
30L. Howard Holley, Barry K. Rosen Qualified Data Flow Problems. Search on Bibsonomy POPL The full citation details ... 1980 DBLP  DOI  BibTeX  RDF
29I-De Huang, Yi-Shing Chang, Sandeep K. Gupta 0001, Sreejit Chakravarty An Industrial Case Study of Sticky Path-Delay Faults. Search on Bibsonomy VTS The full citation details ... 2008 DBLP  DOI  BibTeX  RDF sticky paths, timing false paths, path reprioritization, delay testing, test quality
29Sung-Woo Chang, Hyoung-Joo Kim SOPView+: an object browser which supports navigating database by changing base object. Search on Bibsonomy COMPSAC The full citation details ... 1997 DBLP  DOI  BibTeX  RDF SOPView+, object browser, large database navigation, base object, forward navigation, reference paths, backward navigation, reference hierarchy, screen real estate problem, extended synchronized browsing, online front-ends, navigational paths
29Tse-Yun Feng, Yanggon Kim Fault-diagnosis for a class of distributed control multistage interconnection networks. Search on Bibsonomy FTDCS The full citation details ... 1995 DBLP  DOI  BibTeX  RDF distributed control multistage interconnection networks, multiple disjoint paths, input/output terminals, fault-diagnosis method, self-routing tags, fault-location procedure, performance evaluation, fault-tolerance, fault-diagnosis, fault tolerant computing, multistage interconnection networks, fault location, redundant paths
29Davide Bilò, Luciano Gualà, Guido Proietti, Peter Widmayer Computational Aspects of a 2-Player Stackelberg Shortest Paths Tree Game. Search on Bibsonomy WINE The full citation details ... 2008 DBLP  DOI  BibTeX  RDF Network Pricing Games, Communication Networks, Stackelberg Games, Shortest Paths Tree
29Himanshu Gupta, Rephael Wenger Constructing pairwise disjoint paths with few links. Search on Bibsonomy ACM Trans. Algorithms The full citation details ... 2007 DBLP  DOI  BibTeX  RDF Link paths, isomorphic triangulations, noncrossing, polygon
29Zareen Alamgir, Sarmad Abbasi Combinatorial Algorithms for Listing Paths in Minimal Change Order. Search on Bibsonomy CAAN The full citation details ... 2007 DBLP  DOI  BibTeX  RDF Minimal change order, Revolving door order, Generation of paths, Combinatorial algorithms, Complete graph
29Emerson Ribeiro de Mello, Aad P. A. van Moorsel, Joni da Silva Fraga Evaluation of P2P Search Algorithms for Discovering Trust Paths. Search on Bibsonomy EPEW The full citation details ... 2007 DBLP  DOI  BibTeX  RDF Peer-to-Peer, Web of Trust, Trust Paths
29Qing Xu 0002, Mateu Sbert A New Way to Re-using Paths. Search on Bibsonomy ICCSA (2) The full citation details ... 2007 DBLP  DOI  BibTeX  RDF Reusing paths, Ray tracing, Global Illumination, Monte Carlo
29Roberto Ardon, Laurent D. Cohen Fast Constrained Surface Extraction by Minimal Paths. Search on Bibsonomy Int. J. Comput. Vis. The full citation details ... 2006 DBLP  DOI  BibTeX  RDF active contours, level set method, object extraction, minimal paths, active surfaces
29Chandra Chekuri, Sanjeev Khanna, F. Bruce Shepherd Edge-disjoint paths in Planar graphs with constant congestion. Search on Bibsonomy STOC The full citation details ... 2006 DBLP  DOI  BibTeX  RDF Planar graphs, multicommodity flow, edge-disjoint paths
29Hiroyuki Iwata, Tomokazu Yoneda, Satoshi Ohtake, Hideo Fujiwara A DFT Method for RTL Data Paths Based on Partially Strong Testability to Guarantee Complete Fault Efficiency. Search on Bibsonomy Asian Test Symposium The full citation details ... 2005 DBLP  DOI  BibTeX  RDF strong testability, partially strong testability, complete fault efficiency, design-for-testability, data paths
29Roberto Ardon, Laurent D. Cohen, Anthony J. Yezzi A New Implicit Method for Surface Segmentation by Minimal Paths: Applications in 3D Medical Images. Search on Bibsonomy EMMCVPR The full citation details ... 2005 DBLP  DOI  BibTeX  RDF Stationary Transport Equation, Image segmentation, Active contours, Level Set method, Object Extraction, Minimal Paths
29Keiichi Kaneko Node-to-Set Disjoint Paths Problem in Bi-rotator Graphs. Search on Bibsonomy ISPA The full citation details ... 2004 DBLP  DOI  BibTeX  RDF node-to-set disjoint paths problem, bi-rotator graphs, fault tolerance, parallel computation
29Toshinori Hosokawa, Hiroshi Date, Masahide Miyazaki, Michiaki Muraoka, Hideo Fujiwara A Method of Test Plan Grouping to Shorten Test Length for RTL Data Paths under a Test Controller Area Constraint. Search on Bibsonomy Asian Test Symposium The full citation details ... 2003 DBLP  DOI  BibTeX  RDF test plan grouping, test controllers, partly compacted test plan tables, RTL data paths, test length
29Cheng-Nan Lai, Gen-Huey Chen, Dyi-Rong Duh Constructing One-to-Many Disjoint Paths in Folded Hypercubes. Search on Bibsonomy IEEE Trans. Computers The full citation details ... 2002 DBLP  DOI  BibTeX  RDF folded hypercube, Rabin number, hypercube, optimization problem, Disjoint paths
29Sergio Cabello, Yuanxin Liu, Andrea Mantler, Jack Snoeyink Testing Homotopy for paths in the plane. Search on Bibsonomy SCG The full citation details ... 2002 DBLP  DOI  BibTeX  RDF simple paths, computational topology, Homotopy
29Thomas Deschamps, Laurent D. Cohen Minimal Paths in 3D Images and Application to Virtual Endoscopy. Search on Bibsonomy ECCV (2) The full citation details ... 2000 DBLP  DOI  BibTeX  RDF Medical image understanding, Deformable Models, Level Set methods, Minimal paths, Fast Marching, Eikonal Equation
Displaying result #1 - #100 of 17726 (100 per page; Change: )
Pages: [1][2][3][4][5][6][7][8][9][10][>>]
Valid XHTML 1.1! Valid CSS! [Valid RSS]
Maintained by L3S.
Previously maintained by Jörg Diederich.
Based upon DBLP by Michael Ley.
open data data released under the ODC-BY 1.0 license