

Venues (Conferences, Journals, ...)


GrowBag graphs for keyword ? (Num. hits/coverage)
Group by:
The graphs summarize 3561 occurrences of 1923 keywords



Results
Found 3109 publication records. Showing 3109 according to the selection in the facets
Hits ?▲ 
Authors 
Title 
Venue 
Year 
Link 
Author keywords 
35  Lefteris M. Kirousis, Paul G. Spirakis, Philippas Tsigas 
Reading Many Variables in One Atomic Operation: Solutions with Linear or Sublinear Complexity. 
IEEE Trans. Parallel Distrib. Syst. 
1994 
DBLP DOI BibTeX RDF 
sublinear complexity, deterministic protocol, memory location, Archimedean time assumption, computational complexity, protocols, distributed algorithms, time complexity, probabilistic algorithm, linear complexity, space complexity, atomic operation 
30  Philip Wadler 
Strictness Analysis Aids Time Analysis. 
POPL 
1988 
DBLP DOI BibTeX RDF 

27  Baoliang Xu, Wenjian Luo, Xingxin Pei, Min Zhang 0010, Xufa Wang 
On average time complexity of evolutionary negative selection algorithms for anomaly detection. 
GEC Summit 
2009 
DBLP DOI BibTeX RDF 
drift analysis, evolutionary negative selection algorithm, anomaly detection, artificial immune system, time complexity 
25  Lefteris M. Kirousis, Paul G. Spirakis, Philippas Tsigas 
Reading Many Variables in One Atomic Operation: Solutions With Linear or Sublinear Complexity. 
WDAG 
1991 
DBLP DOI BibTeX RDF 

