The FacetedDBLP logo    Search for: in:

Disable automatic phrases ?     Syntactic query expansion: ?

Searching for sublinear with no syntactic query expansion in all metadata.

Publication years (Num. hits)
1977-1987 (17) 1988-1990 (15) 1991-1992 (19) 1993-1994 (19) 1995-1996 (15) 1997-1999 (23) 2000-2001 (25) 2002-2003 (32) 2004 (32) 2005 (39) 2006 (39) 2007 (47) 2008 (44) 2009 (52) 2010 (38) 2011 (33) 2012 (35) 2013 (30) 2014 (35) 2015 (45) 2016 (51) 2017 (39) 2018 (74) 2019 (75) 2020 (66) 2021 (105) 2022 (104) 2023 (101) 2024 (16)
Publication types (Num. hits)
article(637) book(1) incollection(10) inproceedings(602) phdthesis(13) proceedings(2)
Venues (Conferences, Journals, ...)
GrowBag graphs for keyword ? (Num. hits/coverage)

Group by:
The graphs summarize 311 occurrences of 232 keywords

Results
Found 1265 publication records. Showing 1265 according to the selection in the facets
Hits ? Authors Title Venue Year Link Author keywords
67Ray Maleh, Anna C. Gilbert Sublinear Recovery of Sparse Wavelet Signals. Search on Bibsonomy DCC The full citation details ... 2008 DBLP  DOI  BibTeX  RDF sublinear recovery, Haar, Reed Muller, wavelets, sketch, sparse
63Artur Czumaj, S. Muthukrishnan 0001, Ronitt Rubinfeld, Christian Sohler 08341 Executive Summary - Sublinear Algorithms. Search on Bibsonomy Sublinear Algorithms The full citation details ... 2008 DBLP  BibTeX  RDF
63Artur Czumaj, S. Muthu Muthukrishnan, Ronitt Rubinfeld, Christian Sohler 08341 Abstracts Collection - Sublinear Algorithms. Search on Bibsonomy Sublinear Algorithms The full citation details ... 2008 DBLP  BibTeX  RDF
63Bernard Chazelle, Ding Liu, Avner Magen Sublinear Geometric Algorithms. Search on Bibsonomy Sublinear Algorithms The full citation details ... 2005 DBLP  BibTeX  RDF
63Artur Czumaj, S. Muthu Muthukrishnan, Ronitt Rubinfeld, Christian Sohler 05291 Abstracts Collection -- Sublinear Algorithms. Search on Bibsonomy Sublinear Algorithms The full citation details ... 2005 DBLP  BibTeX  RDF
58Funda Ergün, S. Muthukrishnan 0001, Süleyman Cenk Sahinalp Sublinear Methods for Detecting Periodic Trends in Data Streams. Search on Bibsonomy LATIN The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
58Lawrence L. Larmore, Wojciech Rytter Efficient Sublinear Time Parallel Algorithms for Dynamic Programming and Context-Free Recognition. Search on Bibsonomy STACS The full citation details ... 1992 DBLP  DOI  BibTeX  RDF
56Vaithilingam Jeyakumar, Guoyin Li 0001 Farkas' lemma for separable sublinear inequalities without qualifications. Search on Bibsonomy Optim. Lett. The full citation details ... 2009 DBLP  DOI  BibTeX  RDF Generalized Farkas’ lemma, Separable sublinear inequalities, Robust linear programming, Duality, Optimality conditions
56Bin Fu, Zhixiang Chen 0001 Sublinear time width-bounded separators and their application to the protein side-chain packing problem. Search on Bibsonomy J. Comb. Optim. The full citation details ... 2008 DBLP  DOI  BibTeX  RDF Width-bounded separator, Random sampling, Sublinear time algorithm
56Bernard Chazelle, Ding Liu, Avner Magen Sublinear geometric algorithms. Search on Bibsonomy STOC The full citation details ... 2003 DBLP  DOI  BibTeX  RDF approximate shortest paths, polyhedral intersection, sublinear algorithms
55Paolo Ferragina, Roberto Grossi Optimal On-Line Search and Sublinear Time Update in String Matching. Search on Bibsonomy FOCS The full citation details ... 1995 DBLP  DOI  BibTeX  RDF optimal online search, optimal on-line search, sublinear time update, online searching, arbitrary pattern string, indexed text string, arbitrary string, optimal time, occ occurrences, sublinear time per update, computational complexity, pattern matching, string matching, string matching, search problems, word processing, dynamic algorithm, dynamic setting
48Artur Czumaj, S. Muthu Muthukrishnan, Ronitt Rubinfeld, Christian Sohler (eds.) Sublinear Algorithms, 17.08. - 22.08.2008 Search on Bibsonomy Sublinear Algorithms The full citation details ... 2008 DBLP  BibTeX  RDF
48Tali Kaufman, Simon Litsyn, Ning Xie 0002 Breaking the ε-Soundness Bound of the Linearity Test over GF(2). Search on Bibsonomy Sublinear Algorithms The full citation details ... 2008 DBLP  BibTeX  RDF
48Sumit Ganguly Lower bound for estimating frequency for update data streams. Search on Bibsonomy Sublinear Algorithms The full citation details ... 2008 DBLP  BibTeX  RDF
48Artur Czumaj, S. Muthu Muthukrishnan, Ronitt Rubinfeld, Christian Sohler (eds.) Sublinear Algorithms, 17.07. - 22.07.2005 Search on Bibsonomy Sublinear Algorithms The full citation details ... 2006 DBLP  BibTeX  RDF
48Oded Goldreich 0001 Contemplations on Testing Graph Properties. Search on Bibsonomy Sublinear Algorithms The full citation details ... 2005 DBLP  BibTeX  RDF
48Oded Goldreich 0001, Dana Ron Approximating Average Parameters of Graphs. Search on Bibsonomy Sublinear Algorithms The full citation details ... 2005 DBLP  BibTeX  RDF
47Vassil S. Dimitrov, Kimmo U. Järvinen, Michael J. Jacobson Jr., W. F. Chan, Zhun Huang Provably Sublinear Point Multiplication on Koblitz Curves and Its Hardware Implementation. Search on Bibsonomy IEEE Trans. Computers The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
47Satyen Kale, Yuval Peres, C. Seshadhri 0001 Noise Tolerance of Expanders and Sublinear Expander Reconstruction. Search on Bibsonomy FOCS The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
47Jesper Jansson 0001, Kunihiko Sadakane, Wing-Kin Sung Compressed Dynamic Tries with Applications to LZ-Compression in Sublinear Time and Space. Search on Bibsonomy FSTTCS The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
47Sudipto Guha, Andrew McGregor 0001, Suresh Venkatasubramanian Streaming and sublinear approximation of entropy and information distances. Search on Bibsonomy SODA The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
47Tatsuyuki Matsushita, Hideki Imai A Public-Key Black-Box Traitor Tracing Scheme with Sublinear Ciphertext Size Against Self-Defensive Pirates. Search on Bibsonomy ASIACRYPT The full citation details ... 2004 DBLP  DOI  BibTeX  RDF Public-key traitor tracing, Black-box tracing, Self-defensive pirates
47Marek Karpinski, Wojciech Rytter On a Sublinear Time Parallel Construction of Optimal Binary Search Trees. Search on Bibsonomy MFCS The full citation details ... 1994 DBLP  DOI  BibTeX  RDF
46Stefan S. Dantchev, Tom Friedetzky, Lars Nagel 0001 Sublinear-Time Algorithms for Tournament Graphs. Search on Bibsonomy COCOON The full citation details ... 2009 DBLP  DOI  BibTeX  RDF random walk, tournament, sublinear-time algorithms
46Tugkan Batu, Ravi Kumar 0001, Ronitt Rubinfeld Sublinear algorithms for testing monotone and unimodal distributions. Search on Bibsonomy STOC The full citation details ... 2004 DBLP  DOI  BibTeX  RDF monotone and unimodal distributions, property testing, distribution testing, sublinear algorithms
46Tugkan Batu, Funda Ergün, Joe Kilian, Avner Magen, Sofya Raskhodnikova, Ronitt Rubinfeld, Rahul Sami A sublinear algorithm for weakly approximating edit distance. Search on Bibsonomy STOC The full citation details ... 2003 DBLP  DOI  BibTeX  RDF approximation, string matching, sublinear algorithms
46Lefteris M. Kirousis, Paul G. Spirakis, Philippas Tsigas Reading Many Variables in One Atomic Operation: Solutions with Linear or Sublinear Complexity. Search on Bibsonomy IEEE Trans. Parallel Distributed Syst. The full citation details ... 1994 DBLP  DOI  BibTeX  RDF sublinear complexity, deterministic protocol, memory location, Archimedean time assumption, computational complexity, protocols, distributed algorithms, time complexity, probabilistic algorithm, linear complexity, space complexity, atomic operation
43Alexandr Andoni, Piotr Indyk, Krzysztof Onak, Ronitt Rubinfeld External Sampling. Search on Bibsonomy ICALP (1) The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
42Sharon Marko, Dana Ron Approximating the distance to properties in bounded-degree and general sparse graphs. Search on Bibsonomy ACM Trans. Algorithms The full citation details ... 2009 DBLP  DOI  BibTeX  RDF Sublinear approximation algorithms, property testing, graph properties, distance approximation
40Tugkan Batu, Lance Fortnow, Ronitt Rubinfeld, Warren D. Smith, Patrick White Testing that distributions are close. Search on Bibsonomy FOCS The full citation details ... 2000 DBLP  DOI  BibTeX  RDF distribution closeness testing, rapidly mixing process, computational complexity, lower bound, probability, probability, sampling, Markov processes, Markov process, sublinear algorithm, sublinear algorithms, sampling methods
40Paolo Ferragina, Giovanni Manzini Opportunistic Data Structures with Applications. Search on Bibsonomy FOCS The full citation details ... 2000 DBLP  DOI  BibTeX  RDF opportunistic data structures, data indexing, succinct suffix array, suffix tree data structures, suffix array data structures, Glimpse tool, sublinear query time complexity, sublinear space complexity, computational complexity, data structures, search, data compression, data compression, entropy, database theory, data set, database indexing, query performance
36Bin Fu, Zhiyu Zhao Separating Sublinear Time Computations by Approximate Diameter. Search on Bibsonomy COCOA The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
36Michael T. Goodrich, Jonathan Z. Sun Checking Value-Sensitive Data Structures in Sublinear Space. Search on Bibsonomy ISAAC The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
36Vassil S. Dimitrov, Laurent Imbert, Andrew Zakaluzny Multiplication by a Constant is Sublinear. Search on Bibsonomy IEEE Symposium on Computer Arithmetic The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
36Sofya Raskhodnikova, Dana Ron, Ronitt Rubinfeld, Adam D. Smith Sublinear Algorithms for Approximating String Compressibility. Search on Bibsonomy APPROX-RANDOM The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
36Bin Fu, Zhixiang Chen 0001 Sublinear Time Width-Bounded Separators and Their Application to the Protein Side-Chain Packing Problem. Search on Bibsonomy AAIM The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
36Petra Berenbrink, Funda Ergün, Tom Friedetzky Finding Frequent Patterns in a String in Sublinear Time. Search on Bibsonomy ESA The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
36Zhixiang Chen 0001, Richard H. Fowler, Ada Wai-Chee Fu, Chunyue Wang Linear and Sublinear Time Algorithms for Mining Frequent Traversal Path Patterns from Very Large Web Logs. Search on Bibsonomy IDEAS The full citation details ... 2003 DBLP  DOI  BibTeX  RDF
35Artur Czumaj, Christian Sohler Estimating the weight of metric minimum spanning trees in sublinear-time. Search on Bibsonomy STOC The full citation details ... 2004 DBLP  DOI  BibTeX  RDF approximations algorithms, randomized algorithms, minimum spanning tree, sublinear-time algorithms
35William I. Chang, Eugene L. Lawler Approximate String Matching in Sublinear Expected Time Search on Bibsonomy FOCS The full citation details ... 1990 DBLP  DOI  BibTeX  RDF random string, infrequent errors, sublinear expected time, pattern string, substring matching, dynamic programming, efficient algorithms, genetics, insertions, approximate string matching, deletions, substitutions, differences, molecular biology, text string
35Andrew V. Goldberg, Serge A. Plotkin, Pravin M. Vaidya Sublinear-Time Parallel Algorithms for Matching and Related Problems Search on Bibsonomy FOCS The full citation details ... 1988 DBLP  DOI  BibTeX  RDF sublinear-time parallel algorithms, maximal node-disjoint paths, zero-one networks, matching, depth-first search, node-disjoint paths, combinatorial structure
33Timothy M. Chan, Mihai Patrascu, Liam Roditty Dynamic Connectivity: Connecting to Networks and Geometry. Search on Bibsonomy FOCS The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
33Bilel Derbel Local Maps: New Insights into Mobile Agent Algorithms. Search on Bibsonomy DISC The full citation details ... 2008 DBLP  DOI  BibTeX  RDF local maps, Mobile agents, time complexity
33Vassil S. Dimitrov, Kimmo U. Järvinen, Michael J. Jacobson Jr., W. F. Chan, Zhun Huang FPGA Implementation of Point Multiplication on Koblitz Curves Using Kleinian Integers. Search on Bibsonomy CHES The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
33Morteza Fayyazi, David R. Kaeli, Waleed Meleis Parallel Maximum Weight Bipartite Matching Algorithms for Scheduling in Input-Queued Switches. Search on Bibsonomy IPDPS The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
31Sándor P. Fekete, Dietmar Fey, Marcus Komann, Alexander Kröller, Marc Reichenbach, Christiane Schmidt 0001 Distributed vision with smart pixels. Search on Bibsonomy SCG The full citation details ... 2009 DBLP  DOI  BibTeX  RDF distributed vision, sweepline algorithms, distributed algorithms, principle component analysis, sublinear algorithms
31Joan Feigenbaum, Yuval Ishai, Tal Malkin, Kobbi Nissim, Martin J. Strauss, Rebecca N. Wright Secure multiparty computation of approximations. Search on Bibsonomy ACM Trans. Algorithms The full citation details ... 2006 DBLP  DOI  BibTeX  RDF distributed data processing, sublinear communication, Privacy
29Kyohei Chiba, Hiro Ito Sublinear Computation Paradigm: Constant-Time Algorithms and Sublinear Progressive Algorithms. Search on Bibsonomy IEICE Trans. Fundam. Electron. Commun. Comput. Sci. The full citation details ... 2022 DBLP  DOI  BibTeX  RDF
25Omar U. Florez, Alexander Ocsa, Curtis E. Dyreson Sublinear querying of realistic timeseries and its application to human motion. Search on Bibsonomy Multimedia Information Retrieval The full citation details ... 2010 DBLP  DOI  BibTeX  RDF scalable indexing, search and structuring, human motion
25Jakub Pawlewicz, Mihai Patrascu Order Statistics in the Farey Sequences in Sublinear Time and Counting Primitive Lattice Points in Polygons. Search on Bibsonomy Algorithmica The full citation details ... 2009 DBLP  DOI  BibTeX  RDF Möbius inversion, Mertens function, Primitive lattice points, Farey sequence
25MoonShik Lee, Daegun Ma, MinJae Seo Breaking Two k-Resilient Traitor Tracing Schemes with Sublinear Ciphertext Size. Search on Bibsonomy ACNS The full citation details ... 2009 DBLP  DOI  BibTeX  RDF public-key traitor tracing, black-box tracing, self-defensive pirates, linear attack, cryptanalysis
25Aggelos Kiayias, Serdar Pehlivanoglu On the security of a public-key traitor tracing scheme with sublinear ciphertext size. Search on Bibsonomy Digital Rights Management Workshop The full citation details ... 2009 DBLP  DOI  BibTeX  RDF blackbox tracing, public key cryptosystem, traitor tracing
25Bin Fu, Zhixiang Chen 0001 A Sublinear Time Randomized Algorithm for Coset Enumeration in the Black Box Model. Search on Bibsonomy COCOON The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
25Mehmet Akçakaya, Vahid Tarokh Noisy compressive sampling limits in linear and sublinear regimes. Search on Bibsonomy CISS The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
25Mark A. Iwen, Craig V. Spencer Improved bounds for a deterministic sublinear-time Sparse Fourier Algorithm. Search on Bibsonomy CISS The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
25Jakub Pawlewicz Order Statistics in the Farey Sequences in Sublinear Time. Search on Bibsonomy ESA The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
25Mikkel Thorup, Uri Zwick Spanners and emulators with sublinear distance errors. Search on Bibsonomy SODA The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
25Nicholas D. Pattengale, Bernard M. E. Moret A Sublinear-Time Randomized Approximation Scheme for the Robinson-Foulds Metric. Search on Bibsonomy RECOMB The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
25Leena Salmela, Jorma Tarhio Sublinear Algorithms for Parameterized Matching. Search on Bibsonomy CPM The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
25Javier Peña 0001 On the block-structured distance to non-surjectivity of sublinear mappings. Search on Bibsonomy Math. Program. The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
25Mihai Badoiu, Artur Czumaj, Piotr Indyk, Christian Sohler Facility Location in Sublinear Time. Search on Bibsonomy ICALP The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
25Artur Czumaj, Christian Sohler Sublinear-Time Approximation for Clustering Via Random Sampling. Search on Bibsonomy ICALP The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
25Bernard Chazelle Sublinear Computing. Search on Bibsonomy ESA The full citation details ... 2003 DBLP  DOI  BibTeX  RDF
25Kurt Mehlhorn, Ulrich Meyer 0001 External-Memory Breadth-First Search with Sublinear I/O. Search on Bibsonomy ESA The full citation details ... 2002 DBLP  DOI  BibTeX  RDF
25Klaus Wich Sublinear Ambiguity. Search on Bibsonomy MFCS The full citation details ... 2000 DBLP  DOI  BibTeX  RDF
25Oded Goldreich 0001, Dana Ron A Sublinear Bipartiteness Tester for Bounded Degree Graphs. Search on Bibsonomy Comb. The full citation details ... 1999 DBLP  DOI  BibTeX  RDF AMS Subject Classification (1991) Classes: 68Q25, 68R10
25Lefteris M. Kirousis, Paul G. Spirakis, Philippas Tsigas Reading Many Variables in One Atomic Operation: Solutions With Linear or Sublinear Complexity. Search on Bibsonomy WDAG The full citation details ... 1991 DBLP  DOI  BibTeX  RDF
25Svante Carlsson, Christos Levcopoulos, Ola Petersson Sublinear Merging and Natural Merge Sort. Search on Bibsonomy SIGAL International Symposium on Algorithms The full citation details ... 1990 DBLP  DOI  BibTeX  RDF
22Hossein Maserrat, Jian Pei Neighbor query friendly compression of social networks. Search on Bibsonomy KDD The full citation details ... 2010 DBLP  DOI  BibTeX  RDF MPk linearization, social networks, compression
22Atish Das Sarma, Danupon Nanongkai, Gopal Pandurangan, Prasad Tetali Efficient distributed random walks with applications. Search on Bibsonomy PODC The full citation details ... 2010 DBLP  DOI  BibTeX  RDF decentralized computation, random spanning tree, distributed algorithms, random walks, random sampling, mixing time
22Moni Naor, Guy N. Rothblum The complexity of online memory checking. Search on Bibsonomy J. ACM The full citation details ... 2009 DBLP  DOI  BibTeX  RDF Memory checking, authentication
22Chandra Chekuri, Sanjeev Khanna Edge-disjoint paths revisited. Search on Bibsonomy ACM Trans. Algorithms The full citation details ... 2007 DBLP  DOI  BibTeX  RDF multicommodity flow relaxation, approximation algorithm, greedy algorithm, Edge-disjoint paths
22Lizhong Zheng, David N. C. Tse, Muriel Médard Channel Coherence in the Low-SNR Regime. Search on Bibsonomy IEEE Trans. Inf. Theory The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
22Ke Liu 0010, Akbar M. Sayeed Type-Based Decentralized Detection in Wireless Sensor Networks. Search on Bibsonomy IEEE Trans. Signal Process. The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
22Robert Fitch, Zack J. Butler Scalable Locomotion for Large Self-Reconfiguring Robots. Search on Bibsonomy ICRA The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
22Bernard Chazelle Ushering in a New Era of Algorithm Design. Search on Bibsonomy ICALP The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
22Artur Czumaj, Christian Sohler Small Space Representations for Metric Min-Sum k -Clustering and Their Applications. Search on Bibsonomy STACS The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
22János Csirik, David S. Johnson, Claire Kenyon, James B. Orlin, Peter W. Shor, Richard R. Weber On the Sum-of-Squares algorithm for bin packing. Search on Bibsonomy J. ACM The full citation details ... 2006 DBLP  DOI  BibTeX  RDF Approximation algorithms, bin packing, average case analysis
22Bilel Derbel, Mohamed Mosbah 0001, Akka Zemmari Fast distributed graph partition and application. Search on Bibsonomy IPDPS The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
22Srikanta Tirthapura, Sudip Seal, Srinivas Aluru A Formal Analysis of Space Filling Curves for Parallel Domain Decomposition. Search on Bibsonomy ICPP The full citation details ... 2006 DBLP  DOI  BibTeX  RDF parallel algorithms, probabilistic analysis, domain decomposition, space filling curves
22Oded Goldreich 0001, Dana Ron Approximating Average Parameters of Graphs. Search on Bibsonomy APPROX-RANDOM The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
22Mikhail V. Solodov Convergence rate analysis of iteractive algorithms for solving variational inequality problems. Search on Bibsonomy Math. Program. The full citation details ... 2003 DBLP  DOI  BibTeX  RDF
22Michael Elkin, David Peleg Approximating k-Spanner Problems for k>2. Search on Bibsonomy IPCO The full citation details ... 2001 DBLP  DOI  BibTeX  RDF
22Ran Canetti, Yuval Ishai, Ravi Kumar 0001, Michael K. Reiter, Ronitt Rubinfeld, Rebecca N. Wright Selective private function evaluation with applications to private statistics. Search on Bibsonomy PODC The full citation details ... 2001 DBLP  DOI  BibTeX  RDF
22Rahul Santhanam On Separators, Segregators and Time versus Space. Search on Bibsonomy CCC The full citation details ... 2001 DBLP  DOI  BibTeX  RDF
22Gianfranco Bilardi, Kattamuri Ekanadham, Pratap Pattnaik Computational power of pipelined memory hierarchies. Search on Bibsonomy SPAA The full citation details ... 2001 DBLP  DOI  BibTeX  RDF
22Ulrich Meyer 0001, Peter Sanders 0001 Parallel Shortest Path for Arbitrary Graphs. Search on Bibsonomy Euro-Par The full citation details ... 2000 DBLP  DOI  BibTeX  RDF
22Lenore Cowen, Christopher G. Wagner Compact roundtrip routing in directed networks (extended abstract). Search on Bibsonomy PODC The full citation details ... 2000 DBLP  DOI  BibTeX  RDF
22Gonzalo Navarro 0001, Ricardo A. Baeza-Yates Fast Multi-dimensional Approximate Pattern Matching. Search on Bibsonomy CPM The full citation details ... 1999 DBLP  DOI  BibTeX  RDF
22Rusins Freivalds, Marek Karpinski Lower Time Bounds for Randomized Computation. Search on Bibsonomy ICALP The full citation details ... 1995 DBLP  DOI  BibTeX  RDF
22Nick D. Dendris, Lefteris M. Kirousis, Yannis C. Stamatiou, Dimitrios M. Thilikos Partiality and Approximation Schemes for Local Consistency in Networks of Constraints. Search on Bibsonomy FSTTCS The full citation details ... 1995 DBLP  DOI  BibTeX  RDF
22John Turek, Walter Ludwig, Joel L. Wolf, Lisa Fleischer, Prasoon Tiwari, Jason Glasgow, Uwe Schwiegelshohn, Philip S. Yu Scheduling Parallelizable Tasks to Minimize Average Response Time. Search on Bibsonomy SPAA The full citation details ... 1994 DBLP  DOI  BibTeX  RDF
22Lane A. Hemachandra, Albrecht Hoene Collapsing Degrees via Strong Computation (Extended Abstract). Search on Bibsonomy ICALP The full citation details ... 1991 DBLP  DOI  BibTeX  RDF
22V. Nageshwara Rao, Vipin Kumar 0001 Superlinear Speedup in Parallel State-Space Search. Search on Bibsonomy FSTTCS The full citation details ... 1988 DBLP  DOI  BibTeX  RDF
20Swastik Kopparty, Shubhangi Saraf Local list-decoding and testing of random linear codes from high error. Search on Bibsonomy STOC The full citation details ... 2010 DBLP  DOI  BibTeX  RDF dual-BCH codes, noisy parity, random codes, property testing, list-decoding, sublinear-time algorithms
20Anna C. Gilbert, Yi Li 0002, Ely Porat, Martin J. Strauss Approximate sparse recovery: optimizing time and measurements. Search on Bibsonomy STOC The full citation details ... 2010 DBLP  DOI  BibTeX  RDF approximation, embedding, sketching, sublinear algorithms, sparse approximation
20Nir Ailon, Bernard Chazelle, Seshadhri Comandur, Ding Liu Property-Preserving Data Reconstruction. Search on Bibsonomy Algorithmica The full citation details ... 2008 DBLP  DOI  BibTeX  RDF Monotonicity testing, Sublinear algorithms
20Tali Kaufman, Madhu Sudan 0001 Algebraic property testing: the role of invariance. Search on Bibsonomy STOC The full citation details ... 2008 DBLP  DOI  BibTeX  RDF error-correcting codes, locally testable codes, sublinear time algorithms
20Irit Dinur, Elena Grigorescu, Swastik Kopparty, Madhu Sudan 0001 Decodability of group homomorphisms beyond the johnson bound. Search on Bibsonomy STOC The full citation details ... 2008 DBLP  DOI  BibTeX  RDF hadamard codes, list decoding, sublinear time algorithms
20Elena Grigorescu, Tali Kaufman, Madhu Sudan 0001 2-Transitivity Is Insufficient for Local Testability. Search on Bibsonomy CCC The full citation details ... 2008 DBLP  DOI  BibTeX  RDF error correcting codes, property testing, sublinear time algorithms
Displaying result #1 - #100 of 1265 (100 per page; Change: )
Pages: [1][2][3][4][5][6][7][8][9][10][>>]
Valid XHTML 1.1! Valid CSS! [Valid RSS]
Maintained by L3S.
Previously maintained by Jörg Diederich.
Based upon DBLP by Michael Ley.
open data data released under the ODC-BY 1.0 license