Search results for "space complexity"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
3	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
3	Haining Fan, M. Anwar Hasan	A New Approach to Subquadratic Space Complexity Parallel Multipliers for Extended Binary Fields.	IEEE Trans. Computers	2007	DBLP DOI BibTeX RDF	subquadratic space complexity multiplier, shifted polynomial basis, Finite field, coordinate transformation, Toeplitz matrix
3	François Le Gall	Exponential separation of quantum and classical online space complexity.	SPAA	2006	DBLP DOI BibTeX RDF	quantum computation, communication complexity, online, space complexity, streaming algorithms
3	Joos Heintz, Guillermo Matera, Ariel Waissbein	On the Time-Space Complexity of Geometric Elimination Procedures.	Appl. Algebra Eng. Commun. Comput.	2001	DBLP DOI BibTeX RDF	Algorithmic elimination theory, Polynomial equation solving, Algebraic complexity theory, Time-space complexity, Computation tree, Symbolic computation, Straight-line program
3	Faith Ellen Fich, Maurice Herlihy, Nir Shavit	On the Space Complexity of Randomized Synchronization.	J. ACM	1998	DBLP DOI BibTeX RDF	lower bounds, consensus, space complexity
2	Alain Cournier, Swan Dubois, Vincent Villain	How to Improve Snap-Stabilizing Point-to-Point Communication Space Complexity?	SSS	2009	DBLP DOI BibTeX RDF
2	Oded Lachish, Ilan Newman, Asaf Shapira	Space Complexity Vs. Query Complexity.	Computational Complexity	2008	DBLP DOI BibTeX RDF	Subject classification. 68Q15, 68Q10
2	Faith Ellen, Panagiota Fatourou, Eric Ruppert	The space complexity of unbounded timestamps.	Distributed Computing	2008	DBLP DOI BibTeX RDF	Obstruction-free, Lower bounds, Anonymous, Shared memory, Timestamps, Wait-free
2	Raymond Ros, Nikolaus Hansen	A Simple Modification in CMA-ES Achieving Linear Time and Space Complexity.	PPSN	2008	DBLP DOI BibTeX RDF
2	Ei Ando, Hirotaka Ono, Kunihiko Sadakane, Masafumi Yamashita	The space complexity of the leader election in anonymous networks.	IPDPS	2008	DBLP DOI BibTeX RDF
2	Mirit Shalem, Ziv Bar-Yossef	The Space Complexity of Processing XML Twig Queries Over Indexed Documents.	ICDE	2008	DBLP DOI BibTeX RDF
2	Jana Dvoráková	Towards analyzing space complexity of streaming XML transformations.	RCIS	2008	DBLP DOI BibTeX RDF
2	Kazuyuki Nakamura, Takashi Tsuchiya	A Recursive Recomputation Approach for Smoothing in Nonlinear State-Space Modeling: An Attempt for Reducing Space Complexity.	IEEE Transactions on Signal Processing	2007	DBLP DOI BibTeX RDF
2	Faith Ellen, Panagiota Fatourou, Eric Ruppert	The Space Complexity of Unbounded Timestamps.	DISC	2007	DBLP DOI BibTeX RDF	lower bounds, anonymous, shared memory, timestamps
2	Allan Carroll, Carl Ebeling	Reducing the Space Complexity of Pipelined Routing Using Modified Range Encoding.	FPL	2006	DBLP DOI BibTeX RDF
2	Daniel Sawitzki	Exponential Lower Bounds on the Space Complexity of OBDD-Based Graph Algorithms.	LATIN	2006	DBLP DOI BibTeX RDF
2	Oded Lachish, Ilan Newman, Asaf Shapira	Space Complexity vs. Query Complexity.	APPROX-RANDOM	2006	DBLP DOI BibTeX RDF
2	Raghav Kaushik, Jeffrey F. Naughton, Raghu Ramakrishnan, Venkatesan T. Chakaravarthy	Synopses for query optimization: A space-complexity perspective.	ACM Trans. Database Syst.	2005	DBLP DOI BibTeX RDF	sampling, histograms, Cardinality estimation
2	Matthew J. Streeter	Upper Bounds on the Time and Space Complexity of Optimizing Additively Separable Functions.	GECCO	2004	DBLP DOI BibTeX RDF
2	Raghav Kaushik, Raghu Ramakrishnan, Venkatesan T. Chakaravarthy	Synopses for Query Optimization: A Space-Complexity Perspective. (PDF / PS)	PODS	2004	DBLP DOI BibTeX RDF
2	Marc R. C. van Dongen	Saving Support-Checks Does Not Always Save Time.	Artif. Intell. Rev.	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
2	Michele Elia, Manuel Leone	On the Inherent Space Complexity of Fast Parallel Multipliers for GF(2/supm/).	IEEE Trans. Computers	2002	DBLP DOI BibTeX RDF	finite fields, parallel multiplier, optimal normal basis
2	Marc R. C. van Dongen	AC-3d an Efficient Arc-Consistency Algorithm with a Low Space-Complexity.	CP	2002	DBLP BibTeX RDF
2	Richard Královic	Time and Space Complexity of Reversible Pebbling.	SOFSEM	2001	DBLP DOI BibTeX RDF
2	Eli Ben-Sasson, Nicola Galesi	Space Complexity of Random Formulae in Resolution. (PDF / PS)	IEEE Conference on Computational Complexity	2001	DBLP DOI BibTeX RDF
2	Viliam Geffert	Space Hierarchy Theorem Revised.	MFCS	2001	DBLP DOI BibTeX RDF	Computational complexity, Space complexity
2	Torben Hagerup, Torsten Tholey	Efficient Minimal Perfect Hashing in Nearly Minimal Space.	STACS	2001	DBLP DOI BibTeX RDF	sparse tables, space complexity, algorithms and data structures, perfect hashing, Computational and structural complexity
2	Xuan Liu, Shashi Shekhar, Sanjay Chawla	Consistency checking for Euclidean spatial constraints: a dimension graph approach.	ICTAI	2000	DBLP DOI BibTeX RDF	Euclidean spatial constraints, dimension graph approach, graph cycle detection, spatial predicates, two-dimensional space, computational complexity, computational geometry, transforms, polygons, consistency checking, intervals, space complexity, spatial objects
2	James H. Anderson, Philip Holman	Efficient pure-buffer algorithms for real-time systems.	RTCSA	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
2	D. Rooß	Recent Developments in DNA-Computing. (PDF / PS)	ISMVL	1997	DBLP DOI BibTeX RDF	test tubes, time complexity, DNA-computing, DNA, space complexity, Hamiltonian path problem, theoretical computer science
2	Shietung Peng, Stanislav Sedukhin, Igor S. Sedukhin	Parallel Algorithm And Architecture For Two-Step Division-Free Gaussian Elimination.	ASAP	1996	DBLP DOI BibTeX RDF	two-step division-free Gaussian elimination, two-dimensional array processor, localized dependency graph, time-space complexity, parallel algorithms, parallel algorithm, computational complexity, parallel architectures, parallel architecture, iterative methods, linear systems, VLSI implementation, iterative algorithm, numerical stability, numerical stability, linear scheduling
2	Alexander Reinefeld, T. Anthony Marsland	Enhanced Iterative-Deepening Search.	IEEE Trans. Pattern Anal. Mach. Intell.	1994	DBLP DOI BibTeX RDF	iterative-deepening search, breadth-first node expansion, successively extended search horizons, information management techniques, fast-execution memory functions, computational complexity, game theory, iterative methods, search problems, space complexity, depth-first searches, A* search, search efficiency, best-first searches, two-player games
2	Eiichi Tanaka	A Metric Between Unrooted and Unordered Trees and its Bottom-Up Computing Method.	IEEE Trans. Pattern Anal. Mach. Intell.	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
2	Lefteris M. Kirousis, Paul G. Spirakis, Philippas Tsigas	Reading Many Variables in One Atomic Operation: Solutions with Linear or Sublinear Complexity.	IEEE Trans. Parallel Distrib. Syst.	1994	DBLP DOI BibTeX RDF	sublinear complexity, deterministic protocol, memory location, Archimedean time assumption, computational complexity, protocols, distributed algorithms, time complexity, probabilistic algorithm, linear complexity, space complexity, atomic operation
2	Sushil K. Prasad, Sajal K. Das, Calvin Ching-Yuen Chen	Efficient EREW PRAM Algorithms for Parentheses-Matching.	IEEE Trans. Parallel Distrib. Syst.	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
2	Kurt Mehlhorn, Micha Sharir, Emo Welzl	Tail Estimates for the Space Complexity of Randomized Incremental Algorithms.	SODA	1992	DBLP DOI BibTeX RDF
2	Lance Fortnow, Carsten Lund	Interactive Proof Systems and Alternating Time-Space Complexity.	STACS	1991	DBLP DOI BibTeX RDF
2	Hermann Kaindl, Reza Shams, Helmut Horacek	Minimax Search Algorithms With and Without Aspiration Windows.	IEEE Trans. Pattern Anal. Mach. Intell.	1991	DBLP DOI BibTeX RDF	minimax search algorithms, aspiration windows, exact minimax values, backward pruning, linear space complexity, alpha-beta search, computational complexity, game theory, trees (mathematics), search problems, uniform distribution, minimax techniques, game trees
1	M. Anwar Hasan, Nicolas Meloni, Ashkan Hosseinzadeh Namin, Christophe Nègre	Block Recombination Approach for Subquadratic Space Complexity Binary Field Multiplication Based on Toeplitz Matrix-Vector Product.	IEEE Trans. Computers	2012	DBLP DOI BibTeX RDF
1	Shukai Cai, Taisuke Izumi, Koichi Wada	How to Prove Impossibility Under Global Fairness: On Space Complexity of Self-Stabilizing Leader Election on a Population Protocol Model.	Theory Comput. Syst.	2012	DBLP DOI BibTeX RDF
1	Samir Datta, Raghav Kulkarni, Raghunath Tewari, N. V. Vinodchandran	Space complexity of perfect matching in bounded genus bipartite graphs.	J. Comput. Syst. Sci.	2012	DBLP DOI BibTeX RDF
1	Boris S. Verkhovsky	Space Complexity of Algorithm for Modular Multiplicative Inverse.	IJCNS	2011	DBLP DOI BibTeX RDF
1	Alain Cournier, Swan Dubois, Vincent Villain	How to improve snap-stabilizing point-to-point communication space complexity?	Theor. Comput. Sci.	2011	DBLP DOI BibTeX RDF
1	M. Anwar Hasan, Christophe Nègre	Low Space Complexity Multiplication over Binary Fields with Dickson Polynomial Representation.	IEEE Trans. Computers	2011	DBLP DOI BibTeX RDF
1	Abuzer Yakaryilmaz, A. C. Cem Say	Tight bounds for the space complexity of nonregular language recognition by real-time machines	CoRR	2011	DBLP BibTeX RDF
1	Maryam Helmi, Lisa Higham, Eduardo Pacheco, Philipp Woelfel	The Space Complexity of Long-lived and One-Shot Timestamp Implementations	CoRR	2011	DBLP BibTeX RDF
1	Xiangyu Chang, Zongben Xu, Bin Zou, Hai Zhang	Generalization Bounds of Regularization Algorithms Derived Simultaneously through Hypothesis Space Complexity, Algorithmic Stability and Data Quality.	IJWMIP	2011	DBLP DOI BibTeX RDF
1	Samir Datta, Raghav Kulkarni, Raghunath Tewari, N. Variyam Vinodchandran	Space Complexity of Perfect Matching in Bounded Genus Bipartite Graphs.	STACS	2011	DBLP DOI BibTeX RDF
1	Jie Xu, Bin Zou	The generalization performance of learning algorithms derived simultaneously through algorithmic stability and space complexity.	ICNC	2011	DBLP DOI BibTeX RDF
1	Maryam Helmi, Lisa Higham, Eduardo Pacheco, Philipp Woelfel	The space complexity of long-lived and one-shot timestamp implementations.	PODC	2011	DBLP DOI BibTeX RDF
1	Ioannis Chatzigiannakis, Othon Michail, Stavros Nikolaou, Andreas Pavlogiannis, Paul G. Spirakis	Passively mobile communicating machines that use restricted space.	FOMC	2011	DBLP DOI BibTeX RDF
1	Thomas Locher	Finding heavy distinct hitters in data streams.	SPAA	2011	DBLP DOI BibTeX RDF
1	Beate Bollig	Exponential space complexity for OBDD-based reachability analysis.	Inf. Process. Lett.	2010	DBLP DOI BibTeX RDF
1	Rahul Jain, Ashwin Nayak	The space complexity of recognizing well-parenthesized expressions.	Electronic Colloquium on Computational Complexity (ECCC)	2010	DBLP BibTeX RDF
1	Samir Datta, Raghav Kulkarni, Raghunath Tewari, N. V. Vinodchandran	Space Complexity of Perfect Matching in Bounded Genus Bipartite Graphs.	Electronic Colloquium on Computational Complexity (ECCC)	2010	DBLP BibTeX RDF
1	Ei Ando, Hirotaka Ono, Kunihiko Sadakane, Masafumi Yamashita	The Space Complexity of Leader Election in Anonymous Networks.	Int. J. Found. Comput. Sci.	2010	DBLP DOI BibTeX RDF
1	Chansook Lim	Space Complexity of TCP for Persistent Packet Reordering.	IEICE Transactions	2010	DBLP BibTeX RDF
1	Jean-Claude Bajard, Christophe Nègre, Thomas Plantard	Subquadratic Space Complexity Binary Field Multiplier Using Double Polynomial Representation.	IEEE Trans. Computers	2010	DBLP DOI BibTeX RDF
1	Samir Datta, Raghav Kulkarni, Raghunath Tewari, N. V. Vinodchandran	Space Complexity of Perfect Matching in Bounded Genus Bipartite Graphs	CoRR	2010	DBLP BibTeX RDF
1	Rahul Jain, Ashwin Nayak	The space complexity of recognizing well-parenthesized expressions	CoRR	2010	DBLP BibTeX RDF
1	Remco Loos, Mitsunori Ogihara	Time and Space Complexity for Splicing Systems.	Theory Comput. Syst.	2010	DBLP BibTeX RDF
1	Daniel M. Kane, Jelani Nelson, David P. Woodruff	On the Exact Space Complexity of Sketching and Streaming Small Norms.	SODA	2010	DBLP BibTeX RDF
1	Guillaume Bonfante, Georg Moser	Characterising Space Complexity Classes via Knuth-Bendix Orders.	LPAR (Yogyakarta)	2010	DBLP DOI BibTeX RDF
1	Beate Bollig	Exponential Space Complexity for Symbolic Maximum Flow Algorithms in 0-1 Networks.	MFCS	2010	DBLP DOI BibTeX RDF
1	Ryu Mizoguchi, Hirotaka Ono, Shuji Kijima, Masafumi Yamashita	Upper and Lower Bounds of Space Complexity of Self-Stabilizing Leader Election in Mediated Population Protocol.	OPODIS	2010	DBLP DOI BibTeX RDF
1	Keigo Kinpara, Tomoko Izumi, Taisuke Izumi, Koichi Wada	Improving Space Complexity of Self-stabilizing Counting on Mobile Sensor Networks.	OPODIS	2010	DBLP DOI BibTeX RDF
1	Sedat Akleylek, Murat Cenk, Ferruh Özbudak	Polynomial Multiplication over Binary Fields Using Charlier Polynomial Representation with Low Space Complexity.	INDOCRYPT	2010	DBLP DOI BibTeX RDF
1	Junfeng He, Wei Liu, Shih-Fu Chang	Scalable similarity search with optimized kernel hashing.	KDD	2010	DBLP DOI BibTeX RDF	scalable, search, indexing, kernel method, nearest neighbor, hashing, structure data
1	Shlomi Dolev, Juan A. Garay, Niv Gilboa, Vladimir Kolesnikov	Brief announcement: swarming secrets.	PODC	2010	DBLP DOI BibTeX RDF	strongly oblivious tm, swarm, multi-party computation
1	K. Tuncay Tekle, Yanhong A. Liu	Precise complexity analysis for efficient datalog queries.	PPDP	2010	DBLP DOI BibTeX RDF	demand-driven evaluation, optimization, program transformation, datalog, tabling, complexity analysis
1	Edans Flavius de Oliveira Sandes, Alba Cristina Magalhaes Alves de Melo	CUDAlign: using GPU to accelerate the comparison of megabase genomic sequences.	PPOPP	2010	DBLP DOI BibTeX RDF	biological sequence comparison, gpu, smith-waterman
1	Douglas Cenzer, Rodney G. Downey, Jeffrey B. Remmel, Zia Uddin	Space complexity of Abelian groups.	Arch. Math. Log.	2009	DBLP DOI BibTeX RDF
1	Toshiyasu Matsushima, Shigeichi Hirasawa	Reducing the space complexity of a Bayes coding algorithm using an expanded context tree.	ISIT	2009	DBLP DOI BibTeX RDF
1	Shukai Cai, Taisuke Izumi, Koichi Wada	Space Complexity of Self-stabilizing Leader Election in Passively-Mobile Anonymous Agents.	SIROCCO	2009	DBLP DOI BibTeX RDF
1	M. Anwar Hasan, Christophe Nègre	Subquadratic Space Complexity Multiplier for a Class of Binary Fields Using Toeplitz Matrix Approach.	IEEE Symposium on Computer Arithmetic	2009	DBLP DOI BibTeX RDF
1	T. S. Jayram, David P. Woodruff	The Data Stream Space Complexity of Cascaded Norms.	FOCS	2009	DBLP DOI BibTeX RDF
1	Xavier Dahan	Size of coefficients of lexicographical Groöbner bases: the zero-dimensional, radical and bivariate case.	ISSAC	2009	DBLP DOI BibTeX RDF	gr?bner bases, space complexity, triangular sets
1	Johannes Köbler, Sebastian Kuhnert	The Isomorphism Problem for k-Trees Is Complete for Logspace.	MFCS	2009	DBLP DOI BibTeX RDF	graph canonization, logspace completeness, graph isomorphism, space complexity, k-trees
1	Nizar R. Mabroukeh, Christie I. Ezeife	Using domain ontology for semantic web usage mining and next page prediction.	CIKM	2009	DBLP DOI BibTeX RDF	semantic web, association rules, markov model, web usage mining, domain ontology, semantic relatedness, sequential pattern mining
1	Peixiang Zhao, Jiawei Han, Yizhou Sun	P-Rank: a comprehensive structural similarity measure over information networks.	CIKM	2009	DBLP DOI BibTeX RDF	graph mining, information network, structural similarity
1	R. V. Nataraj, S. Selvan	A framework for mining top-k frequent closed itemsets using order preserving generators.	Bangalore Compute Conf.	2009	DBLP DOI BibTeX RDF	mining methods, data mining, algorithms, closed itemsets
1	Amit Sachan, Sabu Emmanuel, Mohan S. Kankanhalli	Efficient license validation in MPML DRM architecture.	Digital Rights Management Workshop	2009	DBLP DOI BibTeX RDF	license organization, license validation, digital rights management (drm)
1	Hao Yuan, Mikhail J. Atallah	Efficient data structures for range-aggregate queries on trees.	ICDT	2009	DBLP DOI BibTeX RDF	range aggregation, query answering
1	Mohamed E. Hussein, Wael Abd-Almageed	Approximate kernel matrix computation on GPUs forlarge scale learning applications.	ICS	2009	DBLP DOI BibTeX RDF	kernel methods, sparse matrices, space filling curves, gpu, affinity propagation
1	Bin Xin, Xiangyu Zhang	Memory slicing.	ISSTA	2009	DBLP DOI BibTeX RDF	data-centric slicing, memory dependence graph, fault localization, dynamic program slicing
1	Lexiang Ye, Eamonn J. Keogh	Time series shapelets: a new primitive for data mining.	KDD	2009	DBLP DOI BibTeX RDF	classification, pattern extraction
1	Rachid Guerraoui, Michal Kapalka	The semantics of progress in lock-based transactional memory.	POPL	2009	DBLP DOI BibTeX RDF	try-lock, semantics, lower bound, transactional memory, reduction, lock, impossibility, consensus number
1	Khalil Djelloul	From exponential to almost linear decomposability of finite or infinite trees.	SAC	2009	DBLP DOI BibTeX RDF	solving first order constraints, theory of trees, first-order logic, rewriting rules
1	Yury Lifshits, Shengyu Zhang	Combinatorial algorithms for nearest neighbors, near-duplicates and small-world design.	SODA	2009	DBLP DOI BibTeX RDF
1	Sotiris Kentros, Aggelos Kiayias, Nicolas C. Nicolaou, Alexander A. Shvartsman	At-most-once semantics in asynchronous shared memory.	SPAA	2009	DBLP DOI BibTeX RDF	at-most-once semantic, shared memory
1	Mikhail J. Atallah, Marina Blanton, Nelly Fazio, Keith B. Frikken	Dynamic and Efficient Key Management for Access Hierarchies.	ACM Trans. Inf. Syst. Secur.	2009	DBLP DOI BibTeX RDF	Efficient key derivation, key management, hierarchical access control
1	Yu-Ru Hong, Juinn-Dar Huang	Reducing fault dictionary size for million-gate large circuits.	ACM Trans. Design Autom. Electr. Syst.	2009	DBLP DOI BibTeX RDF	fault diagnosis, Fault dictionary, diagnostic resolution
1	Jon Sneyers, Tom Schrijvers, Bart Demoen	The computational power and complexity of constraint handling rules.	ACM Trans. Program. Lang. Syst.	2009	DBLP DOI BibTeX RDF	constant factors, complexity, Constraint Handling Rules
1	Fu-Lai Chung, Zhaohong Deng, Shitong Wang	From Minimum Enclosing Ball to Fast Fuzzy Inference System Training on Large Datasets.	IEEE T. Fuzzy Systems	2009	DBLP DOI BibTeX RDF
1	Nicolás García-Pedrajas	Constructing Ensembles of Classifiers by Means of Weighted Instance Selection.	IEEE Transactions on Neural Networks	2009	DBLP DOI BibTeX RDF
1	Nicolas Baudru	Distributed Asynchronous Automata.	CONCUR	2009	DBLP DOI BibTeX RDF
1	Rolf Backofen, Dekel Tsur, Shay Zakov, Michal Ziv-Ukelson	Sparse RNA Folding: Time and Space Efficient Algorithms.	CPM	2009	DBLP DOI BibTeX RDF
1	M. Julia Flores, José A. Gámez, Ana M. Martínez, Jose Miguel Puerta	HODE: Hidden One-Dependence Estimator.	ECSQARU	2009	DBLP DOI BibTeX RDF	AODE, SPODE, Classification, Bayesian Networks, Bayesian Classifiers, ODE
1	Armelle Brun, Anne Boyer	Towards Privacy Compliant and Anytime Recommender Systems.	EC-Web	2009	DBLP DOI BibTeX RDF
1	Lars R. Knudsen, Florian Mendel, Christian Rechberger, Søren S. Thomsen	Cryptanalysis of MDC-2.	EUROCRYPT	2009	DBLP DOI BibTeX RDF	MDC-2, hash function, collision, preimage