24  Mikhail Ju. Moshkov 
Time Complexity of Decision Trees. 
Trans. Rough Sets 
2005 
DBLP DOI BibTeX RDF 
decision tree, time complexity, rough set theory, test theory 
23  Chuanxiong Guo 
SRR: an O(1) timecomplexity packet scheduler for flows in multiservice packet networks. 
IEEE/ACM Trans. Netw. 
2004 
DBLP DOI BibTeX RDF 
time complexity, packet scheduling, highspeed networks, endtoend delay, fair queueing 
23  Yongzhuang Wei, YuPu Hu 
New relatedkey rectangle attacks on reduced AES192 and AES256. 
Science in China Series F: Information Sciences 
2009 
DBLP DOI BibTeX RDF 
block cipher, Advanced Encryption Standard, time complexity, relatedkey rectangle attack 
23  Marc R. C. van Dongen 
Saving SupportChecks Does Not Always Save Time. 
Artif. Intell. Rev. 
2004 
DBLP DOI BibTeX RDF 
maintain arcconsistency, Abbrevations:, CSP  constraint satisfaction problem, MAC  maintain arc consistency, RLFAP  radio link frequency assignment problem, search, heuristics, constraint satisfaction, timecomplexity, spacecomplexity 
22  Nils Anders Danielsson 
Lightweight semiformal time complexity analysis for purely functional data structures. 
POPL 
2008 
DBLP DOI BibTeX RDF 
amortised time complexity, purely functional data structures, dependent types, lazy evaluation 
22  YongJik Kim, James H. Anderson 
Nonatomic mutual exclusion with local spinning. 
Distributed Computing 
2006 
DBLP DOI BibTeX RDF 
Nonatomic operations, Lower bounds, Shared memory, Time complexity, Mutual exclusion 
20  Amir M. BenAmram, Neil D. Jones, Lars Kristiansen 
Linear, Polynomial or Exponential? Complexity Inference in Polynomial Time. 
CiE 
2008 
DBLP DOI BibTeX RDF 
linear time complexity, static program analysis, polynomial time complexity, implicit computational complexity 
19  James H. Anderson, YongJik Kim 
An improved lower bound for the time complexity of mutual exclusion. 
Distributed Computing 
2002 
DBLP DOI BibTeX RDF 
Lower bounds, Shared memory, Time complexity, Mutual exclusion, Atomicity, Local spinning 
19  Hyungill Kim, Sungyoung Lee, ByeongSoo Jeong 
An improved feasible shortest path realtime faulttolerant scheduling algorithm. 
RTCSA 
2000 
DBLP DOI BibTeX RDF 
feasible shortest path real time fault tolerant scheduling algorithm, real time single processor environment, queue based scheduling techniques, feasible shortest path algorithm, linear time heuristics, FSP algorithm, optimal fault tolerant schedules, LTH algorithm, real time scheduling performance, backup scheduling, minimum interfault time, primary tasks, fault tolerant schedule, backup schedules, scheduling, fault tolerance, realtime systems, computational complexity, fault tolerant computing, queueing theory, time complexity, timing constraints, system performance, greedy heuristics, time interval, real time computer systems 
19  Bin Zhang 0003, Dengguo Feng 
New GuessandDetermine Attack on the SelfShrinking Generator. 
ASIACRYPT 
2006 
DBLP DOI BibTeX RDF 
Selfshrinking, Guessanddetermine, Stream cipher, Linear feedback shift register (LFSR) 
18  Muhammad Kafil, Ishfaq Ahmad 
Optimal task assignment in heterogeneous computing systems. 
Heterogeneous Computing Workshop 
1997 
DBLP DOI BibTeX RDF 
optimal task assignment, bestfirst search technique, assignment algorithm, distributed systems, computational complexity, artificial intelligence, highperformance computing, NPhard, time complexity, clustering technique, search technique, heuristic techniques, heterogeneous computing systems 
18  Tony Savor, Rudolph E. Seviora 
Improving the efficiency of supervision by software through state aggregation. 
IEEE Real Time Technology and Applications Symposium 
1995 
DBLP DOI BibTeX RDF 
private telephone exchanges, supervisory software, software supervision, real time failure detection, real time system monitoring, running time complexity, specification processes, software supervisor, ITU Specification and Description Language, small private branch telephone exchange, SDL processes, telecom switching software, realtime systems, computational complexity, formal specification, fault diagnosis, telecommunication computing, state transitions, telecommunication control, computerised monitoring, inputs queues, state aggregation 
18  Sushil K. Prasad, Sajal K. Das, Calvin ChingYuen Chen 
Efficient EREW PRAM Algorithms for ParenthesesMatching. 
IEEE Trans. Parallel Distrib. Syst. 
1994 
DBLP DOI BibTeX RDF 
EREW PRAM algorithms, parenthesesmatching, polylogtime parallel algorithms, exclusiveread and exclusivewrite, parallelrandomaccess machine, input string, working space, timeoptimal algorithms, pattern recognition, parallel algorithms, computational complexity, data structures, data structures, parallel machines, time complexity, arrays, space complexity, randomaccess storage, PRAM model 
18  Andreas Jakoby 
The Average Time Complexity to Compute Prefix Functions in Processor Networks. 
STACS 
1999 
DBLP DOI BibTeX RDF 

18  Jianxing Feng, Daming Zhu 
Faster algorithms for sorting by transpositions and sorting by block interchanges. 
ACM Trans. Algorithms 
2007 
DBLP DOI BibTeX RDF 
Block interchange, tree, time complexity, permutation, genome, transposition 
17  Rongyue Zhang, Vasiliy Sachnev, HyoungJoong Kim 
Fast BCH Syndrome Coding for Steganography. 
Information Hiding 
2009 
DBLP DOI BibTeX RDF 
syndrome coding, error correction code, steganography, data hiding, BCH coding 
17  Rusins Freivalds, Janis Barzdins, Karlis Podnieks 
Inductive Inference of Recursive Functions: Complexity Bounds. 
Baltic Computer Science 
1991 
DBLP DOI BibTeX RDF 

17  Bolin Ding, Jeffrey Xu Yu, Lu Qin 
Finding timedependent shortest paths over large graphs. 
EDBT 
2008 
DBLP DOI BibTeX RDF 

17  Bilel Derbel 
Local Maps: New Insights into Mobile Agent Algorithms. 
DISC 
2008 
DBLP DOI BibTeX RDF 
local maps, Mobile agents, time complexity 
17  Jie Li 0002, Yi Pan 0001, Hong Shen 
More Efficient Topological Sort Using Reconfigurable Optical Buses. 
The Journal of Supercomputing 
2003 
DBLP DOI BibTeX RDF 
time complexity, analysis of algorithms, massive parallelism, graph problem, optical bus 
16  Zhifeng Hao, Han Huang, Xili Zhang, Kun Tu 
A Time Complexity Analysis of ACO for Linear Functions. 
SEAL 
2006 
DBLP DOI BibTeX RDF 

