Search results for "NP-complete"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
12	Anselm Blumer, J. Blumer, David Haussler, Ross M. McConnell, Andrzej Ehrenfeucht	Complete inverted files for efficient text retrieval and analysis.	J. ACM	1987	DBLP DOI BibTeX RDF
12	David Rappaport	Computing Simple Circuits from a Set of Line Segments is NP-Complete.	SCG	1987	DBLP DOI BibTeX RDF
12	Jerry Calabough	Software Configuration - An NP-complete Problem.	SIGBDP-SIGCPR	1987	DBLP DOI BibTeX RDF
12	Benjamin W. Wah, Y. W. Eva Ma	The architecture of MANIP: a parallel computer system for solving NP-complete problems.	AFIPS National Computer Conference	1981	DBLP DOI BibTeX RDF
12	Sartaj Sahni, Teofilo F. Gonzalez	P-Complete Approximation Problems.	J. ACM	1976	DBLP DOI BibTeX RDF
12	Tomasz Pietrzykowski	A Complete Mechanization of Second-Order Type Theory.	J. ACM	1973	DBLP DOI BibTeX RDF
11	Phillip A. Laplante	Ender Wiggin Played Mafia Wars Too.	IT Prof.	2011	DBLP DOI BibTeX RDF	surreptitious problem solving, social networks, information technology, NP-complete problems, NP-hard problems, crowdsourcing, Gameplay
11	Dezun Dong, Xiangke Liao, Yunhao Liu 0001, Changxiang Shen, Xinbing Wang	Edge Self-Monitoring for Wireless Sensor Networks.	IEEE Trans. Parallel Distributed Syst.	2011	DBLP DOI BibTeX RDF	security, Sensor networks, NP-complete, self-monitoring
11	Ryota Nakamura, Hiroyoshi Miwa	Method of Locating Mirror Servers to Alleviate Load on Servers and Links.	SAINT	2011	DBLP DOI BibTeX RDF	Server Location, QoS, Optimization, Algorithm, NP-complete, Content Delivery Network
11	ChenKun Tsung, Hann-Jang Ho, Sing-Ling Lee	An Equilibrium-Based Approach for Determining Winners in Combinatorial Auctions.	ISPA	2011	DBLP DOI BibTeX RDF	local search procedure, winner determination problem, Nash Equilibrium, combinatorial auction, NP-complete problem
11	Udaya Bhaskar Vemulapati	QR Factorization.	Encyclopedia of Optimization	2009	DBLP DOI BibTeX RDF	Complete orthogonal factorization, QR decomposition, Orthogonal factorization
11	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, Efficient algorithm, Complexity theory, NP-hard problem, Polynomial algorithm, Decision problem, Exponential algorithm
11	Udaya Bhaskar Vemulapati	Orthogonal Triangularization.	Encyclopedia of Optimization	2009	DBLP DOI BibTeX RDF	Rank revealing factorization, Complete orthogonal factorization, QR factorization
11	Katta G. Murty	Complexity of Degeneracy.	Encyclopedia of Optimization	2009	DBLP DOI BibTeX RDF	Near degeneracy, Active constraints, Tight constraints, Inactive constraints, Slack constraints, Basic feasible solution, Regular polyhedron, Simple polyhedron, Stalling, Resolving degeneracy, Positive marginal values, Negative marginal values, Extreme point enumeration, Extreme point ranking, Assignment ranking, Segments of polyhedra, NP-complete problem, Cycling, Degeneracy, Active set methods, Nondegeneracy
11	Stephen A. Vavasis	Complexity Theory.	Encyclopedia of Optimization	2009	DBLP DOI BibTeX RDF	Information-based complexity, Real number model, Complexity, NP-complete, NP-hard, Polynomial time, Turing machine, Decision problem
11	Stephen A. Vavasis	Complexity Theory: Quadratic Programming.	Encyclopedia of Optimization	2009	DBLP DOI BibTeX RDF	Trust region problem, Strongly polynomial time, Simplicial constraints, Box constraints, Ellipsoid method, Approximation algorithms, Complexity, NP-complete, NP-hard, Quadratic programming, Polynomial time, Knapsack problem, Interior point methods, Local minimization
11	Yingdong Lv, Bernhard K. Meister	Application of the Kelly Criterion to Ornstein-Uhlenbeck Processes.	Complex (1)	2009	DBLP DOI BibTeX RDF	optimal investment strategy, self-financing, complete market, risk-neutral measure, Ornstein-Uhlenbeck, utility function, Brownian motion
11	Yan Gérard	About the Complexity of Timetables and 3-Dimensional Discrete Tomography: A Short Proof of NP-Hardness.	IWCIA	2009	DBLP DOI BibTeX RDF	Flow problems, NP-complete, Timetable, Discrete Tomography
11	Andrea Francke, Michael Hoffmann 0001	The Euclidean degree-4 minimum spanning tree problem is NP-hard.	SCG	2009	DBLP DOI BibTeX RDF	degree-constricted graphs, degree-restricted graphs, np-complete, reduction, spanning trees, geometric optimization, geometric graphs, bounded-degree graphs
11	Yi Gu, Qishi Wu, Anne Benoit, Yves Robert	Brief announcement: complexity analysis and algorithm design for pipeline configuration in distributed networks.	PODC	2009	DBLP DOI BibTeX RDF	dynamic programming, np-complete, heuristic algorithm, optimization problem, end-to-end delay, frame rate
11	T. V. Thirumala Reddy, D. Sai Krishna, C. Pandu Rangan	The Guarding Problem - Complexity and Approximation.	IWOCA	2009	DBLP DOI BibTeX RDF	QBF (Quantified Boolean Formula), QSAT (Quantified Satisfiability), Approximation Algorithms, PSPACE-complete
11	Jong Seo Park, Young Chel Kwun, Jin Han Park	Some Properties and Baire Space on Intuitionistic Fuzzy Metric Space.	FSKD (6)	2009	DBLP DOI BibTeX RDF	Intuitionistic fuzzy metric space, precompact, Baire space, complete, compact
11	Szabolcs Mikulás, Mark Reynolds 0001, Tim French 0002	Axiomatizations for Temporal Epistemic Logic with Perfect Recall over Linear Time.	TIME	2009	DBLP DOI BibTeX RDF	temporal logic, epistemic logic, complete axiomatizations
11	Daniel J. Bernstein	Batch Binary Edwards.	CRYPTO	2009	DBLP DOI BibTeX RDF	batch throughput, Karatsuba, Toom, binary Edwards curves, differential addition, complete addition formulas, elliptic curves, vectorization, Scalar multiplication, Diffie-Hellman
11	Mihai Oltean, Oana Muntean	Exact Cover with Light.	New Gener. Comput.	2008	DBLP DOI BibTeX RDF	Exact Cover, NP-complete Problems, Natural Computing, Optical Computing, Unconventional Computing
11	Bing Yang 0001, Jing Chen 0020, Enyue Lu, Si-Qing Zheng	Design and Performance Evaluation of Sequence Partition Algorithms.	J. Comput. Sci. Technol.	2008	DBLP DOI BibTeX RDF	monotone subsequence, permutation algorithm, complexity, approximation, NP-complete
11	Michael A. Bender, Raphaël Clifford, Kostas Tsichlas	Scheduling algorithms for procrastinators.	J. Sched.	2008	DBLP DOI BibTeX RDF	Hit-the-highest-nail, Interval stretch, Procrastinate, Procrastinator, Sum-of-squares problem, NP-complete, Online scheduling, Stretch
11	Mihai Oltean	Solving the Hamiltonian path problem with a light-based computer.	Nat. Comput.	2008	DBLP DOI BibTeX RDF	Light-based computing, NP-complete, Hamiltonian path
11	Jianhua Tong, Hong-Zhou Tan, Leiyong Guo	The Convergence Analysis of an Improved Artificial Immune Algorithm for Clustering.	New Directions in Intelligent Interactive Multimedia	2008	DBLP DOI BibTeX RDF	complete convergence, Markov chain, immune algorithm
11	Davood Shamsi, Farinaz Koushanfar, Miodrag Potkonjak	Challenging benchmark for location discovery in ad hoc networks: foundations and applications.	MobiHoc	2008	DBLP DOI BibTeX RDF	add hoc networks, hard instances, localization, benchmarks, NP-complete problem
11	Olga Goussevskaia, Roger Wattenhofer	Complexity of scheduling with analog network coding.	FOWANC	2008	DBLP DOI BibTeX RDF	analog network coding, geometric sinr, physical interference model, scheduling, complexity, np-complete, wireless ad-hoc networks
11	Khalil Djelloul	Combination of decomposability and propagation for solving first-order constraints in decomposable theories.	SAC	2008	DBLP DOI BibTeX RDF	complete theory, first-order constraint satisfaction problems, first-order constraint solvers, first-order constraints, rewriting rules
11	Seung-Hoon Na, In-Su Kang, Yeha Lee, Jong-Hyeok Lee	Completely-Arbitrary Passage Retrieval in Language Modeling Approach.	AIRS	2008	DBLP DOI BibTeX RDF	complete-arbitrary passage, language modeling approach, passage retrieval
11	Ping Li, Toan Huynh, Marek Z. Reformat, James Miller 0001	A practical approach to testing GUI systems.	Empir. Softw. Eng.	2007	DBLP DOI BibTeX RDF	Two-tierd testing, GUI component, Complete interaction sequence, Testing, GUI, GUI testing, Event sequence
11	Pi-Rong Sheu, Shan-Tai Chen	On the Hardness of Approximating the Multicast Delay Variation Problem.	IEEE Trans. Computers	2007	DBLP DOI BibTeX RDF	inter-destination delay variation, NP-complete, NP-hard, multicast routing, Inapproximability
11	Ming-e Jing, Dian Zhou, Pushan Tang, Xiaofang Zhou, Hua Zhang 0019	Solving SAT problem by heuristic polarity decision-making algorithm.	Sci. China Ser. F Inf. Sci.	2007	DBLP DOI BibTeX RDF	complete algorithm, decision-making, DPLL, SAT problem
11	Wenhua Li, Jinjiang Yuan, Yixun Lin	A note on special optimal batching structures to minimize total weighted completion time.	J. Comb. Optim.	2007	DBLP DOI BibTeX RDF	Total weighted complete time, Scheduling, Batching
11	Sudheendra Murthy, Abhishek Goswami, Arunabha Sen	Interference-Aware Multicasting in Wireless Mesh Networks.	Networking	2007	DBLP DOI BibTeX RDF	Minimum Interference Multicast, Weakly Induced Connected Subgraph, NP-Complete, Wireless Mesh Network
11	Bing Yang 0001, Jing Chen 0020, Enyue Lu, S. Q. Zheng 0001	A Comparative Study of Efficient Algorithms for Partitioning a Sequence into Monotone Subsequences.	TAMC	2007	DBLP DOI BibTeX RDF	algorithm, complexity, approximation, NP-complete, permutation, monotone, subsequence
11	Abedelaziz Mohaisen, DaeHun Nyang, YoungJae Maeng, KyungHee Lee	Structures for Communication-Efficient Public Key Revocation in Ubiquitous Sensor Network.	MSN	2007	DBLP DOI BibTeX RDF	complete subtree cover, dynamic run-length encoding, sensor network, communication efficiency, Key revocation, bit vector
11	Marc García-Arnau, Daniel Manrique, Alfonso Rodríguez-Patón, Petr Sosík	Towards a Robust Biocomputing Solution of Intractable Problems.	DNA	2007	DBLP DOI BibTeX RDF	Incremental Strategy, DNA Computing, NP-Complete problem, Membrane Computing, Maximum Clique Problem
11	Bruno Escoffier, Laurent Gourvès, Jérôme Monnot	Complexity and Approximation Results for the Connected Vertex Cover Problem.	WG	2007	DBLP DOI BibTeX RDF	Connected vertex cover, APX-complete, approximation algorithm, planar graphs, bipartite graphs, chordal graphs
11	Daniel J. Bernstein, Tanja Lange 0001	Faster Addition and Doubling on Elliptic Curves.	ASIACRYPT	2007	DBLP DOI BibTeX RDF	multi-scalar multiplication, side-channel countermeasures, unified addition formulas, complete addition formulas, performance evaluation, Elliptic curves, register allocation, scalar multiplication, efficient implementation, addition, explicit formulas, doubling
11	Jianzhong Cui, Zhixiang Yin, Jin Yang	Molecular Computation: Solving 3-Vertex-Colourability Problem.	ICIC (3)	2007	DBLP DOI BibTeX RDF	3-vertex-colourability, NP-complete, DNA computing
11	Liang Zhang 0027, Beihong Jin	A Service Query Dissemination Algorithm for Accommodating Sophisticated QoS Requirements in a Service Discovery System.	EUC	2007	DBLP DOI BibTeX RDF	QoS, mobile computing, multicast, NP-complete, service discovery
11	Jochen Alber, Nadja Betzler, Rolf Niedermeier	Experiments on data reduction for optimal domination in networks.	Ann. Oper. Res.	2006	DBLP DOI BibTeX RDF	Preprocessing by data reduction rules, NP-complete problem, Domination, Experimental study, Network optimization, Optimal solutions
11	Svetlana Larionova, Nuno Almeida, Lino Marques, Anibal T. de Almeida	Olfactory coordinated area coverage.	Auton. Robots	2006	DBLP DOI BibTeX RDF	Complete coverage, Robot olfaction, Cleaning robots, Robot cooperation
11	Jianping Wang 0001, Xiangtong Qi, Biao Chen 0002	Wavelength assignment for multicast in all-optical WDM networks with splitting constraints.	IEEE/ACM Trans. Netw.	2006	DBLP DOI BibTeX RDF	WDM multicast, heuristics, NP-complete, wavelength assignment
11	Adam Brandenburger, H. Jerome Keisler	An Impossibility Theorem on Beliefs in Games.	Stud Logica	2006	DBLP DOI BibTeX RDF	belief model, complete belief model, game, modal logic, first order logic, paradox
11	Sven Beyer, Christian Jacobi 0002, Daniel Kröning, Dirk Leinenbach, Wolfgang J. Paul	Putting it all together - Formal verification of the VAMP.	Int. J. Softw. Tools Technol. Transf.	2006	DBLP DOI BibTeX RDF	Complete microprocessor verification, Tomasulo scheduler, Cache memory interface, Model checking, Formal methods, Theorem proving, Floating point unit
11	Michael S. Livstone, Ron Weiss, Laura F. Landweber	Automated Design and Programming of a Microfluidic DNA Computer.	Nat. Comput.	2006	DBLP DOI BibTeX RDF	algorithm, NP-complete, satisfiability, DNA computing, microfluidics, Boolean expression
11	Khalil Djelloul, Thi-Bich-Hanh Dao	Solving first-order constraints in the theory of finite or infinite trees: introduction to the decomposable theories.	SAC	2006	DBLP DOI BibTeX RDF	complete theory, first-order constraints, theory of trees, two partners games, rewriting rules
11	Jin-Cherng Lin, Jan-Min Chen	An Automatic Revised Tool for Anti-Malicious Injection.	CIT	2006	DBLP DOI BibTeX RDF	Complete crawling, Malicious injection, Security, SQL Injection, Input validation
11	Chengliang Zhang, Chen Ding 0001, Mitsunori Ogihara, Yutao Zhong 0001, Youfeng Wu	A hierarchical model of data locality.	POPL	2006	DBLP DOI BibTeX RDF	hierarchical data placement, reference affinity, volume distance, NP-complete, program locality, N-body simulation
11	Jonathan M. Graham	Theoretical properties of two problems of distribution of interrelated data.	ACM Southeast Regional Conference	2006	DBLP DOI BibTeX RDF	interrelated data, complexity, database, NP-complete
11	Rolf Klein, Martin Kutz	The density of iterated crossing points and a gap result for triangulations of finite point sets.	SCG	2006	DBLP DOI BibTeX RDF	spanning ratio, lower bound, triangulation, dilation, complete graph, stretch factor, plane graph, geometric network
11	Jennifer Jie Xu 0001, Hsinchun Chen	CrimeNet explorer: a framework for criminal network knowledge discovery.	ACM Trans. Inf. Syst.	2005	DBLP DOI BibTeX RDF	complete-link algorithm, crime investigation, clustering, visualization, knowledge discovery, social network analysis, multidimensional scaling, Law enforcement, concept space, precision and recall
11	Mei Lu, Huiqing Liu, Feng Tian 0008	Fan-Type Theorem for Long Cycles Containing a Specified Edge.	Graphs Comb.	2005	DBLP DOI BibTeX RDF	Specified edge, Complete subgraph, Cycle
11	Miguel A. Gutiérrez-Naranjo, Mario J. Pérez-Jiménez, Agustin Riscos-Núñez	A fast P system for finding a balanced 2-partition.	Soft Comput.	2005	DBLP DOI BibTeX RDF	Active membranes, NP-Complete problem, Membrane computing, Complexity class
11	Esther M. Arkin, Refael Hassin, Shlomi Rubinstein, Maxim Sviridenko	Approximations for Maximum Transportation with Permutable Supply Vector and Other Capacitated Star Packing Problems.	Algorithmica	2004	DBLP DOI BibTeX RDF	Approximation algorithm, NP-complete problem, Transportation problem
11	Thomas Erlebach, Alexander Hall	NP-Hardness of Broadcast Scheduling and Inapproximability of Single-Source Unsplittable Min-Cost Flow.	J. Sched.	2004	DBLP DOI BibTeX RDF	approximation algorithm, NP-complete, inapproximability, resource augmentation, broadcast scheduling
11	Vojkan Vuksanovic	Canonical Equivalence Relations on Qn.	Order	2003	DBLP DOI BibTeX RDF	canonical Ramsey theory, weakly embedded subtrees, complete binary tree
11	Noriyuki Fujimoto, Kenichi Hagihara	On Approximation of the Bulk Synchronous Task Scheduling Problem.	IEEE Trans. Parallel Distributed Syst.	2003	DBLP DOI BibTeX RDF	software overhead, message packaging, bulk synchronous schedule, approximation, NP-complete, Task scheduling, distributed memory, fine grain, nonapproximability
11	Yao-Wen Huang, Shih-Kun Huang, Tsung-Po Lin, Chung-Hung Tsai	Web application security assessment by fault injection and behavior monitoring.	WWW	2003	DBLP DOI BibTeX RDF	complete crawling, fault injection, black-box testing, security assessment, web application testing
11	Michael (Shan-Hui) Ho, Weng-Long Chang, Minyi Guo	Molecular Fast Solution for Set-basis Problem on Sticker-based Model.	ICPP Workshops	2003	DBLP DOI BibTeX RDF	NP-complete Problem, Molecular Computing, Biological Computing, DNA-based Computing
11	George Voutsadakis	Polyadic Concept Analysis.	Order	2002	DBLP DOI BibTeX RDF	triadic concept analysis, triordered sets, formal concept analysis, formal contexts, complete lattices
11	Changqing Xu	Nearly Completely Positive Graphs.	Appl. Algebra Eng. Commun. Comput.	2002	DBLP DOI BibTeX RDF	Doubly nonnegative matrix, Complete positive graph, Factorization index
11	Byung S. Yoo, Chita R. Das	A Fast and Efficient Processor Allocation Scheme for Mesh-Connected Multicomputers.	IEEE Trans. Computers	2002	DBLP DOI BibTeX RDF	Allocation overhead, complete submesh recognition ability, stack-based allocation algorithm, processor allocation, mesh-connected multicomputers
11	Luis Díaz de Cerio, Miguel Valero-García, Antonio González 0001	Hypercube Algorithms on Mesh Connected Multicomputers.	IEEE Trans. Parallel Distributed Syst.	2002	DBLP DOI BibTeX RDF	mesh interconnected multicomputers, standard embedding, communication pipelining, message-scheduling algorithms, Mapping algorithms, complete exchange, hypercube algorithms
11	Sasthi C. Ghosh 0001, Bhabani P. Sinha, Nabanita Das 0001	An Efficient Channel Assignment Technique for Hexagonal Cellular Networks.	ISPAN	2002	DBLP DOI BibTeX RDF	Hexagonal Cell Structure, NP-Complete, Cellular Network, Channel Assignment Problem
11	R. Rother	Realizations of Topological Categories.	Appl. Categorical Struct.	2001	DBLP DOI BibTeX RDF	initial completion, concrete universal category, topologically universal category, universal complete lattice
11	Tsutomu Sasao, Jon T. Butler	Worst and Best Irredundant Sum-of-Products Expressions.	IEEE Trans. Computers	2001	DBLP DOI BibTeX RDF	complete sum-of-products expressions, irredundant sum-of-products, heuristic minimization, minimum sum-of-products expressions, worst sum-of-products expressions, graph enumeration, minimally strongly connected digraphs, Logic minimization, prime implicants, symmetric functions, multiple-output functions
11	Christopher Raphael	Coarse-to-Fine Dynamic Programming.	IEEE Trans. Pattern Anal. Mach. Intell.	2001	DBLP DOI BibTeX RDF	A-star, mine recognition, brachistochrone, iterated complete path, coarse to fine, Dynamic programming, global optimization
11	Martin Skutella	Approximating the single source unsplittable min-cost flow problem.	FOCS	2000	DBLP DOI BibTeX RDF	single source unsplittable min-cost flow problem, common source vertex, destination vertices, edge capacities, virtual-circuit routing, hard cost constraints, computational complexity, load balancing, resource allocation, combinatorial optimization, partitioning, optimisation, processor scheduling, NP-complete problems, packing, hardness, bicriteria approximations
11	Georg Gottlob, Phokion G. Kolaitis, Thomas Schwentick	Existential Second-Order Logic over Graphs: Charting the Tractability Frontier.	FOCS	2000	DBLP DOI BibTeX RDF	existential second-order logic, existential second-order formula, prefix class, first-order quantifiers, polynomial-time solvable problem, computational complexity, computational complexity, graph theory, graphs, directed graphs, NP-complete problems, formal logic, undirected graphs, descriptive complexity, tractability
11	Monika Maidl	The Common Fragment of CTL and LTL.	FOCS	2000	DBLP DOI BibTeX RDF	action-based computation tree logic, linear time logic, common fragment, ACTL formulas, PSPACE-complete problem, path quantifiers, 1-weak Buchi automaton, automaton size, formula size, computational complexity, temporal logic, trees (mathematics), decidability, finite automata, expressive power, negation, CTL, LTL, inductive definition
11	Fernando Ferri, Elaheh Pourabbas, Maurizio Rafanelli, Fabrizio L. Ricci	Extending Geographic Databases for a Query Language to Support Queries Involving Statistical Data.	SSDBM	2000	DBLP DOI BibTeX RDF	Complete Containment Function, Full Contains, Functional Attributes, Statistical Database, Geographic Database
11	J. Frith, Worthen Hunsaker	Completion of Quasi-Uniform Frames.	Appl. Categorical Struct.	1999	DBLP DOI BibTeX RDF	quasi-uniform frame, complete, completion, uniform frame
11	Jirí Velebil	Categorical Generalization of a Universal Domain.	Appl. Categorical Struct.	1999	DBLP DOI BibTeX RDF	Scott domain, Scott complete category, universal domain
11	Arie Harel, Su Namn, Jacob Sturm	Simple bounds for closed queueing networks.	Queueing Syst. Theory Appl.	1999	DBLP DOI BibTeX RDF	balanced job bounds, complete symmetric function, mean performance measures, lower bound, throughput, upper bound, majorization, closed queueing networks, normalization constant
11	Stiliyan Kalitzin, Bart M. ter Haar Romeny, Max A. Viergever	Invertible Apertured Orientation Filters in Image Analysis.	Int. J. Comput. Vis.	1999	DBLP DOI BibTeX RDF	integral transformations, orientation analysis, complete systems, scale space
11	Young-Joo Suh, Sudhakar Yalamanchili	All-To-All Communication with Minimum Start-Up Costs in 2D/3D Tori and Meshes.	IEEE Trans. Parallel Distributed Syst.	1998	DBLP DOI BibTeX RDF	parallel algorithms, collective communication, Interprocessor communication, all-to-all communication, all-to-all broadcast, complete exchange, all-to-all personalized exchange
11	Teresa Krick, Juan Sabia, Pablo Solernó	On Intrinsic Bounds in the Nullstellensatz.	Appl. Algebra Eng. Commun. Comput.	1997	DBLP DOI BibTeX RDF	complete intersection polynomial ideals, effective Nullstellensatz, geometric degree, trace theory
11	Seong-Moo Yoo, Hee Yong Youn, Behrooz A. Shirazi	An Efficient Task Allocation Scheme for 2D Mesh Architectures.	IEEE Trans. Parallel Distributed Syst.	1997	DBLP DOI BibTeX RDF	Complete submesh recognition, coverage submesh, waiting delay, meshes, task allocation
11	Jehoshua Bruck, Ching-Tien Ho, Shlomo Kipnis, Eli Upfal, Derrick Weathersby	Efficient Algorithms for All-to-All Communications in Multiport Message-Passing Systems.	IEEE Trans. Parallel Distributed Syst.	1997	DBLP DOI BibTeX RDF	concatenation operation, index operation, multiscatter/gather, distributed-memory system, parallel system, message-passing system, All-to-all broadcast, complete exchange, all-to-all personalized communication
11	Sanjeev Khanna, Madhu Sudan 0001, Luca Trevisan	Constraint Satisfaction: The Approximability of Minimization Problems.	CCC	1997	DBLP DOI BibTeX RDF	complete problems, computational classes, computational complexity, Approximation algorithms, combinatorial optimization
11	Jehoshua Bruck, Luc De Coster, Natalie Dewulf, Ching-Tien Ho, Rudy Lauwereins	On the Design and Implementation of Broadcast and Global Combine Operations Using the Postal Model.	IEEE Trans. Parallel Distributed Syst.	1996	DBLP DOI BibTeX RDF	global combine, Broadcast, collective communication, complete graph, postal model
11	Gurdip Singh	Leader Election in the Presence of Link Failures.	IEEE Trans. Parallel Distributed Syst.	1996	DBLP DOI BibTeX RDF	intermittent link failures, distributed algorithms, message complexity, Election, complete networks
11	Yoshifusa Ito	Nonlinearity creates linear independence.	Adv. Comput. Math.	1996	DBLP DOI BibTeX RDF	plane wave, linear independence, strict linear independence, complete linear independence, neural network, Fourier transform, activation function, Nonlinear mapping
11	Shi Ping Chen, Yong He, En-Yu Yao	Three-Partitioning Containing Kernels: Complexity and Heuristic.	Computing	1996	DBLP DOI BibTeX RDF	k-partitioning containing kernels, LPT-algorithm, NP-complete, worst case analysis
11	Erez Petrank, Gábor Tardos	On the Knowledge Complexity of NP.	FOCS	1996	DBLP DOI BibTeX RDF	logarithmic statistical knowledge complexity, NP-complete languages, samplable distribution entropy, computational complexity, language, interactive proof, error probability, polynomial time hierarchy
11	Guy Even, Joseph Naor, Leonid Zosin	An 8-Approximation Algorithm for the Subset Feedback Vertex Set Problem.	FOCS	1996	DBLP DOI BibTeX RDF	8-approximation algorithm, subset feedback vertex set problem, minimum weight, special vertices, logarithmic approximation factor, relaxed multi-commodity flow, multi-terminal flow, computational complexity, NP-Complete problems, undirected graph, multi-commodity flow, vertex weights
11	Marina Lenisa	Final Semantics for a Higher Order Concurrent Language.	CAAP	1996	DBLP DOI BibTeX RDF	second order assignment, F-coalgebra, F-bisimulation, final semantics, hyperset, complete metric space, mixed induction-coinduction, operational semantics, coinduction
11	Priyalal Kulasinghe, Saïd Bettayeb	Embedding Binary Trees into Crossed Cubes.	IEEE Trans. Computers	1995	DBLP DOI BibTeX RDF	parallel processing, interconnection network, hypercube, embedding, dilation, expansion, complete binary tree, Crossed cube
11	László Neumann, Attila Neumann	Radiosity and Hybrid Methods.	ACM Trans. Graph.	1995	DBLP DOI BibTeX RDF	Southwell algorithm, complete two-pass method, convergence criteria, coupling method, double-patch method, nondiffuse ambient term, photosimulation, radiosity method, rendering equation, separable reflectance, conjugated gradient method, residual image, distributed ray tracing
11	Sanjeev Mahajan, Ramesh Hariharan	Derandomizing Semidefinite Programming Based Approximation Algorithms.	FOCS	1995	DBLP DOI BibTeX RDF	semidefinite programming based approximation algorithms, Max k-Cut, Max-Dicut, Max-Bisection, k Vertex Coloring, polynomial time randomized algorithms, polynomial time deterministic algorithms, computational complexity, randomized algorithms, semidefinite programming, programming theory, NP-Complete problems, deterministic algorithms, Independent Set, randomised algorithms, Max-Cut, Max-Sat
11	Richard Beigel, David Eppstein	3-Coloring in Time O(1.3446n): A No-MIS Algorithm.	FOCS	1995	DBLP DOI BibTeX RDF	duality (mathematics), 3-coloring, worst case time bounds, 3-edge-coloring, 3-list-coloring, common generalization, symbol-system satisfiability, duality transformation, computational complexity, computability, decidability, NP-complete problems, graph colouring, time bounds, 3-SAT
11	Harry Buhrman, Lance Fortnow, Leen Torenvliet	Using Autoreducibility to Separate Complexity Classes.	FOCS	1995	DBLP DOI BibTeX RDF	autoreducibility, doubly exponential space, Turing complete sets, logarithmic space, computational complexity, set theory, oracle, complexity theory, Turing machines, Turing machine, complexity classes, structural properties, polynomial space, diagonalization
11	Mihir Bellare, Oded Goldreich 0001, Madhu Sudan 0001	Free Bits, PCPs and Non-Approximability - Towards Tight Results.	FOCS	1995	DBLP DOI BibTeX RDF	free bits, logarithmic randomness, amortized free bits, Max Clique, Max-2-SAT, FGLSS connection, amortized free-bit complexity, amortized free bit complexity, FPCP parameters, triviality results, computational complexity, computational geometry, theorem proving, NP-hardness, NP complete problems, proof systems, chromatic number, PCPs, Max-cut, nonapproximability
11	Ying Liu, Ambuj K. Singh, Rajive L. Bagrodia	A Decompositional Approach to the Design of Parallel Programs.	IEEE Trans. Software Eng.	1994	DBLP DOI BibTeX RDF	complete computer programs, decompositional approach, parallel program design, parallel implementation correctness, module specifications, frequently occurring control structures, subprograms, property refinement procedure, sequential composition, UNITY logic, UC programming language, diffusion aggregation, fluid flow simulations, formal specification, parallel programming, program verification, digital simulation, diffusion, iteration, physics computing, program control structures, program specifications, flow simulation