|
|
Venues (Conferences, Journals, ...)
|
|
GrowBag graphs for keyword ? (Num. hits/coverage)
Group by:
The graphs summarize 2006 occurrences of 1376 keywords
|
|
|
Results
Found 3353 publication records. Showing 3353 according to the selection in the facets
Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
135 | Eljas Soisalon-Soininen |
Elimination of Single Productions from LR Parsers in Conjunction with the Use of Default Reductions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
POPL ![In: Conference Record of the Fourth ACM Symposium on Principles of Programming Languages, Los Angeles, California, USA, January 1977, pp. 183-193, 1977, ACM. The full citation details ...](Pics/full.jpeg) |
1977 |
DBLP DOI BibTeX RDF |
|
116 | Lane A. Hemaspaandra, Mayur Thakur |
Query-Monotonic Turing Reductions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
COCOON ![In: Computing and Combinatorics, 11th Annual International Conference, COCOON 2005, Kunming, China, August 16-29, 2005, Proceedings, pp. 895-904, 2005, Springer, 3-540-28061-8. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
103 | Shih-Wei Liao |
Parallelizing User-Defined and Implicit Reductions Globally on Multiprocessors. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Asia-Pacific Computer Systems Architecture Conference ![In: Advances in Computer Systems Architecture, 11th Asia-Pacific Conference, ACSAC 2006, Shanghai, China, September 6-8, 2006, Proceedings, pp. 189-202, 2006, Springer, 3-540-40056-7. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
reduction recognition, implicit reductions, user-defined reductions, parallelization, multiprocessor, multicore, Reduction, data flow analysis, interprocedural analysis |
84 | Arfst Nickelsen, Till Tantau |
Closure of Polynomial Time Partial Information Classes under Polynomial Time Reductions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FCT ![In: Fundamentals of Computation Theory, 13th International Symposium, FCT 2001, Riga, Latvia, August 22-24, 2001, Proceedings, pp. 299-310, 2001, Springer, 3-540-42487-3. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
polynomial time reductions, verboseness, p-selectivity, positive reductions, structural complexity, partial information |
74 | Anuj Dawar, Yuguo He |
Parameterized Complexity Classes under Logical Reductions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
MFCS ![In: Mathematical Foundations of Computer Science 2009, 34th International Symposium, MFCS 2009, Novy Smokovec, High Tatras, Slovakia, August 24-28, 2009. Proceedings, pp. 258-269, 2009, Springer, 978-3-642-03815-0. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
67 | Dan Gutfreund, Salil P. Vadhan |
Limitations of Hardness vs. Randomness under Uniform Reductions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX-RANDOM ![In: Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques, 11th International Workshop, APPROX 2008, and 12th International Workshop, RANDOM 2008, Boston, MA, USA, August 25-27, 2008. Proceedings, pp. 469-482, 2008, Springer, 978-3-540-85362-6. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
derandomization, pseudorandom generators, black-box reductions |
62 | Degang Chen 0002 |
The Part Reductions in Information Systems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Rough Sets and Current Trends in Computing ![In: Rough Sets and Current Trends in Computing, 4th International Conference, RSCTC 2004, Uppsala, Sweden, June 1-5, 2004, Proceedings, pp. 477-482, 2004, Springer, 3-540-22117-4. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
61 | Steven J. Deitz, David Callahan, Bradford L. Chamberlain, Lawrence Snyder |
Global-view abstractions for user-defined reductions and scans. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PPoPP ![In: Proceedings of the ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, PPOPP 2006, New York, New York, USA, March 29-31, 2006, pp. 40-47, 2006, ACM, 1-59593-189-9. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
Chapel, parallel programming, MPI, reductions, scans, parallel prefix |
61 | Edmund M. Clarke, Somesh Jha, Wilfredo R. Marrero |
Partial Order Reductions for Security Protocol Verification. ![Search on Bibsonomy](Pics/bibsonomy.png) |
TACAS ![In: Tools and Algorithms for Construction and Analysis of Systems, 6th International Conference, TACAS 2000, Held as Part of the European Joint Conferences on the Theory and Practice of Software, ETAPS 2000, Berlin, Germany, March 25 - April 2, 2000, Proceedings, pp. 503-518, 2000, Springer, 3-540-67282-6. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
partial order reductions and security, Model checking |
61 | Salvador Lucas |
Needed Reductions with Context-Sensitive Rewriting. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ALP/HOA ![In: Algebraic and Logic Programming, 6th International Joint Conference, ALP '97 - HOA '97, Southampton, UK, Spetember 3-5, 1997, Proceedings, pp. 129-143, 1997, Springer, 3-540-63459-2. The full citation details ...](Pics/full.jpeg) |
1997 |
DBLP DOI BibTeX RDF |
needed reductions, replacement restrictions, functional programming, strategies, term rewriting systems |
56 | John M. Hitchcock, Aduri Pavan |
Comparing Reductions to NP-Complete Sets. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP (1) ![In: Automata, Languages and Programming, 33rd International Colloquium, ICALP 2006, Venice, Italy, July 10-14, 2006, Proceedings, Part I, pp. 465-476, 2006, Springer, 3-540-35904-4. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
56 | Jin-yi Cai, Lane A. Hemaspaandra, Gerd Wechsung |
Robust Reductions. ![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. 174-183, 1998, Springer, 3-540-64824-0. The full citation details ...](Pics/full.jpeg) |
1998 |
DBLP DOI BibTeX RDF |
|
55 | Steven J. Deitz, Bradford L. Chamberlain, Lawrence Snyder |
High-level Language Support for User-defined Reductions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Supercomput. ![In: J. Supercomput. 23(1), pp. 23-37, 2002. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
user-defined reductions, parallel programming, scientific computing, high-level languages |
50 | Frédéric Lang, Radu Mateescu 0001 |
Partial Order Reductions Using Compositional Confluence Detection. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FM ![In: FM 2009: Formal Methods, Second World Congress, Eindhoven, The Netherlands, November 2-6, 2009. Proceedings, pp. 157-172, 2009, Springer, 978-3-642-05088-6. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
50 | Xavier Redon, Paul Feautrier |
Scheduling reductions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
International Conference on Supercomputing ![In: Proceedings of the 8th international conference on Supercomputing, ICS 1994, Manchester, UK, July 11-15, 1994, pp. 117-125, 1994, ACM, 0-89791-665-4. The full citation details ...](Pics/full.jpeg) |
1994 |
DBLP DOI BibTeX RDF |
|
50 | Lane A. Hemachandra, Sanjay Jain 0001 |
On the Limitations of Locally Robust Positive Reductions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FSTTCS ![In: Foundations of Software Technology and Theoretical Computer Science, Ninth Conference, Bangalore, India, December 19-21, 1989, Proceedings, pp. 193-203, 1989, Springer, 3-540-52048-1. The full citation details ...](Pics/full.jpeg) |
1989 |
DBLP DOI BibTeX RDF |
|
49 | Radu Iosif |
Symmetry reductions for model checking of concurrent dynamic software. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Int. J. Softw. Tools Technol. Transf. ![In: Int. J. Softw. Tools Technol. Transf. 6(4), pp. 302-319, 2004. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
Orbit problem, Temporal logic, Software verification, Symmetry reductions |
49 | Ahto Buldas, Sven Laur, Margus Niitsoo |
Oracle Separation in the Non-uniform Model. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ProvSec ![In: Provable Security, Third International Conference, ProvSec 2009, Guangzhou, China, November 11-13, 2009. Proceedings, pp. 230-244, 2009, Springer, 978-3-642-04641-4. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
48 | Yan-Cheng Chang, Chun-Yuan Hsiao, Chi-Jen Lu |
The Impossibility of Basing One-Way Permutations on Central Cryptographic Primitives. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Cryptol. ![In: J. Cryptol. 19(1), pp. 97-114, 2006. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
Private information retrieval, Cryptographic primitives, Black-box reductions, Trapdoor functions, One-way permutations |
47 | Helena Handschuh, Yiannis Tsiounis, Moti Yung |
Decision Oracles are Equivalent to Matching Oracles. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Public Key Cryptography ![In: Public Key Cryptography, Second International Workshop on Practice and Theory in Public Key Cryptography, PKC '99, Kamakura, Japan, March 1-3, 1999, Proceedings, pp. 276-289, 1999, Springer, 3-540-65644-8. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
Diffie-Hellman variants, randomized reductions, uniform reductions, homomorphic encryption functions (ElGamal, Goldwasser-Micali, Okamoto-Uchiyama, Naccache-Stern), random self-reducibility, universal malleability, public-key encryption, decision problems, matching problems |
44 | Ahto Buldas, Aivo Jürgenson, Margus Niitsoo |
Efficiency Bounds for Adversary Constructions in Black-Box Reductions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACISP ![In: Information Security and Privacy, 14th Australasian Conference, ACISP 2009, Brisbane, Australia, July 1-3, 2009, Proceedings, pp. 264-275, 2009, Springer, 978-3-642-02619-5. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
44 | Gary M. Zoppetti, Gagan Agrawal, Rishi Kumar |
Compiler and Runtime Support for Irregular Reductions on a Multithreaded Architecture. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IPDPS ![In: 16th International Parallel and Distributed Processing Symposium (IPDPS 2002), 15-19 April 2002, Fort Lauderdale, FL, USA, CD-ROM/Abstracts Proceedings, 2002, IEEE Computer Society, 0-7695-1573-8. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
44 | Jesús Corbal, Roger Espasa, Mateo Valero |
On the Efficiency of Reductions in µ-SIMD Media Extensions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE PACT ![In: 2001 International Conference on Parallel Architectures and Compilation Techniques (PACT 2001), 8-12 September 2001, Barcelona, Spain, pp. 83-94, 2001, IEEE Computer Society, 0-7695-1363-8. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
44 | Gary M. Zoppetti, Gagan Agrawal, Rishi Kumar |
Impact of Data Distribution on Performance of Irregular Reductions on Multithreaded Architectures. ![Search on Bibsonomy](Pics/bibsonomy.png) |
HPCN ![In: High-Performance Computing and Networking, 9th International Conference, HPCN Europe 2001, Amsterdam, The Netherlands, June 25-27, 2001, Proceedings, pp. 483-492, 2001, Springer, 3-540-42293-5. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
44 | Arnaud Durand 0001, Miki Hermann, Phokion G. Kolaitis |
Subtractive Reductions and Complete Problems for Counting Complexity Classes. ![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. 323-332, 2000, Springer, 3-540-67901-4. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
|
44 | Vikraman Arvind, Yenjo Han, Lane A. Hemachandra, Johannes Köbler, Antoni Lozano, Martin Mundhenk, Mitsunori Ogiwara, Uwe Schöning, Riccardo Silvestri, Thomas Thierauf |
Reductions to Sets of Low Information Content. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP ![In: Automata, Languages and Programming, 19th International Colloquium, ICALP92, Vienna, Austria, July 13-17, 1992, Proceedings, pp. 162-173, 1992, Springer, 3-540-55719-9. The full citation details ...](Pics/full.jpeg) |
1992 |
DBLP DOI BibTeX RDF |
|
43 | Jay Belanger, Aduri Pavan, Jie Wang 0002 |
Reductions Do Not Preserve Fast Convergence Rates in Average Time. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 23(4), pp. 363-373, 1999. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
Average polynomial time, Distributional problem, Reductions |
43 | Jack H. Lutz, Yong Zhao |
The Density of Weakly Complete Problems under Adaptive Reductions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: Proceedings of the Twelfth Annual IEEE Conference on Computational Complexity, Ulm, Germany, June 24-27, 1997, pp. 111-120, 1997, IEEE Computer Society, 0-8186-7907-7. The full citation details ...](Pics/full.jpeg) |
1997 |
DBLP DOI BibTeX RDF |
dense languages, polynomial reductions, sparse languages, weak completeness, computational complexity, complexity classes, resource-bounded measure |
43 | Helmut Veith |
Succinct Representation, Leaf Languages, and Projection Reductions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: Proceedings of the Eleveth Annual IEEE Conference on Computational Complexity, Philadelphia, Pennsylvania, USA, May 24-27, 1996, pp. 118-126, 1996, IEEE Computer Society, 0-8186-7386-9. The full citation details ...](Pics/full.jpeg) |
1996 |
DBLP DOI BibTeX RDF |
leaf languages, quantifier-free reductions, computational complexity, descriptive complexity, succinct representation |
43 | Richard Kennaway, Jan Willem Klop, M. Ronan Sleep, Fer-Jan de Vries |
Transfinite Reductions in Orthogonal Term Rewriting Systems (Extended Abstract). ![Search on Bibsonomy](Pics/bibsonomy.png) |
RTA ![In: Rewriting Techniques and Applications, 4th International Conference, RTA-91, Como, Italy, April 10-12, 1991, Proceedings, pp. 1-12, 1991, Springer, 3-540-53904-2. The full citation details ...](Pics/full.jpeg) |
1991 |
DBLP DOI BibTeX RDF |
orthogonal term rewriting systems, infinitary rewriting, strong converging reductions, infinite Church-Rosser Properties, Böhm Trees, head normal forms, non-unifiable term rewriting systems, normal forms |
43 | Richard Beigel, Bin Fu |
Circuits Over PP and PL. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: Proceedings of the Twelfth Annual IEEE Conference on Computational Complexity, Ulm, Germany, June 24-27, 1997, pp. 24-35, 1997, IEEE Computer Society, 0-8186-7907-7. The full citation details ...](Pics/full.jpeg) |
1997 |
DBLP DOI BibTeX RDF |
reduction, oracle, circuit, closure, PL, Boolean formula, AC, NC, PP |
43 | Mark E. Stickel |
A Case Study of Theorem Proving by the Knuth-Bendix Method: Discovering That x³=x Implies Ring Commutativity. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CADE ![In: 7th International Conference on Automated Deduction, Napa, California, USA, May 14-16, 1984, Proceedings, pp. 248-258, 1984, Springer, 3-540-96022-8. The full citation details ...](Pics/full.jpeg) |
1984 |
DBLP DOI BibTeX RDF |
|
42 | Manindra Agrawal |
Pseudo-Random Generators and Structure of Complete Degrees. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: Proceedings of the 17th Annual IEEE Conference on Computational Complexity, Montréal, Québec, Canada, May 21-24, 2002, pp. 139-147, 2002, IEEE Computer Society, 0-7695-1468-5. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
Completeness, Reductions, Pseudo-random Generators |
41 | Ashish V. Naik, Alan L. Selman |
A Note on P-selective sets and on Adaptive versus Nonadaptive Queries to NP. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: Proceedings of the Eleveth Annual IEEE Conference on Computational Complexity, Philadelphia, Pennsylvania, USA, May 24-27, 1996, pp. 224-232, 1996, IEEE Computer Society, 0-8186-7386-9. The full citation details ...](Pics/full.jpeg) |
1996 |
DBLP DOI BibTeX RDF |
P, p-selective, adaptive reductions, nonadaptive reductions, complexity classes, NP |
37 | Daniele Micciancio |
Efficient reductions among lattice problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SODA ![In: Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2008, San Francisco, California, USA, January 20-22, 2008, pp. 84-93, 2008, SIAM. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP BibTeX RDF |
|
37 | Christophe Pajault, Jean-François Pradat-Peyre, Pierre Rousseau |
Adapting Petri Nets Reductions to Promela Specifications. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FORTE ![In: Formal Techniques for Networked and Distributed Systems - FORTE 2008, 28th IFIP WG 6.1 International Conference, Tokyo, Japan, June 10-13, 2008, Proceedings, pp. 84-98, 2008, Springer, 978-3-540-68854-9. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
37 | Christian Glaßer, Alan L. Selman, Samik Sengupta |
Reductions between Disjoint NP-Pairs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: 19th Annual IEEE Conference on Computational Complexity (CCC 2004), 21-24 June 2004, Amherst, MA, USA, pp. 42-53, 2004, IEEE Computer Society, 0-7695-2120-7. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
37 | A. Prasad Sistla |
Symmetry Reductions in Model-Checking. ![Search on Bibsonomy](Pics/bibsonomy.png) |
VMCAI ![In: Verification, Model Checking, and Abstract Interpretation, 4th International Conference, VMCAI 2003, New York, NY, USA, January 9-11, 2002, Proceedings, pp. 25, 2003, Springer, 3-540-00348-7. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
37 | Jan-Jan Wu |
An Interleaving Transformation for Parallelizing Reductions for Distributed-Memory Parallel Machines. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Supercomput. ![In: J. Supercomput. 15(3), pp. 321-339, 2000. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
triangular systems solver, parallel processing, program transformation, reduction, parallelizing compilation, distributed-memory |
37 | Tatsuaki Okamoto, Shigenori Uchiyama |
Security of an Identity-Based Cryptosystem and the Related Reductions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
EUROCRYPT ![In: Advances in Cryptology - EUROCRYPT '98, International Conference on the Theory and Application of Cryptographic Techniques, Espoo, Finland, May 31 - June 4, 1998, Proceeding, pp. 546-560, 1998, Springer, 3-540-64518-7. The full citation details ...](Pics/full.jpeg) |
1998 |
DBLP DOI BibTeX RDF |
|
37 | Jin-yi Cai, Ashish V. Naik, D. Sivakumar |
On the Existence of Hard Sparse Sets under Weak Reductions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: STACS 96, 13th Annual Symposium on Theoretical Aspects of Computer Science, Grenoble, France, February 22-24, 1996, Proceedings, pp. 307-318, 1996, Springer, 3-540-60922-9. The full citation details ...](Pics/full.jpeg) |
1996 |
DBLP DOI BibTeX RDF |
|
37 | Vincent Danos, Marco Pedicini, Laurent Regnier |
Directed Virtual Reductions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CSL ![In: Computer Science Logic, 10th International Workshop, CSL '96, Annual Conference of the EACSL, Utrecht, The Netherlands, September 21-27, 1996, Selected Papers, pp. 76-88, 1996, Springer, 3-540-63172-0. The full citation details ...](Pics/full.jpeg) |
1996 |
DBLP DOI BibTeX RDF |
|
37 | Andreas Blass, Yuri Gurevich |
Randomizing Reductions of Search Problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FSTTCS ![In: Foundations of Software Technology and Theoretical Computer Science, 11th Conference, New Delhi, India, December 17-19, 1991, Proceedings, pp. 10-24, 1991, Springer, 3-540-54967-6. The full citation details ...](Pics/full.jpeg) |
1991 |
DBLP DOI BibTeX RDF |
|
37 | Lefteris M. Kirousis, Paul G. Spirakis |
Probabilistic Log-Space Reductions and Problems Probabilistically Hard for P. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SWAT ![In: SWAT 88, 1st Scandinavian Workshop on Algorithm Theory, Halmstad, Sweden, July 5-8, 1988, Proceedings, pp. 163-175, 1988, Springer, 3-540-19487-8. The full citation details ...](Pics/full.jpeg) |
1988 |
DBLP DOI BibTeX RDF |
|
37 | Eladio Gutiérrez, Oscar G. Plata, Emilio L. Zapata |
On Improving the Performance of Data Partitioning Oriented Parallel Irregular Reductions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PDP ![In: 10th Euromicro Workshop on Parallel, Distributed and Network-Based Processing (PDP 2002), 9-11 January 2002, Canary Islands, Spain, pp. 445-, 2002, IEEE Computer Society, 0-7695-1444-8. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
Irregular reductions, shared-memory multiprocessor, data locality, workload balancing |
36 | Marisa Venturini Zilli |
Cofinality in Reduction Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CAAP ![In: CAAP'83, Trees in Algebra and Programming, 8th Colloquium, L'Aquila, Italy, March 9-11, 1983, Proceedings, pp. 405-416, 1983, Springer, 3-540-12727-5. The full citation details ...](Pics/full.jpeg) |
1983 |
DBLP DOI BibTeX RDF |
|
36 | Adi Akavia, Oded Goldreich 0001, Shafi Goldwasser, Dana Moshkovitz |
On basing one-way functions on NP-hardness. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STOC ![In: Proceedings of the 38th Annual ACM Symposium on Theory of Computing, Seattle, WA, USA, May 21-23, 2006, pp. 701-710, 2006, ACM, 1-59593-134-1. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
adaptive versus non-adaptive machines, reductions, one-way functions, interactive proof systems, average-case complexity |
35 | Mitsunori Ogihara |
Sparse P-Hard Sets Yield Space-Efficient Algorithms. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 36th Annual Symposium on Foundations of Computer Science, Milwaukee, Wisconsin, USA, 23-25 October 1995, pp. 354-361, 1995, IEEE Computer Society, 0-8186-7183-1. The full citation details ...](Pics/full.jpeg) |
1995 |
DBLP DOI BibTeX RDF |
sparse P-hard sets, space-efficient algorithms, logspace many-one reductions, poly-logarithmic space-computable many-one reductions, computational complexity |
35 | Stavros S. Cosmadakis |
Logical Reducibility and Monadic NP ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 34th Annual Symposium on Foundations of Computer Science, Palo Alto, California, USA, 3-5 November 1993, pp. 52-61, 1993, IEEE Computer Society, 0-8186-4370-6. The full citation details ...](Pics/full.jpeg) |
1993 |
DBLP DOI BibTeX RDF |
syntactically restricted first-order reductions, logical reducibility, monadic NP, polynomial-time many-one reductions, directed reachability, encodings, first-order logic, NP-complete problems, relational structures |
31 | Ulrich Flegel, Joachim Biskup |
Requirements of Information Reductions for Cooperating Intrusion Detection Agents. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ETRICS ![In: Emerging Trends in Information and Communication Security, International Conference, ETRICS 2006, Freiburg, Germany, June 6-9, 2006, Proceedings, pp. 466-480, 2006, Springer, 3-540-34640-6. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
31 | Wenjing Rao, Alex Orailoglu, George Su |
Frugal linear network-based test decompression for drastic test cost reductions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICCAD ![In: 2004 International Conference on Computer-Aided Design, ICCAD 2004, San Jose, CA, USA, November 7-11, 2004, pp. 721-725, 2004, IEEE Computer Society / ACM, 0-7803-8702-3. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
31 | Edmund M. Clarke, Somesh Jha, Wilfredo R. Marrero |
Efficient verification of security protocols using partial-order reductions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Int. J. Softw. Tools Technol. Transf. ![In: Int. J. Softw. Tools Technol. Transf. 4(2), pp. 173-188, 2003. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
Model checking, Security protocols, Partial-order reduction |
31 | Matthew B. Dwyer, Robby, Xianghua Deng, John Hatcliff |
Space Reductions for Model Checking Quasi-Cyclic Systems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
EMSOFT ![In: Embedded Software, Third International Conference, EMSOFT 2003, Philadelphia, PA, USA, October 13-15, 2003, Proceedings, pp. 173-189, 2003, Springer, 3-540-20223-4. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
31 | Ruoming Jin, Gagan Agrawal |
Performance prediction for random write reductions: a case study in modeling shared memory programs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SIGMETRICS ![In: Proceedings of the International Conference on Measurements and Modeling of Computer Systems, SIGMETRICS 2002, June 15-19, 2002, Marina Del Rey, California, USA, pp. 117-128, 2002, ACM, 1-58113-531-9. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
31 | Gautam Gupta, Sanjay V. Rajopadhye, Patrice Quinton |
Scheduling reductions on realistic machines. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SPAA ![In: Proceedings of the Fourteenth Annual ACM Symposium on Parallel Algorithms and Architectures, SPAA 2002, Winnipeg, Manitoba, Canada, August 11-13, 2002, pp. 117-126, 2002, ACM, 1-58113-529-7. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
parametric integer programming, dependence analysis, automatic parallelization, scheduling theory, polyhedral model, affine recurrence equations |
31 | Simon St. James, Ulrich Ultes-Nitsche |
Computing property-preserving behaviour abstractions from trace reductions: abstraction-based verification of linear-time properties under fairness. ![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. 238-245, 2001, ACM, 1-58113-383-9. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
behaviour abstraction, satisfaction within fairness, weakly continuation-closed homomorphisms, partial-order methods, trace reduction |
31 | Peter Niebert, Michaela Huhn, Sarah Zennou, Denis Lugiez |
Local First Search - A New Paradigm for Partial Order Reductions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CONCUR ![In: CONCUR 2001 - Concurrency Theory, 12th International Conference, Aalborg, Denmark, August 20-25, 2001, Proceedings, pp. 396-410, 2001, Springer, 3-540-42497-0. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
31 | Vikraman Arvind, Johannes Köbler, Martin Mundhenk |
On Bounded Truth-Table, Conjunctive, and Randomized Reductions to Sparse Sets. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FSTTCS ![In: Foundations of Software Technology and Theoretical Computer Science, 12th Conference, New Delhi, India, December 18-20, 1992, Proceedings, pp. 140-151, 1992, Springer, 3-540-56287-7. The full citation details ...](Pics/full.jpeg) |
1992 |
DBLP DOI BibTeX RDF |
|
31 | Alfred Strey |
On the Efficient Implementation of Reductions on the Cell Broadband Engine. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PDP ![In: Proceedings of the 18th Euromicro Conference on Parallel, Distributed and Network-based Processing, PDP 2010, Pisa, Italy, February 17-19, 2010, pp. 223-228, 2010, IEEE Computer Society, 978-0-7695-3939-3. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
Reductions, Cell Broadband Engine |
31 | Maria-Florina Balcan, Nikhil Bansal 0001, Alina Beygelzimer, Don Coppersmith, John Langford 0001, Gregory B. Sorkin |
Robust reductions from ranking to classification. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Mach. Learn. ![In: Mach. Learn. 72(1-2), pp. 139-153, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
Classification, Ranking, Reductions |
31 | Pierluigi Crescenzi |
A Short Guide to Approximation Preserving Reductions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: Proceedings of the Twelfth Annual IEEE Conference on Computational Complexity, Ulm, Germany, June 24-27, 1997, pp. 262-273, 1997, IEEE Computer Society, 0-8186-7907-7. The full citation details ...](Pics/full.jpeg) |
1997 |
DBLP DOI BibTeX RDF |
approximation preserving reductions, computational complexity, complexity, combinatorial optimization |
30 | Serge Gaspers, Gregory B. Sorkin |
A universally fastest algorithm for Max 2-Sat, Max 2-CSP, and everything in between. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SODA ![In: Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2009, New York, NY, USA, January 4-6, 2009, pp. 606-615, 2009, SIAM, 978-0-89871-680-1. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
30 | Bin Zhou, Yizheng Ye, Zhao-lin Li, Xin-chun Wu, Rui Ke |
A new low power test pattern generator using a variable-length ring counter. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISQED ![In: 10th International Symposium on Quality of Electronic Design (ISQED 2009), 16-18 March 2009, San Jose, CA, USA, pp. 248-252, 2009, IEEE Computer Society, 978-1-4244-2952-3. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
30 | Alex K. Simpson |
Reduction in a Linear Lambda-Calculus with Applications to Operational Semantics. ![Search on Bibsonomy](Pics/bibsonomy.png) |
RTA ![In: Term Rewriting and Applications, 16th International Conference, RTA 2005, Nara, Japan, April 19-21, 2005, Proceedings, pp. 219-234, 2005, Springer, 3-540-25596-6. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
30 | John M. Hitchcock |
Small Spans in Scaled Dimension. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: 19th Annual IEEE Conference on Computational Complexity (CCC 2004), 21-24 June 2004, Amherst, MA, USA, pp. 104-112, 2004, IEEE Computer Society, 0-7695-2120-7. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
30 | Yan-Cheng Chang, Chun-Yun Hsiao, Chi-Jen Lu |
On the Impossibilities of Basing One-Way Permutations on Central Cryptographic Primitives. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ASIACRYPT ![In: Advances in Cryptology - ASIACRYPT 2002, 8th International Conference on the Theory and Application of Cryptology and Information Security, Queenstown, New Zealand, December 1-5, 2002, Proceedings, pp. 110-124, 2002, Springer, 3-540-00171-9. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
30 | Emma Enström, Viggo Kann |
Computer lab work on theory. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ITiCSE ![In: Proceedings of the 15th Annual SIGCSE Conference on Innovation and Technology in Computer Science Education, ITiCSE 2010, Bilkent, Ankara, Turkey, June 26-30, 2010, pp. 93-97, 2010, ACM, 978-1-60558-729-5. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
computer lab work, learning theoretical computer science, reductions |
30 | Marcio K. Oikawa, João Eduardo Ferreira, Simon Malkowski, Calton Pu |
Towards Algorithmic Generation of Business Processes: From Business Step Dependencies to Process Algebra Expressions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
BPM ![In: Business Process Management, 7th International Conference, BPM 2009, Ulm, Germany, September 8-10, 2009. Proceedings, pp. 80-96, 2009, Springer, 978-3-642-03847-1. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
series-parallel reductions and process algebra, business process modeling, directed acyclic graphs |
30 | Chris Peikert, Alon Rosen |
Lattices that admit logarithmic worst-case to average-case connection factors. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STOC ![In: Proceedings of the 39th Annual ACM Symposium on Theory of Computing, San Diego, California, USA, June 11-13, 2007, pp. 478-487, 2007, ACM, 978-1-59593-631-8. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
algebraic number theory, worst-case to average-case reductions, lattices |
30 | Jin-yi Cai, Hong Zhu 0004 |
Progress in Computational Complexity Theory. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Comput. Sci. Technol. ![In: J. Comput. Sci. Technol. 20(6), pp. 735-750, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
computational complexity theory, PCP theorem, logspace complexity, Reingold's theorem, GAP problem, complexity of lattice problems, worst-case to average-case reductions, extractors, pseudorandomness, inapproximability, primality testing, theoretical computer science, holographic algorithms |
30 | John H. Reif |
Fast Spatial Decomposition and Closest Pair Computation for Limited Precision Input. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 28(3), pp. 271-287, 2000. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
Visibility problems, Gap-preserving reductions, Telecommunications, Terrains, Inapproximability, Art gallery |
30 | James C. Corbett |
Using shape analysis to reduce finite-state models of concurrent Java programs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Trans. Softw. Eng. Methodol. ![In: ACM Trans. Softw. Eng. Methodol. 9(1), pp. 51-93, 2000. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
Java, modeling, shape analysis, concurrent systems, state-space reductions, finite-state verification, model extraction |
26 | Damian Kurpiewski, Witold Pazderski, Wojciech Jamroga, Yan Kim |
STV+Reductions: Towards Practical Verification of Strategic Ability Using Model Reductions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2310.18418, 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
26 | Benjamin Y. Chan, Cody Freitag, Rafael Pass |
Universal Reductions: Reductions Relative to Stateful Oracles. ![Search on Bibsonomy](Pics/bibsonomy.png) |
TCC (3) ![In: Theory of Cryptography - 20th International Conference, TCC 2022, Chicago, IL, USA, November 7-10, 2022, Proceedings, Part III, pp. 151-180, 2022, Springer, 978-3-031-22367-9. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
26 | Damian Kurpiewski, Witold Pazderski, Wojciech Jamroga, Yan Kim |
STV+Reductions: Towards Practical Verification of Strategic Ability Using Model Reductions. (PDF / PS) ![Search on Bibsonomy](Pics/bibsonomy.png) |
AAMAS ![In: AAMAS '21: 20th International Conference on Autonomous Agents and Multiagent Systems, Virtual Event, United Kingdom, May 3-7, 2021., pp. 1770-1772, 2021, ACM, 978-1-4503-8307-3. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP BibTeX RDF |
|
26 | Louis Vuilleumier |
Continuous reductions on the Scott domain and decomposability conjecture. (Réductions continues sur le domaine de Scott et conjecture de la décomposabilité). ![Search on Bibsonomy](Pics/bibsonomy.png) |
|
2021 |
RDF |
|
26 | Luc Pellissier |
Reductions and linear approximations. (Réductions et approximations linéaires). ![Search on Bibsonomy](Pics/bibsonomy.png) |
|
2017 |
RDF |
|
26 | Luoshan Xu, Jing Zhao |
Reductions and Saturation Reductions of (Abstract) Knowledge Bases. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISDT ![In: Proceedings of the 6th International Symposium on Domain Theory and Its Applications, ISDT 2013, Hunan University in Changsha, China, October 25-29, 2013, pp. 139-151, 2013, Elsevier. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP DOI BibTeX RDF |
|
26 | Rakesh M. Verma |
Complexity of Normal Form Properties and Reductions for Term Rewriting Problems Complexity of Normal Form Properties and Reductions for Term Rewriting Problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Fundam. Informaticae ![In: Fundam. Informaticae 92(1-2), pp. 145-168, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
26 | Lionel Marie-Magdeleine |
Sous-typage coercitif en présence de réductions non-standards dans un système aux types dépendants. (Coercive subtyping in a system with dependents types and non-standards reductions). ![Search on Bibsonomy](Pics/bibsonomy.png) |
|
2009 |
RDF |
|
26 | Ming-Hong Lai, Chia-Chi Chu, Wu-Shiung Feng |
On the Equivalent of Structure Preserving Reductions Approach and Adjoint Networks Approach for VLSI Interconnect Reductions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEICE Trans. Fundam. Electron. Commun. Comput. Sci. ![In: IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 90-A(2), pp. 411-414, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
26 | Paul Young |
How reductions to sparse sets collapse the polynomial-time hierarchy: a primer: Part II restricted polynomial-time reductions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SIGACT News ![In: SIGACT News 23(4), pp. 83-94, 1992. The full citation details ...](Pics/full.jpeg) |
1992 |
DBLP DOI BibTeX RDF |
|
26 | Paul Young |
How reductions to sparse sets collapse the polynomial-time hierarchy: a primer; part I: polynomial-time Turing reductions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SIGACT News ![In: SIGACT News 23(3), pp. 107-117, 1992. The full citation details ...](Pics/full.jpeg) |
1992 |
DBLP DOI BibTeX RDF |
|
26 | J. Roger Hindley |
Combinatory Reductions and Lambda Reductions Compared. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Math. Log. Q. ![In: Math. Log. Q. 23(7-12), pp. 169-180, 1977. The full citation details ...](Pics/full.jpeg) |
1977 |
DBLP DOI BibTeX RDF |
|
25 | Chi-Jen Lu |
On the Security Loss in Cryptographic Reductions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
EUROCRYPT ![In: Advances in Cryptology - EUROCRYPT 2009, 28th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Cologne, Germany, April 26-30, 2009. Proceedings, pp. 72-87, 2009, Springer, 978-3-642-01000-2. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
25 | Michael Kowalczyk |
Classification of a Class of Counting Problems Using Holographic Reductions. ![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. 472-485, 2009, Springer, 978-3-642-02881-6. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
Fibonacci gates, holographic reduction, interpolation, holographic algorithms |
25 | Jin-yi Cai, Pinyan Lu, Mingji Xia |
Holographic Algorithms by Fibonacci Gates and Holographic Reductions for Hardness. ![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. 644-653, 2008, IEEE Computer Society, 978-0-7695-3436-7. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
25 | Dorothea Baumeister, Jörg Rothe |
The Three-Color and Two-Color TantrixTM Rotation Puzzle Problems Are NP-Complete Via Parsimonious Reductions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LATA ![In: Language and Automata Theory and Applications, Second International Conference, LATA 2008, Tarragona, Spain, March 13-19, 2008. Revised Papers, pp. 76-87, 2008, Springer, 978-3-540-88281-7. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
25 | Sanjam Garg, Raghav Bhaskar, Satyanarayana V. Lokam |
Improved Bounds on Security Reductions for Discrete Log Based Signatures. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CRYPTO ![In: Advances in Cryptology - CRYPTO 2008, 28th Annual International Cryptology Conference, Santa Barbara, CA, USA, August 17-21, 2008. Proceedings, pp. 93-107, 2008, Springer, 978-3-540-85173-8. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
Schnorr Signature Scheme, Provable Security, Random Oracle Model |
25 | Abdullah Konak |
Combining network reductions and simulation to estimate network reliability. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WSC ![In: Proceedings of the Winter Simulation Conference, WSC 2007, Washington, DC, USA, December 9-12, 2007, pp. 2301-2305, 2007, WSC, 1-4244-1306-0. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
25 | Wei-Hua Xu 0003, Wen-Xiu Zhang |
A Novel Algorithm of Matrix Computation for Knowledge Reductions in Inconsistent Ordered Information Systems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FSKD (3) ![In: Fourth International Conference on Fuzzy Systems and Knowledge Discovery, FSKD 2007, 24-27 August 2007, Haikou, Hainan, China, Proceedings, Volume 3, pp. 91-95, 2007, IEEE Computer Society. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
25 | Dan Gutfreund, Amnon Ta-Shma |
Worst-Case to Average-Case Reductions Revisited. ![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. 569-583, 2007, Springer, 978-3-540-74207-4. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
25 | Ryan C. Harkins, John M. Hitchcock, Aduri Pavan |
Strong Reductions and Isomorphism of Complete Sets. ![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. 168-178, 2007, Springer, 978-3-540-77049-7. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
25 | Gautam Gupta, Sanjay V. Rajopadhye |
Simplifying reductions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
POPL ![In: Proceedings of the 33rd ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL 2006, Charleston, South Carolina, USA, January 11-13, 2006, pp. 30-41, 2006, ACM, 1-59593-027-2. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
equational programming, program transformation, incremental computation, loop optimization, polyhedral model |
25 | Eli Gafni |
Read-Write Reductions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICDCN ![In: Distributed Computing and Networking, 8th International Conference, ICDCN 2006, Guwahati, India, December 27-30, 2006., pp. 349-354, 2006, Springer, 3-540-68139-6. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
25 | Srinivas Neginhal, Suraj Kothari |
Event Views and Graph Reductions for Understanding System Level C Code. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICSM ![In: 22nd IEEE International Conference on Software Maintenance (ICSM 2006), 24-27 September 2006, Philadelphia, Pennsylvania, USA, pp. 279-288, 2006, IEEE Computer Society, 0-7695-2354-4. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
25 | Kiminori Matsuzaki, Zhenjiang Hu, Masato Takeichi |
Towards automatic parallelization of tree reductions in dynamic programming. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SPAA ![In: SPAA 2006: Proceedings of the 18th Annual ACM Symposium on Parallelism in Algorithms and Architectures, Cambridge, Massachusetts, USA, July 30 - August 2, 2006, pp. 39-48, 2006, ACM, 1-59593-452-9. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
commutative semiring, parallel tree contraction, parallel programming, dynamic programming, code generator, tree |
25 | Sami Evangelista, Serge Haddad, Jean-François Pradat-Peyre |
Syntactical Colored Petri Nets Reductions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ATVA ![In: Automated Technology for Verification and Analysis, Third International Symposium, ATVA 2005, Taipei, Taiwan, October 4-7, 2005, Proceedings, pp. 202-216, 2005, Springer, 3-540-29209-8. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
25 | Matthew B. Dwyer, John Hatcliff, Robby, Venkatesh Prasad Ranganath |
Exploiting Object Escape and Locking Information in Partial-Order Reductions for Concurrent Object-Oriented Programs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Formal Methods Syst. Des. ![In: Formal Methods Syst. Des. 25(2-3), pp. 199-240, 2004. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
software verifcation, locking discipline, software model checking, partial order reduction, escape analysis |
25 | Lucian Ilie, Gonzalo Navarro 0001, Sheng Yu 0001 |
On NFA Reductions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Theory Is Forever ![In: Theory Is Forever, Essays Dedicated to Arto Salomaa on the Occasion of His 70th Birthday, pp. 112-124, 2004, Springer, 3-540-22393-2. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
Displaying result #1 - #100 of 3353 (100 per page; Change: ) Pages: [ 1][ 2][ 3][ 4][ 5][ 6][ 7][ 8][ 9][ 10][ >>] |
|