15  Deng Pan, Yuanyuan Yang 
Credit based fair scheduling for packet switched networks. 
INFOCOM 
2005 
DBLP DOI BibTeX RDF 

15  ChuanChing Sue 
An Enhanced Universal N x N Fully Nonblocking Quantum Switch. 
IEEE Trans. Computers 
2009 
DBLP DOI BibTeX RDF 

15  Emilie Charrier, Lilian Buzer 
Reducing the Coefficients of a TwoDimensional Integer Linear Constraint. 
IWCIA 
2008 
DBLP DOI BibTeX RDF 
integer convex hull, Bezout identity, logarithmic time complexity, Linear constraint, continued fraction 
15  Beatrice Luca, Stefan Andrei, Hugh Anderson, SiauCheng Khoo 
Program transformation by solving recurrences. 
PEPM 
2006 
DBLP DOI BibTeX RDF 
efficient time complexity, recurrences with one or multiple parameters, program transformation 
15  Y. J. Bae, Michael C. Fairhurst 
Parallelism in dynamic time warping for automatic signature verification. 
ICDAR 
1995 
DBLP DOI BibTeX RDF 
automatic signature verification, mathematical optimisation, sequentially structured problems, pipeline paradigm, highly distributed network, Meiko Computing Surface, Occam2, computational complexity, computational complexity, optimisation, handwriting recognition, time complexity, dynamic time warping, time warp simulation, transputer network 
15  Hussein M. Alnuweiri, Viktor K. Prasanna 
Fast Image Labeling Using Local Operators on MeshConnected Computers. 
IEEE Trans. Pattern Anal. Mach. Intell. 
1991 
DBLP DOI BibTeX RDF 
bitserial processors, local operators, asymptotic time complexity, very fast shift registers, parallel algorithm, parallel algorithms, computational complexity, computational complexity, parallel architectures, parallel architectures, computerised picture processing, computerised picture processing, stacks, communication links, meshconnected computers, image labeling 
15  Michael E. Houle, Godfried T. Toussaint 
Computing the Width of a Set. 
IEEE Trans. Pattern Anal. Mach. Intell. 
1988 
DBLP DOI BibTeX RDF 
parallel planes, pattern recognition, pattern recognition, computational complexity, computational complexity, computational geometry, computational geometry, time complexity, convex hull, set theory, polygons, point sets, 3D space 
15  Xingwu Liu, Zhiwei Xu 
Interaction Complexity  A Computational Complexity Measure for ServiceOriented Computing. 
SKG 
2005 
DBLP DOI BibTeX RDF 

15  Tianshi Chen, Ke Tang, Guoliang Chen 0001, Xin Yao 0001 
On the analysis of average time complexity of estimation of distribution algorithms. 
IEEE Congress on Evolutionary Computation 
2007 
DBLP DOI BibTeX RDF 

15  Qingzhou Wang, KamHoi Cheng 
Parallel time complexity of a heuristic algorithm for the kcenter problem with usage weights. 
SPDP 
1990 
DBLP DOI BibTeX RDF 

15  Jurek Czyzowicz, Leszek Gasieniec, Dariusz R. Kowalski, Andrzej Pelc 
Consensus and Mutual Exclusion in a Multiple Access Channel. 
DISC 
2009 
DBLP DOI BibTeX RDF 
consensus, collision detection, mutual exclusion, multiple access channel 
15  Rui Yang, Shijie Zhou, Chengyu Fan 
A New Algorithm for Network Diameter. 
ICYCS 
2008 
DBLP DOI BibTeX RDF 

15  James H. Anderson, YongJik Kim 
A new fastpath mechanism for mutual exclusion. 
Distributed Computing 
2001 
DBLP DOI BibTeX RDF 
Fast mutual exclusion, Read/write atomicity, Scalability, Shared memory, Local spinning 
15  Amir M. BenAmram, Neil D. Jones 
Computational complexity via programming languages: constant factors do matter. 
Acta Inf. 
2000 
DBLP DOI BibTeX RDF 

