The FacetedDBLP logo    Search for: in:

Disable automatic phrases ?     Syntactic query expansion: ?

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

Publication years (Num. hits)
1991-2008 (12)
Publication types (Num. hits)
article(8) inproceedings(4)
Venues (Conferences, Journals, ...)
GrowBag graphs for keyword ? (Num. hits/coverage)

Group by:
The graphs summarize 60 occurrences of 47 keywords

Results
Found 12 publication records. Showing 12 according to the selection in the facets
Hits ? Authors Title Venue Year Link Author keywords
49Yigang Chen, Wei-Tek Tsai, Daniel Y. Chao Dependency Analysis - A Petri-Net-Based Technique for Synthesizing Large Concurrent Systems. Search on Bibsonomy IEEE Trans. Parallel Distributed Syst. The full citation details ... 1993 DBLP  DOI  BibTeX  RDF computational complexity, computational complexity, parallel processing, Petri nets, liveness, concurrent systems, reachability, boundedness, dependency relations, Petrinets
27Chris J. Scheiman, Peter R. Cappello A Period-Processor-Time-Minimal Schedule for Cubical Mesh Algorithms. Search on Bibsonomy IEEE Trans. Parallel Distributed Syst. The full citation details ... 1994 DBLP  DOI  BibTeX  RDF period-processor-time-minimal schedule, cubical mesh algorithms, precedence-constrained multiprocessor schedules, toroidally connected mesh, scheduling, parallel algorithms, computational complexity, multiprocessor interconnection networks, directed graphs, systolic arrays, systolic array, directed acyclic graph, matrix algebra, matrix product, computationalcomplexity
27Ivor P. Page, Tom Jacob, Eric Chern Fast Algorithms for Distributed Resource Allocation. Search on Bibsonomy IEEE Trans. Parallel Distributed Syst. The full citation details ... 1993 DBLP  DOI  BibTeX  RDF distributed static resource allocation problem, average case behavior, globalqueue, polynomial waiting time, polynomial message complexity, simulation, resource allocation, distributed processing, computationalcomplexity
27Chia Shen, Krithi Ramamritham, John A. Stankovic Resource Reclaiming in Multiprocessor Real-Time Systems. Search on Bibsonomy IEEE Trans. Parallel Distributed Syst. The full citation details ... 1993 DBLP  DOI  BibTeX  RDF multiprocessor real-time systems, worst case computation times, resource reclaiming, scheduling, real-time systems, resource allocation, multiprocessing systems, real-time scheduling, deadline, local optimization, resource requirements, computationalcomplexity
27Emilio L. Zapata, Francisco Argüello A VLSI Constant Geometry Architecture for the Fast Hartley and Fourier Transforms. Search on Bibsonomy IEEE Trans. Parallel Distributed Syst. The full citation details ... 1992 DBLP  DOI  BibTeX  RDF fast Hartley transform, VLSI constant geometryarchitecture, parallel calculation, constant geometry algorithm, perfect unshuffle permutation, processormemory, systolic data flow, multiplexing operations, hardwired control, parallel algorithms, VLSI, parallel architecture, parallel architectures, fast Fourier transform, fast Fourier transforms, butterflies, FIFO queues, application-specific architecture, computationalcomplexity
27Jorge L. Aravena, Abdulkader O. Barbir A Class of Low Complexity High Concurrence Algorithms. Search on Bibsonomy IEEE Trans. Parallel Distributed Syst. The full citation details ... 1991 DBLP  DOI  BibTeX  RDF transformations families, low complexity high concurrence algorithms, dedicatedcomputing structures, compute cycles, matrixmultiplication array, parallel algorithms, architecture, matrix algebra, real-time applications, least square approximation, least squares approximations, design parameter, computationalcomplexity
27Stephan Olariu, Zhaofang Wen Optimal Parallel Initialization Algorithms for a Class of Priority Queues. Search on Bibsonomy IEEE Trans. Parallel Distributed Syst. The full citation details ... 1991 DBLP  DOI  BibTeX  RDF parallel initialization algorithms, adaptive parallel algorithm, priority queue structure, n-element array, parallel construction algorithms, heap-like structures, double-endedpriority queues, min-max heaps, deeps, min-max-pair heaps, exclusive-read-exclusive-write parallel random-access machine, parallel algorithms, data structures, queueing theory, processors, computationalcomplexity
25Brahim Bensaou, Zhenning Kong, Danny H. K. Tsang A Measurement-Assisted, Model-Based Admission Control Algorithm for IEEE 802.11e. Search on Bibsonomy ISPAN The full citation details ... 2008 DBLP  DOI  BibTeX  RDF Enhanced Distributed Channel Access, Wireless LAN, Call Admission Control, IEEE 802.11e
25Alessandra Nardi, Haibo Zeng 0001, Joshua L. Garrett, Luca Daniel, Alberto L. Sangiovanni-Vincentelli A Methodology for the Computation of an Upper Bound on Nose Current Spectrum of CMOS Switching Activity. Search on Bibsonomy ICCAD The full citation details ... 2003 DBLP  DOI  BibTeX  RDF
25James R. Morrison, P. R. Kumar 0001 New Linear Program Performance Bounds for Closed Queueing Networks. Search on Bibsonomy Discret. Event Dyn. Syst. The full citation details ... 2001 DBLP  DOI  BibTeX  RDF closed networks, closed reentrant lines, asymptotic loss, scheduling, performance evaluation, efficiency, throughput, Queueing networks
25Darko Kirovski, Miodrag Potkonjak System-Level Synthesis of Low-Power Hard Real-Time Systems. Search on Bibsonomy DAC The full citation details ... 1997 DBLP  DOI  BibTeX  RDF
25Huan-Chih Tsai, Kwang-Ting Cheng, Chih-Jen Lin, Sudipta Bhawmik A Hybrid Algorithm for Test Point Selection for Scan-Based BIST. Search on Bibsonomy DAC The full citation details ... 1997 DBLP  DOI  BibTeX  RDF
Displaying result #1 - #12 of 12 (100 per page; Change: )
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