|
|
Venues (Conferences, Journals, ...)
|
|
GrowBag graphs for keyword ? (Num. hits/coverage)
Group by:
The graphs summarize 944 occurrences of 549 keywords
|
|
|
Results
Found 3915 publication records. Showing 3912 according to the selection in the facets
Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
15 | David Buchfuhrer, Christopher Umans |
The Complexity of Boolean Formula Minimization. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP (1) ![In: Automata, Languages and Programming, 35th International Colloquium, ICALP 2008, Reykjavik, Iceland, July 7-11, 2008, Proceedings, Part I: Tack A: Algorithms, Automata, Complexity, and Games, pp. 24-35, 2008, Springer, 978-3-540-70574-1. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
15 | Zhang Yinsheng |
The Mathematic Model of Consciousness. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Asia International Conference on Modelling and Simulation ![In: Second Asia International Conference on Modelling and Simulation, AMS 2008, Kuala Lumpur, Malaysia, May 13-15, 2008, pp. 574-578, 2008, IEEE Computer Society, 978-0-7695-3136-6. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
Mathematic Model of Consciousness, homomorphic model, Jean Piaget |
15 | Paul R. Cohen |
What Shall We Do Next? The Challenges of AI Midway through Its First Century. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PRICAI ![In: PRICAI 2008: Trends in Artificial Intelligence, 10th Pacific Rim International Conference on Artificial Intelligence, Hanoi, Vietnam, December 15-19, 2008. Proceedings, pp. 1, 2008, Springer, 978-3-540-89196-3. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
15 | Jarkko Kari, Nicolas Ollinger |
Periodicity and Immortality in Reversible Computing. ![Search on Bibsonomy](Pics/bibsonomy.png) |
MFCS ![In: Mathematical Foundations of Computer Science 2008, 33rd International Symposium, MFCS 2008, Torun, Poland, August 25-29, 2008, Proceedings, pp. 419-430, 2008, Springer, 978-3-540-85237-7. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
15 | Joan M. Lucas, Jonathan Jarvis |
Incorporating transformations into jflap for enhanced understanding of automata. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SIGCSE ![In: Proceedings of the 39th SIGCSE Technical Symposium on Computer Science Education, SIGCSE 2008, Portland, OR, USA, March 12-15, 2008, pp. 14-18, 2008, ACM, 978-1-59593-799-5. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
automata, educational software, undecidability, jflap |
15 | Edwin J. Beggs, José Félix Costa, Bruno Loff, John V. Tucker |
Oracles and Advice as Measurements. ![Search on Bibsonomy](Pics/bibsonomy.png) |
UC ![In: Unconventional Computing, 7th International Conference, UC 2008, Vienna, Austria, August 25-28, 2008. Proceedings, pp. 33-50, 2008, Springer, 978-3-540-85193-6. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
15 | Turlough Neary |
On the Computational Complexity of Spiking Neural P Systems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
UC ![In: Unconventional Computing, 7th International Conference, UC 2008, Vienna, Austria, August 25-28, 2008. Proceedings, pp. 189-205, 2008, Springer, 978-3-540-85193-6. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
15 | Luca Cardelli, Gianluigi Zavattaro |
On the Computational Power of Biochemistry. ![Search on Bibsonomy](Pics/bibsonomy.png) |
AB ![In: Algebraic Biology, Third International Conference, AB 2008, Castle of Hagenberg, Austria, July 31-August 2, 2008, Proceedings, pp. 65-80, 2008, Springer, 978-3-540-85100-4. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
15 | Amir M. Ben-Amram, Neil D. Jones, Lars Kristiansen |
Linear, Polynomial or Exponential? Complexity Inference in Polynomial Time. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CiE ![In: Logic and Theory of Algorithms, 4th Conference on Computability in Europe, CiE 2008, Athens, Greece, June 15-20, 2008, Proceedings, pp. 67-76, 2008, Springer, 978-3-540-69405-2. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
linear time complexity, static program analysis, polynomial time complexity, implicit computational complexity |
15 | Harry Buhrman, John M. Hitchcock |
NP-Hard Sets Are Exponentially Dense Unless coNP C NP/poly. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: Proceedings of the 23rd Annual IEEE Conference on Computational Complexity, CCC 2008, 23-26 June 2008, College Park, Maryland, USA, pp. 1-7, 2008, IEEE Computer Society, 978-0-7695-3169-4. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
hard sets, polynomial advice, instance complexity |
15 | Jesús Aranda, Cinzia Di Giusto, Mogens Nielsen, Frank D. Valencia |
CCS with Replication in the Chomsky Hierarchy: The Expressive Power of Divergence. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APLAS ![In: Programming Languages and Systems, 5th Asian Symposium, APLAS 2007, Singapore, November 29-December 1, 2007, Proceedings, pp. 383-398, 2007, Springer, 978-3-540-76636-0. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
15 | Mark Burgin |
Universality, Reducibility, and Completeness. ![Search on Bibsonomy](Pics/bibsonomy.png) |
MCU ![In: Machines, Computations, and Universality, 5th International Conference, MCU 2007, Orléans, France, September 10-13, 2007, Proceedings, pp. 24-38, 2007, Springer, 978-3-540-74592-1. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
problem completeness, algorithm, computability, reducibility, universal, computing power, problem hardness |
15 | Grégory Lafitte, Michael Weiss |
Universal Tilings. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: STACS 2007, 24th Annual Symposium on Theoretical Aspects of Computer Science, Aachen, Germany, February 22-24, 2007, Proceedings, pp. 367-380, 2007, Springer, 978-3-540-70917-6. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
15 | Zoltán Csörnyei, Gergely Dévai |
An Introduction to the Lambda Calculus. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CEFP ![In: Central European Functional Programming School, Second Summer School, CEFP 2007, Cluj-Napoca, Romania, June 23-30, 2007, Revised Selected Lectures, pp. 87-111, 2007, Springer, 978-3-540-88058-5. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
15 | Fatih Altiparmak, Selnur Erdal, Ozgur Ozturk, Hakan Ferhatosmanoglu |
A Multi-metric Similarity Based Analysis of Microarray Data. ![Search on Bibsonomy](Pics/bibsonomy.png) |
BIBM ![In: Proceedings of the IEEE International Conference on Bioinformatics and Biomedicine, BIBM 2007, Silicon Valley, CA, USA, November 2-4, 2007, pp. 317-324, 2007, IEEE Computer Society, 0-7695-3031-1. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
15 | Itamar Pitowsky |
From Logic to Physics: How the Meaning of Computation Changed over Time. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CiE ![In: Computation and Logic in the Real World, Third Conference on Computability in Europe, CiE 2007, Siena, Italy, June 18-23, 2007, Proceedings, pp. 621-631, 2007, Springer, 978-3-540-73000-2. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
15 | Joel David Hamkins, Russell G. Miller |
Post's Problem for Ordinal Register Machines. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CiE ![In: Computation and Logic in the Real World, Third Conference on Computability in Europe, CiE 2007, Siena, Italy, June 18-23, 2007, Proceedings, pp. 358-367, 2007, Springer, 978-3-540-73000-2. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
ordinal computability, ordinal register machine, Post’s Problem, computability |
15 | Richard Chang 0001, Suresh Purini |
Bounded Queries and the NP Machine Hypothesis. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: 22nd Annual IEEE Conference on Computational Complexity (CCC 2007), 13-16 June 2007, San Diego, California, USA, pp. 52-59, 2007, IEEE Computer Society, 0-7695-2780-9. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
15 | Ryan Williams 0001 |
Inductive Time-Space Lower Bounds for Sat and Related Problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comput. Complex. ![In: Comput. Complex. 15(4), pp. 433-470, 2006. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
68Q17, Subject classification |
15 | Ann M. Bouchard, Gordon C. Osbourn |
Dynamic self-assembly in living systems as computation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Nat. Comput. ![In: Nat. Comput. 5(4), pp. 321-362, 2006. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
biological information processing, microtubule, motor protein, protein network, unary number, algorithm, computation, computing, information, self-assembly, stochastic, random access machine |
15 | Antonio Montalbán |
There is no ordering on the classes in the generalized high/low hierarchies. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Arch. Math. Log. ![In: Arch. Math. Log. 45(2), pp. 215-231, 2006. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
15 | 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 |
|
15 | Turlough Neary, Damien Woods |
P-completeness of Cellular Automaton Rule 110. ![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. 132-143, 2006, Springer, 3-540-35904-4. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
15 | Ehud Shapiro |
Injecting Life with Computers. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ILP ![In: Inductive Logic Programming, 16th International Conference, ILP 2006, Santiago de Compostela, Spain, August 24-27, 2006, Revised Selected Papers, pp. 26, 2006, Springer, 978-3-540-73846-6. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
15 | Keng Meng Ng, Frank Stephan 0001, Guohua Wu |
Degrees of Weakly Computable Reals. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CiE ![In: Logical Approaches to Computational Barriers, Second Conference on Computability in Europe, CiE 2006, Swansea, UK, June 30-July 5, 2006, Proceedings, pp. 413-422, 2006, Springer, 3-540-35466-2. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
15 | William B. Langdon, Riccardo Poli |
The Halting Probability in Von Neumann Architectures. ![Search on Bibsonomy](Pics/bibsonomy.png) |
EuroGP ![In: Genetic Programming, 9th European Conference, EuroGP 2006, Budapest, Hungary, April 10-12, 2006, Proceedings, pp. 225-237, 2006, Springer, 3-540-33143-3. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
15 | István Németi, Hajnal Andréka |
New Physics and Hypercomputation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SOFSEM ![In: SOFSEM 2006: Theory and Practice of Computer Science, 32nd Conference on Current Trends in Theory and Practice of Computer Science, Merín, Czech Republic, January 21-27, 2006, Proceedings, pp. 63-63, 2006, Springer, 3-540-31198-X. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
15 | Serge Haddad, Laura Recalde, Manuel Silva Suárez |
On the Computational Power of Timed Differentiable Petri Nets. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FORMATS ![In: Formal Modeling and Analysis of Timed Systems, 4th International Conference, FORMATS 2006, Paris, France, September 25-27, 2006, Proceedings, pp. 230-244, 2006, Springer, 3-540-45026-2. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
15 | Edward D. Lazowska, David A. Patterson 0001 |
Computing research: a looming crisis. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comput. Commun. Rev. ![In: Comput. Commun. Rev. 35(3), pp. 65-68, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
computing research, innovation |
15 | Michael Roe |
Non-repudiation and the Metaphysics of Presence. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Security Protocols Workshop ![In: Security Protocols, 13th International Workshop, Cambridge, UK, April 20-22, 2005, Revised Selected Papers, pp. 207-214, 2005, Springer, 978-3-540-77155-5. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
15 | Ee-Chien Chang, Sung Woo Choi, DoYong Kwon, Hyungju Park, Chee-Keng Yap |
Shortest path amidst disc obstacles is computable. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SCG ![In: Proceedings of the 21st ACM Symposium on Computational Geometry, Pisa, Italy, June 6-8, 2005, pp. 116-125, 2005, ACM, 1-58113-991-8. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
disc obstacles, guaranteed precision computation, real RAM model, robust numerical algorithms, shortest path, exact geometric computation, exponential complexity |
15 | Falk Unger |
On Small Hard Leaf Languages. ![Search on Bibsonomy](Pics/bibsonomy.png) |
MFCS ![In: Mathematical Foundations of Computer Science 2005, 30th International Symposium, MFCS 2005, Gdansk, Poland, August 29 - September 2, 2005, Proceedings, pp. 781-792, 2005, Springer, 3-540-28702-7. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
15 | Peng Yin 0003, Sudheer Sahu, Andrew J. Turberfield, John H. Reif |
Design of Autonomous DNA Cellular Automata. ![Search on Bibsonomy](Pics/bibsonomy.png) |
DNA ![In: DNA Computing, 11th International Workshop on DNA Computing, DNA11, London, ON, Canada, June 6-9, 2005. Revised Selected Papers., pp. 399-416, 2005, Springer, 3-540-34161-7. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
15 | Klaus Meer, Martin Ziegler 0001 |
An Explicit Solution to Post's Problem over the Reals. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FCT ![In: Fundamentals of Computation Theory, 15th International Symposium, FCT 2005, Lübeck, Germany, August 17-20, 2005, Proceedings, pp. 467-478, 2005, Springer, 3-540-28193-2. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
15 | Victor Poupet |
Cellular Automata: Real-Time Equivalence Between One-Dimensional Neighborhoods. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: STACS 2005, 22nd Annual Symposium on Theoretical Aspects of Computer Science, Stuttgart, Germany, February 24-26, 2005, Proceedings, pp. 133-144, 2005, Springer, 3-540-24998-2. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
real-time, Cellular automata, neighborhoods |
15 | Peter Koepke |
Computing a Model of Set Theory. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CiE ![In: New Computational Paradigms, First Conference on Computability in Europe, CiE 2005, Amsterdam, The Netherlands, June 8-12, 2005, Proceedings, pp. 223-232, 2005, Springer, 3-540-26179-6. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
15 | Charles M. Harris |
Symmetric Enumeration Reducibility. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CiE ![In: New Computational Paradigms, First Conference on Computability in Europe, CiE 2005, Amsterdam, The Netherlands, June 8-12, 2005, Proceedings, pp. 196-208, 2005, Springer, 3-540-26179-6. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
15 | Angsheng Li |
The Low Splitting Theorem in the Difference Hierarchy. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CiE ![In: New Computational Paradigms, First Conference on Computability in Europe, CiE 2005, Amsterdam, The Netherlands, June 8-12, 2005, Proceedings, pp. 287-296, 2005, Springer, 3-540-26179-6. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
15 | Ryan Williams 0001 |
Parallelizing time with polynomial circuits. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SPAA ![In: SPAA 2005: Proceedings of the 17th Annual ACM Symposium on Parallelism in Algorithms and Architectures, July 18-20, 2005, Las Vegas, Nevada, USA, pp. 171-175, 2005, ACM, 1-58113-986-1. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
parallel speedup, circuit complexity, alternation |
15 | Petr Sosík, Ondrej Valík |
On Evolutionary Lineages of Membrane Systems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Workshop on Membrane Computing ![In: Membrane Computing, 6th International Workshop, WMC 2005, Vienna, Austria, July 18-21, 2005, Revised Selected and Invited Papers, pp. 67-78, 2005, Springer, 3-540-30948-9. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
15 | Aleksandar Ignjatovic, Arun Sharma 0001 |
Some applications of logic to feasibility in higher types. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Trans. Comput. Log. ![In: ACM Trans. Comput. Log. 5(2), pp. 332-350, 2004. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
higher-order complexity, second-order theories, functionals, bounded arithmetic |
15 | Ehud Shapiro |
Invited talk: injecting life with computers. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PEPM ![In: Proceedings of the 2004 ACM SIGPLAN Workshop on Partial Evaluation and Semantics-based Program Manipulation, 2004, Verona, Italy, August 24-25, 2004, pp. 200, 2004, ACM, 1-58113-835-0. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
computer diagnosis and therapy, autonomous computers, DNA computing, molecular computers |
15 | Ruben Gamboa, John R. Cowles |
A Mechanical Proof of the Cook-Levin Theorem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
TPHOLs ![In: Theorem Proving in Higher Order Logics, 17th International Conference, TPHOLs 2004, Park City, Utah, USA, September 14-17, 2004, Proceedings, pp. 99-116, 2004, Springer, 3-540-23017-3. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
15 | Jérôme Durand-Lose |
Abstract Geometrical Computation for Black Hole Computation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
MCU ![In: Machines, Computations, and Universality, 4th International Conference, MCU 2004, Saint Petersburg, Russia, September 21-24, 2004, Revised Selected Papers, pp. 176-187, 2004, Springer, 3-540-25261-4. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
15 | Angelos Stavrou, John Ioannidis, Angelos D. Keromytis, Vishal Misra, Dan Rubenstein |
A Pay-per-Use DoS Protection Mechanism for the Web. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACNS ![In: Applied Cryptography and Network Security, Second International Conference, ACNS 2004, Yellow Mountain, China, June 8-11, 2004, Proceedings, pp. 120-134, 2004, Springer, 3-540-22217-0. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
15 | Ehud Shapiro |
Invited talk: injecting life with computers. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PPDP ![In: Proceedings of the 6th International ACM SIGPLAN Conference on Principles and Practice of Declarative Programming, 24-26 August 2004, Verona, Italy, pp. 6, 2004, ACM, 1-58113-819-9. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
computer diagnosis and therapy, autonomous computers, DNA computing, molecular computers |
15 | Peter Bürgisser, Felipe Cucker |
Counting complexity classes for numeric computations II: algebraic and semialgebraic sets. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STOC ![In: Proceedings of the 36th Annual ACM Symposium on Theory of Computing, Chicago, IL, USA, June 13-16, 2004, pp. 475-485, 2004, ACM, 1-58113-852-0. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
counting complexity classes, geometric degree, semialgebraic sets, completeness, Betti numbers, Euler characteristic |
15 | Rainer Knauf, Setsuo Tsuruta, Hirokazu Ihara, Avelino J. Gonzalez, Torsten Kurbad |
Improving AI Systems? Dependability by Utilizing Historical Knowledge. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PRDC ![In: 10th IEEE Pacific Rim International Symposium on Dependable Computing (PRDC 2004), 3-5 March 2004, Papeete, Tahiti, pp. 343-352, 2004, IEEE Computer Society, 0-7695-2076-6. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
15 | Vikraman Arvind, T. C. Vijayaraghavan |
Abelian Permutation Group Problems and Logspace Counting Classes. ![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. 204-214, 2004, IEEE Computer Society, 0-7695-2120-7. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
15 | 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 |
|
15 | Claudio Sacerdoti Coen |
A Constructive Proof of the Soundness of the Encoding of Random Access Machines in a Linda Calculus with Ordered Semantics. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICTCS ![In: Theoretical Computer Science, 8th Italian Conference, ICTCS 2003, Bertinoro, Italy, October 13-15, 2003, Proceedings, pp. 37-57, 2003, Springer, 3-540-20216-1. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
15 | Robert Rettinger, Klaus Weihrauch |
The computational complexity of some julia sets. ![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. 177-185, 2003, ACM, 1-58113-674-9. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
julia sets, computational complexity |
15 | 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 |
|
15 | Julia Khodor, David K. Gifford |
Programmed Mutagenesis Is Universal. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Theory Comput. Syst. ![In: Theory Comput. Syst. 35(5), pp. 483-500, 2002. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
15 | Harumichi Nishimura |
On Quantum Computation with Some Restricted Amplitudes. ![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. 311-322, 2002, Springer, 3-540-43283-3. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
15 | Peter A. Beling |
Exact Algorithms for Linear Programming over Algebraic Extensions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 31(4), pp. 459-478, 2001. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
Ellipsoid method, Computational complexity, Linear programming, Polynomial-time algorithms, Symbolic computation, Algebraic numbers |
15 | Julia Khodor, David K. Gifford |
Programmed Mutagenesis Is a Universal Model of Computation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
DNA ![In: DNA Computing, 7th International Workshop on DNA-Based Computers, DNA7, Tampa, Florida, USA, June 10-13, 2001, Revised Papers, pp. 300-307, 2001, Springer, 3-540-43775-4. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
15 | Umesh V. Vazirani |
Quantum Algorithms. ![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. 45-46, 2001, Springer, 3-540-42487-3. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
15 | Bruce M. Maggs, Berthold Vöcking |
Improved Routing and Sorting on Multibutterflies. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 28(4), pp. 438-437, 2000. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
Ellipsoid method, Computational complexity, Linear programming, Polynomial-time algorithms, Symbolic computation, Algebraic numbers |
15 | Jirí Wiedermann |
Towards a Computational Theory of Everything. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IFIP TCS ![In: Theoretical Computer Science, Exploring New Frontiers of Theoretical Informatics, International Conference IFIP TCS 2000, Sendai, Japan, August 17-19, 2000, Proceedings, pp. 614-615, 2000, Springer, 3-540-67823-9. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
|
15 | Jan van Leeuwen, Jirí Wiedermann |
On the Power of Interactive Computing. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IFIP TCS ![In: Theoretical Computer Science, Exploring New Frontiers of Theoretical Informatics, International Conference IFIP TCS 2000, Sendai, Japan, August 17-19, 2000, Proceedings, pp. 619-623, 2000, Springer, 3-540-67823-9. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
|
15 | Holger Spakowski, Jörg Vogel 0001 |
Theta2p-Completeness: A Classical Approach for New Results. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FSTTCS ![In: Foundations of Software Technology and Theoretical Computer Science, 20th Conference, FST TCS 2000 New Delhi, India, December 13-15, 2000, Proceedings., pp. 348-360, 2000, Springer, 3-540-41413-4. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
|
15 | Lance Fortnow, Dieter van Melkebeek |
Time-Space Tradeoffs for Nondeterministic Computation. ![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. 2-13, 2000, IEEE Computer Society, 0-7695-0674-7. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
Satisfiability, Time-space tradeoffs |
15 | Felipe Cucker |
Solving polynomial systems: a complexity theory viewpoint. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISSAC ![In: Proceedings of the 2000 International Symposium on Symbolic and Algebraic Computation, ISSAC 2000, St. Andrews, United Kingdom, August 6-10, 2000, 2000, ACM, 1-58113-218-2. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
|
15 | John H. Reif |
Parallel Biomolecular Computation: Models and Simulations. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 25(2-3), pp. 142-175, 1999. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
Parallel RAM, Nondeterministic computation, Recombinant DNA, Parallel computation, DNA, NP, Biomolecular computation, Biotechnology |
15 | Bin Fu, Richard Beigel |
A Comparison of Resource-Bounded Molecular Computation Models. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 24(2), pp. 87-95, 1999. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
|
15 | Rudolf Freund, Lila Kari, Gheorghe Paun |
DNA Computing Based on Splicing: The Existence of Universal Computers. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Theory Comput. Syst. ![In: Theory Comput. Syst. 32(1), pp. 69-112, 1999. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
|
15 | Jirí Wiedermann |
The Computational Limits to the Cognitive Power of the Neuroidal Tabula Rasa. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ALT ![In: Algorithmic Learning Theory, 10th International Conference, ALT '99, Tokyo, Japan, December 6-8, 1999, Proceedings, pp. 63-76, 1999, Springer, 3-540-66748-2. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
|
15 | Penousal Machado, Francisco Baptista Pereira, Amílcar Cardoso, Ernesto Costa |
Busy Beaver - The Influence of Representation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
EuroGP ![In: Genetic Programming, Second European Workshop, Göteborg, Sweden, May 26-27, 1999, Proceedings, pp. 29-38, 1999, Springer, 3-540-65899-8. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
|
15 | John Watrous |
Quantum Simulations of Classical Random Walks and Undirected Graph Connectivity. ![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. 180-187, 1999, IEEE Computer Society, 0-7695-0075-7. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
quantum computation, graph connectivity, space-bounded computation |
15 | Michael Prasse, Peter Rittgen |
Bemerkungen zu Peter Wegners Ausführungen über Interaktion und Berechenbarkeit. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Inform. Spektrum ![In: Inform. Spektrum 21(3), pp. 141-146, 1998. The full citation details ...](Pics/full.jpeg) |
1998 |
DBLP DOI BibTeX RDF |
Interaktionsmaschine, Turingmaschine, Churchsche These, Berechenbarkeit, Algorithmus |
15 | Takashi Mihara, Shao Chin Sung |
A Quantum Polynomial Time Algorithm in Worst Case for Simon's Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: Algorithms and Computation, 9th International Symposium, ISAAC '98, Taejon, Korea, December 14-16, 1998, Proceedings, pp. 229-236, 1998, Springer, 3-540-65385-6. The full citation details ...](Pics/full.jpeg) |
1998 |
DBLP DOI BibTeX RDF |
|
15 | 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 |
|
15 | Cristian Calude, Peter Hertling, Bakhadyr Khoussainov, Yongge Wang |
Recursively Enumerable Reals and Chaitin Omega Numbers. ![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. 596-606, 1998, Springer, 3-540-64230-7. The full citation details ...](Pics/full.jpeg) |
1998 |
DBLP DOI BibTeX RDF |
|
15 | Bin Fu, Richard Beigel |
A Comparison of Resource-Bounded Molecular Computation Models. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISTCS ![In: Fifth Israel Symposium on Theory of Computing and Systems, ISTCS 1997, Ramat-Gan, Israel, June 17-19, 1997, Proceedings, pp. 6-11, 1997, IEEE Computer Society, 0-8186-8037-7. The full citation details ...](Pics/full.jpeg) |
1997 |
DBLP DOI BibTeX RDF |
|
15 | Rolf Backofen, Peter Clote |
Evolution as a Computational Engine. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CSL ![In: Computer Science Logic, 11th International Workshop, CSL '97, Annual Conference of the EACSL, Aarhus, Denmark, August 23-29, 1997, Selected Papers, pp. 35-55, 1997, Springer, 3-540-64570-5. The full citation details ...](Pics/full.jpeg) |
1997 |
DBLP DOI BibTeX RDF |
|
15 | Elena Pezzoli |
On the Computational Complexity of Type 2 Functionals. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CSL ![In: Computer Science Logic, 11th International Workshop, CSL '97, Annual Conference of the EACSL, Aarhus, Denmark, August 23-29, 1997, Selected Papers, pp. 373-388, 1997, Springer, 3-540-64570-5. The full citation details ...](Pics/full.jpeg) |
1997 |
DBLP DOI BibTeX RDF |
|
15 | Klaus-Jörn Lange, Pierre McKenzie, Alain Tapp |
Reversible Space Equals Deterministic Space. ![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. 45-50, 1997, IEEE Computer Society, 0-8186-7907-7. The full citation details ...](Pics/full.jpeg) |
1997 |
DBLP DOI BibTeX RDF |
determinism, reversible computation, Complexity classes, space bounds |
15 | Ulrich Hertrampf |
Acceptance by Transformation Monoids (with an Application to Local Self 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. 213-224, 1997, IEEE Computer Society, 0-8186-7907-7. The full citation details ...](Pics/full.jpeg) |
1997 |
DBLP DOI BibTeX RDF |
local self reduction, bottleneck machine, structural complexity |
15 | Stephen A. Fenner, Steven Homer, Randall Pruim, Marcus Schaefer 0001 |
Hyper-Polynomial Hierarchies and the NP-Jump. ![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. 102-110, 1997, IEEE Computer Society, 0-8186-7907-7. The full citation details ...](Pics/full.jpeg) |
1997 |
DBLP DOI BibTeX RDF |
|
15 | 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 |
15 | Hermann Ney, Ute Essen, Reinhard Kneser |
On the Estimation of 'Small' Probabilities by Leaving-One-Out. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Pattern Anal. Mach. Intell. ![In: IEEE Trans. Pattern Anal. Mach. Intell. 17(12), pp. 1202-1212, 1995. The full citation details ...](Pics/full.jpeg) |
1995 |
DBLP DOI BibTeX RDF |
Stochastic language modeling, zero-frequency problem, generalization capability, maximum likelihood estimation, leaving-one-out |
15 | Stephen A. Fenner, Jack H. Lutz, Elvira Mayordomo |
Weakly Useful Sequences. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP ![In: Automata, Languages and Programming, 22nd International Colloquium, ICALP95, Szeged, Hungary, July 10-14, 1995, Proceedings, pp. 393-404, 1995, Springer, 3-540-60084-1. The full citation details ...](Pics/full.jpeg) |
1995 |
DBLP DOI BibTeX RDF |
|
15 | Hans-Jörg Burtschick |
Comparing Counting Classes for Logspace, One-way Logspace, and First-order. ![Search on Bibsonomy](Pics/bibsonomy.png) |
MFCS ![In: Mathematical Foundations of Computer Science 1995, 20th International Symposium, MFCS'95, Prague, Czech Republic, August 28 - September 1, 1995, Proceedings, pp. 139-148, 1995, Springer, 3-540-60246-1. The full citation details ...](Pics/full.jpeg) |
1995 |
DBLP DOI BibTeX RDF |
|
15 | Wolfgang Merkle, Yongge Wang |
Separations by Random Oracles and "Almost" Classes for Generalized Reducibilities. ![Search on Bibsonomy](Pics/bibsonomy.png) |
MFCS ![In: Mathematical Foundations of Computer Science 1995, 20th International Symposium, MFCS'95, Prague, Czech Republic, August 28 - September 1, 1995, Proceedings, pp. 179-190, 1995, Springer, 3-540-60246-1. The full citation details ...](Pics/full.jpeg) |
1995 |
DBLP DOI BibTeX RDF |
|
15 | Carsten Damm, Markus Holzer 0001 |
Inductive Counting Below LOGSPACE. ![Search on Bibsonomy](Pics/bibsonomy.png) |
MFCS ![In: Mathematical Foundations of Computer Science 1994, 19th International Symposium, MFCS'94, Kosice, Slovakia, August 22 - 26, 1994, Proceedings, pp. 276-285, 1994, Springer, 3-540-58338-6. The full citation details ...](Pics/full.jpeg) |
1994 |
DBLP DOI BibTeX RDF |
|
15 | Martin Dietzfelbinger, Martin Hühne |
Matching Upper and Lower Bounds for Simulation of Several Tapes on One Multidimensional Tape. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FSTTCS ![In: Foundations of Software Technology and Theoretical Computer Science, 14th Conference, Madras, India, December 15-17, 1994, Proceedings, pp. 24-35, 1994, Springer, 3-540-58715-2. The full citation details ...](Pics/full.jpeg) |
1994 |
DBLP DOI BibTeX RDF |
|
15 | Yenjo Han, Lane A. Hemaspaandra, Thomas Thierauf |
Threshold Computation and Cryptographic Security. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: Algorithms and Computation, 4th International Symposium, ISAAC '93, Hong Kong, December 15-17, 1993, Proceedings, pp. 230-239, 1993, Springer, 3-540-57568-5. The full citation details ...](Pics/full.jpeg) |
1993 |
DBLP DOI BibTeX RDF |
|
15 | Cynthia Dwork, Larry J. Stockmeyer |
Finite State Verifiers I: The Power of Interaction. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. ACM ![In: J. ACM 39(4), pp. 800-828, 1992. The full citation details ...](Pics/full.jpeg) |
1992 |
DBLP DOI BibTeX RDF |
complexity theory, finite state automata, interactive proof systems, probabilistic automata, Arthur-Merlin games |
15 | Hava T. Siegelmann, Eduardo D. Sontag |
On the Computational Power of Neural Nets. ![Search on Bibsonomy](Pics/bibsonomy.png) |
COLT ![In: Proceedings of the Fifth Annual ACM Conference on Computational Learning Theory, COLT 1992, Pittsburgh, PA, USA, July 27-29, 1992., pp. 440-449, 1992, ACM, 0-89791-497-X. The full citation details ...](Pics/full.jpeg) |
1992 |
DBLP DOI BibTeX RDF |
|
15 | David Alex Lamb, Kevin A. Schneider |
Formalization of information hiding design methods. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CASCON ![In: Proceedings of the 1992 Conference of the Centre for Advanced Studies on Collaborative Research, November 9-12, 1992, Toronto, Ontario, Canada, 2 Volumes, pp. 201-214, 1992, IBM. The full citation details ...](Pics/full.jpeg) |
1992 |
DBLP BibTeX RDF |
|
15 | Viliam Geffert |
Speed-Up Theorem Without Tape Compression. ![Search on Bibsonomy](Pics/bibsonomy.png) |
MFCS ![In: Mathematical Foundations of Computer Science 1990, MFCS'90, Banská Bystrica, Czechoslovakia, August 27-31, 1990, Proceedings, pp. 285-291, 1990, Springer, 3-540-52953-5. The full citation details ...](Pics/full.jpeg) |
1990 |
DBLP DOI BibTeX RDF |
|
15 | Etienne Grandjean, J. M. Robson |
RAM with Compact Memory: A Realistic and Robust Model of Computation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CSL ![In: Computer Science Logic, 4th Workshop, CSL '90, Heidelberg, Germany, October 1-5, 1990, Proceedings, pp. 195-233, 1990, Springer, 3-540-54487-9. The full citation details ...](Pics/full.jpeg) |
1990 |
DBLP DOI BibTeX RDF |
|
15 | Rafail Ostrovsky |
An Efficient Software Protection Scheme. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CRYPTO ![In: Advances in Cryptology - CRYPTO '89, 9th Annual International Cryptology Conference, Santa Barbara, California, USA, August 20-24, 1989, Proceedings, pp. 610-611, 1989, Springer, 3-540-97317-6. The full citation details ...](Pics/full.jpeg) |
1989 |
DBLP DOI BibTeX RDF |
|
15 | Jeffrey D. Ullman, Moshe Y. Vardi |
The Complexity of Ordering Subgoals. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PODS ![In: Proceedings of the Seventh ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, March 21-23, 1988, Austin, Texas, USA, pp. 74-81, 1988, ACM, 0-89791-263-2. The full citation details ...](Pics/full.jpeg) |
1988 |
DBLP DOI BibTeX RDF |
|
15 | Michael Kaminski |
A linear time algorithm for residue computation and a fast algorithm for division with a sparse divisor. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. ACM ![In: J. ACM 34(4), pp. 968-984, 1987. The full citation details ...](Pics/full.jpeg) |
1987 |
DBLP DOI BibTeX RDF |
|
15 | Steven Homer |
Minimal degrees for polynomial reducibilities. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. ACM ![In: J. ACM 34(2), pp. 480-491, 1987. The full citation details ...](Pics/full.jpeg) |
1987 |
DBLP DOI BibTeX RDF |
|
15 | Oscar H. Ibarra, Sam M. Kim, Louis E. Rosier |
Space and Time Efficient Simulations and Characterizations of Some Restricted Classes of PDAs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP ![In: Automata, Languages and Programming, 11th Colloquium, Antwerp, Belgium, July 16-20, 1984, Proceedings, pp. 247-259, 1984, Springer, 3-540-13345-3. The full citation details ...](Pics/full.jpeg) |
1984 |
DBLP DOI BibTeX RDF |
|
15 | Juraj Hromkovic |
On the Power of Alternation in Finite Automata. ![Search on Bibsonomy](Pics/bibsonomy.png) |
MFCS ![In: Mathematical Foundations of Computer Science 1984, Praha, Czechoslovakia, September 3-7, 1984, Proceedings, pp. 322-329, 1984, Springer, 3-540-13372-0. The full citation details ...](Pics/full.jpeg) |
1984 |
DBLP DOI BibTeX RDF |
|
15 | Paul M. B. Vitányi |
On the Simulation of Many Storage Heads by a Single One (Extended Abstract). ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP ![In: Automata, Languages and Programming, 10th Colloquium, Barcelona, Spain, July 18-22, 1983, Proceedings, pp. 687-694, 1983, Springer, 3-540-12317-2. The full citation details ...](Pics/full.jpeg) |
1983 |
DBLP DOI BibTeX RDF |
|
Displaying result #501 - #600 of 3912 (100 per page; Change: ) Pages: [ <<][ 1][ 2][ 3][ 4][ 5][ 6][ 7][ 8][ 9][ 10][ 11][ 12][ 13][ 14][ 15][ >>] |
|