15  Shay Kutten, David Peleg 
Deterministic distributed resource discovery (brief announcement). 
PODC 
2000 
DBLP DOI BibTeX RDF 

15  Fabian Kuhn, Thomas Locher, Roger Wattenhofer 
Tight bounds for distributed selection. 
SPAA 
2007 
DBLP DOI BibTeX RDF 
sensor networks, distributed algorithms, time complexity, data aggregation, median, innetwork aggregation 
15  Heejong Suh, Carl K. Chang 
Algorithms for the Minimal Cutsets Enumeration of Networks by Graph Search and Branch Addition. 
LCN 
2000 
DBLP DOI BibTeX RDF 
minimal cutsets enumeration, branch addition, graph method, graph tree, subvertex set, graph topology, disjoint vertex set, algorithms, computational complexity, reliability, reliability, networks, graph theory, network topology, time complexity, spanning tree, binary tree, graph search 
15  James H. Anderson, Philip Holman 
Efficient purebuffer algorithms for realtime systems. 
RTCSA 
2000 
DBLP DOI BibTeX RDF 
efficient purebuffer algorithms, multiprocessor realtime systems, multiwriter read/write purebuffers, overwritten data, client processes, handshaking mechanisms, concurrent read/write operations safety, quantumscheduled systems, priorityscheduled systems, buffer word length, realtime systems, computational complexity, distributed algorithms, safety, multiprocessing systems, time complexity, processor scheduling, optimized algorithms, buffer storage, space complexity, waitfree algorithms, shared buffers, processor number 
15  Han Kesong, Yongcheng Wang, Guilin Chen 
Research on a faster algorithm for pattern matching. 
IRAL 
2000 
DBLP DOI BibTeX RDF 
BoyerMoore algorithm, quick search algorithm, pattern matching, time complexity 
15  Vincenzo Auletta, Amelia De Vivo, Vittorio Scarano 
Multiple Templates Access of Trees in Parallel Memory Systems. 
IPPS 
1997 
DBLP DOI BibTeX RDF 
multiple template access, node mapping algorithms, subtree templates, roottoleaf path templates, preprocessing phase, data structure, time complexity, tree data structures, load, complete binary trees, conflictfree access, parallel access, memory modules, parallel memory systems 
15  Ajay D. Kshemkalyani, Mukesh Singhal 
Efficient Detection and Resolution of Generalized Distributed Deadlocks. 
IEEE Trans. Software Eng. 
1994 
DBLP DOI BibTeX RDF 
generalized distributed deadlock resolution, onephase algorithm, concurrent sweeps, generalized distributed deadlock detection, outward sweep, distributed waitforgraph, inward sweep, distributed snapshot, algorithm correctness, worstcase message complexity, leaf nodes, distributed system, computational complexity, concurrency control, directed graphs, directed graph, time complexity, messages, operating systems (computers), graph reduction 
15  Fionn Murtagh 
Comments on 'Parallel Algorithms for Hierarchical Clustering and Cluster Validity'. 
IEEE Trans. Pattern Anal. Mach. Intell. 
1992 
DBLP DOI BibTeX RDF 
computational time complexity, singlelink method, pattern recognition, pattern recognition, parallel algorithms, parallel algorithms, computational complexity, hierarchical clustering, cluster validity 
14  Georg Seelig, David Soloveichik 
TimeComplexity of Multilayered DNA Strand Displacement Circuits. 
DNA 
2009 
DBLP DOI BibTeX RDF 

14  James N. Knight, Monte Lunacek 
Reducing the spacetime complexity of the CMAES. 
GECCO 
2007 
DBLP DOI BibTeX RDF 
complexity, evolution strategy, covariance matrix adaptation 
14  Zhihong Zuo, Qingxin Zhu, Mingtian Zhou 
On the time complexity of computer viruses. 
IEEE Trans. Information Theory 
2005 
DBLP DOI BibTeX RDF 

