The FacetedDBLP logo    Search for: in:

Disable automatic phrases ?     Syntactic query expansion: ?

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

Publication years (Num. hits)
1968-1979 (16) 1980-1982 (15) 1983-1985 (26) 1986-1987 (40) 1988 (28) 1989 (39) 1990 (62) 1991 (42) 1992 (51) 1993 (46) 1994 (52) 1995 (55) 1996 (55) 1997 (61) 1998 (58) 1999 (102) 2000 (97) 2001 (91) 2002 (162) 2003 (169) 2004 (228) 2005 (264) 2006 (311) 2007 (311) 2008 (284) 2009 (240) 2010 (43) 2011 (20) 2012 (20) 2013-2014 (39) 2015 (26) 2016-2017 (36) 2018 (17) 2019 (3)
Publication types (Num. hits)
article(782) book(1) incollection(6) inproceedings(2319) phdthesis(1)
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
35Lefteris M. Kirousis, Paul G. Spirakis, Philippas Tsigas Reading Many Variables in One Atomic Operation: Solutions with Linear or Sublinear Complexity. Search on Bibsonomy IEEE Trans. Parallel Distrib. Syst. The full citation details ... 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
30Philip Wadler Strictness Analysis Aids Time Analysis. Search on Bibsonomy POPL The full citation details ... 1988 DBLP  DOI  BibTeX  RDF
27Baoliang Xu, Wenjian Luo, Xingxin Pei, Min Zhang 0010, Xufa Wang On average time complexity of evolutionary negative selection algorithms for anomaly detection. Search on Bibsonomy GEC Summit The full citation details ... 2009 DBLP  DOI  BibTeX  RDF drift analysis, evolutionary negative selection algorithm, anomaly detection, artificial immune system, time complexity
25Lefteris M. Kirousis, Paul G. Spirakis, Philippas Tsigas Reading Many Variables in One Atomic Operation: Solutions With Linear or Sublinear Complexity. Search on Bibsonomy WDAG The full citation details ... 1991 DBLP  DOI  BibTeX  RDF
24Mikhail Ju. Moshkov Time Complexity of Decision Trees. Search on Bibsonomy Trans. Rough Sets The full citation details ... 2005 DBLP  DOI  BibTeX  RDF decision tree, time complexity, rough set theory, test theory
23Chuanxiong Guo SRR: an O(1) time-complexity packet scheduler for flows in multiservice packet networks. Search on Bibsonomy IEEE/ACM Trans. Netw. The full citation details ... 2004 DBLP  DOI  BibTeX  RDF time complexity, packet scheduling, high-speed networks, end-to-end delay, fair queueing
23Yongzhuang Wei, YuPu Hu New related-key rectangle attacks on reduced AES-192 and AES-256. Search on Bibsonomy Science in China Series F: Information Sciences The full citation details ... 2009 DBLP  DOI  BibTeX  RDF block cipher, Advanced Encryption Standard, time complexity, related-key rectangle attack
23Marc R. C. van Dongen Saving Support-Checks Does Not Always Save Time. Search on Bibsonomy Artif. Intell. Rev. The full citation details ... 2004 DBLP  DOI  BibTeX  RDF maintain arc-consistency, Abbrevations:, CSP - constraint satisfaction problem, MAC - maintain arc consistency, RLFAP - radio link frequency assignment problem, search, heuristics, constraint satisfaction, time-complexity, space-complexity
22Nils Anders Danielsson Lightweight semiformal time complexity analysis for purely functional data structures. Search on Bibsonomy POPL The full citation details ... 2008 DBLP  DOI  BibTeX  RDF amortised time complexity, purely functional data structures, dependent types, lazy evaluation
22Yong-Jik Kim, James H. Anderson Nonatomic mutual exclusion with local spinning. Search on Bibsonomy Distributed Computing The full citation details ... 2006 DBLP  DOI  BibTeX  RDF Nonatomic operations, Lower bounds, Shared memory, Time complexity, Mutual exclusion
20Amir M. Ben-Amram, Neil D. Jones, Lars Kristiansen Linear, Polynomial or Exponential? Complexity Inference in Polynomial Time. Search on Bibsonomy CiE The full citation details ... 2008 DBLP  DOI  BibTeX  RDF linear time complexity, static program analysis, polynomial time complexity, implicit computational complexity
19James H. Anderson, Yong-Jik Kim An improved lower bound for the time complexity of mutual exclusion. Search on Bibsonomy Distributed Computing The full citation details ... 2002 DBLP  DOI  BibTeX  RDF Lower bounds, Shared memory, Time complexity, Mutual exclusion, Atomicity, Local spinning
19Hyungill Kim, Sungyoung Lee, Byeong-Soo Jeong An improved feasible shortest path real-time fault-tolerant scheduling algorithm. Search on Bibsonomy RTCSA The full citation details ... 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 inter-fault time, primary tasks, fault tolerant schedule, backup schedules, scheduling, fault tolerance, real-time systems, computational complexity, fault tolerant computing, queueing theory, time complexity, timing constraints, system performance, greedy heuristics, time interval, real time computer systems
19Bin Zhang 0003, Dengguo Feng New Guess-and-Determine Attack on the Self-Shrinking Generator. Search on Bibsonomy ASIACRYPT The full citation details ... 2006 DBLP  DOI  BibTeX  RDF Self-shrinking, Guess-and-determine, Stream cipher, Linear feedback shift register (LFSR)
18Muhammad Kafil, Ishfaq Ahmad Optimal task assignment in heterogeneous computing systems. Search on Bibsonomy Heterogeneous Computing Workshop The full citation details ... 1997 DBLP  DOI  BibTeX  RDF optimal task assignment, best-first search technique, assignment algorithm, distributed systems, computational complexity, artificial intelligence, high-performance computing, NP-hard, time complexity, clustering technique, search technique, heuristic techniques, heterogeneous computing systems
18Tony Savor, Rudolph E. Seviora Improving the efficiency of supervision by software through state aggregation. Search on Bibsonomy IEEE Real Time Technology and Applications Symposium The full citation details ... 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, real-time systems, computational complexity, formal specification, fault diagnosis, telecommunication computing, state transitions, telecommunication control, computerised monitoring, inputs queues, state aggregation
18Sushil 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
18Andreas Jakoby The Average Time Complexity to Compute Prefix Functions in Processor Networks. Search on Bibsonomy STACS The full citation details ... 1999 DBLP  DOI  BibTeX  RDF
18Jianxing Feng, Daming Zhu Faster algorithms for sorting by transpositions and sorting by block interchanges. Search on Bibsonomy ACM Trans. Algorithms The full citation details ... 2007 DBLP  DOI  BibTeX  RDF Block interchange, tree, time complexity, permutation, genome, transposition
17Rongyue Zhang, Vasiliy Sachnev, Hyoung-Joong Kim Fast BCH Syndrome Coding for Steganography. Search on Bibsonomy Information Hiding The full citation details ... 2009 DBLP  DOI  BibTeX  RDF syndrome coding, error correction code, steganography, data hiding, BCH coding
17Rusins Freivalds, Janis Barzdins, Karlis Podnieks Inductive Inference of Recursive Functions: Complexity Bounds. Search on Bibsonomy Baltic Computer Science The full citation details ... 1991 DBLP  DOI  BibTeX  RDF
17Bolin Ding, Jeffrey Xu Yu, Lu Qin Finding time-dependent shortest paths over large graphs. Search on Bibsonomy EDBT The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
17Bilel Derbel Local Maps: New Insights into Mobile Agent Algorithms. Search on Bibsonomy DISC The full citation details ... 2008 DBLP  DOI  BibTeX  RDF local maps, Mobile agents, time complexity
17Jie Li 0002, Yi Pan 0001, Hong Shen More Efficient Topological Sort Using Reconfigurable Optical Buses. Search on Bibsonomy The Journal of Supercomputing The full citation details ... 2003 DBLP  DOI  BibTeX  RDF time complexity, analysis of algorithms, massive parallelism, graph problem, optical bus
16Zhifeng Hao, Han Huang, Xili Zhang, Kun Tu A Time Complexity Analysis of ACO for Linear Functions. Search on Bibsonomy SEAL The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
15Deng Pan, Yuanyuan Yang Credit based fair scheduling for packet switched networks. Search on Bibsonomy INFOCOM The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
15Chuan-Ching Sue An Enhanced Universal N x N Fully Nonblocking Quantum Switch. Search on Bibsonomy IEEE Trans. Computers The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
15Emilie Charrier, Lilian Buzer Reducing the Coefficients of a Two-Dimensional Integer Linear Constraint. Search on Bibsonomy IWCIA The full citation details ... 2008 DBLP  DOI  BibTeX  RDF integer convex hull, Bezout identity, logarithmic time complexity, Linear constraint, continued fraction
15Beatrice Luca, Stefan Andrei, Hugh Anderson, Siau-Cheng Khoo Program transformation by solving recurrences. Search on Bibsonomy PEPM The full citation details ... 2006 DBLP  DOI  BibTeX  RDF efficient time complexity, recurrences with one or multiple parameters, program transformation
15Y. J. Bae, Michael C. Fairhurst Parallelism in dynamic time warping for automatic signature verification. Search on Bibsonomy ICDAR The full citation details ... 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
15Hussein M. Alnuweiri, Viktor K. Prasanna Fast Image Labeling Using Local Operators on Mesh-Connected Computers. Search on Bibsonomy IEEE Trans. Pattern Anal. Mach. Intell. The full citation details ... 1991 DBLP  DOI  BibTeX  RDF bit-serial 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, mesh-connected computers, image labeling
15Michael E. Houle, Godfried T. Toussaint Computing the Width of a Set. Search on Bibsonomy IEEE Trans. Pattern Anal. Mach. Intell. The full citation details ... 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
15Xingwu Liu, Zhiwei Xu Interaction Complexity - A Computational Complexity Measure for Service-Oriented Computing. Search on Bibsonomy SKG The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
15Tianshi Chen, Ke Tang, Guoliang Chen 0001, Xin Yao 0001 On the analysis of average time complexity of estimation of distribution algorithms. Search on Bibsonomy IEEE Congress on Evolutionary Computation The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
15Qingzhou Wang, Kam-Hoi Cheng Parallel time complexity of a heuristic algorithm for the k-center problem with usage weights. Search on Bibsonomy SPDP The full citation details ... 1990 DBLP  DOI  BibTeX  RDF
15Jurek Czyzowicz, Leszek Gasieniec, Dariusz R. Kowalski, Andrzej Pelc Consensus and Mutual Exclusion in a Multiple Access Channel. Search on Bibsonomy DISC The full citation details ... 2009 DBLP  DOI  BibTeX  RDF consensus, collision detection, mutual exclusion, multiple access channel
15Rui Yang, Shijie Zhou, Chengyu Fan A New Algorithm for Network Diameter. Search on Bibsonomy ICYCS The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
15James H. Anderson, Yong-Jik Kim A new fast-path mechanism for mutual exclusion. Search on Bibsonomy Distributed Computing The full citation details ... 2001 DBLP  DOI  BibTeX  RDF Fast mutual exclusion, Read/write atomicity, Scalability, Shared memory, Local spinning
15Amir M. Ben-Amram, Neil D. Jones Computational complexity via programming languages: constant factors do matter. Search on Bibsonomy Acta Inf. The full citation details ... 2000 DBLP  DOI  BibTeX  RDF
15Shay Kutten, David Peleg Deterministic distributed resource discovery (brief announcement). Search on Bibsonomy PODC The full citation details ... 2000 DBLP  DOI  BibTeX  RDF
15Fabian Kuhn, Thomas Locher, Roger Wattenhofer Tight bounds for distributed selection. Search on Bibsonomy SPAA The full citation details ... 2007 DBLP  DOI  BibTeX  RDF sensor networks, distributed algorithms, time complexity, data aggregation, median, in-network aggregation
15Heejong Suh, Carl K. Chang Algorithms for the Minimal Cutsets Enumeration of Networks by Graph Search and Branch Addition. Search on Bibsonomy LCN The full citation details ... 2000 DBLP  DOI  BibTeX  RDF minimal cutsets enumeration, branch addition, graph method, graph tree, sub-vertex set, graph topology, disjoint vertex set, algorithms, computational complexity, reliability, reliability, networks, graph theory, network topology, time complexity, spanning tree, binary tree, graph search
15James H. Anderson, Philip Holman Efficient pure-buffer algorithms for real-time systems. Search on Bibsonomy RTCSA The full citation details ... 2000 DBLP  DOI  BibTeX  RDF efficient pure-buffer algorithms, multiprocessor real-time systems, multi-writer read/write pure-buffers, overwritten data, client processes, handshaking mechanisms, concurrent read/write operations safety, quantum-scheduled systems, priority-scheduled systems, buffer word length, real-time systems, computational complexity, distributed algorithms, safety, multiprocessing systems, time complexity, processor scheduling, optimized algorithms, buffer storage, space complexity, wait-free algorithms, shared buffers, processor number
15Han Kesong, Yongcheng Wang, Guilin Chen Research on a faster algorithm for pattern matching. Search on Bibsonomy IRAL The full citation details ... 2000 DBLP  DOI  BibTeX  RDF Boyer-Moore algorithm, quick search algorithm, pattern matching, time complexity
15Vincenzo Auletta, Amelia De Vivo, Vittorio Scarano Multiple Templates Access of Trees in Parallel Memory Systems. Search on Bibsonomy IPPS The full citation details ... 1997 DBLP  DOI  BibTeX  RDF multiple template access, node mapping algorithms, subtree templates, root-to-leaf path templates, preprocessing phase, data structure, time complexity, tree data structures, load, complete binary trees, conflict-free access, parallel access, memory modules, parallel memory systems
15Ajay D. Kshemkalyani, Mukesh Singhal Efficient Detection and Resolution of Generalized Distributed Deadlocks. Search on Bibsonomy IEEE Trans. Software Eng. The full citation details ... 1994 DBLP  DOI  BibTeX  RDF generalized distributed deadlock resolution, one-phase algorithm, concurrent sweeps, generalized distributed deadlock detection, outward sweep, distributed wait-for-graph, inward sweep, distributed snapshot, algorithm correctness, worst-case message complexity, leaf nodes, distributed system, computational complexity, concurrency control, directed graphs, directed graph, time complexity, messages, operating systems (computers), graph reduction
15Fionn Murtagh Comments on 'Parallel Algorithms for Hierarchical Clustering and Cluster Validity'. Search on Bibsonomy IEEE Trans. Pattern Anal. Mach. Intell. The full citation details ... 1992 DBLP  DOI  BibTeX  RDF computational time complexity, single-link method, pattern recognition, pattern recognition, parallel algorithms, parallel algorithms, computational complexity, hierarchical clustering, cluster validity
14Georg Seelig, David Soloveichik Time-Complexity of Multilayered DNA Strand Displacement Circuits. Search on Bibsonomy DNA The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
14James N. Knight, Monte Lunacek Reducing the space-time complexity of the CMA-ES. Search on Bibsonomy GECCO The full citation details ... 2007 DBLP  DOI  BibTeX  RDF complexity, evolution strategy, covariance matrix adaptation
14Zhi-hong Zuo, Qing-xin Zhu, Ming-tian Zhou On the time complexity of computer viruses. Search on Bibsonomy IEEE Trans. Information Theory The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
14Keqin Li Constant Time Boolean Matrix Multiplication on a Linear Array with a Reconfigurable Pipelined Bus System. Search on Bibsonomy The Journal of Supercomputing The full citation details ... 1997 DBLP  DOI  BibTeX  RDF Boolean matrix closure, reconfigurability, time complexity, cost, transitive closure, processor array, optical bus, boolean matrix multiplication
14Yu-Kwong Kwok, Ishfaq Ahmad A Parallel Algorithm for Compile-Time Scheduling of Parallel Programs on Multiprocessors. Search on Bibsonomy IEEE PACT The full citation details ... 1997 DBLP  DOI  BibTeX  RDF parallel randomized algorithm, PFAST algorithm, parallel fast assignment, parallel random search technique, computer-aided parallelization, computer-aided scheduling tool, CASCH tool, running time constraints, parallel programming, parallel programs, multiprocessors, time complexity, directed acyclic graphs, execution times, linear-time algorithm, Intel Paragon, compile-time scheduling
14Mohamed Naimi Parallel assignment to distinct identities in arbitrary networks. Search on Bibsonomy ICCCN The full citation details ... 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, depth-first search, network diameter, rooted tree, arbitrary network, synchronous distributed systems
14Curt Powley, Richard E. Korf Single-Agent Parallel Window Search. Search on Bibsonomy IEEE Trans. Pattern Anal. Mach. Intell. The full citation details ... 1991 DBLP  DOI  BibTeX  RDF parallel window search, single-agent problems, Iterative-Deepening-A*, node ordering, parallel algorithms, computational complexity, optimisation, iterative methods, time complexity, search problems
14Yen-Cheng Chen, Wen-Tsuen Chen, Gen-Huey Chen, Jang-Ping Sheu Designing Efficient Parallel Algorithms on Mech-Connected Computers with Multiple Broadcasting. Search on Bibsonomy IEEE Trans. Parallel Distrib. Syst. The full citation details ... 1990 DBLP  DOI  BibTeX  RDF mech-connected computers, 2-MCCMBs, parallel algorithms, parallel algorithms, computational complexity, parallel architectures, time complexity, multiprocessorinterconnection networks, prefix computations, prefix computations, multiple broadcasting, multiple broadcasting, semigroup computations
14Shay Kutten, David Peleg, Uzi Vishkin Deterministic Resource Discovery in Distributed Networks. Search on Bibsonomy Theory Comput. Syst. The full citation details ... 2003 DBLP  DOI  BibTeX  RDF
14Yong-Jik Kim, James H. Anderson Adaptive mutual exclusion with local spinning. Search on Bibsonomy Distributed Computing The full citation details ... 2007 DBLP  DOI  BibTeX  RDF Adaptive mutual exclusion, Read/write atomicity, Time complexity, Shared-memory systems, Local spinning
14Wenqin Zhou, Jacques Carette, David J. Jeffrey, Michael B. Monagan Hierarchical Representations with Signatures for Large Expression Management. Search on Bibsonomy AISC The full citation details ... 2006 DBLP  DOI  BibTeX  RDF Veiling Strategy, Zero Test, Large Expression Management, Symbolic LU Decomposition, Time Complexity, Signature, Hierarchical Representation
14Katia Hristova, Tom Rothamel, Yanhong A. Liu, Scott D. Stoller Efficient type inference for secure information flow. Search on Bibsonomy PLAS The full citation details ... 2006 DBLP  DOI  BibTeX  RDF security, algorithm, information flow, time complexity, type inference
14Wenling Wu, Dengguo Feng, Hua Chen Collision Attack and Pseudorandomness of Reduced-Round Camellia. Search on Bibsonomy Selected Areas in Cryptography The full citation details ... 2004 DBLP  DOI  BibTeX  RDF Block cipher, Time complexity, Pseudorandomness, Data complexity, Camellia
14David J. Lieberman, Jan P. Allebach Efficient Model Based Halftoning Using Direct Binary Search. Search on Bibsonomy ICIP (1) The full citation details ... 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
14Eiichi Tanaka A Metric Between Unrooted and Unordered Trees and its Bottom-Up Computing Method. Search on Bibsonomy IEEE Trans. Pattern Anal. Mach. Intell. The full citation details ... 1994 DBLP  DOI  BibTeX  RDF unrooted trees, unordered trees, bottom-up computing method, strongly structure-preserving 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
14Xuzhen Xie, Mutsunori Yagiura, Takao Ono, Tomio Hirata, Uri Zwick New Bounds for the Nearly Equitable Edge Coloring Problem. Search on Bibsonomy ISAAC The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
14Jiajing Zhuo, Chen Meng, Minghu Zou A Task Scheduling Algorithm of Single Processor Parallel Test System. Search on Bibsonomy SNPD (1) The full citation details ... 2007 DBLP  DOI  BibTeX  RDF Auto test system(ATS), Multi-threading technique, Task scheduling algorithm, Algorithm time complexity, Parallel test
14Amihood Amir, Yonatan Aumann, Gad M. Landau, Moshe Lewenstein, Noa Lewenstein Pattern Matching with Swaps. Search on Bibsonomy FOCS The full citation details ... 1997 DBLP  DOI  BibTeX  RDF swapped matching, O(mn) time, pattern matching, pattern matching, time complexity, text string
14Yoshifumi Manabe, Shigemi Aoyagi A feasibility decision algorithm for rate monotonic scheduling of periodic real-time tasks. Search on Bibsonomy IEEE Real Time Technology and Applications Symposium The full citation details ... 1995 DBLP  DOI  BibTeX  RDF feasibility decision algorithm, periodic real-time tasks, task scheduling algorithm, periodic real time task systems, real time task system, inverse deadline scheduling algorithm, scheduling, real-time systems, computational complexity, time complexity, scheduling algorithm, rate monotonic scheduling
14Subhada K. Mishra, Vijay V. Raghavan 0001, Nian-Feng Tzeng Efficient Algorithms For Selection of Recovery Points in Tree Task Models. Search on Bibsonomy IEEE Trans. Software Eng. The full citation details ... 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
14Chin-Shyurng Fahn, Jhing-Fa Wang, Jau-Yien Lee An Adaptive Reduction Procedure for the Piecewise Linear Approximation of Digitized Curves. Search on Bibsonomy IEEE Trans. Pattern Anal. Mach. Intell. The full citation details ... 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
14Chryssis Georgiou, Dariusz R. Kowalski, Alexander A. Shvartsman Efficient Gossip and Robust Distributed Computation. Search on Bibsonomy DISC The full citation details ... 2003 DBLP  DOI  BibTeX  RDF
13Lin Lin, Le Yi Wang, George Zames Time complexity and model complexity of fast identification of continuous-time LTI systems. Search on Bibsonomy IEEE Trans. Automat. Contr. The full citation details ... 1999 DBLP  DOI  BibTeX  RDF
13Chuanxiong Guo SRR: An O(1) time complexity packet scheduler for flows in multi-service packet networks. Search on Bibsonomy SIGCOMM The full citation details ... 2001 DBLP  DOI  BibTeX  RDF QoS, Internet, complexity, packet scheduler, high speed networks, end-to-end delay, fair queueing
13Norman Danner, James S. Royer Time-Complexity Semantics for Feasible Affine Recursions. Search on Bibsonomy CiE The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
13Sarang C. Joshi, S. K. Bodhe Time Complexity Analysis for Decoding VOP Content in MPEG-4 Presentations. Search on Bibsonomy ITNG The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
13Seon Ok Lee, Seok Won Jung, Chang Han Kim, Janghong Yoon, Jae-Young Koh, Daeho Kim Design of Bit Parallel Multiplier with Lower Time Complexity. Search on Bibsonomy ICISC The full citation details ... 2003 DBLP  DOI  BibTeX  RDF
13Jyh-Huei Guo, Chin-Liang Wang A low time-complexity, hardware-efficient bit-parallel power-sum circuit for finite fields GF(2M). Search on Bibsonomy ISCAS (1) The full citation details ... 1999 DBLP  DOI  BibTeX  RDF
13Qi Cheng Primality Proving via One Round in ECPP and One Iteration in AKS. Search on Bibsonomy J. Cryptology The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
13Eldar Fischer, Orly Yahalom Testing Convexity Properties of Tree Colorings. Search on Bibsonomy STACS The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
13Maryam Amiripour, Hamid Abachi Analytical Modeling of Task Scheduling for Master-Slave Super Hypercube Architecture. Search on Bibsonomy SNPD The full citation details ... 2008 DBLP  DOI  BibTeX  RDF modeling, time complexity, task scheduling, message passing architecture, matrix product
13Partha Dutta, Rachid Guerraoui, Ron R. Levy, Arindam Chakraborty How fast can a distributed atomic read be? Search on Bibsonomy PODC The full citation details ... 2004 DBLP  DOI  BibTeX  RDF time-complexity, atomic registers, shared-memory emulation
13Ricardo A. Baeza-Yates, Gabriel Valiente An Image Similarity Measure Based on Graph Matching. Search on Bibsonomy SPIRE The full citation details ... 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
13Matthias Ruhl, Hannes Hartenstein, Dietmar Saupe Adaptive Partitionings for Fractal Image Compression. Search on Bibsonomy ICIP (2) The full citation details ... 1997 DBLP  DOI  BibTeX  RDF adaptive partitionings, fractal image compression, split-and-merge process, connected sets, small square image blocks, rate-distortion curves, encoding quality, evolutionary computing, data compression, time-complexity, ranges, acceleration techniques
13Gyung-Leen Park, Behrooz A. Shirazi, Jeff Marquis DFRN: A New Approach for Duplication Based Scheduling for Distributed Memory Multiprocessor Systems. Search on Bibsonomy IPPS The full citation details ... 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
13Jin-Tai Yan An efficient cut-based algorithm on minimizing the number of L-shaped channels for safe routing ordering. Search on Bibsonomy ICCD The full citation details ... 1995 DBLP  DOI  BibTeX  RDF cut-based algorithm, L-shaped channels, safe routing ordering, geometrical topology, floorplan graph, channel precedence graph, S-cuts, redundant L-cuts, balanced L-cuts, non-minimal L-cuts, non-critical L-cuts, critical L-cuts, computational complexity, time complexity, circuit layout CAD, line segments, precedence relations
13Garng M. Huang, Shan Zhu A fast distributed optimal routing algorithm for multicommodity large data networks. Search on Bibsonomy IPPS The full citation details ... 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
13Jia-Shung Wang, Biing-Feng Wang, Chen-Hsing Peng Recognizing depth-first-search trees in parallel. Search on Bibsonomy IPPS The full citation details ... 1995 DBLP  DOI  BibTeX  RDF depth-first-search trees, parallel algorithms, parallel algorithm, computational complexity, directed graphs, time complexity, spanning tree, search problems, undirected graph, tree searching, speed-up, EREW PRAM model
13Mayez A. Al-Mouhamed, Adel Al-Maasarani Performance Evaluation of Scheduling Precedence-Constained Computations on Message-Passing Systems. Search on Bibsonomy IEEE Trans. Parallel Distrib. Syst. The full citation details ... 1994 DBLP  DOI  BibTeX  RDF scheduling precedence-constrained computations, multiprocessor topology, global priority-based schedulingheuristics, generalized list scheduling, backward scheduling, graph-driven scheduling, scheduling, performance evaluation, performance evaluation, computational complexity, multiprocessor, message passing, network topology, time complexity, message-passing systems
13Shou-Hsuan Stephen Huang, Hongfei Liu, Venkatraman Viswanathan Parallel Dynamic Programming. Search on Bibsonomy IEEE Trans. Parallel Distrib. Syst. The full citation details ... 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
13Jun Gu, Wei Wang A Novel Discrete Relaxation Architecture. Search on Bibsonomy IEEE Trans. Pattern Anal. Mach. Intell. The full citation details ... 1992 DBLP  DOI  BibTeX  RDF discrete relaxation algorithm, sequential AC-1 algorithm, sequential AC-4 algorithm, parallel DRA5 algorithm, parallel algorithms, computational complexity, parallel architectures, time complexity, polynomial, polynomials
13Jun-Ichi Aoe An Efficient Digital Search Algorithm by Using a Double-Array Structure. Search on Bibsonomy IEEE Trans. Software Eng. The full citation details ... 1989 DBLP  DOI  BibTeX  RDF digital search algorithm, double-array structure, internal array structure, matrix form, list form, digital search tree, DS-tree, worst-case time complexity, input symbols, constant, computational complexity, data structures, retrieval, trees (mathematics), search problems, nodes, insertion, deletion, key, arc
13Kiyoharu Hamaguchi, Hiromi Hiraishi, Shuzo Yajima Branching Time Regular Temporal Logic for Model Checking with Linear Time Complexity. Search on Bibsonomy CAV The full citation details ... 1990 DBLP  DOI  BibTeX  RDF
13Ashish V. Naik, Kenneth W. Regan, D. Sivakumar Quasilinear Time Complexity Theory. Search on Bibsonomy STACS The full citation details ... 1994 DBLP  DOI  BibTeX  RDF
13Yong-Jik Kim, James H. Anderson A Time Complexity Bound for Adaptive Mutual Exclusion. Search on Bibsonomy DISC The full citation details ... 2001 DBLP  DOI  BibTeX  RDF
13Baudoin Collard, François-Xavier Standaert, Jean-Jacques Quisquater Improving the Time Complexity of Matsui's Linear Cryptanalysis. Search on Bibsonomy ICISC The full citation details ... 2007 DBLP  DOI  BibTeX  RDF Fast Fourier Transform, block ciphers, linear cryptanalysis
13Weiyi Zhang, Guoliang Xue, Jian Tang 0008, Krishnaiyan Thulasiraman Linear time construction of redundant trees for recovery schemes enhancing QoP and QoS. Search on Bibsonomy INFOCOM The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
13Kwong-fai Chan, Tak Wah Lam Finding Least-Weight Subsequences with Fewer Processors. Search on Bibsonomy SIGAL International Symposium on Algorithms The full citation details ... 1990 DBLP  DOI  BibTeX  RDF
12Xiaorui Sun, Xuejia Lai Improved Integral Attacks on MISTY1. Search on Bibsonomy Selected Areas in Cryptography The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
12Christophe Nègre Quadrinomial Modular Arithmetic using Modified Polynomial Basis. Search on Bibsonomy ITCC (1) The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
12Lisa Hellerstein, Krishnan Pillaipakkamnatt, Vijay Raghavan 0002, Dawn Wilkins How Many Queries Are Needed to Learn? Search on Bibsonomy J. ACM The full citation details ... 1996 DBLP  DOI  BibTeX  RDF exact identification, polynomial-query learning, polynomial-time learning, proper learning, certificates, membership queries, equivalence queries, polynomial-time hierarchy
12Dan Suciu, Val Tannen Efficient Compilation of High-Level Data Parallel Algorithms. Search on Bibsonomy SPAA The full citation details ... 1994 DBLP  DOI  BibTeX  RDF
12Huajun Quin Efficient Verification of Determinate Processes. Search on Bibsonomy CONCUR The full citation details ... 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][>>]
Valid XHTML 1.1! Valid CSS! [Valid RSS]
Maintained by Jörg Diederich.
Based upon DBLP by Michael Ley.
open data data released under the ODC-BY 1.0 license