Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
129 | Tomoyuki Yamakami |
Nearly Bounded Error Probabilistic Sets. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CIAC ![In: Algorithms and Complexity, 5th Italian Conference, CIAC 2003, Rome, Italy, May 28-30, 2003, Proceedings, pp. 213-226, 2003, Springer, 3-540-40176-8. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
94 | Russell Impagliazzo |
Can every randomized algorithm be derandomized? ![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. 373-374, 2006, ACM, 1-59593-134-1. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
algebraic circuit complexity, probabilistic algorithms, derandomization, circuit complexity, complexity classes, pseudo-randomness |
93 | Ivana Cerná, Mojmír Kretínský, Antonín Kucera 0001 |
Comparing Expressibility of Normed BPA and Normed BPP Processes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Acta Informatica ![In: Acta Informatica 36(3), pp. 233-256, 1999. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
|
93 | Stathis Zachos |
A New Characterization of BPP. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FSTTCS ![In: Foundations of Software Technology and Theoretical Computer Science, Fourth Conference, Bangalore, India, December 13-15, 1984, Proceedings, pp. 179-187, 1984, Springer, 3-540-13883-8. The full citation details ...](Pics/full.jpeg) |
1984 |
DBLP DOI BibTeX RDF |
Probalistic algorithms, polynomial time complexity classes, oracles, polynomial hierarchies |
71 | Alexander E. Andreev, Andrea E. F. Clementi, José D. P. Rolim, Luca Trevisan |
Weak Random Sources, Hitting Sets, and BPP Simulations. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 38th Annual Symposium on Foundations of Computer Science, FOCS '97, Miami Beach, Florida, USA, October 19-22, 1997, pp. 264-272, 1997, IEEE Computer Society, 0-8186-8197-7. The full citation details ...](Pics/full.jpeg) |
1997 |
DBLP DOI BibTeX RDF |
BPP simulations, parallel classes, lower bound, sampling, polynomial time, randomised algorithms, hitting sets, weak random source, weak random sources, min-entropy |
59 | Mariusz Glabowski |
Recurrent Method for Blocking Probability Calculation in Multi-service Switching Networks with BPP Traffic. ![Search on Bibsonomy](Pics/bibsonomy.png) |
EPEW ![In: Computer Performance Engineering, 5th European Performance Engineering Workshop, EPEW 2008, Palma de Mallorca, Spain, September 24-25, 2008. Proceedings, pp. 152-167, 2008, Springer, 978-3-540-87411-9. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
BPP traffic, blocking probability, switching networks |
59 | Zheng He, Qi Zhang 0013, Villy Bæk Iversen |
Trunk Reservation in Multi-service Networks with BPP Traffic. ![Search on Bibsonomy](Pics/bibsonomy.png) |
EuroNGI Workshop ![In: Wireless Systems and Mobility in Next Generation Internet, Third International Workshop of the EURO-NGI Network of Excellence, Sitges, Spain, June 6-9, 2006, Revised Selected Papers, pp. 200-212, 2006, Springer, 978-3-540-70968-8. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
BPP traffic, multi-rate traffic, wireless systems, trunk reservation |
59 | Jirí Srba |
Note on the Tableau Technique for Commutative Transition Systems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FoSSaCS ![In: Foundations of Software Science and Computation Structures, 5th International Conference, FOSSACS 2002. Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2002 Grenoble, France, April 8-12, 2002, Proceedings, pp. 387-401, 2002, Springer, 3-540-43366-X. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
59 | Richard Mayr |
On the Complexity of Bisimulation Problems for Basic Parallel Processes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP ![In: Automata, Languages and Programming, 27th International Colloquium, ICALP 2000, Geneva, Switzerland, July 9-15, 2000, Proceedings, pp. 329-341, 2000, Springer, 3-540-67715-1. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
|
58 | Petr Jancar, Martin Kot, Zdenek Sawa |
Normed BPA vs. Normed BPP Revisited. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CONCUR ![In: CONCUR 2008 - Concurrency Theory, 19th International Conference, CONCUR 2008, Toronto, Canada, August 19-22, 2008. Proceedings, pp. 434-446, 2008, Springer, 978-3-540-85360-2. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
Basic Process Algebra, Basic Parallel Processes, verification, equivalence checking, bisimulation equivalence |
58 | Slawomir Lasota 0001 |
Decidability of Strong Bisimilarity for Timed BPP. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CONCUR ![In: CONCUR 2002 - Concurrency Theory, 13th International Conference, Brno, Czech Republic, August 20-23, 2002, Proceedings, pp. 562-578, 2002, Springer, 3-540-44043-7. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
58 | Avi Wigderson |
De-Randomizing BPP: The State of the Art. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: Proceedings of the 14th Annual IEEE Conference on Computational Complexity, Atlanta, Georgia, USA, May 4-6, 1999, pp. 76-, 1999, IEEE Computer Society, 0-7695-0075-7. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
|
48 | Eric Allender, Martin Strauss 0001 |
Measure on Small Complexity Classes, with Applications for BPP ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 35th Annual Symposium on Foundations of Computer Science, Santa Fe, New Mexico, USA, 20-22 November 1994, pp. 807-818, 1994, IEEE Computer Society, 0-8186-6580-7. The full citation details ...](Pics/full.jpeg) |
1994 |
DBLP DOI BibTeX RDF |
resource-bounded measure theory, small complexity classes, BPP, subexponential-time classes, class of sets, resource-bounded measure |
47 | Mariusz Glabowski |
Modelling of state-dependent multirate systems carrying BPP traffic. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Ann. des Télécommunications ![In: Ann. des Télécommunications 63(7-8), pp. 393-407, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
State-dependent systems, BPP traffic, Multiservice traffic, Bandwidth reservation |
47 | David Zuckerman |
Simulating BPP Using a General Weak Random Source ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 32nd Annual Symposium on Foundations of Computer Science, San Juan, Puerto Rico, 1-4 October 1991, pp. 79-89, 1991, IEEE Computer Society, 0-8186-2445-0. The full citation details ...](Pics/full.jpeg) |
1991 |
DBLP DOI BibTeX RDF |
probe search, BPP simulation, general weak random source, R-bit string, approximation algorithms, polynomial time, maximum clique, weak random source |
47 | Haiyan Chen |
More on Weak Bisimilarity of Normed Basic Parallel Processes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
TAMC ![In: Theory and Applications of Models of Computation, 5th International Conference, TAMC 2008, Xi'an, China, April 25-29, 2008. Proceedings, pp. 192-203, 2008, Springer, 978-3-540-79227-7. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
47 | Xiaoyang Gu, Jack H. Lutz |
Dimension Characterizations of Complexity Classes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
MFCS ![In: Mathematical Foundations of Computer Science 2006, 31st International Symposium, MFCS 2006, Stará Lesná, Slovakia, August 28-September 1, 2006, Proceedings, pp. 471-479, 2006, Springer, 3-540-37791-3. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
47 | Clemens Grabmayer, Jan Willem Klop, Bas Luttik |
Some Remarks on Definability of Process Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CONCUR ![In: CONCUR 2006 - Concurrency Theory, 17th International Conference, CONCUR 2006, Bonn, Germany, August 27-30, 2006, Proceedings, pp. 16-36, 2006, Springer, 3-540-37376-4. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
47 | Jirí Srba |
Strong Bisimilarity and Regularity of Basic Parallel Processes Is PSPACE-Hard. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: STACS 2002, 19th Annual Symposium on Theoretical Aspects of Computer Science, Antibes - Juan les Pins, France, March 14-16, 2002, Proceedings, pp. 535-546, 2002, Springer, 3-540-43283-3. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
47 | Amirali Baniasadi, Andreas Moshovos |
Branch Predictor Prediction: A Power-Aware Branch Predictor for High-Performance Processors. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICCD ![In: 20th International Conference on Computer Design (ICCD 2002), VLSI in Computers and Processors, 16-18 September 2002, Freiburg, Germany, Proceedings, pp. 458-461, 2002, IEEE Computer Society, 0-7695-1700-5. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
47 | Russell Impagliazzo, Valentine Kabanets, Avi Wigderson |
In Search of an Easy Witness: Exponential Time vs. Probabilistic Polynomial Time. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: Proceedings of the 16th Annual IEEE Conference on Computational Complexity, Chicago, Illinois, USA, June 18-21, 2001, pp. 2-12, 2001, IEEE Computer Society, 0-7695-1053-1. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
46 | Hongfei Fu 0001 |
Branching Bisimilarity between Finite-State Systems and BPA or Normed BPP Is Polynomial-Time Decidable. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APLAS ![In: Programming Languages and Systems, 7th Asian Symposium, APLAS 2009, Seoul, Korea, December 14-16, 2009. Proceedings, pp. 327-342, 2009, Springer, 978-3-642-10671-2. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
46 | Naoki Kobayashi 0001, Takashi Suto |
Undecidability of 2-Label BPP Equivalences and Behavioral Type Systems for the pi -Calculus. ![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. 740-751, 2007, Springer, 978-3-540-73419-2. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
46 | Sibylle B. Fröschle, Slawomir Lasota 0001 |
Decomposition and Complexity of Hereditary History Preserving Bisimulation on BPP. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CONCUR ![In: CONCUR 2005 - Concurrency Theory, 16th International Conference, CONCUR 2005, San Francisco, CA, USA, August 23-26, 2005, Proceedings, pp. 263-277, 2005, Springer, 3-540-28309-9. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
46 | Alexander E. Andreev, Andrea E. F. Clementi, José D. P. Rolim |
Hitting Sets Derandomize BPP. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP ![In: Automata, Languages and Programming, 23rd International Colloquium, ICALP96, Paderborn, Germany, 8-12 July 1996, Proceedings, pp. 357-368, 1996, Springer, 3-540-61440-0. The full citation details ...](Pics/full.jpeg) |
1996 |
DBLP DOI BibTeX RDF |
|
46 | Nobuki Yoda, Takeo Igarashi |
Decomposition of 32 bpp into 16 bpp textures with alpha. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SIGGRAPH Posters ![In: Special Interest Group on Computer Graphics and Interactive Techniques Conference, SIGGRAPH '15, Los Angeles, CA, USA, August 9-13, 2015, Posters Proceedings, pp. 33:1, 2015, ACM, 978-1-4503-3632-1. The full citation details ...](Pics/full.jpeg) |
2015 |
DBLP DOI BibTeX RDF |
|
46 | Oded Goldreich 0001, David Zuckerman |
Another Proof That BPP Í PH\mathcal{BPP}\subseteq \mathcal{PH} (and More). ![Search on Bibsonomy](Pics/bibsonomy.png) |
Studies in Complexity and Cryptography ![In: Studies in Complexity and Cryptography. Miscellanea on the Interplay between Randomness and Computation - In Collaboration with Lidor Avigad, Mihir Bellare, Zvika Brakerski, Shafi Goldwasser, Shai Halevi, Tali Kaufman, Leonid Levin, Noam Nisan, Dana Ron, Madhu Sudan, Luca Trevisan, Salil Vadhan, Avi Wigderson, David Zuckerman, pp. 40-53, 2011, Springer, 978-3-642-22669-4. The full citation details ...](Pics/full.jpeg) |
2011 |
DBLP DOI BibTeX RDF |
|
46 | Philippe Moser |
BPP has effective dimension at most 1/2 unless BPP=EXP ![Search on Bibsonomy](Pics/bibsonomy.png) |
Electron. Colloquium Comput. Complex. ![In: Electron. Colloquium Comput. Complex. TR03, 2003. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP BibTeX RDF |
|
37 | Valentine Kabanets, Russell Impagliazzo |
Derandomizing polynomial identity tests means proving circuit lower bounds. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STOC ![In: Proceedings of the 35th Annual ACM Symposium on Theory of Computing, June 9-11, 2003, San Diego, CA, USA, pp. 355-364, 2003, ACM, 1-58113-674-9. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
BPP, NEXP, circuit lower bounds, derandomization, polynomial identity testing |
37 | Alexander E. Andreev, Andrea E. F. Clementi, José D. P. Rolim |
A New General Derandomization Method. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. ACM ![In: J. ACM 45(1), pp. 179-213, 1998. The full citation details ...](Pics/full.jpeg) |
1998 |
DBLP DOI BibTeX RDF |
BPP, derandomization, Boolean circuits |
36 | Juan Javier González Barbosa, Laura Cruz Reyes, José Francisco Delgado Orta, Héctor Joaquín Fraire Huacuja, Guadalupe Castilla Valdez, Víctor Jesús Sosa Sosa |
Less Expensive Formulation for a Realistic Routing-Scheduling-Loading Problem (RoSLoP). ![Search on Bibsonomy](Pics/bibsonomy.png) |
DCAI ![In: International Symposium on Distributed Computing and Artificial Intelligence, DCAI 2008, University of Salamanca, Spain, 22th-24th October 2008, pp. 481-489, 2008, Springer, 978-3-540-85862-1. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
Routing-Scheduling-Loading Problem (RoSLoP), Bin Packing Problem (BPP), Complexity, Vehicle Routing Problem (VRP) |
35 | Wojciech Czerwinski, Sibylle B. Fröschle, Slawomir Lasota 0001 |
Partially-Commutative Context-Free Processes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CONCUR ![In: CONCUR 2009 - Concurrency Theory, 20th International Conference, CONCUR 2009, Bologna, Italy, September 1-4, 2009. Proceedings, pp. 259-273, 2009, Springer, 978-3-642-04080-1. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
35 | Xiaoyang Gu, Jack H. Lutz |
Dimension Characterizations of Complexity Classes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comput. Complex. ![In: Comput. Complex. 17(4), pp. 459-474, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
Subject classification, 68Q15 |
35 | Lucia Acciai, Michele Boreale |
Type Abstractions of Name-Passing Processes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FSEN ![In: International Symposium on Fundamentals of Software Engineering, International Symposium, FSEN 2007, Tehran, Iran, April 17-19, 2007, Proceedings, pp. 302-317, 2007, Springer, 978-3-540-75697-2. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
35 | Jag Mohan Singh, P. J. Narayanan |
Progressive Decomposition of Point Clouds Without Local Planes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICVGIP ![In: Computer Vision, Graphics and Image Processing, 5th Indian Conference, ICVGIP 2006, Madurai, India, December 13-16, 2006, Proceedings, pp. 364-375, 2006, Springer, 3-540-68301-1. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
35 | Stefano Lonardi, Yu Luo |
Gridding and Compression of Microarray Images. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CSB ![In: 3rd International IEEE Computer Society Computational Systems Bioinformatics Conference, CSB 2004, Stanford, CA, USA, August 16-19, 2004, pp. 122-130, 2004, IEEE Computer Society, 0-7695-2194-0. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
35 | Jirí Srba |
Strong bisimilarity of simple process algebras: complexity lower bounds. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Acta Informatica ![In: Acta Informatica 39(6-7), pp. 469-499, 2003. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
35 | Rebecka Jörnsten, Bin Yu 0001 |
Compression of cDNA microarray images. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISBI ![In: Proceedings of the 2002 IEEE International Symposium on Biomedical Imaging, Ritz-Carlton Hotel, Washington, DC, USA, 7-10 June 2002, pp. 38-41, 2002, IEEE, 0-7803-7584-X. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
35 | Oded Goldreich 0001, Avi Wigderson |
Derandomization That Is Rarely Wrong from Short Advice That Is Typically Good. ![Search on Bibsonomy](Pics/bibsonomy.png) |
RANDOM ![In: Randomization and Approximation Techniques, 6th International Workshop, RANDOM 2002, Cambridge, MA, USA, September 13-15, 2002, Proceedings, pp. 209-223, 2002, Springer, 3-540-44147-6. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
35 | Valentine Kabanets |
Easiness Assumptions and Hardness Tests: Trading Time for Zero Error. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: Proceedings of the 15th Annual IEEE Conference on Computational Complexity, Florence, Italy, July 4-7, 2000, pp. 150-157, 2000, IEEE Computer Society, 0-7695-0674-7. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
probabilistic complexity classes, uniform setting, derandomization |
35 | Cynthia Dwork, Moni Naor, Omer Reingold, Larry J. Stockmeyer |
Magic Functions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 40th Annual Symposium on Foundations of Computer Science, FOCS '99, 17-18 October, 1999, New York, NY, USA, pp. 523-534, 1999, IEEE Computer Society, 0-7695-0409-4. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
interactive argument, magic function, selective decommitment, three-round protocol, cryptography, distributed computing, zero knowledge, complexity theory, signature scheme, commitment scheme |
35 | Harry Buhrman, Lance Fortnow |
One-sided Versus Two-sided Error in Probabilistic Computation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: STACS 99, 16th Annual Symposium on Theoretical Aspects of Computer Science, Trier, Germany, March 4-6, 1999, Proceedings, pp. 100-109, 1999, Springer. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
|
35 | Sheng-Chieh Huang, Liang-Gee Chen, Hao-Chieh Chang |
A novel image compression algorithm by using Log-Exp transform. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISCAS (4) ![In: Proceedings of the 1999 International Symposium on Circuits and Systems, ISCAS 1999, Orlando, Florida, USA, May 30 - June 2, 1999, pp. 17-20, 1999, IEEE, 0-7803-5471-0. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
|
35 | Avi Wigderson |
Do Probabilistic Algorithms Outperform Deterministic Ones? ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP ![In: Automata, Languages and Programming, 25th International Colloquium, ICALP'98, Aalborg, Denmark, July 13-17, 1998, Proceedings, pp. 212-214, 1998, Springer, 3-540-64781-3. The full citation details ...](Pics/full.jpeg) |
1998 |
DBLP DOI BibTeX RDF |
|
35 | Juris Hartmanis, Lane A. Hemachandra |
Complexity Classes Without Machines: On Complete Languages for UP. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP ![In: Automata, Languages and Programming, 13th International Colloquium, ICALP86, Rennes, France, July 15-19, 1986, Proceedings, pp. 123-135, 1986, Springer, 3-540-16761-7. The full citation details ...](Pics/full.jpeg) |
1986 |
DBLP DOI BibTeX RDF |
|
35 | Eunice López-Camacho, Hugo Terashima-Marín, Peter Ross, Manuel Valenzuela-Rendón |
Problem-state representations in a hyper-heuristic approach for the 2D irregular BPP. ![Search on Bibsonomy](Pics/bibsonomy.png) |
GECCO ![In: Genetic and Evolutionary Computation Conference, GECCO 2010, Proceedings, Portland, Oregon, USA, July 7-11, 2010, pp. 297-298, 2010, ACM, 978-1-4503-0072-8. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
2D irregular binpacking problems, Problem State Representation, optimization, evolutionary computation, hyper-heuristics |
35 | Junfeng Xiao, Biao Ren, Shiduan Cheng |
A BPP-Based Scheduling Algorithm in Bluetooth Systems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
MSN ![In: Mobile Ad-hoc and Sensor Networks, First International Conference, MSN 2005, Wuhan, China, December 13-15, 2005, Proceedings, pp. 623-632, 2005, Springer, 3-540-30856-3. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
24 | Aravind Srinivasan, David Zuckerman |
Computing with Very Weak Random Sources ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 35th Annual Symposium on Foundations of Computer Science, Santa Fe, New Mexico, USA, 20-22 November 1994, pp. 264-275, 1994, IEEE Computer Society, 0-8186-6580-7. The full citation details ...](Pics/full.jpeg) |
1994 |
DBLP DOI BibTeX RDF |
randomness-efficient Leftover Hash Lemma, very weak random sources, RP algorithms simulation, R-bit string, BPP simulations, Chor-Goldreich sources, expander constructions, probability, hardness, time-space tradeoffs, min-entropy |
24 | Russell Impagliazzo, David Zuckerman |
How to Recycle Random Bits ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 30th Annual Symposium on Foundations of Computer Science, Research Triangle Park, North Carolina, USA, 30 October - 1 November 1989, pp. 248-253, 1989, IEEE Computer Society, 0-8186-1982-1. The full citation details ...](Pics/full.jpeg) |
1989 |
DBLP DOI BibTeX RDF |
random bits, shift register generator, BPP algorithm, information-theoretic lower bound, probabilistic algorithm, pseudorandom generator, linear congruential generator, linear congruential generators |
24 | Aviad Cohen 0001, Avi Wigderson |
Dispersers, Deterministic Amplification, and Weak Random Sources (Extended Abstract) ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 30th Annual Symposium on Foundations of Computer Science, Research Triangle Park, North Carolina, USA, 30 October - 1 November 1989, pp. 14-19, 1989, IEEE Computer Society, 0-8186-1982-1. The full citation details ...](Pics/full.jpeg) |
1989 |
DBLP DOI BibTeX RDF |
weak bit fixing sources, RP algorithm, BPP algorithm, deterministic amplification, bipartite multigraphs, probabilistic algorithms, dispersers, error probability, weak random sources |
23 | Dmitry Itsykson |
Structural Complexity of AvgBPP. ![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. 155-166, 2009, Springer, 978-3-642-03350-6. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
23 | J. Wang, Y. C. Jeung, J. W. Chong |
Improved block truncation coding using low cost approach for color image compression. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICIS ![In: Proceedings of the 2nd International Conference on Interaction Sciences: Information Technology, Culture and Human (ICIS 2009), Seoul, Korea, 24-26 November 2009, pp. 1106-1109, 2009, ACM, 978-1-60558-710-3. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
adaptive quantization coding, block truncation coding, color image compression |
23 | Tomás Brázdil, Antonín Kucera 0001, Oldrich Strazovský |
Deciding probabilistic bisimilarity over infinite-state probabilistic systems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Acta Informatica ![In: Acta Informatica 45(2), pp. 131-154, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
23 | Firas Hassan, Joan Carletta |
High throughput JPEG2000 compatible encoder for high dynamic range images. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICIP ![In: Proceedings of the International Conference on Image Processing, ICIP 2008, October 12-15, 2008, San Diego, California, USA, pp. 1424-1427, 2008, IEEE, 978-1-4244-1765-0. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
23 | Soumyadip Rakshit, Donald M. Monro |
An Evaluation of Image Sampling and Compression for Human Iris Recognition. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Inf. Forensics Secur. ![In: IEEE Trans. Inf. Forensics Secur. 2(3-2), pp. 605-612, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
23 | Dror Alani, Amir Averbuch, Shai Dekel |
Image Coding With Geometric Wavelets. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Image Process. ![In: IEEE Trans. Image Process. 16(1), pp. 69-77, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
23 | Matthew Gaubatz, Sheila S. Hemami |
Robust Rate-Control for Wavelet-Based Image Coding via Conditional Probability Models. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Image Process. ![In: IEEE Trans. Image Process. 16(3), pp. 649-663, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
23 | Jin-yi Cai, Venkatesan T. Chakaravarthy |
On zero error algorithms having oracle access to one query. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Comb. Optim. ![In: J. Comb. Optim. 11(2), pp. 189-202, 2006. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
23 | Weisi Lin, Li Dong |
Adaptive downsampling to improve image compression at low bit rates. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Image Process. ![In: IEEE Trans. Image Process. 15(9), pp. 2513-2521, 2006. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
23 | Russell Impagliazzo, Ragesh Jaiswal, Valentine Kabanets |
Approximately List-Decoding Direct Product Codes and Uniform Hardness Amplification. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2006), 21-24 October 2006, Berkeley, California, USA, Proceedings, pp. 187-196, 2006, IEEE Computer Society, 0-7695-2720-5. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
23 | Dekun Zou, Yun Q. Shi 0001, Wei Su 0001, Guorong Xuan |
Steganalysis based on Markov Model of Thresholded Prediction-Error Image. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICME ![In: Proceedings of the 2006 IEEE International Conference on Multimedia and Expo, ICME 2006, July 9-12 2006, Toronto, Ontario, Canada, pp. 1365-1368, 2006, IEEE Computer Society, 1-4244-0367-7. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
23 | Will Harwood, Faron Moller, Anton Setzer |
Weak Bisimulation Approximants. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CSL ![In: Computer Science Logic, 20th International Workshop, CSL 2006, 15th Annual Conference of the EACSL, Szeged, Hungary, September 25-29, 2006, Proceedings, pp. 365-379, 2006, Springer, 3-540-45458-6. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
23 | Ronen Shaltiel, Christopher Umans |
Simple extractors for all min-entropies and a new pseudorandom generator. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. ACM ![In: J. ACM 52(2), pp. 172-216, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
Hardness versus randomness, pseudorandom generator, randomness extractor |
23 | Guorong Xuan, Yun Q. Shi 0001, Jianjiong Gao, Dekun Zou, Chengyun Yang, Zhenping Zhang, Peiqi Chai, Chunhua Chen 0001, Wen Chen 0002 |
Steganalysis Based on Multiple Features Formed by Statistical Moments of Wavelet Characteristic Functions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Information Hiding ![In: Information Hiding, 7th International Workshop, IH 2005, Barcelona, Spain, June 6-8, 2005, Revised Selected Papers, pp. 262-277, 2005, Springer, 3-540-29039-7. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
23 | Martin Beaudry, José M. Fernandez 0001, Markus Holzer 0001 |
A Common Algebraic Description for Probabilistic and Quantum Computations (Extended Abstract). ![Search on Bibsonomy](Pics/bibsonomy.png) |
MFCS ![In: Mathematical Foundations of Computer Science 2004, 29th International Symposium, MFCS 2004, Prague, Czech Republic, August 22-27, 2004, Proceedings, pp. 851-862, 2004, Springer, 3-540-22823-3. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
23 | Tomás Brázdil, Antonín Kucera 0001, Oldrich Strazovský |
Deciding Probabilistic Bisimilarity Over Infinite-State Probabilistic Systems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CONCUR ![In: CONCUR 2004 - Concurrency Theory, 15th International Conference, London, UK, August 31 - September 3, 2004, Proceedings, pp. 193-208, 2004, Springer, 3-540-22940-X. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
23 | 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 |
|
23 | Takashi Mihara, Shao Chin Sung |
Deterministic polynomial-time quantum algorithms for Simon's problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comput. Complex. ![In: Comput. Complex. 12(3-4), pp. 162-175, 2003. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
Mathematics Subject Classification (2000). 03D15, 81P68, 68Q25, 68Q05 |
23 | Cynthia Dwork, Moni Naor, Omer Reingold, Larry J. Stockmeyer |
Magic Functions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. ACM ![In: J. ACM 50(6), pp. 852-921, 2003. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
Fiat-Shamir methodology, interactive argument, magic function, selective decommitment, Digital signature, zero knowledge, interactive proof system |
23 | Petr Jancar |
Strong Bisimilarity on Basic Parallel Processes is PSPACE-complete. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LICS ![In: 18th IEEE Symposium on Logic in Computer Science (LICS 2003), 22-25 June 2003, Ottawa, Canada, Proceedings, pp. 218-, 2003, IEEE Computer Society, 0-7695-1884-2. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
23 | Luca Trevisan |
List-Decoding Using The XOR Lemma. ![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. 126-135, 2003, IEEE Computer Society, 0-7695-2040-5. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
23 | Philippe Moser |
Baire's Categories on Small Complexity Classes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FCT ![In: Fundamentals of Computation Theory, 14th International Symposium, FCT 2003, Malmö, Sweden, August 12-15, 2003, Proceedings, pp. 333-342, 2003, Springer, 3-540-40543-7. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
23 | Rahul Santhanam, Dieter van Melkebeek |
Holographic Proofs and Derandomization. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: 18th Annual IEEE Conference on Computational Complexity (Complexity 2003), 7-10 July 2003, Aarhus, Denmark, pp. 269-283, 2003, IEEE Computer Society, 0-7695-1879-6. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
23 | Yevgeniy Dodis, Joel Spencer |
On the (non)Universality of the One-Time Pad. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 43rd Symposium on Foundations of Computer Science (FOCS 2002), 16-19 November 2002, Vancouver, BC, Canada, Proceedings, pp. 376-, 2002, IEEE Computer Society, 0-7695-1822-2. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
23 | Alfredo De Santis, Giovanni Di Crescenzo, Giuseppe Persiano |
Randomness-Optimal Characterization of Two NP Proof Systems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
RANDOM ![In: Randomization and Approximation Techniques, 6th International Workshop, RANDOM 2002, Cambridge, MA, USA, September 13-15, 2002, Proceedings, pp. 179-193, 2002, Springer, 3-540-44147-6. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
23 | Nicholas J. Adams, Christopher K. I. Williams |
Dynamic Trees: Learning to Model Outdoor Scenes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ECCV (4) ![In: Computer Vision - ECCV 2002, 7th European Conference on Computer Vision, Copenhagen, Denmark, May 28-31, 2002, Proceedings, Part IV, pp. 82-96, 2002, Springer, 3-540-43748-7. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
23 | Artur Przelaskowski |
Hybrid Lossless Coder of Medical Images with Statistical Data Modelling. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CAIP ![In: Computer Analysis of Images and Patterns, 9th International Conference, CAIP 2001 Warsaw, Poland, September 5-7, 2001, Proceedings, pp. 92-101, 2001, Springer, 3-540-42513-6. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
reversible hybrid coders, statistical modeling, medical image compression |
23 | Raouf Hamzaoui, Dietmar Saupe |
Combining fractal image compression and vector quantization. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Image Process. ![In: IEEE Trans. Image Process. 9(2), pp. 197-208, 2000. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
|
23 | Béatrice Bérard, Anne Labroue, Philippe Schnoebelen |
Verifying Performance Equivalence for Timed Basic Parallel Processes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FoSSaCS ![In: Foundations of Software Science and Computation Structures, Third International Conference, FOSSACS 2000, Held as Part of the Joint European Conferences on Theory and Practice of Software,ETAPS 2000, Berlin, Germany, March 25 - April 2, 2000, Proceedings, pp. 35-47, 2000, Springer, 3-540-67257-5. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
|
23 | Kunal Mukherjee, Amar Mukherjee, Tinku Acharya |
Distributed Internet-Adaptive Image Compression. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Data Compression Conference ![In: Data Compression Conference, DCC 2000, Snowbird, Utah, USA, March 28-30, 2000., pp. 563, 2000, IEEE Computer Society, 0-7695-0592-9. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
|
23 | Satoshi Hada |
Zero-Knowledge and Code Obfuscation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ASIACRYPT ![In: Advances in Cryptology - ASIACRYPT 2000, 6th International Conference on the Theory and Application of Cryptology and Information Security, Kyoto, Japan, December 3-7, 2000, Proceedings, pp. 443-457, 2000, Springer, 3-540-41404-5. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
|
23 | Jin-yi Cai, Aduri Pavan, D. Sivakumar |
On the Hardness of Permanent. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: STACS 99, 16th Annual Symposium on Theoretical Aspects of Computer Science, Trier, Germany, March 4-6, 1999, Proceedings, pp. 90-99, 1999, Springer. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
|
23 | Petr Jancar, Faron Moller |
Techniques for Decidability and Undecidability of Bisimilarity. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CONCUR ![In: CONCUR '99: Concurrency Theory, 10th International Conference, Eindhoven, The Netherlands, August 24-27, 1999, Proceedings, pp. 30-45, 1999, Springer, 3-540-66425-4. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
|
23 | Harry Buhrman, Dieter van Melkebeek, Kenneth W. Regan, D. Sivakumar, Martin Strauss 0001 |
A Generalization of Resource-Bounded Measure, With an Application (Extended Abstract). ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: STACS 98, 15th Annual Symposium on Theoretical Aspects of Computer Science, Paris, France, February 25-27, 1998, Proceedings, pp. 161-171, 1998, Springer, 3-540-64230-7. The full citation details ...](Pics/full.jpeg) |
1998 |
DBLP DOI BibTeX RDF |
|
23 | Donald M. Monro, Huijuan Li, Jeremy A. Nicholls |
Object Based Video with Progressive Foreground. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICIP (3) ![In: Proceedings 1997 International Conference on Image Processing, ICIP '97, Santa Barbara, California, USA, October 26-29, 1997, pp. 448-451, 1997, IEEE Computer Society, 0-8186-8183-7. The full citation details ...](Pics/full.jpeg) |
1997 |
DBLP DOI BibTeX RDF |
|
23 | Harry Buhrman, Stephen A. Fenner, Lance Fortnow |
Results on Resource-Bounded Measure. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP ![In: Automata, Languages and Programming, 24th International Colloquium, ICALP'97, Bologna, Italy, 7-11 July 1997, Proceedings, pp. 188-194, 1997, Springer, 3-540-63165-8. The full citation details ...](Pics/full.jpeg) |
1997 |
DBLP DOI BibTeX RDF |
|
23 | Richard Mayr |
Weak Bisimulation and Model Checking for Basic Parallel Processes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FSTTCS ![In: Foundations of Software Technology and Theoretical Computer Science, 16th Conference, Hyderabad, India, December 18-20, 1996, Proceedings, pp. 88-99, 1996, Springer, 3-540-62034-6. The full citation details ...](Pics/full.jpeg) |
1996 |
DBLP DOI BibTeX RDF |
Basic Parallel Processes, model checking, bisimulation |
23 | Ahmed Bouajjani, Rachid Echahed, Peter Habermehl |
Verifying Infinite State Processes with Sequential and Parallel Composition. ![Search on Bibsonomy](Pics/bibsonomy.png) |
POPL ![In: Conference Record of POPL'95: 22nd ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, San Francisco, California, USA, January 23-25, 1995, pp. 95-106, 1995, ACM Press, 0-89791-692-1. The full citation details ...](Pics/full.jpeg) |
1995 |
DBLP DOI BibTeX RDF |
|
23 | Ingrid Biehl |
Definition and Existence of Super Complexity Cores. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: Algorithms and Computation, 5th International Symposium, ISAAC '94, Beijing, P. R. China, August 25-27, 1994, Proceedings, pp. 600-606, 1994, Springer, 3-540-58325-4. The full citation details ...](Pics/full.jpeg) |
1994 |
DBLP DOI BibTeX RDF |
|
23 | Lijie Chen 0001, Roei Tell |
New ways of studying the BPP = P conjecture. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Electron. Colloquium Comput. Complex. ![In: Electron. Colloquium Comput. Complex. TR23, 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP BibTeX RDF |
|
23 | Lijie Chen 0001, Roei Tell |
Guest Column: New ways of studying the BPP = P conjecture. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SIGACT News ![In: SIGACT News 54(2), pp. 44-69, 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
23 | Florian Kagerer, Maximilian Beinhofer, Stefan Stricker, Andreas Nüchter |
BED-BPP: Benchmarking dataset for robotic bin packing problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Int. J. Robotics Res. ![In: Int. J. Robotics Res. 42(11), pp. 1007-1014, September 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
23 | Meriem Hsayri, Mounira Tlili |
A novel multi stage optimization algorithm for a 3D-BPP resolution. ![Search on Bibsonomy](Pics/bibsonomy.png) |
INISTA ![In: International Conference on Innovations in Intelligent Systems and Applications, INISTA 2023, Hammamet, Tunisia, September 20-23, 2023, pp. 1-5, 2023, IEEE, 979-8-3503-3890-4. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
23 | Joanna Weissenberg, Michal Weissenberg |
Model of a Queuing System With BPP Elastic and Adaptive Traffic. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Access ![In: IEEE Access 10, pp. 130771-130783, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
23 | Roberto Gorrieri |
A study on team bisimulation and H-team bisimulation for BPP nets. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Theor. Comput. Sci. ![In: Theor. Comput. Sci. 897, pp. 83-113, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
23 | Roberto Gorrieri |
Causal Semantics for BPP Nets with Silent Moves. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Fundam. Informaticae ![In: Fundam. Informaticae 180(3), pp. 179-249, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
23 | Roberto Gorrieri |
Team bisimilarity, and its associated modal logic, for BPP nets. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Acta Informatica ![In: Acta Informatica 58(5), pp. 529-569, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
23 | Yanyi Liu, Rafael Pass |
On the Possibility of Basing Cryptography on $\EXP \neq \BPP$. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Electron. Colloquium Comput. Complex. ![In: Electron. Colloquium Comput. Complex. TR21, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP BibTeX RDF |
|
23 | Yanyi Liu, Rafael Pass |
On the Possibility of Basing Cryptography on $\EXP \neq \BPP$. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IACR Cryptol. ePrint Arch. ![In: IACR Cryptol. ePrint Arch. 2021, pp. 535, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP BibTeX RDF |
|
23 | Yanyi Liu, Rafael Pass |
On the Possibility of Basing Cryptography on EXP≠ BPP. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CRYPTO (1) ![In: Advances in Cryptology - CRYPTO 2021 - 41st Annual International Cryptology Conference, CRYPTO 2021, Virtual Event, August 16-20, 2021, Proceedings, Part I, pp. 11-40, 2021, Springer, 978-3-030-84241-3. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|