14  Keqin Li 
Constant Time Boolean Matrix Multiplication on a Linear Array with a Reconfigurable Pipelined Bus System. 
The Journal of Supercomputing 
1997 
DBLP DOI BibTeX RDF 
Boolean matrix closure, reconfigurability, time complexity, cost, transitive closure, processor array, optical bus, boolean matrix multiplication 
14  YuKwong Kwok, Ishfaq Ahmad 
A Parallel Algorithm for CompileTime Scheduling of Parallel Programs on Multiprocessors. 
IEEE PACT 
1997 
DBLP DOI BibTeX RDF 
parallel randomized algorithm, PFAST algorithm, parallel fast assignment, parallel random search technique, computeraided parallelization, computeraided scheduling tool, CASCH tool, running time constraints, parallel programming, parallel programs, multiprocessors, time complexity, directed acyclic graphs, execution times, lineartime algorithm, Intel Paragon, compiletime scheduling 
14  Mohamed Naimi 
Parallel assignment to distinct identities in arbitrary networks. 
ICCCN 
1995 
DBLP DOI BibTeX RDF 
sequential distributed algorithm, parallel assignment, distinct identities, parallel distributed algorithm, distributed system nodes, initiator channel, children channel, outgoing channels, upper bound time transmission, parallel algorithms, multiprocessor interconnection networks, time complexity, communication complexity, spanning tree, depthfirst search, network diameter, rooted tree, arbitrary network, synchronous distributed systems 
14  Curt Powley, Richard E. Korf 
SingleAgent Parallel Window Search. 
IEEE Trans. Pattern Anal. Mach. Intell. 
1991 
DBLP DOI BibTeX RDF 
parallel window search, singleagent problems, IterativeDeepeningA*, node ordering, parallel algorithms, computational complexity, optimisation, iterative methods, time complexity, search problems 
14  YenCheng Chen, WenTsuen Chen, GenHuey Chen, JangPing Sheu 
Designing Efficient Parallel Algorithms on MechConnected Computers with Multiple Broadcasting. 
IEEE Trans. Parallel Distrib. Syst. 
1990 
DBLP DOI BibTeX RDF 
mechconnected computers, 2MCCMBs, parallel algorithms, parallel algorithms, computational complexity, parallel architectures, time complexity, multiprocessorinterconnection networks, prefix computations, prefix computations, multiple broadcasting, multiple broadcasting, semigroup computations 
14  Shay Kutten, David Peleg, Uzi Vishkin 
Deterministic Resource Discovery in Distributed Networks. 
Theory Comput. Syst. 
2003 
DBLP DOI BibTeX RDF 

14  YongJik Kim, James H. Anderson 
Adaptive mutual exclusion with local spinning. 
Distributed Computing 
2007 
DBLP DOI BibTeX RDF 
Adaptive mutual exclusion, Read/write atomicity, Time complexity, Sharedmemory systems, Local spinning 
14  Wenqin Zhou, Jacques Carette, David J. Jeffrey, Michael B. Monagan 
Hierarchical Representations with Signatures for Large Expression Management. 
AISC 
2006 
DBLP DOI BibTeX RDF 
Veiling Strategy, Zero Test, Large Expression Management, Symbolic LU Decomposition, Time Complexity, Signature, Hierarchical Representation 
14  Katia Hristova, Tom Rothamel, Yanhong A. Liu, Scott D. Stoller 
Efficient type inference for secure information flow. 
PLAS 
2006 
DBLP DOI BibTeX RDF 
security, algorithm, information flow, time complexity, type inference 
14  Wenling Wu, Dengguo Feng, Hua Chen 
Collision Attack and Pseudorandomness of ReducedRound Camellia. 
Selected Areas in Cryptography 
2004 
DBLP DOI BibTeX RDF 
Block cipher, Time complexity, Pseudorandomness, Data complexity, Camellia 
14  David J. Lieberman, Jan P. Allebach 
Efficient Model Based Halftoning Using Direct Binary Search. 
ICIP (1) 
1997 
DBLP DOI BibTeX RDF 
model based halftoning, direct binary search algorithm, grayscale original image, halftone quality, HVS model parameters, halftone updating, image processing, efficiency, iterative method, time complexity, human visual system, pixel, local minimum, halftone image 
14  Eiichi Tanaka 
A Metric Between Unrooted and Unordered Trees and its BottomUp Computing Method. 
IEEE Trans. Pattern Anal. Mach. Intell. 
1994 
DBLP DOI BibTeX RDF 
unrooted trees, unordered trees, bottomup computing method, strongly structurepreserving mapping, vertex correspondences, similar substructures, similar structure search, pattern recognition, computational complexity, dynamic programming, dynamic programming, pattern matching, pattern matching, similarity, time complexity, trees (mathematics), space complexity, distance metric, maximum degrees 
14  Xuzhen Xie, Mutsunori Yagiura, Takao Ono, Tomio Hirata, Uri Zwick 
New Bounds for the Nearly Equitable Edge Coloring Problem. 
ISAAC 
2007 
DBLP DOI BibTeX RDF 

