|
|
Venues (Conferences, Journals, ...)
|
|
GrowBag graphs for keyword ? (Num. hits/coverage)
Group by:
The graphs summarize 6 occurrences of 5 keywords
|
|
|
Results
Found 8 publication records. Showing 8 according to the selection in the facets
Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
40 | Manel Abdelhedi, Omessaad Hamdi, Ammar Bouallegue |
Reduced-Comlexity Decoding of LDPC Codes Using TAP Approach. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SITIS ![In: Fifth International Conference on Signal-Image Technology & Internet-Based Systems, SITIS 2009, Marrakesh, Morocco, November 29 - December 4, 2009, pp. 187-191, 2009, IEEE Computer Society, 978-0-7695-3959-1. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
40 | Richard Beigel, William I. Gasarch, Martin Kummer, Georgia Martin, Timothy H. McNicholl, Frank Stephan 0001 |
The Comlexity of OddAn. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Symb. Log. ![In: J. Symb. Log. 65(1), pp. 1-18, 2000. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
|
40 | Albert Atserias |
The Descriptive Comlexity of the Fixed-Points of Bounded Formulas. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CSL ![In: Computer Science Logic, 14th Annual Conference of the EACSL, Fischbachau, Germany, August 21-26, 2000, Proceedings, pp. 172-186, 2000, Springer, 3-540-67895-6. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
Circuit uniformity, BIT predicate, logarithmic-time hierarchy, rudimentary languages, integer division |
33 | Dániel Marx |
Completely Inapproximable Monotone and Antimonotone Parameterized Problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: Proceedings of the 25th Annual IEEE Conference on Computational Complexity, CCC 2010, Cambridge, Massachusetts, USA, June 9-12, 2010, pp. 181-187, 2010, IEEE Computer Society, 978-0-7695-4060-3. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
parameterized comlexity, approximation, fixed-parameter tractability, inapproximability |
33 | Walter Unger |
The Complexity of the Approximation of the Bandwidth Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 39th Annual Symposium on Foundations of Computer Science, FOCS '98, November 8-11, 1998, Palo Alto, California, USA, pp. 82-91, 1998, IEEE Computer Society, 0-8186-9172-7. The full citation details ...](Pics/full.jpeg) |
1998 |
DBLP DOI BibTeX RDF |
comlexity, approximation, bandwidth |
28 | Laura Recalde, Serge Haddad, Manuel Silva Suárez |
Continuous Petri Nets: Expressive Power and Decidability Issues. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ATVA ![In: Automated Technology for Verification and Analysis, 5th International Symposium, ATVA 2007, Tokyo, Japan, October 22-25, 2007, Proceedings, pp. 362-377, 2007, Springer, 978-3-540-75595-1. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
28 | Shlomi Dolev, Rafail Ostrovsky |
Xor-trees for efficient anonymous multicast and reception. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Trans. Inf. Syst. Secur. ![In: ACM Trans. Inf. Syst. Secur. 3(2), pp. 63-84, 2000. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
anonymous multicast, anonymous communication |
28 | Amihood Amir, Emanuel Dar |
An Improved Deterministic Algorithms for Generalized Random Sampling. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CIAC ![In: Algorithms and Complexity, Third Italian Conference, CIAC '97, Rome, Italy, March 12-14, 1997, Proceedings, pp. 159-170, 1997, Springer, 3-540-62592-5. The full citation details ...](Pics/full.jpeg) |
1997 |
DBLP DOI BibTeX RDF |
|
Displaying result #1 - #8 of 8 (100 per page; Change: )
|
|