|
|
Venues (Conferences, Journals, ...)
|
|
GrowBag graphs for keyword ? (Num. hits/coverage)
Group by:
The graphs summarize 1953 occurrences of 1282 keywords
|
|
|
Results
Found 10495 publication records. Showing 10495 according to the selection in the facets
Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
34 | Haim Kaplan, Micha Sharir |
Randomized incremental constructions of three-dimensional convex hulls and planar voronoi diagrams, and approximate range counting. ![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. 484-493, 2006, ACM Press, 0-89871-605-5. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
34 | Sunil Arya, Theocharis Malamatos, David M. Mount |
Space-time tradeoffs for approximate spherical range counting. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SODA ![In: Proceedings of the Sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2005, Vancouver, British Columbia, Canada, January 23-25, 2005, pp. 535-544, 2005, SIAM, 0-89871-585-7. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP BibTeX RDF |
|
34 | Wei Wei 0040, Bart Selman |
A New Approach to Model Counting. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SAT ![In: Theory and Applications of Satisfiability Testing, 8th International Conference, SAT 2005, St. Andrews, UK, June 19-23, 2005, Proceedings, pp. 324-339, 2005, Springer, 3-540-26276-8. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
34 | Srikanta Tirthapura |
Adaptive Counting Networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICDCS ![In: 25th International Conference on Distributed Computing Systems (ICDCS 2005), 6-10 June 2005, Columbus, OH, USA, pp. 241-250, 2005, IEEE Computer Society, 0-7695-2331-5. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
34 | Osmar R. Zaïane |
Relevance of Counting in Data Mining Tasks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ADMA ![In: Advanced Data Mining and Applications, First International Conference, ADMA 2005, Wuhan, China, July 22-24, 2005, Proceedings, pp. 14-18, 2005, Springer, 3-540-27894-X. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
34 | Robert M. Hierons |
Testing from a Nondeterministic Finite State Machine Using Adaptive State Counting. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Computers ![In: IEEE Trans. Computers 53(10), pp. 1330-1342, 2004. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
34 | Stefan Andrei, Wei-Ngan Chin |
Incremental Satisfiability Counting for Real-Time Systems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Real-Time and Embedded Technology and Applications Symposium ![In: 10th IEEE Real-Time and Embedded Technology and Applications Symposium (RTAS 2004), 25-28 May 2004, Toronto, Canada, pp. 482-489, 2004, IEEE Computer Society, 0-7695-2148-7. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
34 | Ola Angelsmark, Peter Jonsson |
Improved Algorithms for Counting Solutions in Constraint Satisfaction Problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CP ![In: Principles and Practice of Constraint Programming - CP 2003, 9th International Conference, CP 2003, Kinsale, Ireland, September 29 - October 3, 2003, Proceedings, pp. 81-95, 2003, Springer, 3-540-20202-1. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
34 | Vikraman Arvind, Venkatesh Raman 0001 |
Approximation Algorithms for Some Parameterized Counting Problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: Algorithms and Computation, 13th International Symposium, ISAAC 2002 Vancouver, BC, Canada, November 21-23, 2002, Proceedings, pp. 453-464, 2002, Springer, 3-540-00142-5. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
34 | Fabrice Noilhan, Miklos Santha |
Semantical Counting Circuits. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CIAC ![In: Algorithms and Complexity, 4th Italian Conference, CIAC 2000, Rome, Italy, March 2000, Proceedings, pp. 87-101, 2000, Springer, 3-540-67159-5. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
|
34 | Leonid Libkin |
Logics with Counting, Auxiliary Relations, and Lower Bounds for Invariant Queries. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LICS ![In: 14th Annual IEEE Symposium on Logic in Computer Science, Trento, Italy, July 2-5, 1999, pp. 316-325, 1999, IEEE Computer Society, 0-7695-0158-3. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
|
34 | Peter Kirschenhofer, Helmut Prodinger, Wojciech Szpankowski |
How to Count Quickly and Accurately: A Unified Analysis of Probabilistic Counting and Other Related Problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP ![In: Automata, Languages and Programming, 19th International Colloquium, ICALP92, Vienna, Austria, July 13-17, 1992, Proceedings, pp. 211-222, 1992, Springer, 3-540-55719-9. The full citation details ...](Pics/full.jpeg) |
1992 |
DBLP DOI BibTeX RDF |
|
34 | Richard Beigel, John Gill, Ulrich Hertrampf |
Counting Classes: Thresholds, Parity, Mods, and Fewness. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: STACS 90, 7th Annual Symposium on Theoretical Aspects of Computer Science, Rouen, France, February 22-24, 1990, Proceedings, pp. 49-57, 1990, Springer, 3-540-52282-4. The full citation details ...](Pics/full.jpeg) |
1990 |
DBLP DOI BibTeX RDF |
|
34 | Jacobo Torán |
Succinct Representations of Counting Problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
AAECC ![In: Applied Algebra, Algebraic Algorithms and Error-Correcting Codes, 6th International Conference, AAECC-6, Rome, Italy, July 4-8, 1988, Proceedings, pp. 415-426, 1988, Springer, 3-540-51083-4. The full citation details ...](Pics/full.jpeg) |
1988 |
DBLP DOI BibTeX RDF |
|
34 | Ramsey W. Haddad, Jeffrey F. Naughton |
Counting Methods for Cyclic Relations. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PODS ![In: Proceedings of the Seventh ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, March 21-23, 1988, Austin, Texas, USA, pp. 333-340, 1988, ACM, 0-89791-263-2. The full citation details ...](Pics/full.jpeg) |
1988 |
DBLP DOI BibTeX RDF |
|
34 | Vivek Sarkar |
Synchronization using counting semaphores. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICS ![In: Proceedings of the 2nd international conference on Supercomputing, ICS 1988, Saint Malo, France, July 4-8, 1988, pp. 627-637, 1988, ACM, 0-89791-272-1. The full citation details ...](Pics/full.jpeg) |
1988 |
DBLP DOI BibTeX RDF |
|
34 | Craig A. Rich |
The Complexity of a Counting Finite-State Automaton. ![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. 225-239, 1988, Springer, 3-540-50517-2. The full citation details ...](Pics/full.jpeg) |
1988 |
DBLP DOI BibTeX RDF |
|
32 | Harel Paz, David F. Bacon, Elliot K. Kolodner, Erez Petrank, V. T. Rajan |
An efficient on-the-fly cycle collection. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Trans. Program. Lang. Syst. ![In: ACM Trans. Program. Lang. Syst. 29(4), pp. 20, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
concurrent cycle collection, Programming languages, garbage collection, memory management, runtime systems, reference counting |
32 | Fang-Wei Fu 0001, Harald Niederreiter, Ming Su |
The Characterization of 2n-Periodic Binary Sequences with Fixed 1-Error Linear Complexity. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SETA ![In: Sequences and Their Applications - SETA 2006, 4th International Conference, Beijing, China, September 24-28, 2006, Proceedings, pp. 88-103, 2006, Springer, 3-540-44523-4. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
Stream cipher systems, Counting function, Fast algorithms, Linear complexity, Periodic sequences, k-Error linear complexity |
32 | Sorin Dan Cotofana, Casper Lageweg, Stamatis Vassiliadis |
Addition Related Arithmetic Operations via Controlled Transport of Charge. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Computers ![In: IEEE Trans. Computers 54(3), pp. 243-256, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
single electron technology, electron counting, multiplication, SET, addition |
32 | Charles R. Tolle, Timothy R. McJunkin, David J. Gorisch |
Suboptimal Minimum Cluster Volume Cover-Based Method for Measuring Fractal Dimension. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Pattern Anal. Mach. Intell. ![In: IEEE Trans. Pattern Anal. Mach. Intell. 25(1), pp. 32-41, 2003. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
suboptimal cover, box counting, clustering, texture analysis, Fuzzy-C means, Fractal dimension |
32 | Dina Thomas, Rajesh Bordawekar, Charu C. Aggarwal, Philip S. Yu |
On Efficient Query Processing of Stream Counts on the Cell Processor. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICDE ![In: Proceedings of the 25th International Conference on Data Engineering, ICDE 2009, March 29 2009 - April 2 2009, Shanghai, China, pp. 748-759, 2009, IEEE Computer Society, 978-0-7695-3545-6. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
32 | Kamel Aouiche, Daniel Lemire |
A comparison of five probabilistic view-size estimation techniques in OLAP. ![Search on Bibsonomy](Pics/bibsonomy.png) |
DOLAP ![In: DOLAP 2007, ACM 10th International Workshop on Data Warehousing and OLAP, Lisbon, Portugal, November 9, 2007, Proceedings, pp. 17-24, 2007, ACM, 978-1-59593-827-5. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
random hashing, view-size estimation, data warehouse, OLAP, materialized views |
32 | Paul A. Griffin, Witawas Srisa-an, J. Morris Chang |
On designing a low-power garbage collector for java embedded devices: a case study. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SAC ![In: Proceedings of the 2005 ACM Symposium on Applied Computing (SAC), Santa Fe, New Mexico, USA, March 13-17, 2005, pp. 868-873, 2005, ACM, 1-58113-964-0. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
Java, embedded systems, garbage collection, power awareness |
32 | Jon Bondy |
Uninitialized Modula-2 Abstract Object Instances, Yet Again. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM SIGPLAN Notices ![In: ACM SIGPLAN Notices 22(5), pp. 58-63, 1987. The full citation details ...](Pics/full.jpeg) |
1987 |
DBLP DOI BibTeX RDF |
Modula-2 |
29 | Krists Zutis, Jesse Hoey |
Who's Counting? Real-Time Blackjack Monitoring for Card Counting Detection. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICVS ![In: Computer Vision Systems, 7th International Conference on Computer Vision Systems, ICVS 2009, Liège, Belgium, October 13-15, 2009, Proceedings, pp. 354-363, 2009, Springer, 978-3-642-04666-7. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
29 | Charalampos E. Tsourakakis |
Fast Counting of Triangles in Large Real Networks without Counting: Algorithms and Laws. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICDM ![In: Proceedings of the 8th IEEE International Conference on Data Mining (ICDM 2008), December 15-19, 2008, Pisa, Italy, pp. 608-617, 2008, IEEE Computer Society, 978-0-7695-3502-9. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
29 | Zhijian Yuan, Jiajia Miao, Yan Jia 0001, Le Wang 0001 |
Counting Data Stream Based on Improved Counting Bloom Filter. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WAIM ![In: The Ninth International Conference on Web-Age Information Management, WAIM 2008, July 20-22, 2008, Zhangjiajie, China, pp. 512-519, 2008, IEEE Computer Society, 978-0-7695-3185-4. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
28 | Saswata Shannigrahi, Sudebkumar Prasant Pal |
Efficient Prüfer-Like Coding and Counting Labelled Hypertrees. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 54(2), pp. 208-225, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
Hypertree, Prüfer code, r-uniform, Coding, Counting |
28 | Yunlong Liu 0001, Jianer Chen, Jianxin Wang 0001 |
On Counting 3-D Matchings of Size k. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 54(4), pp. 530-543, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
3-D matching, Counting complexity, Approximation algorithm, Randomized algorithm, Parameterized algorithm |
28 | Jian Wang, Brian D. Davison 0001 |
Counting ancestors to estimate authority. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SIGIR ![In: Proceedings of the 32nd Annual International ACM SIGIR Conference on Research and Development in Information Retrieval, SIGIR 2009, Boston, MA, USA, July 19-23, 2009, pp. 658-659, 2009, ACM, 978-1-60558-483-6. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
probabilistic counting, link analysis, PageRank |
28 | José A. Joao, Onur Mutlu, Yale N. Patt |
Flexible reference-counting-based hardware acceleration for garbage collection. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISCA ![In: 36th International Symposium on Computer Architecture (ISCA 2009), June 20-24, 2009, Austin, TX, USA, pp. 418-428, 2009, ACM, 978-1-60558-526-0. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
garbage collection, reference counting |
28 | Parikshit Gopalan, Venkatesan Guruswami, Richard J. Lipton |
Algorithms for Modular Counting of Roots of Multivariate Polynomials. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 50(4), pp. 479-496, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
Modular counting, Polynomials, Reed-Solomon codes |
28 | Hong Zhang, Lei Liu |
An Abstract Interpretation Frame of the Calculus of Boxed Ambients Based on the Ambient Occurrence Counting. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISECS ![In: Proceedings of The International Symposium on Electronic Commerce and Security, ISECS 2008, August 3-5, 2008, Guangzhou, China, pp. 623-626, 2008, IEEE Computer Society, 978-0-7695-3258-5. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
Boxed Ambients, the ambient occurrence counting, abstract interpretation |
28 | Baltasar Trancón y Widemann |
A reference-counting garbage collection algorithmfor cyclical functional programming. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISMM ![In: Proceedings of the 7th International Symposium on Memory Management, ISMM 2008, Tucson, AZ, USA, June 7-8, 2008, pp. 71-80, 2008, ACM, 978-1-60558-134-7. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
functional programming, garbage collection, memory management, cycles, reference counting |
28 | David Sheldon, Frank Vahid |
Don't forget memories: a case study redesigning a pattern counting ASIC circuit for FPGAs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CODES+ISSS ![In: Proceedings of the 6th International Conference on Hardware/Software Codesign and System Synthesis, CODES+ISSS 2008, Atlanta, GA, USA, October 19-24, 2008, pp. 155-160, 2008, ACM, 978-1-60558-470-6. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
BRAM, high-throughput design, pattern counting, redesigning circuit, FPGA, design patterns, stream, memory, ASIC |
28 | Tao Jiang 0002, Daiming Qu |
On minimum sensing error with spectrum sensing using counting rule in cognitive radio networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WICON ![In: Proceedings of the 4th Annual International Conference on Wireless Internet, WICON 2008, Maui, Hawaii, USA, November 17-19, 2008, pp. 62, 2008, ICST, 978-963-9799-36-3. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
cooperative spectrum sensing, counting rule, sensing error, optimization, cognitive radio, error, spectrum sensing |
28 | Hui Wang 0001, Zhiwei Lin 0002 |
A Time Weighted Neighbourhood Counting Similarity for Time Series Analysis. ![Search on Bibsonomy](Pics/bibsonomy.png) |
RSKT ![In: Rough Sets and Knowledge Technology, Third International Conference, RSKT 2008, Chengdu, China, May 17-19, 2008. Proceedings, pp. 580-587, 2008, Springer, 978-3-540-79720-3. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
time weighting, neighbourhood counting, time series analysis, time dependency |
28 | Pramod G. Joisha |
A principled approach to nondeferred reference-counting garbage collection. ![Search on Bibsonomy](Pics/bibsonomy.png) |
VEE ![In: Proceedings of the 4th International Conference on Virtual Execution Environments, VEE 2008, Seattle, WA, USA, March 5-7, 2008, pp. 131-140, 2008, ACM, 978-1-59593-796-4. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
static analysis, instrumentation, reference counting |
28 | Pramod G. Joisha |
Overlooking roots: a framework for making nondeferred reference-counting garbage collection fast. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISMM ![In: Proceedings of the 6th International Symposium on Memory Management, ISMM 2007, Montreal, Quebec, Canada, October 21-22, 2007, pp. 141-158, 2007, ACM, 978-1-59593-893-0. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
static analysis, reference counting |
28 | Peyman Afshani, Timothy M. Chan |
On approximate range counting and depth. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SCG ![In: Proceedings of the 23rd ACM Symposium on Computational Geometry, Gyeongju, South Korea, June 6-8, 2007, pp. 337-343, 2007, ACM, 978-1-59593-705-6. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
data depth, computational geometry, approximation, approximate counting |
28 | Peter Damaschke |
The Union of Minimal Hitting Sets: Parameterized Combinatorial Bounds and Counting. ![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. 332-343, 2007, Springer, 978-3-540-70917-6. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
combinatorial inference, algorithms, parameterization, counting, hypergraph transversals |
28 | Qing Ai, Yan-Song Li, Gui-Lu Long 0001 |
Influences of Gate Operation Errors in the Quantum Counting Algorithm. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Comput. Sci. Technol. ![In: J. Comput. Sci. Technol. 21(6), pp. 927-932, 2006. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
quantum counting, Grover algorithm, gate error analysis |
28 | Stefan Porschen |
Counting All Solutions of Minimum Weight Exact Satisfiability. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CIAC ![In: Algorithms and Complexity, 6th Italian Conference, CIAC 2006, Rome, Italy, May 29-31, 2006, Proceedings, pp. 50-59, 2006, Springer, 3-540-34375-X. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
Minimum weight exact satisfiability, minimum weight set partition, counting problem, maximum weight independent set |
28 | Elham Safi, Andreas Moshovos, Andreas G. Veneris |
L-CBF: a low-power, fast counting bloom filter architecture. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISLPED ![In: Proceedings of the 2006 International Symposium on Low Power Electronics and Design, 2006, Tegernsee, Bavaria, Germany, October 4-6, 2006, pp. 250-255, 2006, ACM, 1-59593-462-6. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
counting bloom filters, energy per operation, delay, processors |
28 | Peter Bürgisser, Felipe Cucker, Martin Lotz |
Counting Complexity Classes for Numeric Computations. III: Complex Projective Sets. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Found. Comput. Math. ![In: Found. Comput. Math. 5(4), pp. 351-387, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
Complexity classes, Counting problems, Euler characteristic |
28 | Mary Cryan, Martin E. Dyer, Dana Randall |
Approximately counting integral flows and cell-bounded contingency tables. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STOC ![In: Proceedings of the 37th Annual ACM Symposium on Theory of Computing, Baltimore, MD, USA, May 22-24, 2005, pp. 413-422, 2005, ACM, 1-58113-960-8. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
integral flows, contingency tables, approximate counting |
28 | Martin E. Dyer, Leslie Ann Goldberg, Catherine S. Greenhill, Mark Jerrum |
The Relative Complexity of Approximate Counting Problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 38(3), pp. 471-500, 2004. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
Computational complexity, Approximate counting |
28 | Stefan Andrei |
Counting for Satisfiability by Inverting Resolution. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Artif. Intell. Rev. ![In: Artif. Intell. Rev. 22(4), pp. 339-366, 2004. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
counting truth assignments, algorithms, satisfiability |
28 | Esther Ezra, Micha Sharir |
Counting and representing intersections among triangles in three dimensions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SCG ![In: Proceedings of the 20th ACM Symposium on Computational Geometry, Brooklyn, New York, USA, June 8-11, 2004, pp. 210-219, 2004, ACM, 1-58113-885-7. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
3SUM-hard problems, counting intersections, curve-sensitive cuttings, triangles in three dimensions, arrangements |
28 | Subhash Suri, Csaba D. Tóth, Yunhong Zhou |
Range counting over multidimensional data streams. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SCG ![In: Proceedings of the 20th ACM Symposium on Computational Geometry, Brooklyn, New York, USA, June 8-11, 2004, pp. 160-169, 2004, ACM, 1-58113-885-7. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
?-approximation, range counting, data streams |
28 | Juan Humberto Sossa Azuela, Giovanni Guzmán, Oleksiy B. Pogrebnyak, Francisco Cuevas de la Rosa |
Object Counting without Conglomerate Separation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ENC ![In: 4th Mexican International Conference on Computer Science (ENC 2003), 8-12 September 2003, Apizaco, Mexico, pp. 216-220, 2003, IEEE Computer Society, 0-7695-1915-6. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
Object counting, Image skeletonization, Image segmentation, Image analysis |
28 | David Detlefs, Paul Alan Martin, Mark Moir, Guy L. Steele Jr. |
Lock-free reference counting. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Distributed Comput. ![In: Distributed Comput. 15(4), pp. 255-271, 2002. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
Lockfree synchronization, Memory management, Reference counting, Dynamic data structures |
27 | Evangelos Bampas, Andreas-Nikolas Göbel, Aris Pagourtzis, Aris Tentes |
On the Connection between Interval Size Functions and Path Counting. ![Search on Bibsonomy](Pics/bibsonomy.png) |
TAMC ![In: Theory and Applications of Models of Computation, 6th Annual Conference, TAMC 2009, Changsha, China, May 18-22, 2009. Proceedings, pp. 108-117, 2009, Springer, 978-3-642-02016-2. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
27 | Jin-yi Cai, Pinyan Lu, Mingji Xia |
A Computational Proof of Complexity of Some Restricted Counting Problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
TAMC ![In: Theory and Applications of Models of Computation, 6th Annual Conference, TAMC 2009, Changsha, China, May 18-22, 2009. Proceedings, pp. 138-149, 2009, Springer, 978-3-642-02016-2. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
27 | Kristoffer Arnsfelt Hansen |
Depth Reduction for Circuits with a Single Layer of Modular Counting Gates. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CSR ![In: Computer Science - Theory and Applications, Fourth International Computer Science Symposium in Russia, CSR 2009, Novosibirsk, Russia, August 18-23, 2009. Proceedings, pp. 117-128, 2009, Springer, 978-3-642-03350-6. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
27 | Michael Emmi, Ranjit Jhala, Eddie Kohler, Rupak Majumdar |
Verifying Reference Counting Implementations. ![Search on Bibsonomy](Pics/bibsonomy.png) |
TACAS ![In: Tools and Algorithms for the Construction and Analysis of Systems, 15th International Conference, TACAS 2009, Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2009, York, UK, March 22-29, 2009. Proceedings, pp. 352-367, 2009, Springer, 978-3-642-00767-5. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
27 | Jin-yi Cai, Pinyan Lu, Mingji Xia |
Holant problems and counting CSP. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STOC ![In: Proceedings of the 41st Annual ACM Symposium on Theory of Computing, STOC 2009, Bethesda, MD, USA, May 31 - June 2, 2009, pp. 715-724, 2009, ACM, 978-1-60558-506-2. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
holant problem, holographic reduction, CSP, polynomial interpolation |
27 | R. Ryan Williams |
Time-Space Tradeoffs for Counting NP Solutions Modulo Integers. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comput. Complex. ![In: Comput. Complex. 17(2), pp. 179-219, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
68Q17, Subject classification. 68Q15 |
27 | Giorgio Ghelli, Dario Colazzo, Carlo Sartiani |
Linear time membership in a class of regular expressions with interleaving and counting. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CIKM ![In: Proceedings of the 17th ACM Conference on Information and Knowledge Management, CIKM 2008, Napa Valley, California, USA, October 26-30, 2008, pp. 389-398, 2008, ACM, 978-1-59593-991-3. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
xml, regular expressions, xml schema |
27 | Antonios G. Alexiou, Christos Bouras, Evangelos Rekkas |
A Novel Power Counting Mechanism for Enhanced MBMS Performance in UMTS Networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
MWCN/PWC ![In: Wireless and Mobile Networking, IFIP Joint Conference on Mobile and Wireless Communications Networks (MWCN'2008) and Personal Wireless Communications (PWC'2008), Toulouse, France, September 30 - October 2, 2008, pp. 57-68, 2008, Springer, 978-0-387-84838-9. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
27 | Yao-Chung Fan, Arbee L. P. Chen |
Efficient and robust sensor data aggregation using linear counting sketches. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IPDPS ![In: 22nd IEEE International Symposium on Parallel and Distributed Processing, IPDPS 2008, Miami, Florida USA, April 14-18, 2008, pp. 1-12, 2008, IEEE. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
27 | Nutan Limaye, Meena Mahajan, Antoine Meyer |
On the Complexity of Membership and Counting in Height-Deterministic Pushdown Automata. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CSR ![In: Computer Science - Theory and Applications, Third International Computer Science Symposium in Russia, CSR 2008, Moscow, Russia, June 7-12, 2008, Proceedings, pp. 240-251, 2008, Springer, 978-3-540-79708-1. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
27 | Ahmed Metwally 0001, Divyakant Agrawal, Amr El Abbadi |
Why go logarithmic if we can go linear?: Towards effective distinct counting of search traffic. ![Search on Bibsonomy](Pics/bibsonomy.png) |
EDBT ![In: EDBT 2008, 11th International Conference on Extending Database Technology, Nantes, France, March 25-29, 2008, Proceedings, pp. 618-629, 2008, ACM, 978-1-59593-926-5. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
27 | Günter Krampen, Ralf Becker, Ute Wahner, Leo Montada |
On the validity of citation counting in science evaluation: Content analyses of references and citations in psychological publications. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Scientometrics ![In: Scientometrics 71(2), pp. 191-202, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
27 | David Gamarnik, Dmitriy Katz |
Correlation decay and deterministic FPTAS for counting list-colorings of a graph. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SODA ![In: Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2007, New Orleans, Louisiana, USA, January 7-9, 2007, pp. 1245-1254, 2007, SIAM, 978-0-898716-24-5. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP BibTeX RDF |
|
27 | Albert Atserias, Andrei A. Bulatov, Anuj Dawar |
Affine Systems of Equations and Counting Infinitary Logic. ![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. 558-570, 2007, Springer, 978-3-540-73419-2. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
27 | Mahmood Ahmadi, Stephan Wong |
A Cache Architecture for Counting Bloom Filters. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICON ![In: Proceedings of the 15th IEEE International Conference on Networks, ICON 2007, 19-21 November 2007, Adelaide, Australia, pp. 218-223, 2007, IEEE, 1-4244-1230-7. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
27 | Stefan Andrei, Gabriel Manolache, Roland H. C. Yap, Victor Felea |
Approximate Satisfiability Counting. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SYNASC ![In: Proceedings of the Ninth International Symposium on Symbolic and Numeric Algorithms for Scientific Computing, SYNASC 2007, Timisoara, Romania, September 26-29, 2007, pp. 196-202, 2007, IEEE Computer Society, 978-0-7695-3078-9. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
27 | Ryan Williams 0001 |
Time-Space Tradeoffs for Counting NP Solutions Modulo Integers. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: 22nd Annual IEEE Conference on Computational Complexity (CCC 2007), 13-16 June 2007, San Diego, California, USA, pp. 70-82, 2007, IEEE Computer Society, 0-7695-2780-9. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
27 | I Nengah Suparta, A. J. van Zanten |
Balanced Maximum Counting Sequences. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Inf. Theory ![In: IEEE Trans. Inf. Theory 52(8), pp. 3827-3830, 2006. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
27 | Nikos Ntarmos, Peter Triantafillou, Gerhard Weikum |
Counting at Large: Efficient Cardinality Estimation in Internet-Scale Data Networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICDE ![In: Proceedings of the 22nd International Conference on Data Engineering, ICDE 2006, 3-8 April 2006, Atlanta, GA, USA, pp. 40, 2006, IEEE Computer Society, 0-7695-2570-9. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
27 | Feng Liu, Fengzhan Tian, QiLiang Zhu |
Frequent Itemset Mining Based on Heuristic Two Level Counting. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICICIC (2) ![In: First International Conference on Innovative Computing, Information and Control (ICICIC 2006), 30 August - 1 September 2006, Beijing, China, pp. 640-643, 2006, IEEE Computer Society, 0-7695-2616-0. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
27 | Feng Xian, Witawas Srisa-an, Hong Jiang 0001 |
Evaluating Hardware Support for Reference Counting Using Software Configurable Processors. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ASAP ![In: 2006 IEEE International Conference on Application-Specific Systems, Architecture and Processors (ASAP 2006), 11-13 September 2006, Steamboat Springs, Colorado, USA, pp. 297-302, 2006, IEEE Computer Society, 0-7695-2682-9. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
27 | Predrag T. Tosic, Gul A. Agha |
On Computational Complexity of Counting Fixed Points in Symmetric Boolean Graph Automata. ![Search on Bibsonomy](Pics/bibsonomy.png) |
UC ![In: Unconventional Computation, 4th International Conference, UC 2005, Sevilla, Spain, October 3-7, 2005, Proceedings, pp. 191-205, 2005, Springer, 3-540-29100-8. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
Cellular and graph automata, sequential and synchronous dynamical systems, configuration space properties, #P-completeness, computational complexity |
27 | Ronen Shaltiel, Christopher Umans |
Pseudorandomness for Approximate Counting and Sampling. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: 20th Annual IEEE Conference on Computational Complexity (CCC 2005), 11-15 June 2005, San Jose, CA, USA, pp. 212-226, 2005, IEEE Computer Society, 0-7695-2364-1. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
27 | Joseph F. JáJá, Christian Worm Mortensen, Qingmin Shi |
Space-Efficient and Fast Algorithms for Multidimensional Dominance Reporting and Counting. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: Algorithms and Computation, 15th International Symposium, ISAAC 2004, Hong Kong, China, December 20-22, 2004, Proceedings, pp. 558-568, 2004, Springer, 3-540-24131-0. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
27 | Josep Díaz, Maria J. Serna, Dimitrios M. Thilikos |
Fixed Parameter Algorithms for Counting and Deciding Bounded Restrictive List H-Colorings. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ESA ![In: Algorithms - ESA 2004, 12th Annual European Symposium, Bergen, Norway, September 14-17, 2004, Proceedings, pp. 275-286, 2004, Springer, 3-540-23025-4. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
27 | Andrei A. Bulatov, Víctor Dalmau |
Towards a Dichotomy Theorem for the Counting Constraint Satisfaction Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 44th Symposium on Foundations of Computer Science (FOCS 2003), 11-14 October 2003, Cambridge, MA, USA, Proceedings, pp. 562-571, 2003, IEEE Computer Society, 0-7695-2040-5. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
27 | Vilhelm Dahllöf, Peter Jonsson |
An algorithm for counting maximum weighted independent sets and its applications. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SODA ![In: Proceedings of the Thirteenth Annual ACM-SIAM Symposium on Discrete Algorithms, January 6-8, 2002, San Francisco, CA, USA., pp. 292-298, 2002, ACM/SIAM, 0-89871-513-X. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP BibTeX RDF |
|
27 | Salvatore Orlando 0001, Paolo Palmerini, Raffaele Perego 0001, Fabrizio Silvestri |
An Efficient Parallel and Distributed Algorithm for Counting Frequent Sets. ![Search on Bibsonomy](Pics/bibsonomy.png) |
VECPAR ![In: High Performance Computing for Computational Science - VECPAR 2002, 5th International Conference, Porto, Portugal, June 26-28, 2002, Selected Papers and Invited Talks, pp. 421-435, 2002, Springer, 3-540-00852-7. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
27 | Bernard Boigelot, Louis Latour |
Counting the Solutions of Presburger Equations without Enumerating Them. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CIAA ![In: Implementation and Application of Automata, 6th International Conference, CIAA 2001, Pretoria, South Africa, July 23-25, 2001, Revised Papers, pp. 40-51, 2001, Springer, 3-540-00400-9. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
27 | Catherine S. Greenhill |
The complexity of counting colourings and independent sets in sparse graphs and hypergraphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comput. Complex. ![In: Comput. Complex. 9(1), pp. 52-72, 2000. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
#P-completeness, interpolation, independent sets, Graph colourings |
27 | Hirotaka Yamamoto, Kenjiro Taura, Akinori Yonezawa |
Comparing Reference Counting and Global Mark-and-Sweep on Parallel Computers. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LCR ![In: Languages, Compilers, and Run-Time Systems for Scalable Computers, 4th International Workshop, LCR '98, Pittsburgh, PA, USA, May 28-30, 1998, Selected Papers, pp. 205-218, 1998, Springer, 3-540-65172-1. The full citation details ...](Pics/full.jpeg) |
1998 |
DBLP DOI BibTeX RDF |
|
27 | Ulrich Hertrampf |
The Inherent Dimension of Bounded Counting Classes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
COCOON ![In: Computing and Combinatorics, 4th Annual International Conference, COCOON '98, Taipei, Taiwan, R.o.C., August 12-14, 1998, Proceedings, pp. 157-166, 1998, Springer, 3-540-64824-0. The full citation details ...](Pics/full.jpeg) |
1998 |
DBLP DOI BibTeX RDF |
|
27 | Leonid Libkin, Juha Nurmonen |
Counting and Locality over Finite Structures: A Survey. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ESSLLI ![In: Generalized Quantifiers and Computation, 9th European Summer School in Logic, Language, and Information, ESSLLI'97 Workshop, Aix-en-Provence, France, August 11-22, 1997, Revised Lectures, pp. 18-50, 1997, Springer, 3-540-66993-0. The full citation details ...](Pics/full.jpeg) |
1997 |
DBLP DOI BibTeX RDF |
|
27 | Hans-Jörg Burtschick |
Comparing Counting Classes for Logspace, One-way Logspace, and First-order. ![Search on Bibsonomy](Pics/bibsonomy.png) |
MFCS ![In: Mathematical Foundations of Computer Science 1995, 20th International Symposium, MFCS'95, Prague, Czech Republic, August 28 - September 1, 1995, Proceedings, pp. 139-148, 1995, Springer, 3-540-60246-1. The full citation details ...](Pics/full.jpeg) |
1995 |
DBLP DOI BibTeX RDF |
|
27 | Ulrich Hertrampf |
Classes of Bounded Counting Type and their Inclusion Relations. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: STACS 95, 12th Annual Symposium on Theoretical Aspects of Computer Science, Munich, Germany, March 2-4, 1995, Proceedings, pp. 60-70, 1995, Springer, 3-540-59042-0. The full citation details ...](Pics/full.jpeg) |
1995 |
DBLP DOI BibTeX RDF |
|
27 | Nikos Hardavellas, Damianos G. Karakos, Marios Mavronicolas |
Notes on Sorting and Counting Networks (Extended Abstract). ![Search on Bibsonomy](Pics/bibsonomy.png) |
WDAG ![In: Distributed Algorithms, 7th International Workshop, WDAG '93, Lausanne, Switzerland, September 27-29, 1993, Proceedings, pp. 234-248, 1993, Springer, 3-540-57271-6. The full citation details ...](Pics/full.jpeg) |
1993 |
DBLP DOI BibTeX RDF |
|
27 | Sergio Greco, Carlo Zaniolo |
Optimization of Linear Logic Programs Using Counting Methods. ![Search on Bibsonomy](Pics/bibsonomy.png) |
EDBT ![In: Advances in Database Technology - EDBT'92, 3rd International Conference on Extending Database Technology, Vienna, Austria, March 23-27, 1992, Proceedings, pp. 72-87, 1992, Springer, 3-540-55270-7. The full citation details ...](Pics/full.jpeg) |
1992 |
DBLP DOI BibTeX RDF |
|
27 | Kyu-Young Whang, Brad T. Vander Zanden, Howard M. Taylor |
A Linear-Time Probabilistic Counting Algorithm for Database Applications. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Trans. Database Syst. ![In: ACM Trans. Database Syst. 15(2), pp. 208-229, 1990. The full citation details ...](Pics/full.jpeg) |
1990 |
DBLP DOI BibTeX RDF |
|
27 | Marek Piotrów |
ATIME(N) is Closed Under Counting. ![Search on Bibsonomy](Pics/bibsonomy.png) |
MFCS ![In: Mathematical Foundations of Computer Science 1990, MFCS'90, Banská Bystrica, Czechoslovakia, August 27-31, 1990, Proceedings, pp. 457-463, 1990, Springer, 3-540-52953-5. The full citation details ...](Pics/full.jpeg) |
1990 |
DBLP DOI BibTeX RDF |
|
27 | Jacobo Torán |
A Combinatorial Technique for Separating Counting Complexity Classes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP ![In: Automata, Languages and Programming, 16th International Colloquium, ICALP89, Stresa, Italy, July 11-15, 1989, Proceedings, pp. 733-744, 1989, Springer, 3-540-51371-X. The full citation details ...](Pics/full.jpeg) |
1989 |
DBLP DOI BibTeX RDF |
|
27 | Domenico Saccà, Carlo Zaniolo |
Magic Counting Methods. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SIGMOD Conference ![In: Proceedings of the Association for Computing Machinery Special Interest Group on Management of Data 1987 Annual Conference, San Francisco, CA, USA, May 27-29, 1987, pp. 49-59, 1987, ACM Press, 978-0-89791-236-5. The full citation details ...](Pics/full.jpeg) |
1987 |
DBLP DOI BibTeX RDF |
|
26 | Martin E. Dyer, David Richerby |
On the complexity of #CSP. ![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. 725-734, 2010, ACM, 978-1-4503-0050-6. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
complexity dichotomy, constraint satisfaction problem, counting problems |
26 | Abderrazak Zahour, Bruno Taconet, Laurence Likforman-Sulem, Wafa Boussellaa |
Overlapping and multi-touching text-line segmentation by Block Covering analysis. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Pattern Anal. Appl. ![In: Pattern Anal. Appl. 12(4), pp. 335-351, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
Block covering, Text-line segmentation, Overlapping and multi-touching lines, Block Counting, Ancient Arabic documents |
26 | Giuseppe Bianchi 0001, Simone Teofili, Matteo Pomposini |
New directions in privacy-preserving anomaly detection for network traffic. ![Search on Bibsonomy](Pics/bibsonomy.png) |
NDA ![In: Proceedings of the 1st ACM workshop on Network Data Anonymization, NDA 2008, Alexandria, VA, USA, October 31, 2008, pp. 11-18, 2008, ACM, 978-1-60558-301-3. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
counting bloom filters, anomaly detection, privacy-preserving, traffic measurement |
26 | Chin-Yang Lin, Ting-Wei Hou |
A simple and efficient algorithm for cycle collection. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM SIGPLAN Notices ![In: ACM SIGPLAN Notices 42(3), pp. 7-13, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
cycle collection, Java, garbage collection, reference counting |
26 | Matthew Might, Benjamin Chambers, Olin Shivers |
Model Checking Via GammaCFA. ![Search on Bibsonomy](Pics/bibsonomy.png) |
VMCAI ![In: Verification, Model Checking, and Abstract Interpretation, 8th International Conference, VMCAI 2007, Nice, France, January 14-16, 2007, Proceedings, pp. 59-73, 2007, Springer, 978-3-540-69735-0. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
abstract counting, abstract garbage collection, ?CFA, static analysis, Abstract interpretation, higher-order languages |
26 | Öznur Özkasap, Emine Sule Yazici, Selda Küçükçifçi, Mine Çaglar |
Exact Performance Measures for Peer-to-Peer Epidemic Information Diffusion. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISCIS ![In: Computer and Information Sciences - ISCIS 2006, 21th International Symposium, Istanbul, Turkey, November 1-3, 2006, Proceedings, pp. 866-876, 2006, Springer, 3-540-47242-8. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
anti-entropy, peer-to-peer, Markov chain, counting, epidemic |
Displaying result #101 - #200 of 10495 (100 per page; Change: ) Pages: [ <<][ 1][ 2][ 3][ 4][ 5][ 6][ 7][ 8][ 9][ 10][ 11][ >>] |
|