14  Jiajing Zhuo, Chen Meng, Minghu Zou 
A Task Scheduling Algorithm of Single Processor Parallel Test System. 
SNPD (1) 
2007 
DBLP DOI BibTeX RDF 
Auto test system(ATS), Multithreading technique, Task scheduling algorithm, Algorithm time complexity, Parallel test 
14  Amihood Amir, Yonatan Aumann, Gad M. Landau, Moshe Lewenstein, Noa Lewenstein 
Pattern Matching with Swaps. 
FOCS 
1997 
DBLP DOI BibTeX RDF 
swapped matching, O(mn) time, pattern matching, pattern matching, time complexity, text string 
14  Yoshifumi Manabe, Shigemi Aoyagi 
A feasibility decision algorithm for rate monotonic scheduling of periodic realtime tasks. 
IEEE Real Time Technology and Applications Symposium 
1995 
DBLP DOI BibTeX RDF 
feasibility decision algorithm, periodic realtime tasks, task scheduling algorithm, periodic real time task systems, real time task system, inverse deadline scheduling algorithm, scheduling, realtime systems, computational complexity, time complexity, scheduling algorithm, rate monotonic scheduling 
14  Subhada K. Mishra, Vijay V. Raghavan 0001, NianFeng Tzeng 
Efficient Algorithms For Selection of Recovery Points in Tree Task Models. 
IEEE Trans. Software Eng. 
1991 
DBLP DOI BibTeX RDF 
tree task models, recovery points, task precedence, uniprocessor environment, binary tree model, exponential time requirements, arbitrary tree model, computational complexity, optimisation, time complexity, trees (mathematics), tree structure 
14  ChinShyurng Fahn, JhingFa Wang, JauYien Lee 
An Adaptive Reduction Procedure for the Piecewise Linear Approximation of Digitized Curves. 
IEEE Trans. Pattern Anal. Mach. Intell. 
1989 
DBLP DOI BibTeX RDF 
2D digitised curves, adaptive reduction, computational complexity, computerised picture processing, computerised picture processing, time complexity, critical points, piecewise linear approximation, square grid 
14  Chryssis Georgiou, Dariusz R. Kowalski, Alexander A. Shvartsman 
Efficient Gossip and Robust Distributed Computation. 
DISC 
2003 
DBLP DOI BibTeX RDF 

13  Lin Lin, Le Yi Wang, George Zames 
Time complexity and model complexity of fast identification of continuoustime LTI systems. 
IEEE Trans. Automat. Contr. 
1999 
DBLP DOI BibTeX RDF 

13  Chuanxiong Guo 
SRR: An O(1) time complexity packet scheduler for flows in multiservice packet networks. 
SIGCOMM 
2001 
DBLP DOI BibTeX RDF 
QoS, Internet, complexity, packet scheduler, high speed networks, endtoend delay, fair queueing 
13  Norman Danner, James S. Royer 
TimeComplexity Semantics for Feasible Affine Recursions. 
CiE 
2007 
DBLP DOI BibTeX RDF 

13  Sarang C. Joshi, S. K. Bodhe 
Time Complexity Analysis for Decoding VOP Content in MPEG4 Presentations. 
ITNG 
2007 
DBLP DOI BibTeX RDF 

13  Seon Ok Lee, Seok Won Jung, Chang Han Kim, Janghong Yoon, JaeYoung Koh, Daeho Kim 
Design of Bit Parallel Multiplier with Lower Time Complexity. 
ICISC 
2003 
DBLP DOI BibTeX RDF 

