Search results for "complexity"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
7	Lefteris M. Kirousis, Paul G. Spirakis, Philippas Tsigas	Reading Many Variables in One Atomic Operation: Solutions with Linear or Sublinear Complexity. (PDF / PS)	IEEE Trans. Parallel Distrib. Syst.	1994	DBLP DOI BibTeX RDF	sublinear complexity, deterministic protocol, memory location, Archimedean time assumption, computational complexity, distributed algorithms, protocols, time complexity, probabilistic algorithm, linear complexity, space complexity, atomic operation
6	Harry Buhrman, Michal Koucký, Nikolai K. Vereshchagin	Randomised Individual Communication Complexity.	IEEE Conference on Computational Complexity	2008	DBLP DOI BibTeX RDF	individual communication complexity, Kolmogorov complexity, rounds, randomized protocols
6	László Babai, Peter G. Kimmel	Randomized Simultaneous Messages: Solution of a Problem of Yao in Communication Complexity. (PDF / PS)	IEEE Conference on Computational Complexity	1997	DBLP DOI BibTeX RDF	randomized simultaneous messages, two-player communication model, deterministic SM complexity, quadratic reduction, lower bound proof, computational complexity, communication complexity, linear algebra
6	Jerzy W. Rozenblit	Process and systems complexity. (PDF / PS)	ECBS	1997	DBLP DOI BibTeX RDF	process complexity, ECBS Complexity, engineering techniques, products, systems engineering, complexity measurement, computer based systems engineering, systems complexity
6	Juan Liu, Pierre Moulin	Complexity-Regularized Image Denoising. (PDF / PS)	ICIP	1997	DBLP DOI BibTeX RDF	complexity-regularized image denoising, complexity penalties, reconstructed image mean-squared error, complexity-regularized estimators, computational complexity, maximum likelihood estimation, AWGN
6	Christos H. Papadimitriou	The Complexity of Knowledge Representation. (PDF / PS)	IEEE Conference on Computational Complexity	1996	DBLP DOI BibTeX RDF	computational complexity, complexity, artificial intelligence, artificial intelligence, knowledge representation, knowledge representation, complexity theory, common-sense reasoning, common-sense reasoning
6	Sol M. Shatz	Towards Complexity Metrics for Ada Tasking. (PDF / PS)	IEEE Trans. Software Eng.	1988	DBLP DOI BibTeX RDF	concurrently active rendezvous, representative distributed programming language, Petri net graph model, Ada rendezvous, rendezvous graph, software engineering, software engineering, computational complexity, Ada, distributed processing, communication complexity, directed graphs, software complexity, complexity metrics, Ada tasking
6	Elaine J. Weyuker	Evaluating Software Complexity Measures. (PDF / PS)	IEEE Trans. Software Eng.	1988	DBLP DOI BibTeX RDF	syntactic software complexity, statement count, cyclomatic number, effort measure, data flow complexity, synthetic complexity, software engineering, software engineering, software complexity measures
5	Rahul Jain, Hartmut Klauck	The Partition Bound for Classical Communication Complexity and Query Complexity.	IEEE Conference on Computational Complexity	2010	DBLP DOI BibTeX RDF	Partition Bound, Linear Programming, Lower Bounds, Communication Complexity, Query Complexity
5	Victor Korotkikh	Kolmogorov Complexity.	Encyclopedia of Optimization	2009	DBLP DOI BibTeX RDF	Algorithmic information, Algorithmic entropy, Solomonoff-Kolmogorov-Chaitin complexity, Shortest program length, Complexity, Computation, Randomness, Information, Descriptional complexity, Algorithmic complexity, Algorithmic randomness
5	Amir M. Ben-Amram, 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, implicit computational complexity, polynomial time complexity
5	Dmitry Gavinsky, Pavel Pudlák	Exponential Separation of Quantum and Classical Non-interactive Multi-party Communication Complexity.	IEEE Conference on Computational Complexity	2008	DBLP DOI BibTeX RDF	separation of communication classes, communication complexity, quantum communication
5	Alexander A. Sherstov	Communication Complexity under Product and Nonproduct Distributions.	IEEE Conference on Computational Complexity	2008	DBLP DOI BibTeX RDF	Randomized/distributional communication complexity, product/nonproduct distributions, Yao's Minimax Principle
5	Nati Linial, Adi Shraibman	Learning Complexity vs. Communication Complexity.	IEEE Conference on Computational Complexity	2008	DBLP DOI BibTeX RDF	large margin classifiers, communication complexity, discrepancy, rigidity
5	Yefim Dinitz, Shlomo Moran, Sergio Rajsbaum	Bit complexity of breaking and achieving symmetry in chains and rings.	J. ACM	2008	DBLP DOI BibTeX RDF	bit complexity, processor chain, processor ring, symmetric synchronous execution, Distributed computing, lower bounds, consensus, communication complexity, leader election, communication cost, message complexity, tight bound
5	Bin Lin, Aaron B. Brown, Joseph L. Hellerstein	Towards an understanding of decision complexity in IT configuration.	CHIMIT	2007	DBLP DOI BibTeX RDF	configuration complexity, decision complexity, complexity metrics
5	Harald Niederreiter	The Probabilistic Theory of the Joint Linear Complexity of Multisequences.	SETA	2006	DBLP DOI BibTeX RDF	Word-based stream ciphers, Multisequences, Joint linear complexity, Joint linear complexity profile, Linear complexity
5	Jeong Yang, T. Dean Hendrix, Kai H. Chang, David A. Umphress	An empirical validation of complexity profile graph.	ACM Southeast Regional Conference	2005	DBLP DOI BibTeX RDF	complexity profile graph, control structure diagram, program comprehension, software complexity metric, program complexity
5	Jin-yi Cai, Hong Zhu	Progress in Computational Complexity Theory.	J. Comput. Sci. Technol.	2005	DBLP DOI BibTeX RDF	theoretical computer science, computational complexity theory, PCP theorem, logspace complexity, Reingold's theorem, GAP problem, complexity of lattice problems, worst-case to average-case reductions, extractors, pseudorandomness, inapproximability, primality testing, holographic algorithms
5	Lucian Ilie, Sheng Yu, Kaizhong Zhang	Repetition Complexity of Words.	COCOON	2002	DBLP BibTeX RDF	repetition complexity, Lempel-Ziv complexity, subword complexity, infinite words, iterated morphisms, ultimate periodicity, de Bruijn words, algorithms, words
5	Gursaran, Gurdev Roy	On the Applicability of Weyuker Property 9 to Object-Oriented Structural Inheritance Complexity Metrics. (PDF / PS)	IEEE Trans. Software Eng.	2001	DBLP DOI BibTeX RDF	Inheritance complexity metrics, object-oriented design complexity metrics, structural metrics, software complexity metrics
5	Ronald de Wolf	Characterization of Non-Deterministic Quantum Query and Quantum Communication Complexity. (PDF / PS)	IEEE Conference on Computational Complexity	2000	DBLP DOI BibTeX RDF	non-deterministic computation, Quantum computing, communication complexity, query complexity
5	Daniele Frigioni, Alberto Marchetti-Spaccamela, Umberto Nanni	Semidynamic Algorithms for Maintaining Single-Source Shortest Path Trees.	Algorithmica	1998	DBLP BibTeX RDF	Single-source shortest path, Amortized complexity, Output complexity, Single-source shortest path, Amortized complexity, Output complexity, Key words, Dynamic algorithms, Dynamic algorithms
5	Michiharu Niimi, Hideki Noda, Eiji Kawaguchi	An Image Embedding in Image by a Complexity Based Region Segmentation Method. (PDF / PS)	ICIP	1997	DBLP DOI BibTeX RDF	image embedding, complexity based region segmentation, secret data, dummy image, local complexity measure, noise-like region, image conjugate operation, informative region, 512 pixel, 262144 pixel, image segmentation, color images, binary image, complexity measure, data encryption, gray image
5	Fritz Henglein, Jakob Rehof	The Complexity of Subtype Entailment for Simple Types. (PDF / PS)	LICS	1997	DBLP DOI BibTeX RDF	subtype entailment complexity, atomic entailment, coNP-completeness, complexity-theoretic marker, exponential explosion, subtype inference, structural complexity bounds, computability, satisfiability, axiomatization, linear-time algorithm
5	Serge Abiteboul, Moshe Y. Vardi, Victor Vianu	Fixpoint logics, relational machines, and computational complexity.	J. ACM	1997	DBLP DOI BibTeX RDF	fixpoint logic, relational complexity, computational complexity, complexity classes
5	Dan A. Simovici, Corina Reischer	Several Remarks on the Complexity of Set-Valued Switching Functions. (PDF / PS)	ISMVL	1996	DBLP DOI BibTeX RDF	set-valued switching functions, complexity of circuits, set-valued logic functions, complete basis, Boolean components, non-Boolean components, computational complexity, complexity, Boolean algebra, switching functions
5	Michalis Faloutsos, Mart Molle	What features really make distributed minimum spanning tree algorithms efficient?. (PDF / PS)	ICPADS	1996	DBLP DOI BibTeX RDF	distributed minimum spanning tree, Distributed Information, computational complexity, distributed algorithms, graph theory, multiprocessor interconnection networks, communication complexity, performance improvement, complexity measures, message complexity, running times
5	Benoit Dubuc, Steven W. Zucker	Indexing Visual Representations through the Complexity Map. (PDF / PS)	ICCV	1995	DBLP DOI BibTeX RDF	visual representations indexing, complexity map, Hausdorff space, countability properties, formal complexity theory, computer vision, computational vision, computational complexity, differential geometry, differential geometry, visual databases, perceptual grouping
5	Christof Ebert	Tracing complexity through the software process. (PDF / PS)	ICECCS	1995	DBLP DOI BibTeX RDF	complete development process, complexity factors, real-time automation projects, real-time systems, real-time systems, computational complexity, complexity, formal specification, software metrics, software process, computer aided software engineering, development environments, research project, specification methods, CASE environment
5	Carsten Damm, Matthias Krause, Christoph Meinel, Stephan Waack	Separating Counting Communication Complexity Classes.	STACS	1992	DBLP DOI BibTeX RDF	complexity of Boolean function, communication complexity and distributed computing, probabilism, lower bound arguments, separation of complexity classes
4	Russell Impagliazzo, Ryan Williams	Communication Complexity with Synchronized Clocks.	IEEE Conference on Computational Complexity	2010	DBLP DOI BibTeX RDF	time-communication tradeoffs, lower bounds, communication complexity
4	Luca Trevisan	The Program-Enumeration Bottleneck in Average-Case Complexity Theory.	IEEE Conference on Computational Complexity	2010	DBLP DOI BibTeX RDF	Universal Search, Average-case Complexity
4	T. S. Jayram	Information complexity: a tutorial.	PODS	2010	DBLP DOI BibTeX RDF	information complexity, streams, information theory, statistics, sketching, communication complexity, geometry
4	Akitoshi Kawamura, Stephen Cook	Complexity theory for operators in analysis.	STOC	2010	DBLP DOI BibTeX RDF	higher-type complexity, second-order polynomials, computational complexity, computable analysis
4	Giovanni Di Crescenzo	Minimal Assumptions and Round Complexity for Concurrent Zero-Knowledge in the Bare Public-Key Model.	COCOON	2009	DBLP DOI BibTeX RDF	Concurrent Zero-Knowledge, Bare Public-Key Model, Complexity Assumptions, Round Complexity, Zero-Knowledge Protocols
4	Jukka Perkiö, Aapo Hyvärinen	Modelling Image Complexity by Independent Component Analysis, with Application to Content-Based Image Retrieval.	ICANN	2009	DBLP DOI BibTeX RDF	Image complexity, NCD, ICA, Kolmogorov complexity
4	Lei Liu, Stefan Thanheiser, Hartmut Schmeck	Assessing complexity of service-oriented computing using learning classifier systems.	SAC	2009	DBLP DOI BibTeX RDF	simulation, service-oriented architecture, complexity, experiment, learning classifier systems, service-oriented computing, complexity measurement
4	Ananya Kanjilal, Sabnam Sengupta, Swapan Bhattacharya	Analysis of complexity of requirements: a metrics based approach.	ISEC	2009	DBLP DOI BibTeX RDF	requirement complexity, requirement metrics, measurement, requirements management, design complexity
4	Kazuo Iwama, Hiroki Morizumi, Jun Tarui	Negation-Limited Complexity of Parity and Inverters.	Algorithmica	2009	DBLP DOI BibTeX RDF	Negation-limited circuit, Parity function, Inversion complexity, Gate elimination, Circuit complexity, Inverter
4	François Le Gall	Exponential Separation of Quantum and Classical Online Space Complexity.	Theory Comput. Syst.	2009	DBLP DOI BibTeX RDF	Online space complexity, Quantum computation, Communication complexity
4	Harry B. Hunt III	Complexity Classes in Optimization.	Encyclopedia of Optimization	2009	DBLP DOI BibTeX RDF	Complexity, Complexity classes
4	Hamilton Emmons, Sanatan Rai	Computational Complexity Theory.	Encyclopedia of Optimization	2009	DBLP DOI BibTeX RDF	Recognition problem, Time complexity function, Nondeterministic polynomial algorithm, Computational complexity, Combinatorial optimization, Reducibility, NP-complete problem, Complexity theory, Efficient algorithm, NP-hard problem, Polynomial algorithm, Decision problem, Exponential algorithm
4	Veena Bansal, Tripti Negi	A Metric for ERP Complexity.	BIS	2008	DBLP DOI BibTeX RDF	Process complexity, Configuration, ERP, Complexity metrics
4	Sanjay Misra, Ibrahim Akman	A Model for Measuring Cognitive Complexity of Software.	KES	2008	DBLP DOI BibTeX RDF	metric, structure, size, understandability, Software complexity, cognitive complexity
4	Søren Riis	On the Asymptotic Nullstellensatz and Polynomial Calculus Proof Complexity.	LICS	2008	DBLP DOI BibTeX RDF	Algebraic proof complexity, predicate logic, Propositional proof complexity
4	Sanjay Misra, Ibrahim Akman	A New Complexity Metric Based on Cognitive Informatics.	RSKT	2008	DBLP DOI BibTeX RDF	method complexity, Weyuker properties, object oriented programming, Software metrics, inheritance, cognitive complexity
4	Ramakanth Kavuluru	2n-Periodic Binary Sequences with Fixed k-Error Linear Complexity for k=2 or 3.	SETA	2008	DBLP DOI BibTeX RDF	linear complexity, Periodic sequence, k-error linear complexity
4	Scott Aaronson, Avi Wigderson	Algebrization: a new barrier in complexity theory.	STOC	2008	DBLP DOI BibTeX RDF	low-degree polynomials, communication complexity, oracles, arithmetization, interactive proofs, query complexity
4	Aduri Pavan, N. V. Vinodchandran	Relations between Average-Case and Worst-Case Complexity.	Theory Comput. Syst.	2008	DBLP DOI BibTeX RDF	Average-case complexity, Arthur-Merlin games, Worst-case complexity
4	Kord Eickmeyer, Martin Grohe, Magdalena Grüber	Approximation of Natural W[P]-Complete Minimisation Problems Is Hard.	IEEE Conference on Computational Complexity	2008	DBLP DOI BibTeX RDF	derandomisation, parameterized complexity, inapproximability
4	Troy Lee, Adi Shraibman, Robert Spalek	A Direct Product Theorem for Discrepancy.	IEEE Conference on Computational Complexity	2008	DBLP DOI BibTeX RDF	direct sum theorems, factorization norms, communication complexity, discrepancy, direct product theorems
4	Troy Lee, Adi Shraibman	Disjointness Is Hard in the Multi-party Number-on-the-Forehead Model.	IEEE Conference on Computational Complexity	2008	DBLP DOI BibTeX RDF	multiparty communication complexity, disjointness, lower bounds
4	Harry Buhrman, John M. Hitchcock	NP-Hard Sets Are Exponentially Dense Unless coNP C NP/poly.	IEEE Conference on Computational Complexity	2008	DBLP DOI BibTeX RDF	hard sets, polynomial advice, instance complexity
4	Henning Schnoor, Ilka Schnoor	Partial Polymorphisms and Constraint Satisfaction Problems.	Complexity of Constraints	2008	DBLP DOI BibTeX RDF	partial polymorphisms, computational complexity, constraint satisfaction problems, clones
4	Prahladh Harsha, Rahul Jain, David A. McAllester, Jaikumar Radhakrishnan	The Communication Complexity of Correlation.	IEEE Conference on Computational Complexity	2007	DBLP DOI BibTeX RDF
4	Kei Uchizawa, Eiji Takimoto	An Exponential Lower Bound on the Size of Constant-Depth Threshold Circuits with Small Energy Complexity.	IEEE Conference on Computational Complexity	2007	DBLP DOI BibTeX RDF
4	Guillaume Malod	The Complexity of Polynomials and Their Coefficient Functions.	IEEE Conference on Computational Complexity	2007	DBLP DOI BibTeX RDF
4	Fong-Ling Fu, Shao-Yuan Chiu, Chiu Hung Su	Measuring the Screen Complexity of Web Pages.	HCI	2007	DBLP DOI BibTeX RDF	Screen complexity measurements, Complexity on screen layout, GUI design, Web page design
4	Alexandra Alecu, Ana Salagean	Modified Berlekamp-Massey Algorithm for Approximating the k -Error Linear Complexity of Binary Sequences.	IMA Int. Conf.	2007	DBLP DOI BibTeX RDF	stream ciphers, linear complexity, pseudorandom sequences, k-error linear complexity
4	Ramakanth Kavuluru, Andrew Klapper	On the k -Operation Linear Complexity of Periodic Sequences.	INDOCRYPT	2007	DBLP DOI BibTeX RDF	k symbol insertion, k symbol deletion, linear complexity, Periodic sequence, k-error linear complexity
4	Pascal Koiran	Decision Versus Evaluation in Algebraic Complexity.	MCU	2007	DBLP DOI BibTeX RDF	Blum-Shub-Smale model, Valiant’s model, computational complexity, algebraic complexity
4	Stefan S. Dantchev	Rank complexity gap for Lovász-Schrijver and Sherali-Adams proof systems.	STOC	2007	DBLP DOI BibTeX RDF	Lovász-Schrijver proof system, complexity gap theorems, lift and project methods, lower bounds, propositional proof complexity
4	Martin Grohe	The complexity of homomorphism and constraint satisfaction problems seen from the other side.	J. ACM	2007	DBLP DOI BibTeX RDF	Complexity, constraint satisfaction, conjunctive queries, homomorphisms, parameterized complexity
4	Vili Podgorelec, Marjan Hericko	Estimating software complexity from UML models.	ACM SIGSOFT Software Engineering Notes	2007	DBLP DOI BibTeX RDF	software development, software complexity, complexity metrics
4	Sanjay Misra	Validating modified cognitive complexity measure.	ACM SIGSOFT Software Engineering Notes	2007	DBLP DOI BibTeX RDF	scale of measure, complexity measures, measurement theory, cognitive complexity, validation criteria
4	S. Anand, Gurumurthi V. Ramanan	Periodicity, complementarity and complexity of 2-adic FCSR combiner generators.	ASIACCS	2006	DBLP DOI BibTeX RDF	?-sequences, 2-adic complexity, stream ciphers, combiners, linear complexity, pseudorandom number generators, FCSR, feedback shift registers
4	Eric Allender, Peter Bürgisser, Johan Kjeldgaard-Pedersen, Peter Bro Miltersen	On the Complexity of Numerical Analysis.	IEEE Conference on Computational Complexity	2006	DBLP DOI BibTeX RDF
4	Yijia Chen, Martin Grohe	An Isomorphism between Subexponential and Parameterized Complexity Theory.	IEEE Conference on Computational Complexity	2006	DBLP DOI BibTeX RDF
4	Qiang-Sheng Hua, Francis C. M. Lau	The scheduling and energy complexity of strong connectivity in ultra-wideband networks.	MSWiM	2006	DBLP DOI BibTeX RDF	ad hoc and sensor networks, energy complexity, interference control, scheduling complexity, ultra-wideband, interference models
4	Nina Brandstätter, Wilfried Meidl	On the Linear Complexity of Sidel'nikov Sequences over Fd.	SETA	2006	DBLP DOI BibTeX RDF	Sidel’nikov sequence, Linear complexity profile, Aperiodic autocorrelation, Linear complexity
4	Jin-Ho Chung, Kyeongcheol Yang	Bounds on the Linear Complexity and the 1-Error Linear Complexity over Fp of M-ary Sidel'nikov Sequences.	SETA	2006	DBLP DOI BibTeX RDF	M-ary sequences, Sidel’nikov sequences, 1-error linear complexity, linear complexity
4	Fang-Wei Fu, Harald Niederreiter, Ming Su	The Characterization of 2n-Periodic Binary Sequences with Fixed 1-Error Linear Complexity.	SETA	2006	DBLP DOI BibTeX RDF	Stream cipher systems, Counting function, Fast algorithms, Linear complexity, Periodic sequences, k-Error linear complexity
4	Wenying Zhang, Chuan-Kun Wu	The Algebraic Normal Form, Linear Complexity and k-Error Linear Complexity of Single-Cycle T-Function.	SETA	2006	DBLP DOI BibTeX RDF	Single-cycle T-function, Algebraic normal form, k-error complexity, Cryptography, Linear complexity
4	François Le Gall	Exponential separation of quantum and classical online space complexity.	SPAA	2006	DBLP DOI BibTeX RDF	quantum computation, communication complexity, online, streaming algorithms, space complexity
4	Amit B. Kulkarni, Stephen F. Bush	Detecting Distributed Denial-of-Service Attacks Using Kolmogorov Complexity Metrics.	J. Network Syst. Manage.	2006	DBLP DOI BibTeX RDF	complexity probes, entropy, active network, Kolmogorov Complexity, denial-of-service attack
4	Luke Ritchie, Hyo-Sik Yang, Andréa W. Richa, Martin Reisslein	Cluster Overlay Broadcast (COB): MANET Routing with Complexity Polynomial in Source-Destination Distance.	IEEE Trans. Mob. Comput.	2006	DBLP DOI BibTeX RDF	One-hop clustering, scalability, routing protocol, time complexity, algorithm/protocol design and analysis, message complexity, wireless mobile ad hoc network
4	Dharmender Singh Kushwaha, Arun Kumar Misra	A modified cognitive information complexity measure of software.	ACM SIGSOFT Software Engineering Notes	2006	DBLP DOI BibTeX RDF	cognitive information complexity unit, complexity information complexity, information coding efficiency, information unit, weighted information count, cognitive informatics
4	Dharmender Singh Kushwaha, Arun Kumar Misra	Robustness analysis of cognitive information complexity measure using Weyuker properties.	ACM SIGSOFT Software Engineering Notes	2006	DBLP DOI BibTeX RDF	basic control structures, cognitive information complexity measure, cognitive information complexity unit, cognitive weight, weighted information count
4	Russell Impagliazzo	Can every randomized algorithm be derandomized?	STOC	2006	DBLP DOI BibTeX RDF	algebraic circuit complexity, probabilistic algorithms, derandomization, circuit complexity, complexity classes, pseudo-randomness
4	Paul Beame, Toniann Pitassi, Nathan Segerlind, Avi Wigderson	A Direct Sum Theorem for Corruption and the Multiparty NOF Communication Complexity of Set Disjointness.	IEEE Conference on Computational Complexity	2005	DBLP DOI BibTeX RDF
4	Lance Fortnow, Russell Impagliazzo, Valentine Kabanets, Christopher Umans	On the Complexity of Succinct Zero-Sum Games.	IEEE Conference on Computational Complexity	2005	DBLP DOI BibTeX RDF
4	Chi-Jen Lu, Shi-Chun Tsai, Hsin-Lung Wu	On the Complexity of Hardness Amplification.	IEEE Conference on Computational Complexity	2005	DBLP DOI BibTeX RDF
4	Ingo Wegener, Philipp Woelfel	New Results on the Complexity of the Middle Bit of Multiplication.	IEEE Conference on Computational Complexity	2005	DBLP DOI BibTeX RDF
4	Harald Niederreiter, Li-Ping Wang	Proof of a Conjecture on the Joint Linear Complexity Profile of Multisequences.	INDOCRYPT	2005	DBLP DOI BibTeX RDF	Word-based stream ciphers, multisequences, joint linear complexity, joint linear complexity profile
4	Verónica Becher, Santiago Figueira	Kolmogorov Complexity for Possibly Infinite Computations.	Journal of Logic, Language and Information	2005	DBLP DOI BibTeX RDF	infinite computations, monotone machines, non-effective computations, program-size complexity, Kolmogorov complexity, Turing machines
4	David P. Darcy, Chris F. Kemerer, Sandra Slaughter, James E. Tomayko	The Structural Complexity of Software: An Experimental Test.	IEEE Trans. Software Eng.	2005	DBLP DOI BibTeX RDF	Wood's model of task complexity, object-oriented programming, software maintenance, software metrics, experiment, cognition, coupling, cohesion, Software complexity, software structure, procedural programming
4	Syed A. Khayam, Hayder Radha	Linear-Complexity Models for Wireless MAC-to-MAC Channels.	Wireless Networks	2005	DBLP DOI BibTeX RDF	wireless networks, MAC, 802.11, Markov model, linear-complexity, bit-errors, model complexity
4	Paul M. B. Vitányi	Time, space, and energy in reversible computing.	Conf. Computing Frontiers	2005	DBLP DOI BibTeX RDF	energy dissipation complexity, low-energy computing, reversible simulation, computational complexity, time complexity, reversible computing, tradeoffs, space complexity, adiabatic computing
4	Zexin Pan, W. David Pan, Aleksandar Milenkovic	Complexity-distortion tradeoffs in variable complexity 2-D DCT.	ACM Southeast Regional Conference	2004	DBLP DOI BibTeX RDF	Complexity-Distortion tradeoffs, Variable Complexity Algorithm (VCA), Discrete Cosine Transform (DCT)
4	Andris Ambainis, Ke Yang	Towards the Classical Communication Complexity of Entanglement Distillation Protocols with Incomplete Information. (PDF / PS)	IEEE Conference on Computational Complexity	2004	DBLP DOI BibTeX RDF
4	Harry Buhrman, Leen Torenvliet	Separating Complexity Classes Using Structural Properties. (PDF / PS)	IEEE Conference on Computational Complexity	2004	DBLP DOI BibTeX RDF
4	Nicola Galesi, Neil Thapen	The Complexity of Treelike Systems over lamda-Local Formulae. (PDF / PS)	IEEE Conference on Computational Complexity	2004	DBLP DOI BibTeX RDF
4	Venkatesan Guruswami, Daniele Micciancio, Oded Regev	The Complexity of the Covering Radius Problem on Lattices and Codes. (PDF / PS)	IEEE Conference on Computational Complexity	2004	DBLP DOI BibTeX RDF
4	Sophie Laplante, Frédéric Magniez	Lower Bounds for Randomized and Quantum Query Complexity Using Kolmogorov Arguments. (PDF / PS)	IEEE Conference on Computational Complexity	2004	DBLP DOI BibTeX RDF
4	Xiaoming Sun, Andrew Chi-Chih Yao, Shengyu Zhang	Graph Properties and Circular Functions: How Low Can Quantum Query Complexity Go? (PDF / PS)	IEEE Conference on Computational Complexity	2004	DBLP DOI BibTeX RDF
4	Wilfried Meidl	How Many Bits have to be Changed to Decrease the Linear Complexity?.	Des. Codes Cryptography	2004	DBLP DOI BibTeX RDF	algorithm, stream ciphers, linear complexity, periodic sequences, k-error linear complexity
4	Nasib S. Gill, P. S. Grover	Few important considerations for deriving interface complexity metric for component-based systems.	ACM SIGSOFT Software Engineering Notes	2004	DBLP DOI BibTeX RDF	interface characterisation, interface complexity, interface complexity metric, software components
4	Klaus Holzapfel, Sven Kosub, Moritz G. Maaß, Hanjo Täubig	The Complexity of Detecting Fixed-Density Clusters.	CIAC	2003	DBLP BibTeX RDF	fixed-parameter problems, computational complexity, graph algorithms, Density-based clustering
4	Scott Aaronson	Quantum Certificate Complexity. (PDF / PS)	IEEE Conference on Computational Complexity	2003	DBLP DOI BibTeX RDF