Search results for "complexities"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
60	Daniel Hammer, Andrei E. Romashchenko, Alexander Shen, Nikolai K. Vereshchagin	Inequalities for Shannon entropies and Kolmogorov complexities.	CCC	1997	DBLP DOI BibTeX RDF	finite objects, Ingleton's inequality, Gacs-Korner's results, computational complexity, Kolmogorov complexities, Shannon entropies, linear inequalities
45	A. C. Cem Say, Selahattin Kuru	Improved Filtering for the QSIM Algorithm.	IEEE Trans. Pattern Anal. Mach. Intell.	1993	DBLP DOI BibTeX RDF	spurious predictions, qualitative simulation algorithm, interval corresponding values, inconsistent states, simulation, filtering, time complexities, inference mechanisms, filtering and prediction theory, space complexities, QSIM
45	Ryouei Takahashi, Yukihiro Nakamura	The effect of interface complexity on program error density.	ICSM	1996	DBLP DOI BibTeX RDF	interface complexity, program error density, modified parts, unmodified parts, interfaced complexities, functionally related routines, discriminant analyses, reuse-ratio, optimal threshold, extended cyclomatic number, error density, software maintenance, regression analysis, subsystems, software maintainability, software errors, C-coding, software quality classification, AIC
41	Ibrahim Furkan Ince, Yücel Batu Salman, Mustafa Eren Yildirim	A user study: the effects of mobile phone prototypes and task complexities on usability.	ICIS	2009	DBLP DOI BibTeX RDF	LG-GM730, mobile phone interface design, prototypes and task complexities, HCI, usability
39	Ming-Bo Lin, A. Yavuz Oruç	Constant Time Inner Product and Matrix Computations on Permutation Network Processors.	IEEE Trans. Computers	1994	DBLP DOI BibTeX RDF	constant time inner product, permutation network processors, algebraic computations, cost complexities, computational complexity, parallel architectures, time complexities, matrix algebra, PRAM, parallel computation model, matrix computations, CRCW PRAM
39	David M. Nicol, David R. O'Hallaron	Improved Algorithms for Mapping Pipelined and Parallel Computations.	IEEE Trans. Computers	1991	DBLP DOI BibTeX RDF	linear array systems, host-satellite systems, computation module execution times, intermodule communication times, homogeneity constraints, parallel mapping algorithms, parallel algorithms, computational complexity, parallel computations, time complexities, shared memory systems, space complexities, pipelined computations
39	Rajamani Sundar	A Lower Bound for the Dictionary Problem under a Hashing Model	FOCS	1991	DBLP DOI BibTeX RDF	randomized complexities, update costs, deterministic complexities, constant amortized time, multilevel hashing model, log-algorithmic amortized time, nontrivial lower bound, limited wordsize, memory locations, data structures, polynomial space, dictionary problem, cell probe model
38	Harold W. Lawson	The insides and outsides of computer-based system complexity.	ECBS	1997	DBLP DOI BibTeX RDF	computer-based system complexity, man-made complexities, hardware and systems software, software metrics, application softwares, computer industry
38	Guoyin Wang 0001, Feng Hu 0001	Quick Knowledge Reduction Based on Divide and Conquer Method in Huge Data Sets.	PReMI	2007	DBLP DOI BibTeX RDF	Huge data sets processing, quick sort, attribute order, rough set, divide and conquer, attribute reduction
35	Clement T. Yu, Weiyi Meng	Confronting Database Complexities.	IEEE Softw.	1994	DBLP DOI BibTeX RDF	database complexities, database technology, hierarchical database model, distributed heterogeneous databases, specialized database models, database programmers, database users, database tools, data structures, database management systems, object-oriented databases, database designers, relational database model
35	Vince Grolmusz	Separating the Communication Complexities of MOD m and MOD p Circuits	FOCS	1992	DBLP DOI BibTeX RDF	GIP function, MOD m circuits, MOD p circuits, depth-2, size-N circuits, k-party communication protocols, communication complexities
34	Vincent Chiew, Yingxu Wang 0001	Design of a Cognitive Complexities Measurement and Analysis Tool.	CCECE	2006	DBLP DOI BibTeX RDF
34	Peter L. Bartlett, Shahar Mendelson	Rademacher and Gaussian Complexities: Risk Bounds and Structural Results.	COLT/EuroCOLT	2001	DBLP DOI BibTeX RDF
34	Harry B. Hunt III, Richard Edwin Stearns	Monotone Boolean Formulas, Distributive Lattices, and the Complexities of Logics, Algebraic Structures, and Computation Structures (Preliminary Report).	STACS	1986	DBLP DOI BibTeX RDF
32	K. B. Lakshmanan, Krishnaiyan Thulasiraman, M. A. Comeau	An Efficient Distributed Protocol for Finding Shortest Paths in Networks with Negative Weights.	IEEE Trans. Software Eng.	1989	DBLP DOI BibTeX RDF	efficient distributed protocol, negative weights, single-source shortest-path problem, asynchronous directed network, unbounded message complexity, synchronous version, Chandy-Misra algorithm, efficient synchronizer, computational complexity, protocols, distributed algorithms, distributed processing, directed graphs, time complexities, edges, cycle, nodes, worst case, asynchronous protocol
31	Hao Chen 0029, Liqing Xu	On the binary sequences with high GF(2) linear complexities and low GF(p) linear complexities.	IACR Cryptol. ePrint Arch.	2005	DBLP BibTeX RDF
28	Shinobu Nagayama, Tsutomu Sasao	Complexities of Graph-Based Representations for Elementary Functions.	IEEE Trans. Computers	2009	DBLP DOI BibTeX RDF
28	Ning Chen 0004, Zhiyuan Yan 0001	Cyclotomic FFTs With Reduced Additive Complexities Based on a Novel Common Subexpression Elimination Algorithm.	IEEE Trans. Signal Process.	2009	DBLP DOI BibTeX RDF
28	Yu-Cheng He, Christian Cardinal, David Haccoun	Comparison of decoding complexities for LDPC and convolutional self-doubly-orthogonal codes.	PIMRC	2008	DBLP DOI BibTeX RDF
28	Tunga Güngör, Ali Çiltik	Developing Methods and Heuristics with Low Time Complexities for Filtering Spam Messages.	NLDB	2007	DBLP DOI BibTeX RDF	Spam e-mails, N-gram methods, Heuristics, Turkish
28	Yuri Kalnishkan, Vladimir Vovk, Michael V. Vyugin	Generalised Entropy and Asymptotic Complexities of Languages.	COLT	2007	DBLP DOI BibTeX RDF
28	Hao Chen 0095	Reducing the Computation of Linear Complexities of Periodic Sequences Over GF(pm).	IEEE Trans. Inf. Theory	2006	DBLP DOI BibTeX RDF
28	Alexey V. Chernov, Jürgen Schmidhuber	Prefix-Like Complexities and Computability in the Limit.	CiE	2006	DBLP DOI BibTeX RDF	limit computability, generalized Turing machine, non-halting computation, Kolmogorov complexity
28	Barbara L. Marcolin, Alain Ross	Complexities in IS sourcing: equifinality and relationship management.	Data Base	2005	DBLP DOI BibTeX RDF	IS sourcing, equifinality, framework, governance, partnership, relationship management
28	Michael V. Vyugin, Vladimir V. V'yugin	Non-linear Inequalities between Predictive and Kolmogorov Complexities.	ALT	2001	DBLP DOI BibTeX RDF
26	Tony Y. T. Chan	Practical Linear Space Algorithms for Computing String-Edit Distances.	ICIC (3)	2006	DBLP DOI BibTeX RDF	time and space complexities, algorithms, String-edit distance
26	Dawn N. Jutla, Peter Bodorik, Y. Cai	Interoperability for Accessing DBs by E-Commerce Applications.	HICSS	2001	DBLP DOI BibTeX RDF	DB access, SQL queries, Reducing complexities, Interoperability, Framework, CORBA, Application program interface, Distributed Objects, DCOM
26	Tamal K. Dey	Improved Bounds on Planar k-sets and k-levels.	FOCS	1997	DBLP DOI BibTeX RDF	planar k-sets, k-levels, parametric minimum spanning trees, parametric matroids, computational complexity, line segments, combinatorial complexities, convex polygons
26	Tatsuo Nakajima	A toolkit for building continuous media applications.	RTCSA	1997	DBLP DOI BibTeX RDF	continuous media applications, multimedia programming, dynamic QOS control, real-time Mach microkernel, complexities, multimedia computing, multimedia computing, scripting language, real-time processing, media synchronization
26	John Yiannis Cotronis	Efficient Program Composition on Parix by the Ensemble Methodology.	EUROMICRO	1996	DBLP DOI BibTeX RDF	program composition, Parix, Ensemble methodology, message passing program composition methodology, Process Communication Graphs, application scripts, universal Parix program loader, communication dependencies, complexities, message passing, parallel virtual machine
26	Omer Berkman, Yossi Matias	Fast parallel algorithms for minimum and related problems with small integer inputs.	IPPS	1995	DBLP DOI BibTeX RDF	integer inputs, prefix minima, range minima, integer domain, domain size, parallel algorithms, parallel algorithms, computational complexity, complexities, running time
26	Mark Genoe, Paul Vanoostende, Geert van Wauwe	On the use of VHDL-based behavioral synthesis for telecom ASIC design.	ISSS	1995	DBLP DOI BibTeX RDF	Alcatel-Bell, RTL-synthesizable description, behavioral synthesis tools, hardware CAD tool, system level design methodology, telecom ASIC design, telecom system hardware design, high level synthesis, VHDL, VHDL, application specific integrated circuits, ASIC, logic synthesis, integrated circuit design, hardware description languages, integrated logic circuits, behavioral synthesis, telecommunication computing, hardware software codesign, design complexities
26	Vinod Narayananan, David LaPotin, Rajesh Gupta 0003, Gopalakrishnan Vijayan	PEPPER - a timing driven early floorplanner.	ICCD	1995	DBLP DOI BibTeX RDF	PEPPER, timing driven early floorplanner, chip complexities, early analysis, performance critical CMOS chips, wireability, floorplan optimization process, performance, computational complexity, optimisation, timing, system design, circuit layout CAD, CMOS integrated circuits, static timing analysis, integrated circuit layout, area, interconnect delay
26	Yingsha Liao, Donald Cohen	A Specificational Approach to High Level Program Monitoring and Measuring.	IEEE Trans. Software Eng.	1992	DBLP DOI BibTeX RDF	program measurement, specificational approach, high level program monitoring, execution characteristics, instrumentation code, high-level specification language, augmented program, complexities, formal specification, software metrics, specification languages, automatic programming, system monitoring, special-purpose hardware
26	Tadao Murata, Boris Shenker, Sol M. Shatz	Detection of Ada Static Deadlocks Using Petri Net Invariants.	IEEE Trans. Software Eng.	1989	DBLP DOI BibTeX RDF	Ada static deadlocks, Petri net invariants, Ada tasking programs, message-flow, computational complexity, complexities, Petri nets, Ada, concurrency control, program testing, system recovery, control-flow
26	Viktor K. Prasanna, Venkatesh Krishnan	Efficient Parallel Algorithms for Image Template Matching on Hypercube SIMD Machines.	IEEE Trans. Pattern Anal. Mach. Intell.	1989	DBLP DOI BibTeX RDF	image template matching, hypercube SIMD machines, parallel algorithms, parallel algorithms, computational complexity, computerised picture processing, computerised picture processing, computerised pattern recognition, computerised pattern recognition, time complexities, bounds
25	Guy E. Blelloch, Phillip B. Gibbons, Harsha Vardhan Simhadri	Low depth cache-oblivious algorithms.	SPAA	2010	DBLP DOI BibTeX RDF	sparse-matrix vector multiply, schedulers, parallel algorithms, multiprocessors, sorting, graph algorithms, cache-oblivious algorithms
25	Veli Mäkinen, Gonzalo Navarro 0001	Dynamic entropy-compressed sequences and full-text indexes.	ACM Trans. Algorithms	2008	DBLP DOI BibTeX RDF	Compressed dynamic data structures, compressed text databases, partial sums, entropy, sequences
22	Pierre Fraigniaud	Distributed computational complexities: are you volvo-addicted or nascar-obsessed?	PODC	2010	DBLP DOI BibTeX RDF	mobile computing, network computing, wait-free computing
22	Miklos Santha, Mario Szegedy	Quantum and Classical Query Complexities of Local Search Are Polynomially Related.	Algorithmica	2009	DBLP DOI BibTeX RDF	Local search, Quantum computing, Query complexity
22	Jackey Z. Yan, Natarajan Viswanathan, Chris Chu	Handling complexities in modern large-scale mixed-size placement.	DAC	2009	DBLP DOI BibTeX RDF	incremental placement, mixed-size design, floorplanning
22	Joseph Kibombo Balikuddembe, Anet Potgieter	Using Actor Object Operations Structures to Understand Project Requirements Complexities.	ICSEA	2008	DBLP DOI BibTeX RDF
22	Georg Moser, Andreas Schnabl	Proving Quadratic Derivational Complexities Using Context Dependent Interpretations.	RTA	2008	DBLP DOI BibTeX RDF
22	Gary R. Mayer, Hessam S. Sarjoughian	Complexities of simulating a hybrid agent-landscape model using multi-formalism composability.	SpringSim (2)	2007	DBLP BibTeX RDF	poly-formalism, agents, cellular automata, multi-modeling, multi-formalism
22	Jia-Huai You, Li-Yan Yuan, Guohua Liu, Yi-Dong Shen	Logic Programs with Abstract Constraints: Representaton, Disjunction and Complexities.	LPNMR	2007	DBLP DOI BibTeX RDF
22	Kazuho Watanabe, Motoki Shiga, Sumio Watanabe	Upper Bounds for Variational Stochastic Complexities of Bayesian Networks.	IDEAL	2006	DBLP DOI BibTeX RDF
22	Yingxu Wang	Psychological experiments on the cognitive complexities of fundamental control structures of software systems.	IEEE ICCI	2005	DBLP DOI BibTeX RDF
22	Kevin M. Taaffe, Rachel Kohl, Delbert L. Kimbler	Hospital evacuation: issues and complexities.	WSC	2005	DBLP DOI BibTeX RDF
22	Yun-Pyo Hong, Hong-Yeop Song	Frequency/Time Hopping Sequences with Large Linear Complexities.	WCC	2005	DBLP DOI BibTeX RDF
22	Boris Aronov, Micha Sharir	Cell Complexities in Hyperplane Arrangements.	Discret. Comput. Geom.	2004	DBLP DOI BibTeX RDF
22	Miklos Santha, Mario Szegedy	Quantum and classical query complexities of local search are polynomially related.	STOC	2004	DBLP DOI BibTeX RDF	PLO, neighborhood structure, decision trees, quantum computation, query model, local optimization
22	Peter Høyer, Jan Neerbek, Yaoyun Shi	Quantum Complexities of Ordered Searching, Sorting, and Element Distinctness.	Algorithmica	2002	DBLP DOI BibTeX RDF
22	Henry N. Adorna	On the Separation between k-Party and (k-1)-Party Nondeterministic Message Complexities.	Developments in Language Theory	2002	DBLP DOI BibTeX RDF
22	Peter Høyer, Jan Neerbek, Yaoyun Shi	Quantum Complexities of Ordered Searching, Sorting, and Element Distinctness.	ICALP	2001	DBLP DOI BibTeX RDF
22	Prasad V. Saraph	Simulating biotech manufacturing operations: issues and complexities.	WSC	2001	DBLP DOI BibTeX RDF
22	Sylvia B. Encheva, Gérard D. Cohen	On the State Complexities of Ternary Codes.	AAECC	1999	DBLP DOI BibTeX RDF
22	Cunsheng Ding	Lower Bounds on the Weight Complexities of Cascaded Binary Sequences.	AUSCRYPT	1990	DBLP DOI BibTeX RDF
22	Helmut Alt	Comparing the combinational complexities of arithmetic functions.	J. ACM	1988	DBLP DOI BibTeX RDF
22	Thomas Lengauer, Klaus W. Wagner	The Correlation Between the Complexities of the Nonhierarchical and Hierarchical Versions of Graph Problems.	STACS	1987	DBLP DOI BibTeX RDF
20	Mourad Elloumi, Ahmed Mokaddem	An Algorithm for Multiple and Global Alignments.	BIRD	2008	DBLP DOI BibTeX RDF	multiple and global alignments, common subsequence, algorithms, complexities, Strings, divide-and-conquer strategy
20	Hatem Tahri, Mourad Elloumi	A New Approximation Algorithm for the Minimum Fragment Removal Problem.	BIRD	2008	DBLP DOI BibTeX RDF	haplotype assembly, minimum fragment removal, vertex bipartization, algorithms, complexities, Graphs
20	Chun-Yuan Lin, Chen Tai Huang, Yeh-Ching Chung, Chuan Yi Tang	Efficient Parallel Algorithm for Optimal Three-Sequences Alignment.	ICPP	2007	DBLP DOI BibTeX RDF	Hirschberg’s technique, time and space complexities, dynamic programming, computational biology, sequence alignment
20	Lior Shabtay, Adrian Segall	Low Complexity Network Synchronization.	WDAG	1994	DBLP DOI BibTeX RDF	sparse covers, communication and time complexities, networks, distributed algorithms, synchronization
20	Dinesh P. Mehta, Sartaj Sahni	A Data Structure for Circular String Analysis and Visualization.	IEEE Trans. Computers	1993	DBLP DOI BibTeX RDF	circular string analysis, compact symmetric directed acyclic word graph, linear strings, visualization, computational complexity, data structure, data structures, computational geometry, directed graphs, time complexity, object-oriented language, data visualisation, space complexities
20	Keh-Chang Guh, Clement T. Yu	Efficient Management of Materialized Generalized Transitive Closure in Centralized and Parallel Environments.	IEEE Trans. Knowl. Data Eng.	1992	DBLP DOI BibTeX RDF	centralised environments, materialized generalized transitive closure, computational complexity, parallel processing, data structure, data structures, expert systems, queries, time complexities, deductive databases, insertions, deletions, parallel environments, multiprocessor environment
20	Leonard J. Schulman	Communication on Noisy Channels: A Coding Theorem for Computation	FOCS	1992	DBLP DOI BibTeX RDF	private-coin noisy channel protocol, coding theorem, noiseless channel protocol, complexities, parallel computing, distributed computing, computation, errors, noisy channels, noisy channel
20	A. Yavuz Oruç, Millind Mittal	Setup Algorithms for Cube-Connected Parallel Computers Using Recursive Karnaugh Maps.	IEEE Trans. Computers	1991	DBLP DOI BibTeX RDF	setup algorithms, cube-connected parallel computers, recursive Karnaugh maps, one-pass permutations, parallel algorithms, computational complexity, time complexities, transportations, cycles, cycles, paths, transpositions
20	Kar-Lik Wong, Wan-Chi Siu	Data Routing Networks for Systolic/Pipeline Realization of Prime Factor Mapping.	IEEE Trans. Computers	1991	DBLP DOI BibTeX RDF	prime factor mapping, data routing networks, low circuit complexities, very-high-throughput, parallel architectures, pipeline architecture, systolic architecture
20	László Lovász 0001, Moni Naor, Ilan Newman, Avi Wigderson	Search Problems in the Decision Tree Model (Preliminary Version)	FOCS	1991	DBLP DOI BibTeX RDF	Boolean decision tree model, CNF search, complexities, randomness, search problems, determinism, nondeterminism
20	Wolfgang Maass 0001, György Turán	On the Complexity of Learning from Counterexamples and Membership Queries	FOCS	1990	DBLP DOI BibTeX RDF	nondecreasing functions, domain subsets, learning from counterexamples, learning complexities, online learning models, combinatorial parameters, monomials, lower bound, membership queries, equivalence queries, threshold gates, concept class
20	Marina Roesler, Walter A. Burkhard	Resolution of Deadlocks in Object-Oriented Distributed Systems.	IEEE Trans. Computers	1989	DBLP DOI BibTeX RDF	worst time complexity, object-oriented distributed systems, semantic lock model, message traffic, average time complexities, distributed algorithm, distributed databases, concurrency control, deadlocks resolution, dependence relations, concurrency control algorithms
20	K. V. S. Ramarao	Distributed Algorithms for Network Recognition Problems.	IEEE Trans. Computers	1989	DBLP DOI BibTeX RDF	unified algorithms, network recognition, noncentralized initiations, computational complexity, distributed algorithms, distributed processing, computer networks, tree, time complexities, communication complexity, bipartite graph, ring, centralized, decentralized, star, complete graph
20	Maciej Liskiewicz, Krzysztof Lorys	On Reversal Complexity for Alternating Turing Machines (Extended Abstract)	FOCS	1989	DBLP DOI BibTeX RDF	reversal complexity, nonregular languages, ATM, space complexities, alternating Turing machines
19	Yanhong A. Liu, Scott D. Stoller	From datalog rules to efficient programs with time and space guarantees.	ACM Trans. Program. Lang. Syst.	2009	DBLP DOI BibTeX RDF	data structure design, indexed representations, linked representations, optimization, indexing, program transformation, Datalog, recursion, tabling, Complexity analysis, incremental computation
19	Bahman Kalantari, Isabella Lari, Federica Ricca, Bruno Simeone	On the complexity of general matrix scaling and entropy minimization via the RAS algorithm.	Math. Program.	2008	DBLP DOI BibTeX RDF
19	Chi-Sing Leung, Kwok-Wo Wong, Yong Xu	The Local True Weight Decay Recursive Least Square Algorithm.	ICONIP (1)	2007	DBLP DOI BibTeX RDF
19	Gang Cheng 0003, Nirwan Ansari, Li Zhu	Enhancing epsilon-Approximation Algorithms With the Optimal Linear Scaling Factor.	IEEE Trans. Commun.	2006	DBLP DOI BibTeX RDF
19	Doron Bustan, John Havlicek	Some Complexity Results for SystemVerilog Assertions.	CAV	2006	DBLP DOI BibTeX RDF
19	Eli Biham, Orr Dunkelman, Nathan Keller	Related-Key Impossible Differential Attacks on 8-Round AES-192.	CT-RSA	2006	DBLP DOI BibTeX RDF	related-key differentials, AES, impossible differentials
19	Arash Reyhani-Masoleh, M. Anwar Hasan	Low Complexity Bit Parallel Architectures for Polynomial Basis Multiplication over GF(2^{m}).	IEEE Trans. Computers	2004	DBLP DOI BibTeX RDF
19	Berk Sunar	A Generalized Method for Constructing Subquadratic Complexity GF(2^k) Multipliers.	IEEE Trans. Computers	2004	DBLP DOI BibTeX RDF
19	Ingo Lepper	Simply terminating rewrite systems with long derivations.	Arch. Math. Log.	2004	DBLP DOI BibTeX RDF	Simple termination, Hardy hierarchy, Fundamental sequence, Hydra
19	Fedor V. Fomin, Dieter Kratsch, Gerhard J. Woeginger	Exact (Exponential) Algorithms for the Dominating Set Problem.	WG	2004	DBLP DOI BibTeX RDF
19	Jared Hayes, Antoni B. Moore, George L. Benwell, B. L. William Wong	Ambulance Dispatch Complexity and Dispatcher Decision Strategies: Implications for Interface Design.	APCHI	2004	DBLP DOI BibTeX RDF
19	Alex Biryukov, Christophe De Cannière, Michaël Quisquater	On Multiple Linear Approximations.	CRYPTO	2004	DBLP DOI BibTeX RDF	multiple linear approximations, stochastic systems of linear equations, maximum likelihood decoding, key-ranking, AES, DES, Linear cryptanalysis
19	Yanhong A. Liu, Scott D. Stoller	From datalog rules to efficient programs with time and space guarantees.	PPDP	2003	DBLP DOI BibTeX RDF	data structure design, indexed representations, linked representations, optimization, indexing, program transformation, datalog, recursion, tabling, complexity analysis, incremental computation
19	Sorin Cotofana, Stamatis Vassiliadis	Signed Digit Addition and Related Operations with Threshold Logic.	IEEE Trans. Computers	2000	DBLP DOI BibTeX RDF	signed-digit arithmetic, redundant adders, redundant multipliers, neural networks, Computer arithmetic, threshold logic, carry-free addition, signed-digit number representation
19	Ngoc Binh Nguyen, Tu Bao Ho	A Mixed Similarity Measure in Near-Linear Computational Complexity for Distance-Based Methods.	PKDD	2000	DBLP DOI BibTeX RDF	mixed similarity measure (MSM), distance-based methods, computational complexity, very large databases
19	David Z. Gevorkian, Jaakko Astola, Samvel M. Atourian	Improving Gil-Werman Algorithm for Running Min and Max Filters.	IEEE Trans. Pattern Anal. Mach. Intell.	1997	DBLP DOI BibTeX RDF	Running min and max, algorithms, computational complexity, morphological filters
19	Piyush Maheshwari	Partitioning and Scheduling of Parallel Functional Programs Using Complexity Information.	ICCI	1991	DBLP DOI BibTeX RDF	time and communication complexity functions, scheduling, partitioning, Functional programming, granularity
16	Xueping Yan, Lin Tan 0003, Hong Xu 0008, Wen-Feng Qi 0001	Improved mixture differential attacks on 6-round AES-like ciphers towards time and data complexities.	J. Inf. Secur. Appl.	2024	DBLP DOI BibTeX RDF
16	Huimin Han, Zehua Liu, Jiuhao Li, Zhixiong Zeng	Challenges in remote sensing based climate and crop monitoring: navigating the complexities using AI.	J. Cloud Comput.	2024	DBLP DOI BibTeX RDF
16	Modjtaba Ghorbani, Zahra Vaziri	On the Szeged and Wiener complexities in graphs.	Appl. Math. Comput.	2024	DBLP DOI BibTeX RDF
16	Lijiao Jia, Yunil Roh, Guangri Piao, Il Hyo Jung	Dynamic Complexities in Competing Parasitoid Species on a Shared Host.	Int. J. Bifurc. Chaos	2024	DBLP DOI BibTeX RDF
16	Bin Gu 0001, Xiyuan Wei, Hualin Zhang, Yi Chang, Heng Huang	Obtaining Lower Query Complexities Through Lightweight Zeroth-Order Proximal Gradient Algorithms.	Neural Comput.	2024	DBLP DOI BibTeX RDF
16	Florian Kern, Jonathan Tschanter, Marc Erich Latoschik	Handwriting for Text Input and the Impact of XR Displays, Surface Alignments, and Sentence Complexities.	IEEE Trans. Vis. Comput. Graph.	2024	DBLP DOI BibTeX RDF
16	Pranav Khadpe, Lindy Le, Kate Nowak, Shamsi T. Iqbal, Jina Suh	DISCERN: Designing Decision Support Interfaces to Investigate the Complexities of Workplace Social Decision-Making With Line Managers.	CoRR	2024	DBLP DOI BibTeX RDF
16	Dongqi Pu, Yifan Wang, Jia E. Loy, Vera Demberg	SciNews: From Scholarly Complexities to Public Narratives - A Dataset for Scientific News Report Generation.	CoRR	2024	DBLP DOI BibTeX RDF
16	Lijun Chang	Maximum Defective Clique Computation: Improved Time Complexities and Practical Performance.	CoRR	2024	DBLP DOI BibTeX RDF
16	Kento Imaizumi, Hideaki Iiduka	Iteration and Stochastic First-order Oracle Complexities of Stochastic Gradient Descent using Constant and Decaying Learning Rates.	CoRR	2024	DBLP DOI BibTeX RDF