The FacetedDBLP logo    Search for: in:

Disable automatic phrases ?     Syntactic query expansion: ?

Searching for phrase time-optimal algorithms (changed automatically) with no syntactic query expansion in all metadata.

Publication years (Num. hits)
1980-2003 (15) 2006-2010 (8)
Publication types (Num. hits)
article(12) incollection(1) inproceedings(10)
GrowBag graphs for keyword ? (Num. hits/coverage)

Group by:
The graphs summarize 66 occurrences of 59 keywords

Results
Found 23 publication records. Showing 23 according to the selection in the facets
Hits ? Authors Title Venue Year Link Author keywords
2Tatsuya Hayashi, Koji Nakano, Stephan Olariu Work-Time Optimal k-Merge Algorithms on the PRAM. Search on Bibsonomy IEEE Trans. Parallel Distrib. Syst. The full citation details ... 1998 DBLP  DOI  BibTeX  RDF work-time optimal algorithms, information retrieval, parallel algorithms, databases, query processing, sorting, Merging
2Sushil K. Prasad, Sajal K. Das, Calvin Ching-Yuen Chen Efficient EREW PRAM Algorithms for Parentheses-Matching. Search on Bibsonomy IEEE Trans. Parallel Distrib. Syst. The full citation details ... 1994 DBLP  DOI  BibTeX  RDF EREW PRAM algorithms, parentheses-matching, polylog-time parallel algorithms, exclusive-read and exclusive-write, parallelrandom-access machine, input string, working space, time-optimal algorithms, pattern recognition, parallel algorithms, computational complexity, data structures, data structures, parallel machines, time complexity, arrays, space complexity, random-access storage, PRAM model
1Balasingham Balamohan, Paola Flocchini, Ali Miri, Nicola Santoro Time Optimal Algorithms for Black Hole Search in Rings. Search on Bibsonomy COCOA The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Zhuo Li, David A. Papa, Charles J. Alpert, Shiyan Hu, Weiping Shi, Cliff C. N. Sze, Ying Zhou Ultra-fast interconnect driven cell cloning for minimizing critical path delay. Search on Bibsonomy ISPD The full citation details ... 2010 DBLP  DOI  BibTeX  RDF gate duplication, physical synthesis, timing-driven placement
1Jurek Czyzowicz, Evangelos Kranakis, Danny Krizanc, Ioannis Lambadaris, Lata Narayanan, Jaroslav Opatrny, Ladislav Stacho, Jorge Urrutia, Mohammadreza Yazdani On Minimizing the Maximum Sensor Movement for Barrier Coverage of a Line Segment. Search on Bibsonomy ADHOC-NOW The full citation details ... 2009 DBLP  DOI  BibTeX  RDF Intruder, Optimal Movement, Sensors, NP-complete, Coverage, Detection, PTAS, Barrier, Line Segment
1Luzi Anderegg, Paolo Penna, Peter Widmayer Online Train Disposition: To Wait or Not to Wait? Search on Bibsonomy Robust and Online Large-Scale Optimization The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Sanpawat Kantabutra, Pattama Longani The Complexity of the Grid Wireless Mobility Model. Search on Bibsonomy SNPD The full citation details ... 2008 DBLP  DOI  BibTeX  RDF Wireless Mobility Model, Complexity
1David Coeurjolly, Annick Montanvert Optimal Separable Algorithms to Compute the Reverse Euclidean Distance Transformation and Discrete Medial Axis in Arbitrary Dimension. Search on Bibsonomy IEEE Trans. Pattern Anal. Mach. Intell. The full citation details ... 2007 DBLP  DOI  BibTeX  RDF reverse Euclidean distance transformation, medial axis extraction, d-dimensional shapes, Shape representation, distance transformation
1Janna Burman, Shay Kutten Time Optimal Asynchronous Self-stabilizing Spanning Tree. Search on Bibsonomy DISC The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
1Michele Flammini, Gianpiero Monaco, Luca Moscardelli, Mordechai Shalom, Shmuel Zaks Approximating the Traffic Grooming Problem in Tree and Star Networks. Search on Bibsonomy WG The full citation details ... 2006 DBLP  DOI  BibTeX  RDF Optical Networks, Tree Networks, Traffic Grooming, Add-Drop Multiplexer(ADM), Wavelength Division Multiplexing(WDM)
1R. Sai Anand, Thomas Erlebach Routing and Call Control Algorithms for Ring Networks. Search on Bibsonomy WADS The full citation details ... 2003 DBLP  DOI  BibTeX  RDF
1Andrea Pietracaprina, Geppino Pucci Optimal Many-to-One Routing on the Mesh with Constant Queues. Search on Bibsonomy Euro-Par The full citation details ... 2001 DBLP  DOI  BibTeX  RDF
1Hakan Aydin, Rami G. Melhem, Daniel Mossé Incorporating Error Recovery into the Imprecise Computation Model. Search on Bibsonomy RTCSA The full citation details ... 1999 DBLP  DOI  BibTeX  RDF Fault-Tolerant Scheduling, Aperiodic Scheduling, Real-Time Scheduling, Error Recovery, Imprecise Computation
1Venkatavasu Bokka, Himabindu Gurla, Stephan Olariu, James L. Schwing, Larry Wilson Time-Optimal Domain-Specific Querying on Enhanced Meshes. Search on Bibsonomy IEEE Trans. Parallel Distrib. Syst. The full citation details ... 1997 DBLP  DOI  BibTeX  RDF time-optimal algorithms, enhanced meshes, pattern recognition, parallel algorithms, VLSI, robotics, Searching, ranking, database design
1Ion Stoica Time-optimal Algorithms for Generalized Dominance Computation and Related Problems on Mesh Connected Computers and Meshes with Multiple Broadcasting. Search on Bibsonomy Parallel Algorithms Appl. The full citation details ... 1996 DBLP  DOI  BibTeX  RDF
1Martin Dietzfelbinger, Miroslaw Kutylowski, Rüdiger Reischuk Feasible Time-Optimal Algorithms for Boolean Functions on Exclusive-Write Parallel Random-Access Machines. Search on Bibsonomy SIAM J. Comput. The full citation details ... 1996 DBLP  DOI  BibTeX  RDF
1Stephan Olariu, Albert Y. Zomaya A Time- and Cost-Optimal Algorithm for Interlocking Sets-With Applications. Search on Bibsonomy IEEE Trans. Parallel Distrib. Syst. The full citation details ... 1996 DBLP  DOI  BibTeX  RDF time-optimal algorithms, routing, parallel algorithms, VLSI, lower bounds, CAD, Circuit design
1Martin Dietzfelbinger, Miroslaw Kutylowski, Rüdiger Reischuk Feasible Time-Optimal Algorithms for Boolean Functions on Exclusive-Write PRAMs Search on Bibsonomy Electronic Colloquium on Computational Complexity (ECCC) The full citation details ... 1995 DBLP  BibTeX  RDF
1Dharmavani Bhagavathi, Venkatavasu Bokka, Himabindu Gurla, Stephan Olariu, James L. Schwing, Ivan Stojmenovic, Jingyuan Zhang Time-Optimal Visibility-Related Algorithms on Meshes with Multiple Broadcasting. Search on Bibsonomy IEEE Trans. Parallel Distrib. Syst. The full citation details ... 1995 DBLP  DOI  BibTeX  RDF dominance graph, meshes with multiple broadcasting, time-optimal algorithms, parallel algorithms, image processing, robotics, computational geometry, computer graphics, triangulation, Visibility, VLSI design, compaction, visibility graph
1Piera Barcaccia, Maurizio A. Bonuccelli Polynomial time optimal algorithms for time slot assignment of variable bandwidth systems. Search on Bibsonomy IEEE/ACM Trans. Netw. The full citation details ... 1994 DBLP  DOI  BibTeX  RDF variable bandwidth switching system, combinatorial optimization, polynomial time algorithm, network flow
1Dharmavani Bhagavathi, Venkatavasu Bokka, Himabindu Gurla, Stephan Olariu, James L. Schwing Time-Optimal Tree Computations on Sparse Meshes. Search on Bibsonomy WG The full citation details ... 1994 DBLP  DOI  BibTeX  RDF meshes with multiple broadcasting, traversais, tree reconstruction, parentheses algorithms, encoding, decoding, binary trees, ordered trees
1Yang Cai, Martin D. F. Wong Optimal channel pin assignment. Search on Bibsonomy IEEE Trans. on CAD of Integrated Circuits and Systems The full citation details ... 1991 DBLP  DOI  BibTeX  RDF
1Vijay K. Vaishnavi, Hans-Peter Kriegel, Derick Wood Space and time optimal algorithms for a class of rectangle intersection problems. Search on Bibsonomy Inf. Sci. The full citation details ... 1980 DBLP  DOI  BibTeX  RDF
Displaying result #1 - #23 of 23 (100 per page; Change: )
Valid XHTML 1.1! Valid CSS! [Valid RSS]
Maintained by Jörg Diederich.
Based upon DBLP by Michael Ley.