13  JyhHuei Guo, ChinLiang Wang 
A low timecomplexity, hardwareefficient bitparallel powersum circuit for finite fields GF(2M). 
ISCAS (1) 
1999 
DBLP DOI BibTeX RDF 

13  Qi Cheng 
Primality Proving via One Round in ECPP and One Iteration in AKS. 
J. Cryptology 
2007 
DBLP DOI BibTeX RDF 

13  Eldar Fischer, Orly Yahalom 
Testing Convexity Properties of Tree Colorings. 
STACS 
2007 
DBLP DOI BibTeX RDF 

13  Maryam Amiripour, Hamid Abachi 
Analytical Modeling of Task Scheduling for MasterSlave Super Hypercube Architecture. 
SNPD 
2008 
DBLP DOI BibTeX RDF 
modeling, time complexity, task scheduling, message passing architecture, matrix product 
13  Partha Dutta, Rachid Guerraoui, Ron R. Levy, Arindam Chakraborty 
How fast can a distributed atomic read be? 
PODC 
2004 
DBLP DOI BibTeX RDF 
timecomplexity, atomic registers, sharedmemory emulation 
13  Ricardo A. BaezaYates, Gabriel Valiente 
An Image Similarity Measure Based on Graph Matching. 
SPIRE 
2000 
DBLP DOI BibTeX RDF 
image similarity measure, extended region adjacency graphs, invariance to translation, invariance to rotation, invariance to scaling, pixel similarity threshold, distance measure approximation, image recognition, directed graph, time complexity, image matching, error, graph matching, pixels 
13  Matthias Ruhl, Hannes Hartenstein, Dietmar Saupe 
Adaptive Partitionings for Fractal Image Compression. 
ICIP (2) 
1997 
DBLP DOI BibTeX RDF 
adaptive partitionings, fractal image compression, splitandmerge process, connected sets, small square image blocks, ratedistortion curves, encoding quality, evolutionary computing, data compression, timecomplexity, ranges, acceleration techniques 
13  GyungLeen Park, Behrooz A. Shirazi, Jeff Marquis 
DFRN: A New Approach for Duplication Based Scheduling for Distributed Memory Multiprocessor Systems. 
IPPS 
1997 
DBLP DOI BibTeX RDF 
DFRN, duplication based scheduling, distributed memory multiprocessor systems, parallel execution time minimization, DBS algorithms, task duplication method, worst case behavior, tree structured input directed acyclic graph, time complexity, distributed memory systems, performance improvement, optimal schedule, boundary condition, multiprocessor scheduling problems 
13  JinTai Yan 
An efficient cutbased algorithm on minimizing the number of Lshaped channels for safe routing ordering. 
ICCD 
1995 
DBLP DOI BibTeX RDF 
cutbased algorithm, Lshaped channels, safe routing ordering, geometrical topology, floorplan graph, channel precedence graph, Scuts, redundant Lcuts, balanced Lcuts, nonminimal Lcuts, noncritical Lcuts, critical Lcuts, computational complexity, time complexity, circuit layout CAD, line segments, precedence relations 
13  Garng M. Huang, Shan Zhu 
A fast distributed optimal routing algorithm for multicommodity large data networks. 
IPPS 
1995 
DBLP DOI BibTeX RDF 
fast distributed optimal routing algorithm, multicommodity large data networks, large data network, multicommodities, parallel time complexity, flow demand, OPNET simulation tool, computational complexity, distributed algorithms 
13  JiaShung Wang, BiingFeng Wang, ChenHsing Peng 
Recognizing depthfirstsearch trees in parallel. 
IPPS 
1995 
DBLP DOI BibTeX RDF 
depthfirstsearch trees, parallel algorithms, parallel algorithm, computational complexity, directed graphs, time complexity, spanning tree, search problems, undirected graph, tree searching, speedup, EREW PRAM model 
13  Mayez A. AlMouhamed, Adel AlMaasarani 
Performance Evaluation of Scheduling PrecedenceConstained Computations on MessagePassing Systems. 
IEEE Trans. Parallel Distrib. Syst. 
1994 
DBLP DOI BibTeX RDF 
scheduling precedenceconstrained computations, multiprocessor topology, global prioritybased schedulingheuristics, generalized list scheduling, backward scheduling, graphdriven scheduling, scheduling, performance evaluation, performance evaluation, computational complexity, multiprocessor, message passing, network topology, time complexity, messagepassing systems 
13  ShouHsuan Stephen Huang, Hongfei Liu, Venkatraman Viswanathan 
Parallel Dynamic Programming. 
IEEE Trans. Parallel Distrib. Syst. 
1994 
DBLP DOI BibTeX RDF 
parallel dynamicprogramming, optimal binary search tree, optimal triangulation ofpolygons, CREW PRAM algorithm, parallel algorithms, computational complexity, dynamic programming, time complexity, matrix multiplication 
13  Jun Gu, Wei Wang 
A Novel Discrete Relaxation Architecture. 
IEEE Trans. Pattern Anal. Mach. Intell. 
1992 
DBLP DOI BibTeX RDF 
discrete relaxation algorithm, sequential AC1 algorithm, sequential AC4 algorithm, parallel DRA5 algorithm, parallel algorithms, computational complexity, parallel architectures, time complexity, polynomial, polynomials 
13  JunIchi Aoe 
An Efficient Digital Search Algorithm by Using a DoubleArray Structure. 
IEEE Trans. Software Eng. 
1989 
DBLP DOI BibTeX RDF 
digital search algorithm, doublearray structure, internal array structure, matrix form, list form, digital search tree, DStree, worstcase time complexity, input symbols, constant, computational complexity, data structures, retrieval, trees (mathematics), search problems, nodes, insertion, deletion, key, arc 
13  Kiyoharu Hamaguchi, Hiromi Hiraishi, Shuzo Yajima 
Branching Time Regular Temporal Logic for Model Checking with Linear Time Complexity. 
CAV 
1990 
DBLP DOI BibTeX RDF 

