Search results for "reductions"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
4	Shih-Wei Liao	Parallelizing User-Defined and Implicit Reductions Globally on Multiprocessors.	Asia-Pacific Computer Systems Architecture Conference	2006	DBLP DOI BibTeX RDF	reduction recognition, implicit reductions, user-defined reductions, parallelization, multiprocessor, multicore, Reduction, data flow analysis, interprocedural analysis
4	Arfst Nickelsen, Till Tantau	Closure of Polynomial Time Partial Information Classes under Polynomial Time Reductions.	FCT	2001	DBLP DOI BibTeX RDF	polynomial time reductions, verboseness, p-selectivity, positive reductions, structural complexity, partial information
3	Dan Gutfreund, Salil P. Vadhan	Limitations of Hardness vs. Randomness under Uniform Reductions.	APPROX-RANDOM	2008	DBLP DOI BibTeX RDF	derandomization, pseudorandom generators, black-box reductions
3	Steven J. Deitz, David Callahan, Bradford L. Chamberlain, Lawrence Snyder	Global-view abstractions for user-defined reductions and scans.	PPOPP	2006	DBLP DOI BibTeX RDF	Chapel, parallel programming, MPI, reductions, scans, parallel prefix
3	Radu Iosif	Symmetry reductions for model checking of concurrent dynamic software.	STTT	2004	DBLP DOI BibTeX RDF	Orbit problem, Temporal logic, Software verification, Symmetry reductions
3	Steven J. Deitz, Bradford L. Chamberlain, Lawrence Snyder	High-level Language Support for User-defined Reductions.	The Journal of Supercomputing	2002	DBLP DOI BibTeX RDF	user-defined reductions, parallel programming, scientific computing, high-level languages
3	Eladio Gutiérrez, Oscar G. Plata, Emilio L. Zapata	On Improving the Performance of Data Partitioning Oriented Parallel Irregular Reductions.	PDP	2002	DBLP DOI BibTeX RDF	Irregular reductions, shared-memory multiprocessor, data locality, workload balancing
3	Edmund M. Clarke, Somesh Jha, Wilfredo R. Marrero	Partial Order Reductions for Security Protocol Verification.	TACAS	2000	DBLP DOI BibTeX RDF	partial order reductions and security, Model checking
3	Jay Belanger, Aduri Pavan, Jie Wang	Reductions Do Not Preserve Fast Convergence Rates in Average Time.	Algorithmica	1999	DBLP DOI BibTeX RDF	Average polynomial time, Distributional problem, Reductions
3	Helena Handschuh, Yiannis Tsiounis, Moti Yung	Decision Oracles are Equivalent to Matching Oracles.	Public Key Cryptography	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
3	Salvador Lucas	Needed Reductions with Context-Sensitive Rewriting.	ALP/HOA	1997	DBLP DOI BibTeX RDF	needed reductions, replacement restrictions, functional programming, strategies, term rewriting systems
3	Jack H. Lutz, Yong Zhao	The Density of Weakly Complete Problems under Adaptive Reductions. (PDF / PS)	IEEE Conference on Computational Complexity	1997	DBLP DOI BibTeX RDF	dense languages, polynomial reductions, sparse languages, weak completeness, computational complexity, complexity classes, resource-bounded measure
3	Helmut Veith	Succinct Representation, Leaf Languages, and Projection Reductions. (PDF / PS)	IEEE Conference on Computational Complexity	1996	DBLP DOI BibTeX RDF	leaf languages, quantifier-free reductions, computational complexity, descriptive complexity, succinct representation
3	Ashish V. Naik, Alan L. Selman	A Note on P-selective sets and on Adaptive versus Nonadaptive Queries to NP. (PDF / PS)	IEEE Conference on Computational Complexity	1996	DBLP DOI BibTeX RDF	P, p-selective, adaptive reductions, nonadaptive reductions, complexity classes, NP
3	Richard Kennaway, Jan Willem Klop, M. Ronan Sleep, Fer-Jan de Vries	Transfinite Reductions in Orthogonal Term Rewriting Systems (Extended Abstract).	RTA	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
2	Alfred Strey	On the Efficient Implementation of Reductions on the Cell Broadband Engine.	PDP	2010	DBLP DOI BibTeX RDF	Reductions, Cell Broadband Engine
2	Vignesh T. Ravi, Wenjing Ma, David Chiu, Gagan Agrawal	Compiler and runtime support for enabling generalized reduction computations on heterogeneous parallel configurations.	ICS	2010	DBLP DOI BibTeX RDF	dynamic work distribution, generalized reductions, multi-cores, GPGPU, heterogeneous systems
2	Emma Enström, Viggo Kann	Computer lab work on theory.	ITiCSE	2010	DBLP DOI BibTeX RDF	computer lab work, learning theoretical computer science, reductions
2	Ahto Buldas, Aivo Jürgenson, Margus Niitsoo	Efficiency Bounds for Adversary Constructions in Black-Box Reductions.	ACISP	2009	DBLP DOI BibTeX RDF
2	Anuj Dawar, Yuguo He	Parameterized Complexity Classes under Logical Reductions.	MFCS	2009	DBLP DOI BibTeX RDF
2	Astrid Rakow	Decompositional Petri Net Reductions.	IFM	2009	DBLP DOI BibTeX RDF
2	Frédéric Lang, Radu Mateescu	Partial Order Reductions Using Compositional Confluence Detection.	FM	2009	DBLP DOI BibTeX RDF
2	Chi-Jen Lu	On the Security Loss in Cryptographic Reductions.	EUROCRYPT	2009	DBLP DOI BibTeX RDF
2	Michael Kowalczyk	Classification of a Class of Counting Problems Using Holographic Reductions.	COCOON	2009	DBLP DOI BibTeX RDF	Fibonacci gates, holographic reduction, interpolation, holographic algorithms
2	Madhur Tulsiani	CSP gaps and reductions in the lasserre hierarchy.	STOC	2009	DBLP DOI BibTeX RDF	constraint satisfaction, semidefinite programming, integrality gaps
2	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.	BPM	2009	DBLP DOI BibTeX RDF	series-parallel reductions and process algebra, business process modeling, directed acyclic graphs
2	Maria-Florina Balcan, Nikhil Bansal, Alina Beygelzimer, Don Coppersmith, John Langford, Gregory B. Sorkin	Robust reductions from ranking to classification.	Machine Learning	2008	DBLP DOI BibTeX RDF	Classification, Ranking, Reductions
2	Christophe Pajault, Jean-François Pradat-Peyre, Pierre Rousseau	Adapting Petri Nets Reductions to Promela Specifications.	FORTE	2008	DBLP DOI BibTeX RDF
2	Daniele Micciancio	Efficient reductions among lattice problems.	SODA	2008	DBLP DOI BibTeX RDF
2	Dorothea Baumeister, Jörg Rothe	The Three-Color and Two-Color TantrixTM Rotation Puzzle Problems Are NP-Complete Via Parsimonious Reductions.	LATA	2008	DBLP DOI BibTeX RDF
2	Omid David-Tabibi, Nathan S. Netanyahu	Extended Null-Move Reductions.	Computers and Games	2008	DBLP DOI BibTeX RDF
2	Sanjam Garg, Raghav Bhaskar, Satyanarayana V. Lokam	Improved Bounds on Security Reductions for Discrete Log Based Signatures.	CRYPTO	2008	DBLP DOI BibTeX RDF	Schnorr Signature Scheme, Provable Security, Random Oracle Model
2	Sarvani S. Vakkalanka, Ganesh Gopalakrishnan, Robert M. Kirby	Dynamic Verification of MPI Programs with Reductions in Presence of Split Operations and Relaxed Orderings.	CAV	2008	DBLP DOI BibTeX RDF
2	Jin-yi Cai, Pinyan Lu, Mingji Xia	Holographic Algorithms by Fibonacci Gates and Holographic Reductions for Hardness.	FOCS	2008	DBLP DOI BibTeX RDF
2	Aleksander Wojdyga	Short Proofs of Strong Normalization.	MFCS	2008	DBLP DOI BibTeX RDF	permutative reductions, lambda calculus, system F, CPS-translation, strong normalization
2	Michalis D. Galanis, Gregory Dimitroulakos, Costas E. Goutis	Performance and Energy Consumption Improvements in Microprocessor Systems Utilizing a Coprocessor Data-Path.	Signal Processing Systems	2008	DBLP DOI BibTeX RDF	coprocessor data-path, template units, kernels, performance improvements, design flow, energy reductions, architectural synthesis
2	Luca Trevisan, Salil P. Vadhan	Pseudorandomness and Average-Case Complexity Via Uniform Reductions.	Computational Complexity	2007	DBLP DOI BibTeX RDF	Subject classification, 68Q10
2	Eu-Jin Goh, Stanislaw Jarecki, Jonathan Katz, Nan Wang	Efficient Signature Schemes with Tight Reductions to the Diffie-Hellman Problems.	J. Cryptology	2007	DBLP DOI BibTeX RDF
2	Kazuhiko Kakehi, Kiminori Matsuzaki, Kento Emoto	Efficient Parallel Tree Reductions on Distributed Memory Environments.	International Conference on Computational Science	2007	DBLP DOI BibTeX RDF	Tree reduction, parentheses matching, parallel algorithm, BSP
2	Rahul Tripathi	Complexity Upper Bounds for Classical Locally Random Reductions Using a Quantum Computational Argument.	MFCS	2007	DBLP DOI BibTeX RDF
2	Wei-Hua Xu, Wen-Xiu Zhang	A Novel Algorithm of Matrix Computation for Knowledge Reductions in Inconsistent Ordered Information Systems.	FSKD	2007	DBLP DOI BibTeX RDF
2	Dan Gutfreund, Amnon Ta-Shma	Worst-Case to Average-Case Reductions Revisited.	APPROX-RANDOM	2007	DBLP DOI BibTeX RDF
2	Abdullah Konak	Combining network reductions and simulation to estimate network reliability.	Winter Simulation Conference	2007	DBLP DOI BibTeX RDF
2	Ryan C. Harkins, John M. Hitchcock, Aduri Pavan	Strong Reductions and Isomorphism of Complete Sets.	FSTTCS	2007	DBLP DOI BibTeX RDF
2	Chris Peikert, Alon Rosen	Lattices that admit logarithmic worst-case to average-case connection factors.	STOC	2007	DBLP DOI BibTeX RDF	algebraic number theory, worst-case to average-case reductions, lattices
2	Jianer Chen, Xiuzhen Huang, Iyad A. Kanj, Ge Xia	On the computational hardness based on linear FPT-reductions.	J. Comb. Optim.	2006	DBLP DOI BibTeX RDF	FPT-reduction, Complexity, Linear, Hardness
2	Eli Gafni	Read-Write Reductions.	ICDCN	2006	DBLP DOI BibTeX RDF
2	John M. Hitchcock, Aduri Pavan	Comparing Reductions to NP-Complete Sets.	ICALP	2006	DBLP DOI BibTeX RDF
2	Gautam Gupta, Sanjay V. Rajopadhye	Simplifying reductions.	POPL	2006	DBLP DOI BibTeX RDF	equational programming, program transformation, incremental computation, loop optimization, polyhedral model
2	Kiminori Matsuzaki, Zhenjiang Hu, Masato Takeichi	Towards automatic parallelization of tree reductions in dynamic programming.	SPAA	2006	DBLP DOI BibTeX RDF	commutative semiring, parallel tree contraction, parallel programming, dynamic programming, code generator, tree
2	Srinivas Neginhal, Suraj Kothari	Event Views and Graph Reductions for Understanding System Level C Code.	ICSM	2006	DBLP DOI BibTeX RDF
2	Ming-Hong Lai, Chia-Chi Chu, Wu-Shiung Feng	MIMO interconnects order reductions by using the global Arnoldi algorithm.	ISCAS	2006	DBLP DOI BibTeX RDF
2	Ulrich Flegel, Joachim Biskup	Requirements of Information Reductions for Cooperating Intrusion Detection Agents.	ETRICS	2006	DBLP DOI BibTeX RDF
2	Adi Akavia, Oded Goldreich, Shafi Goldwasser, Dana Moshkovitz	On basing one-way functions on NP-hardness.	STOC	2006	DBLP DOI BibTeX RDF	adaptive versus non-adaptive machines, reductions, one-way functions, interactive proof systems, average-case complexity
2	Yan-Cheng Chang, Chun-Yuan Hsiao, Chi-Jen Lu	The Impossibility of Basing One-Way Permutations on Central Cryptographic Primitives.	J. Cryptology	2006	DBLP DOI BibTeX RDF	Private information retrieval, Cryptographic primitives, Black-box reductions, Trapdoor functions, One-way permutations
2	Sami Evangelista, Serge Haddad, Jean-François Pradat-Peyre	Syntactical Colored Petri Nets Reductions.	ATVA	2005	DBLP DOI BibTeX RDF
2	Chia-Chi Chu, Herng-Jer Lee, Wu-Shiung Feng, Ming-Hong Lai	Interconnect model reductions by using the AORA algorithm with considering the adjoint network.	ISCAS	2005	DBLP DOI BibTeX RDF
2	Jianer Chen, Xiuzhen Huang, Iyad A. Kanj, Ge Xia	W-Hardness Under Linear FPT-Reductions: Structural Properties and Further Applications.	COCOON	2005	DBLP DOI BibTeX RDF
2	Lane A. Hemaspaandra, Mayur Thakur	Query-Monotonic Turing Reductions.	COCOON	2005	DBLP DOI BibTeX RDF
2	Jin-yi Cai, Hong Zhu	Progress in Computational Complexity Theory.	J. Comput. Sci. Technol.	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
2	Matthew B. Dwyer, John Hatcliff, Robby, Venkatesh Prasad Ranganath	Exploiting Object Escape and Locking Information in Partial-Order Reductions for Concurrent Object-Oriented Programs.	Formal Methods in System Design	2004	DBLP DOI BibTeX RDF	software verifcation, locking discipline, software model checking, partial order reduction, escape analysis
2	Degang Chen	The Part Reductions in Information Systems.	Rough Sets and Current Trends in Computing	2004	DBLP DOI BibTeX RDF
2	Anderson C. A. Nascimento, Jörn Müller-Quade, Hideki Imai	Bit String Commitment Reductions with a Non-zero Rate.	CT-RSA	2004	DBLP DOI BibTeX RDF
2	Lucian Ilie, Gonzalo Navarro, Sheng Yu	On NFA Reductions.	Theory Is Forever	2004	DBLP DOI BibTeX RDF
2	Christian Glaßer, Alan L. Selman, Samik Sengupta	Reductions between Disjoint NP-Pairs.	IEEE Conference on Computational Complexity	2004	DBLP DOI BibTeX RDF
2	Nick Benton, Andrew Kennedy, Sam Lindley, Claudio V. Russo	Shrinking Reductions in SML.NET.	IFL	2004	DBLP DOI BibTeX RDF
2	Wenjing Rao, Alex Orailoglu, G. Su	Frugal linear network-based test decompression for drastic test cost reductions.	ICCAD	2004	DBLP DOI BibTeX RDF
2	Renato Renner, Stefan Wolf	The Exact Price for Unconditionally Secure Asymmetric Cryptography.	EUROCRYPT	2004	DBLP DOI BibTeX RDF	quantum key agreement, reductions of information-theoretic primitives, authentication, Information-theoretic security, privacy amplification, information reconciliation
2	Adam L. Young, Moti Yung	Relationships Between Diffie-Hellman and "Index Oracles".	SCN	2004	DBLP DOI BibTeX RDF	Diffie-Hellman (DH), Computational Diffie-Hellman, Decision Diffie-Hellman, JDL, LDL, Public Key Cryptography, Oracles, Black-Box Reductions, Discrete-Log
2	Edmund M. Clarke, Somesh Jha, Wilfredo R. Marrero	Efficient verification of security protocols using partial-order reductions.	STTT	2003	DBLP DOI BibTeX RDF	Model checking, Security protocols, Partial-order reduction
2	Matthew B. Dwyer, Robby, Xianghua Deng, John Hatcliff	Space Reductions for Model Checking Quasi-Cyclic Systems.	EMSOFT	2003	DBLP DOI BibTeX RDF
2	François-Régis Sinot, Maribel Fernández, Ian Mackie	Efficient Reductions with Director Strings.	RTA	2003	DBLP DOI BibTeX RDF
2	Andrej Bogdanov, Luca Trevisan	On Worst-Case to Average-Case Reductions for NP Problems.	FOCS	2003	DBLP DOI BibTeX RDF
2	A. Prasad Sistla	Symmetry Reductions in Model-Checking.	VMCAI	2003	DBLP DOI BibTeX RDF
2	Eu-Jin Goh, Stanislaw Jarecki	A Signature Scheme as Secure as the Diffie-Hellman Problem.	EUROCRYPT	2003	DBLP DOI BibTeX RDF	Computational Diffie-Hellman, Discrete Logarithm, Random Oracle Model, Signature Schemes, Exact Security, Tight Reductions
2	Renato Renner, Stefan Wolf	New Bounds in Secret-Key Agreement: The Gap between Formation and Secrecy Extraction.	EUROCRYPT	2003	DBLP DOI BibTeX RDF	reductions among primitives, information measures, quantum entanglement purification, Information-theoretic security, secret-key agreement
2	Ziv Bar-Yossef, Ravi Kumar, D. Sivakumar	Reductions in streaming algorithms, with an application to counting triangles in graphs.	SODA	2002	DBLP DOI BibTeX RDF
2	Robert A. Hearn, Erik D. Demaine	The Nondeterministic Constraint Logic Model of Computation: Reductions and Applications.	ICALP	2002	DBLP DOI BibTeX RDF
2	Gary M. Zoppetti, Gagan Agrawal, Rishi Kumar	Compiler and Runtime Support for Irregular Reductions on a Multithreaded Architecture. (PDF / PS)	IPDPS	2002	DBLP DOI BibTeX RDF
2	Gautam Gupta, Sanjay V. Rajopadhye, Patrice Quinton	Scheduling reductions on realistic machines.	SPAA	2002	DBLP DOI BibTeX RDF	parametric integer programming, dependence analysis, automatic parallelization, scheduling theory, polyhedral model, affine recurrence equations
2	Luca Trevisan, Salil P. Vadhan	Pseudorandomness and Average-Case Complexity via Uniform Reductions. (PDF / PS)	IEEE Conference on Computational Complexity	2002	DBLP DOI BibTeX RDF
2	Ruoming Jin, Gagan Agrawal	Performance prediction for random write reductions: a case study in modeling shared memory programs.	SIGMETRICS	2002	DBLP DOI BibTeX RDF
2	Manindra Agrawal	Pseudo-Random Generators and Structure of Complete Degrees. (PDF / PS)	IEEE Conference on Computational Complexity	2002	DBLP DOI BibTeX RDF	Completeness, Reductions, Pseudo-random Generators
2	Tobias Polzin, Siavash Vahdati Daneshmand	Extending Reduction Techniques for the Steiner Tree Problem.	ESA	2002	DBLP DOI BibTeX RDF	Reductions, Steiner Problem
2	Peter Niebert, Michaela Huhn, Sarah Zennou, Denis Lugiez	Local First Search - A New Paradigm for Partial Order Reductions.	CONCUR	2001	DBLP DOI BibTeX RDF
2	Eladio Gutiérrez, Oscar G. Plata, Emilio L. Zapata	Improving parallel irregular reductions using partial array expansion.	SC	2001	DBLP DOI BibTeX RDF
2	Jesús Corbal, Roger Espasa, Mateo Valero	On the Efficiency of Reductions in µ-SIMD Media Extensions.	IEEE PACT	2001	DBLP DOI BibTeX RDF
2	María Jesús Garzarán, Milos Prvulovic, Ye Zhang, Josep Torrellas, Alin Jula, Hao Yu, Lawrence Rauchwerger	Architectural Support for Parallel Reductions in Scalable Shared-Memory Multiprocessors.	IEEE PACT	2001	DBLP DOI BibTeX RDF
2	Javier Esparza, Claus Schröter	Net Reductions for LTL Model-Checking.	CHARME	2001	DBLP DOI BibTeX RDF
2	Rudolf Berghammer, Thorsten Hoffmann	Calculating a Relational Program for Transitive Reductions of Strongly Connected Graphs.	RelMiCS	2001	DBLP DOI BibTeX RDF
2	Paolo D'Arco, Douglas R. Stinson	Generalized Zig-zag Functions and Oblivious Transfer Reductions.	Selected Areas in Cryptography	2001	DBLP DOI BibTeX RDF	Zig-zag Functions, Ramp Schemes, Oblivious Transfer
2	Simon St. James, Ulrich Ultes-Nitsche	Computing property-preserving behaviour abstractions from trace reductions: abstraction-based verification of linear-time properties under fairness.	PODC	2001	DBLP DOI BibTeX RDF	behaviour abstraction, satisfaction within fairness, weakly continuation-closed homomorphisms, partial-order methods, trace reduction
2	Gary M. Zoppetti, Gagan Agrawal, Rishi Kumar	Impact of Data Distribution on Performance of Irregular Reductions on Multithreaded Architectures.	HPCN	2001	DBLP DOI BibTeX RDF
2	Eladio Gutiérrez, Oscar G. Plata, Emilio L. Zapata	Balanced, Locality-Based Parallel Irregular Reductions.	LCPC	2001	DBLP DOI BibTeX RDF
2	Harry B. Hunt III, Madhav V. Marathe, Richard Edwin Stearns	Strongly-local reductions and the complexity/efficient approximability of algebra and optimization on abstract algebraic structures.	ISSAC	2001	DBLP DOI BibTeX RDF
2	Jan-Jan Wu	An Interleaving Transformation for Parallelizing Reductions for Distributed-Memory Parallel Machines.	The Journal of Supercomputing	2000	DBLP DOI BibTeX RDF	triangular systems solver, parallel processing, program transformation, reduction, parallelizing compilation, distributed-memory
2	Jean-Pierre Krimm, Laurent Mounier	Compositional State Space Generation with Partial Order Reductions for Asynchronous Communicating Systems.	TACAS	2000	DBLP DOI BibTeX RDF
2	Siegfried Benkner, Thomas Brandes	Efficient Parallelization of Unstructured Reductions on Shared Memory Parallel Architectures.	IPDPS Workshops	2000	DBLP DOI BibTeX RDF
2	Arnaud Durand, Miki Hermann, Phokion G. Kolaitis	Subtractive Reductions and Complete Problems for Counting Complexity Classes.	MFCS	2000	DBLP DOI BibTeX RDF
2	Eladio Gutiérrez, Oscar G. Plata, Emilio L. Zapata	A compiler method for the parallel execution of irregular reductions in scalable shared memory multiprocessors.	ICS	2000	DBLP DOI BibTeX RDF