|
|
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 |
67 | Ray Maleh, Anna C. Gilbert |
Sublinear Recovery of Sparse Wavelet Signals. ![Search on Bibsonomy](Pics/bibsonomy.png) |
DCC ![In: 2008 Data Compression Conference (DCC 2008), 25-27 March 2008, Snowbird, UT, USA, pp. 342-351, 2008, IEEE Computer Society, 978-0-7695-3121-2. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
sublinear recovery, Haar, Reed Muller, wavelets, sketch, sparse |
63 | Artur Czumaj, S. Muthukrishnan 0001, Ronitt Rubinfeld, Christian Sohler |
08341 Executive Summary - Sublinear Algorithms. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Sublinear Algorithms ![In: Sublinear Algorithms, 17.08. - 22.08.2008, 2008, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, Germany. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP BibTeX RDF |
|
63 | Artur Czumaj, S. Muthu Muthukrishnan, Ronitt Rubinfeld, Christian Sohler |
08341 Abstracts Collection - Sublinear Algorithms. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Sublinear Algorithms ![In: Sublinear Algorithms, 17.08. - 22.08.2008, 2008, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, Germany. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP BibTeX RDF |
|
63 | Bernard Chazelle, Ding Liu, Avner Magen |
Sublinear Geometric Algorithms. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Sublinear Algorithms ![In: Sublinear Algorithms, 17.07. - 22.07.2005, 2005, Internationales Begegnungs- und Forschungszentrum für Informatik (IBFI), Schloss Dagstuhl, Germany. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP BibTeX RDF |
|
63 | Artur Czumaj, S. Muthu Muthukrishnan, Ronitt Rubinfeld, Christian Sohler |
05291 Abstracts Collection -- Sublinear Algorithms. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Sublinear Algorithms ![In: Sublinear Algorithms, 17.07. - 22.07.2005, 2005, Internationales Begegnungs- und Forschungszentrum für Informatik (IBFI), Schloss Dagstuhl, Germany. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP BibTeX RDF |
|
58 | Funda Ergün, S. Muthukrishnan 0001, Süleyman Cenk Sahinalp |
Sublinear Methods for Detecting Periodic Trends in Data Streams. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LATIN ![In: LATIN 2004: Theoretical Informatics, 6th Latin American Symposium, Buenos Aires, Argentina, April 5-8, 2004, Proceedings, pp. 16-28, 2004, Springer, 3-540-21258-2. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
58 | Lawrence L. Larmore, Wojciech Rytter |
Efficient Sublinear Time Parallel Algorithms for Dynamic Programming and Context-Free Recognition. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: STACS 92, 9th Annual Symposium on Theoretical Aspects of Computer Science, Cachan, France, February 13-15, 1992, Proceedings, pp. 121-132, 1992, Springer, 3-540-55210-3. The full citation details ...](Pics/full.jpeg) |
1992 |
DBLP DOI BibTeX RDF |
|
56 | Vaithilingam Jeyakumar, Guoyin Li 0001 |
Farkas' lemma for separable sublinear inequalities without qualifications. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Optim. Lett. ![In: Optim. Lett. 3(4), pp. 537-545, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
Generalized Farkas’ lemma, Separable sublinear inequalities, Robust linear programming, Duality, Optimality conditions |
56 | Bin Fu, Zhixiang Chen 0001 |
Sublinear time width-bounded separators and their application to the protein side-chain packing problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Comb. Optim. ![In: J. Comb. Optim. 15(4), pp. 387-407, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
Width-bounded separator, Random sampling, Sublinear time algorithm |
56 | Bernard Chazelle, Ding Liu, Avner Magen |
Sublinear geometric algorithms. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STOC ![In: Proceedings of the 35th Annual ACM Symposium on Theory of Computing, June 9-11, 2003, San Diego, CA, USA, pp. 531-540, 2003, ACM, 1-58113-674-9. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
approximate shortest paths, polyhedral intersection, sublinear algorithms |
55 | Paolo Ferragina, Roberto Grossi |
Optimal On-Line Search and Sublinear Time Update in String Matching. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 36th Annual Symposium on Foundations of Computer Science, Milwaukee, Wisconsin, USA, 23-25 October 1995, pp. 604-612, 1995, IEEE Computer Society, 0-8186-7183-1. The full citation details ...](Pics/full.jpeg) |
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 |
48 | Artur Czumaj, S. Muthu Muthukrishnan, Ronitt Rubinfeld, Christian Sohler (eds.) |
Sublinear Algorithms, 17.08. - 22.08.2008 ![Search on Bibsonomy](Pics/bibsonomy.png) |
Sublinear Algorithms ![Schloss Dagstuhl - Leibniz-Zentrum für Informatik, Germany The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP BibTeX RDF |
|
48 | Tali Kaufman, Simon Litsyn, Ning Xie 0002 |
Breaking the ε-Soundness Bound of the Linearity Test over GF(2). ![Search on Bibsonomy](Pics/bibsonomy.png) |
Sublinear Algorithms ![In: Sublinear Algorithms, 17.08. - 22.08.2008, 2008, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, Germany. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP BibTeX RDF |
|
48 | Sumit Ganguly |
Lower bound for estimating frequency for update data streams. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Sublinear Algorithms ![In: Sublinear Algorithms, 17.08. - 22.08.2008, 2008, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, Germany. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP BibTeX RDF |
|
48 | Artur Czumaj, S. Muthu Muthukrishnan, Ronitt Rubinfeld, Christian Sohler (eds.) |
Sublinear Algorithms, 17.07. - 22.07.2005 ![Search on Bibsonomy](Pics/bibsonomy.png) |
Sublinear Algorithms ![Internationales Begegnungs- und Forschungszentrum für Informatik (IBFI), Schloss Dagstuhl, Germany The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP BibTeX RDF |
|
48 | Oded Goldreich 0001 |
Contemplations on Testing Graph Properties. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Sublinear Algorithms ![In: Sublinear Algorithms, 17.07. - 22.07.2005, 2005, Internationales Begegnungs- und Forschungszentrum für Informatik (IBFI), Schloss Dagstuhl, Germany. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP BibTeX RDF |
|
48 | Oded Goldreich 0001, Dana Ron |
Approximating Average Parameters of Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Sublinear Algorithms ![In: Sublinear Algorithms, 17.07. - 22.07.2005, 2005, Internationales Begegnungs- und Forschungszentrum für Informatik (IBFI), Schloss Dagstuhl, Germany. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP BibTeX RDF |
|
47 | Vassil 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](Pics/bibsonomy.png) |
IEEE Trans. Computers ![In: IEEE Trans. Computers 57(11), pp. 1469-1481, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
47 | Satyen Kale, Yuval Peres, C. Seshadhri 0001 |
Noise Tolerance of Expanders and Sublinear Expander Reconstruction. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 49th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2008, October 25-28, 2008, Philadelphia, PA, USA, pp. 719-728, 2008, IEEE Computer Society, 978-0-7695-3436-7. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
47 | Jesper Jansson 0001, Kunihiko Sadakane, Wing-Kin Sung |
Compressed Dynamic Tries with Applications to LZ-Compression in Sublinear Time and Space. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FSTTCS ![In: FSTTCS 2007: Foundations of Software Technology and Theoretical Computer Science, 27th International Conference, New Delhi, India, December 12-14, 2007, Proceedings, pp. 424-435, 2007, Springer, 978-3-540-77049-7. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
47 | Sudipto Guha, Andrew McGregor 0001, Suresh Venkatasubramanian |
Streaming and sublinear approximation of entropy and information distances. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SODA ![In: Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2006, Miami, Florida, USA, January 22-26, 2006, pp. 733-742, 2006, ACM Press, 0-89871-605-5. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
47 | Tatsuyuki Matsushita, Hideki Imai |
A Public-Key Black-Box Traitor Tracing Scheme with Sublinear Ciphertext Size Against Self-Defensive Pirates. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ASIACRYPT ![In: Advances in Cryptology - ASIACRYPT 2004, 10th International Conference on the Theory and Application of Cryptology and Information Security, Jeju Island, Korea, December 5-9, 2004, Proceedings, pp. 260-275, 2004, Springer, 3-540-23975-8. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
Public-key traitor tracing, Black-box tracing, Self-defensive pirates |
47 | Marek Karpinski, Wojciech Rytter |
On a Sublinear Time Parallel Construction of Optimal Binary Search Trees. ![Search on Bibsonomy](Pics/bibsonomy.png) |
MFCS ![In: Mathematical Foundations of Computer Science 1994, 19th International Symposium, MFCS'94, Kosice, Slovakia, August 22 - 26, 1994, Proceedings, pp. 453-461, 1994, Springer, 3-540-58338-6. The full citation details ...](Pics/full.jpeg) |
1994 |
DBLP DOI BibTeX RDF |
|
46 | Stefan S. Dantchev, Tom Friedetzky, Lars Nagel 0001 |
Sublinear-Time Algorithms for Tournament Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
COCOON ![In: Computing and Combinatorics, 15th Annual International Conference, COCOON 2009, Niagara Falls, NY, USA, July 13-15, 2009, Proceedings, pp. 459-471, 2009, Springer, 978-3-642-02881-6. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
random walk, tournament, sublinear-time algorithms |
46 | Tugkan Batu, Ravi Kumar 0001, Ronitt Rubinfeld |
Sublinear algorithms for testing monotone and unimodal distributions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STOC ![In: Proceedings of the 36th Annual ACM Symposium on Theory of Computing, Chicago, IL, USA, June 13-16, 2004, pp. 381-390, 2004, ACM, 1-58113-852-0. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
monotone and unimodal distributions, property testing, distribution testing, sublinear algorithms |
46 | Tugkan 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](Pics/bibsonomy.png) |
STOC ![In: Proceedings of the 35th Annual ACM Symposium on Theory of Computing, June 9-11, 2003, San Diego, CA, USA, pp. 316-324, 2003, ACM, 1-58113-674-9. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
approximation, string matching, sublinear algorithms |
46 | Lefteris M. Kirousis, Paul G. Spirakis, Philippas Tsigas |
Reading Many Variables in One Atomic Operation: Solutions with Linear or Sublinear Complexity. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Parallel Distributed Syst. ![In: IEEE Trans. Parallel Distributed Syst. 5(7), pp. 688-696, 1994. The full citation details ...](Pics/full.jpeg) |
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 |
43 | Alexandr Andoni, Piotr Indyk, Krzysztof Onak, Ronitt Rubinfeld |
External Sampling. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP (1) ![In: Automata, Languages and Programming, 36th International Colloquium, ICALP 2009, Rhodes, Greece, July 5-12, 2009, Proceedings, Part I, pp. 83-94, 2009, Springer, 978-3-642-02926-4. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
42 | Sharon Marko, Dana Ron |
Approximating the distance to properties in bounded-degree and general sparse graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Trans. Algorithms ![In: ACM Trans. Algorithms 5(2), pp. 22:1-22:28, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
Sublinear approximation algorithms, property testing, graph properties, distance approximation |
40 | Tugkan Batu, Lance Fortnow, Ronitt Rubinfeld, Warren D. Smith, Patrick White |
Testing that distributions are close. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 41st Annual Symposium on Foundations of Computer Science, FOCS 2000, 12-14 November 2000, Redondo Beach, California, USA, pp. 259-269, 2000, IEEE Computer Society, 0-7695-0850-2. The full citation details ...](Pics/full.jpeg) |
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 |
40 | Paolo Ferragina, Giovanni Manzini |
Opportunistic Data Structures with Applications. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 41st Annual Symposium on Foundations of Computer Science, FOCS 2000, 12-14 November 2000, Redondo Beach, California, USA, pp. 390-398, 2000, IEEE Computer Society, 0-7695-0850-2. The full citation details ...](Pics/full.jpeg) |
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 |
36 | Bin Fu, Zhiyu Zhao |
Separating Sublinear Time Computations by Approximate Diameter. ![Search on Bibsonomy](Pics/bibsonomy.png) |
COCOA ![In: Combinatorial Optimization and Applications, Second International Conference, COCOA 2008, St. John's, NL, Canada, August 21-24, 2008. Proceedings, pp. 79-88, 2008, Springer, 978-3-540-85096-0. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
36 | Michael T. Goodrich, Jonathan Z. Sun |
Checking Value-Sensitive Data Structures in Sublinear Space. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: Algorithms and Computation, 18th International Symposium, ISAAC 2007, Sendai, Japan, December 17-19, 2007, Proceedings, pp. 353-364, 2007, Springer, 978-3-540-77118-0. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
36 | Vassil S. Dimitrov, Laurent Imbert, Andrew Zakaluzny |
Multiplication by a Constant is Sublinear. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Symposium on Computer Arithmetic ![In: 18th IEEE Symposium on Computer Arithmetic (ARITH-18 2007), 25-27 June 2007, Montpellier, France, pp. 261-268, 2007, IEEE Computer Society, 0-7695-2854-6. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
36 | Sofya Raskhodnikova, Dana Ron, Ronitt Rubinfeld, Adam D. Smith |
Sublinear Algorithms for Approximating String Compressibility. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX-RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, 10th International Workshop, APPROX 2007, and 11th International Workshop, RANDOM 2007, Princeton, NJ, USA, August 20-22, 2007, Proceedings, pp. 609-623, 2007, Springer, 978-3-540-74207-4. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
36 | Bin Fu, Zhixiang Chen 0001 |
Sublinear Time Width-Bounded Separators and Their Application to the Protein Side-Chain Packing Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
AAIM ![In: Algorithmic Aspects in Information and Management, Second International Conference, AAIM 2006, Hong Kong, China, June 20-22, 2006, Proceedings, pp. 149-160, 2006, Springer, 3-540-35157-4. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
36 | Petra Berenbrink, Funda Ergün, Tom Friedetzky |
Finding Frequent Patterns in a String in Sublinear Time. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ESA ![In: Algorithms - ESA 2005, 13th Annual European Symposium, Palma de Mallorca, Spain, October 3-6, 2005, Proceedings, pp. 746-757, 2005, Springer, 3-540-29118-0. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
36 | Zhixiang 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](Pics/bibsonomy.png) |
IDEAS ![In: 7th International Database Engineering and Applications Symposium (IDEAS 2003), 16-18 July 2003, Hong Kong, China, pp. 117-122, 2003, IEEE Computer Society, 0-7695-1981-4. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
35 | Artur Czumaj, Christian Sohler |
Estimating the weight of metric minimum spanning trees in sublinear-time. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STOC ![In: Proceedings of the 36th Annual ACM Symposium on Theory of Computing, Chicago, IL, USA, June 13-16, 2004, pp. 175-183, 2004, ACM, 1-58113-852-0. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
approximations algorithms, randomized algorithms, minimum spanning tree, sublinear-time algorithms |
35 | William I. Chang, Eugene L. Lawler |
Approximate String Matching in Sublinear Expected Time ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 31st Annual Symposium on Foundations of Computer Science, St. Louis, Missouri, USA, October 22-24, 1990, Volume I, pp. 116-124, 1990, IEEE Computer Society, 0-8186-2082-X. The full citation details ...](Pics/full.jpeg) |
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 |
35 | Andrew V. Goldberg, Serge A. Plotkin, Pravin M. Vaidya |
Sublinear-Time Parallel Algorithms for Matching and Related Problems ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 29th Annual Symposium on Foundations of Computer Science, White Plains, New York, USA, 24-26 October 1988, pp. 174-185, 1988, IEEE Computer Society, 0-8186-0877-3. The full citation details ...](Pics/full.jpeg) |
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 |
33 | Timothy M. Chan, Mihai Patrascu, Liam Roditty |
Dynamic Connectivity: Connecting to Networks and Geometry. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 49th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2008, October 25-28, 2008, Philadelphia, PA, USA, pp. 95-104, 2008, IEEE Computer Society, 978-0-7695-3436-7. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
33 | Bilel Derbel |
Local Maps: New Insights into Mobile Agent Algorithms. ![Search on Bibsonomy](Pics/bibsonomy.png) |
DISC ![In: Distributed Computing, 22nd International Symposium, DISC 2008, Arcachon, France, September 22-24, 2008. Proceedings, pp. 121-136, 2008, Springer, 978-3-540-87778-3. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
local maps, Mobile agents, time complexity |
33 | Vassil 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](Pics/bibsonomy.png) |
CHES ![In: Cryptographic Hardware and Embedded Systems - CHES 2006, 8th International Workshop, Yokohama, Japan, October 10-13, 2006, Proceedings, pp. 445-459, 2006, Springer, 3-540-46559-6. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
33 | Morteza Fayyazi, David R. Kaeli, Waleed Meleis |
Parallel Maximum Weight Bipartite Matching Algorithms for Scheduling in Input-Queued Switches. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IPDPS ![In: 18th International Parallel and Distributed Processing Symposium (IPDPS 2004), CD-ROM / Abstracts Proceedings, 26-30 April 2004, Santa Fe, New Mexico, USA, 2004, IEEE Computer Society, 0-7695-2132-0. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
31 | Sándor P. Fekete, Dietmar Fey, Marcus Komann, Alexander Kröller, Marc Reichenbach, Christiane Schmidt 0001 |
Distributed vision with smart pixels. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SCG ![In: Proceedings of the 25th ACM Symposium on Computational Geometry, Aarhus, Denmark, June 8-10, 2009, pp. 257-266, 2009, ACM, 978-1-60558-501-7. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
distributed vision, sweepline algorithms, distributed algorithms, principle component analysis, sublinear algorithms |
31 | Joan Feigenbaum, Yuval Ishai, Tal Malkin, Kobbi Nissim, Martin J. Strauss, Rebecca N. Wright |
Secure multiparty computation of approximations. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Trans. Algorithms ![In: ACM Trans. Algorithms 2(3), pp. 435-472, 2006. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
distributed data processing, sublinear communication, Privacy |
29 | Kyohei Chiba, Hiro Ito |
Sublinear Computation Paradigm: Constant-Time Algorithms and Sublinear Progressive Algorithms. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEICE Trans. Fundam. Electron. Commun. Comput. Sci. ![In: IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 105-A(3), pp. 131-141, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
25 | Omar U. Florez, Alexander Ocsa, Curtis E. Dyreson |
Sublinear querying of realistic timeseries and its application to human motion. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Multimedia Information Retrieval ![In: Proceedings of the 11th ACM SIGMM International Conference on Multimedia Information Retrieval, MIR 2010, Philadelphia, Pennsylvania, USA, March 29-31, 2010, pp. 137-146, 2010, ACM, 978-1-60558-815-5. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
scalable indexing, search and structuring, human motion |
25 | Jakub Pawlewicz, Mihai Patrascu |
Order Statistics in the Farey Sequences in Sublinear Time and Counting Primitive Lattice Points in Polygons. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 55(2), pp. 271-282, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
Möbius inversion, Mertens function, Primitive lattice points, Farey sequence |
25 | MoonShik Lee, Daegun Ma, MinJae Seo |
Breaking Two k-Resilient Traitor Tracing Schemes with Sublinear Ciphertext Size. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACNS ![In: Applied Cryptography and Network Security, 7th International Conference, ACNS 2009, Paris-Rocquencourt, France, June 2-5, 2009. Proceedings, pp. 238-252, 2009, 978-3-642-01956-2. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
public-key traitor tracing, black-box tracing, self-defensive pirates, linear attack, cryptanalysis |
25 | Aggelos Kiayias, Serdar Pehlivanoglu |
On the security of a public-key traitor tracing scheme with sublinear ciphertext size. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Digital Rights Management Workshop ![In: Proceedings of the 9th ACM Workshop on Digital Rights Management, Chicago, Illinois, USA, November 9, 2009, pp. 1-10, 2009, ACM, 978-1-60558-779-0. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
blackbox tracing, public key cryptosystem, traitor tracing |
25 | Bin Fu, Zhixiang Chen 0001 |
A Sublinear Time Randomized Algorithm for Coset Enumeration in the Black Box Model. ![Search on Bibsonomy](Pics/bibsonomy.png) |
COCOON ![In: Computing and Combinatorics, 14th Annual International Conference, COCOON 2008, Dalian, China, June 27-29, 2008, Proceedings, pp. 82-91, 2008, Springer, 978-3-540-69732-9. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
25 | Mehmet Akçakaya, Vahid Tarokh |
Noisy compressive sampling limits in linear and sublinear regimes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CISS ![In: 42nd Annual Conference on Information Sciences and Systems, CISS 2008, Princeton, NJ, USA, 19-21 March 2008, pp. 1-4, 2008, IEEE, 978-1-4244-2246-3. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
25 | Mark A. Iwen, Craig V. Spencer |
Improved bounds for a deterministic sublinear-time Sparse Fourier Algorithm. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CISS ![In: 42nd Annual Conference on Information Sciences and Systems, CISS 2008, Princeton, NJ, USA, 19-21 March 2008, pp. 458-463, 2008, IEEE, 978-1-4244-2246-3. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
25 | Jakub Pawlewicz |
Order Statistics in the Farey Sequences in Sublinear Time. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ESA ![In: Algorithms - ESA 2007, 15th Annual European Symposium, Eilat, Israel, October 8-10, 2007, Proceedings, pp. 218-229, 2007, Springer, 978-3-540-75519-7. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
25 | Mikkel Thorup, Uri Zwick |
Spanners and emulators with sublinear distance errors. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SODA ![In: Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2006, Miami, Florida, USA, January 22-26, 2006, pp. 802-809, 2006, ACM Press, 0-89871-605-5. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
25 | Nicholas D. Pattengale, Bernard M. E. Moret |
A Sublinear-Time Randomized Approximation Scheme for the Robinson-Foulds Metric. ![Search on Bibsonomy](Pics/bibsonomy.png) |
RECOMB ![In: Research in Computational Molecular Biology, 10th Annual International Conference, RECOMB 2006, Venice, Italy, April 2-5, 2006, Proceedings, pp. 221-230, 2006, Springer, 3-540-33295-2. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
25 | Leena Salmela, Jorma Tarhio |
Sublinear Algorithms for Parameterized Matching. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CPM ![In: Combinatorial Pattern Matching, 17th Annual Symposium, CPM 2006, Barcelona, Spain, July 5-7, 2006, Proceedings, pp. 354-364, 2006, Springer, 3-540-35455-7. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
25 | Javier Peña 0001 |
On the block-structured distance to non-surjectivity of sublinear mappings. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Math. Program. ![In: Math. Program. 103(3), pp. 561-573, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
25 | Mihai Badoiu, Artur Czumaj, Piotr Indyk, Christian Sohler |
Facility Location in Sublinear Time. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP ![In: Automata, Languages and Programming, 32nd International Colloquium, ICALP 2005, Lisbon, Portugal, July 11-15, 2005, Proceedings, pp. 866-877, 2005, Springer, 3-540-27580-0. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
25 | Artur Czumaj, Christian Sohler |
Sublinear-Time Approximation for Clustering Via Random Sampling. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP ![In: Automata, Languages and Programming: 31st International Colloquium, ICALP 2004, Turku, Finland, July 12-16, 2004. Proceedings, pp. 396-407, 2004, Springer, 3-540-22849-7. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
25 | Bernard Chazelle |
Sublinear Computing. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ESA ![In: Algorithms - ESA 2003, 11th Annual European Symposium, Budapest, Hungary, September 16-19, 2003, Proceedings, pp. 1, 2003, Springer, 3-540-20064-9. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
25 | Kurt Mehlhorn, Ulrich Meyer 0001 |
External-Memory Breadth-First Search with Sublinear I/O. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ESA ![In: Algorithms - ESA 2002, 10th Annual European Symposium, Rome, Italy, September 17-21, 2002, Proceedings, pp. 723-735, 2002, Springer, 3-540-44180-8. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
25 | Klaus Wich |
Sublinear Ambiguity. ![Search on Bibsonomy](Pics/bibsonomy.png) |
MFCS ![In: Mathematical Foundations of Computer Science 2000, 25th International Symposium, MFCS 2000, Bratislava, Slovakia, August 28 - September 1, 2000, Proceedings, pp. 690-698, 2000, Springer, 3-540-67901-4. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
|
25 | Oded Goldreich 0001, Dana Ron |
A Sublinear Bipartiteness Tester for Bounded Degree Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comb. ![In: Comb. 19(3), pp. 335-373, 1999. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
AMS Subject Classification (1991) Classes: 68Q25, 68R10 |
25 | Lefteris M. Kirousis, Paul G. Spirakis, Philippas Tsigas |
Reading Many Variables in One Atomic Operation: Solutions With Linear or Sublinear Complexity. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WDAG ![In: Distributed Algorithms, 5th International Workshop, WDAG '91, Delphi, Greece, October 7-9, 1991, Proceedings, pp. 229-241, 1991, Springer, 3-540-55236-7. The full citation details ...](Pics/full.jpeg) |
1991 |
DBLP DOI BibTeX RDF |
|
25 | Svante Carlsson, Christos Levcopoulos, Ola Petersson |
Sublinear Merging and Natural Merge Sort. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SIGAL International Symposium on Algorithms ![In: Algorithms, International Symposium SIGAL '90, Tokyo, Japan, August 16-18, 1990, Proceedings, pp. 251-260, 1990, Springer, 3-540-52921-7. The full citation details ...](Pics/full.jpeg) |
1990 |
DBLP DOI BibTeX RDF |
|
22 | Hossein Maserrat, Jian Pei |
Neighbor query friendly compression of social networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
KDD ![In: Proceedings of the 16th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, Washington, DC, USA, July 25-28, 2010, pp. 533-542, 2010, ACM, 978-1-4503-0055-1. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
MPk linearization, social networks, compression |
22 | Atish Das Sarma, Danupon Nanongkai, Gopal Pandurangan, Prasad Tetali |
Efficient distributed random walks with applications. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PODC ![In: Proceedings of the 29th Annual ACM Symposium on Principles of Distributed Computing, PODC 2010, Zurich, Switzerland, July 25-28, 2010, pp. 201-210, 2010, ACM, 978-1-60558-888-9. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
decentralized computation, random spanning tree, distributed algorithms, random walks, random sampling, mixing time |
22 | Moni Naor, Guy N. Rothblum |
The complexity of online memory checking. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. ACM ![In: J. ACM 56(1), pp. 2:1-2:46, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
Memory checking, authentication |
22 | Chandra Chekuri, Sanjeev Khanna |
Edge-disjoint paths revisited. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Trans. Algorithms ![In: ACM Trans. Algorithms 3(4), pp. 46, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
multicommodity flow relaxation, approximation algorithm, greedy algorithm, Edge-disjoint paths |
22 | Lizhong Zheng, David N. C. Tse, Muriel Médard |
Channel Coherence in the Low-SNR Regime. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Inf. Theory ![In: IEEE Trans. Inf. Theory 53(3), pp. 976-997, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
22 | Ke Liu 0010, Akbar M. Sayeed |
Type-Based Decentralized Detection in Wireless Sensor Networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Signal Process. ![In: IEEE Trans. Signal Process. 55(5-1), pp. 1899-1910, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
22 | Robert Fitch, Zack J. Butler |
Scalable Locomotion for Large Self-Reconfiguring Robots. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICRA ![In: 2007 IEEE International Conference on Robotics and Automation, ICRA 2007, 10-14 April 2007, Roma, Italy, pp. 2248-2253, 2007, IEEE. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
22 | Bernard Chazelle |
Ushering in a New Era of Algorithm Design. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP ![In: Automata, Languages and Programming, 34th International Colloquium, ICALP 2007, Wroclaw, Poland, July 9-13, 2007, Proceedings, pp. 1, 2007, Springer, 978-3-540-73419-2. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
22 | Artur Czumaj, Christian Sohler |
Small Space Representations for Metric Min-Sum k -Clustering and Their Applications. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: STACS 2007, 24th Annual Symposium on Theoretical Aspects of Computer Science, Aachen, Germany, February 22-24, 2007, Proceedings, pp. 536-548, 2007, Springer, 978-3-540-70917-6. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
22 | Já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](Pics/bibsonomy.png) |
J. ACM ![In: J. ACM 53(1), pp. 1-65, 2006. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
Approximation algorithms, bin packing, average case analysis |
22 | Bilel Derbel, Mohamed Mosbah 0001, Akka Zemmari |
Fast distributed graph partition and application. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IPDPS ![In: 20th International Parallel and Distributed Processing Symposium (IPDPS 2006), Proceedings, 25-29 April 2006, Rhodes Island, Greece, 2006, IEEE. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
22 | Srikanta Tirthapura, Sudip Seal, Srinivas Aluru |
A Formal Analysis of Space Filling Curves for Parallel Domain Decomposition. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICPP ![In: 2006 International Conference on Parallel Processing (ICPP 2006), 14-18 August 2006, Columbus, Ohio, USA, pp. 505-512, 2006, IEEE Computer Society, 0-7695-2636-5. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
parallel algorithms, probabilistic analysis, domain decomposition, space filling curves |
22 | Oded Goldreich 0001, Dana Ron |
Approximating Average Parameters of Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX-RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, 9th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2006 and 10th International Workshop on Randomization and Computation, RANDOM 2006, Barcelona, Spain, August 28-30 2006, Proceedings, pp. 363-374, 2006, Springer, 3-540-38044-2. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
22 | Mikhail V. Solodov |
Convergence rate analysis of iteractive algorithms for solving variational inequality problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Math. Program. ![In: Math. Program. 96(3), pp. 513-528, 2003. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
22 | Michael Elkin, David Peleg |
Approximating k-Spanner Problems for k>2. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IPCO ![In: Integer Programming and Combinatorial Optimization, 8th International IPCO Conference, Utrecht, The Netherlands, June 13-15, 2001, Proceedings, pp. 90-104, 2001, Springer, 3-540-42225-0. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
22 | Ran 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](Pics/bibsonomy.png) |
PODC ![In: Proceedings of the Twentieth Annual ACM Symposium on Principles of Distributed Computing, PODC 2001, Newport, Rhode Island, USA, August 26-29, 2001, pp. 293-304, 2001, ACM, 1-58113-383-9. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
22 | Rahul Santhanam |
On Separators, Segregators and Time versus Space. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: Proceedings of the 16th Annual IEEE Conference on Computational Complexity, Chicago, Illinois, USA, June 18-21, 2001, pp. 286-294, 2001, IEEE Computer Society, 0-7695-1053-1. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
22 | Gianfranco Bilardi, Kattamuri Ekanadham, Pratap Pattnaik |
Computational power of pipelined memory hierarchies. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SPAA ![In: Proceedings of the Thirteenth Annual ACM Symposium on Parallel Algorithms and Architectures, SPAA 2001, Heraklion, Crete Island, Greece, July 4-6, 2001, pp. 144-152, 2001, ACM, 1-58113-409-6. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
22 | Ulrich Meyer 0001, Peter Sanders 0001 |
Parallel Shortest Path for Arbitrary Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Euro-Par ![In: Euro-Par 2000, Parallel Processing, 6th International Euro-Par Conference, Munich, Germany, August 29 - September 1, 2000, Proceedings., pp. 461-470, 2000, Springer, 3-540-67956-1. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
|
22 | Lenore Cowen, Christopher G. Wagner |
Compact roundtrip routing in directed networks (extended abstract). ![Search on Bibsonomy](Pics/bibsonomy.png) |
PODC ![In: Proceedings of the Nineteenth Annual ACM Symposium on Principles of Distributed Computing, July 16-19, 2000, Portland, Oregon, USA., pp. 51-59, 2000, ACM, 1-58113-183-6. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
|
22 | Gonzalo Navarro 0001, Ricardo A. Baeza-Yates |
Fast Multi-dimensional Approximate Pattern Matching. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CPM ![In: Combinatorial Pattern Matching, 10th Annual Symposium, CPM 99, Warwick University, UK, July 22-24, 1999, Proceedings, pp. 243-257, 1999, Springer, 3-540-66278-2. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
|
22 | Rusins Freivalds, Marek Karpinski |
Lower Time Bounds for Randomized Computation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP ![In: Automata, Languages and Programming, 22nd International Colloquium, ICALP95, Szeged, Hungary, July 10-14, 1995, Proceedings, pp. 183-195, 1995, Springer, 3-540-60084-1. The full citation details ...](Pics/full.jpeg) |
1995 |
DBLP DOI BibTeX RDF |
|
22 | Nick 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](Pics/bibsonomy.png) |
FSTTCS ![In: Foundations of Software Technology and Theoretical Computer Science, 15th Conference, Bangalore, India, December 18-20, 1995, Proceedings, pp. 210-224, 1995, Springer, 3-540-60692-0. The full citation details ...](Pics/full.jpeg) |
1995 |
DBLP DOI BibTeX RDF |
|
22 | John 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](Pics/bibsonomy.png) |
SPAA ![In: Proceedings of the 6th Annual ACM Symposium on Parallel Algorithms and Architectures, SPAA '94, Cape May, New Jersey, USA, June 27-29, 1994, pp. 200-209, 1994, ACM, 0-89791-671-9. The full citation details ...](Pics/full.jpeg) |
1994 |
DBLP DOI BibTeX RDF |
|
22 | Lane A. Hemachandra, Albrecht Hoene |
Collapsing Degrees via Strong Computation (Extended Abstract). ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP ![In: Automata, Languages and Programming, 18th International Colloquium, ICALP91, Madrid, Spain, July 8-12, 1991, Proceedings, pp. 393-404, 1991, Springer, 3-540-54233-7. The full citation details ...](Pics/full.jpeg) |
1991 |
DBLP DOI BibTeX RDF |
|
22 | V. Nageshwara Rao, Vipin Kumar 0001 |
Superlinear Speedup in Parallel State-Space Search. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FSTTCS ![In: Foundations of Software Technology and Theoretical Computer Science, Eighth Conference, Pune, India, December 21-23, 1988, Proceedings, pp. 161-174, 1988, Springer, 3-540-50517-2. The full citation details ...](Pics/full.jpeg) |
1988 |
DBLP DOI BibTeX RDF |
|
20 | Swastik Kopparty, Shubhangi Saraf |
Local list-decoding and testing of random linear codes from high error. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STOC ![In: Proceedings of the 42nd ACM Symposium on Theory of Computing, STOC 2010, Cambridge, Massachusetts, USA, 5-8 June 2010, pp. 417-426, 2010, ACM, 978-1-4503-0050-6. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
dual-BCH codes, noisy parity, random codes, property testing, list-decoding, sublinear-time algorithms |
20 | Anna C. Gilbert, Yi Li 0002, Ely Porat, Martin J. Strauss |
Approximate sparse recovery: optimizing time and measurements. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STOC ![In: Proceedings of the 42nd ACM Symposium on Theory of Computing, STOC 2010, Cambridge, Massachusetts, USA, 5-8 June 2010, pp. 475-484, 2010, ACM, 978-1-4503-0050-6. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
approximation, embedding, sketching, sublinear algorithms, sparse approximation |
20 | Nir Ailon, Bernard Chazelle, Seshadhri Comandur, Ding Liu |
Property-Preserving Data Reconstruction. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 51(2), pp. 160-182, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
Monotonicity testing, Sublinear algorithms |
20 | Tali Kaufman, Madhu Sudan 0001 |
Algebraic property testing: the role of invariance. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STOC ![In: Proceedings of the 40th Annual ACM Symposium on Theory of Computing, Victoria, British Columbia, Canada, May 17-20, 2008, pp. 403-412, 2008, ACM, 978-1-60558-047-0. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
error-correcting codes, locally testable codes, sublinear time algorithms |
20 | Irit Dinur, Elena Grigorescu, Swastik Kopparty, Madhu Sudan 0001 |
Decodability of group homomorphisms beyond the johnson bound. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STOC ![In: Proceedings of the 40th Annual ACM Symposium on Theory of Computing, Victoria, British Columbia, Canada, May 17-20, 2008, pp. 275-284, 2008, ACM, 978-1-60558-047-0. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
hadamard codes, list decoding, sublinear time algorithms |
20 | Elena Grigorescu, Tali Kaufman, Madhu Sudan 0001 |
2-Transitivity Is Insufficient for Local Testability. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: Proceedings of the 23rd Annual IEEE Conference on Computational Complexity, CCC 2008, 23-26 June 2008, College Park, Maryland, USA, pp. 259-267, 2008, IEEE Computer Society, 978-0-7695-3169-4. The full citation details ...](Pics/full.jpeg) |
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][ >>] |
|