13  Ashish V. Naik, Kenneth W. Regan, D. Sivakumar 
Quasilinear Time Complexity Theory. 
STACS 
1994 
DBLP DOI BibTeX RDF 

13  YongJik Kim, James H. Anderson 
A Time Complexity Bound for Adaptive Mutual Exclusion. 
DISC 
2001 
DBLP DOI BibTeX RDF 

13  Baudoin Collard, FrançoisXavier Standaert, JeanJacques Quisquater 
Improving the Time Complexity of Matsui's Linear Cryptanalysis. 
ICISC 
2007 
DBLP DOI BibTeX RDF 
Fast Fourier Transform, block ciphers, linear cryptanalysis 
13  Weiyi Zhang, Guoliang Xue, Jian Tang 0008, Krishnaiyan Thulasiraman 
Linear time construction of redundant trees for recovery schemes enhancing QoP and QoS. 
INFOCOM 
2005 
DBLP DOI BibTeX RDF 

13  Kwongfai Chan, Tak Wah Lam 
Finding LeastWeight Subsequences with Fewer Processors. 
SIGAL International Symposium on Algorithms 
1990 
DBLP DOI BibTeX RDF 

12  Xiaorui Sun, Xuejia Lai 
Improved Integral Attacks on MISTY1. 
Selected Areas in Cryptography 
2009 
DBLP DOI BibTeX RDF 

12  Christophe Nègre 
Quadrinomial Modular Arithmetic using Modified Polynomial Basis. 
ITCC (1) 
2005 
DBLP DOI BibTeX RDF 

12  Lisa Hellerstein, Krishnan Pillaipakkamnatt, Vijay Raghavan 0002, Dawn Wilkins 
How Many Queries Are Needed to Learn? 
J. ACM 
1996 
DBLP DOI BibTeX RDF 
exact identification, polynomialquery learning, polynomialtime learning, proper learning, certificates, membership queries, equivalence queries, polynomialtime hierarchy 
12  Dan Suciu, Val Tannen 
Efficient Compilation of HighLevel Data Parallel Algorithms. 
SPAA 
1994 
DBLP DOI BibTeX RDF 

12  Huajun Quin 
Efficient Verification of Determinate Processes. 
CONCUR 
1991 
DBLP DOI BibTeX RDF 

Displaying result #1  #100 of 3109 (100 per page; Change: ) Pages: [ 1][ 2][ 3][ 4][ 5][ 6][ 7][ 8][ 9][ 10][ >>] 
