language:
Find link is a tool written by Edward Betts.Longer titles found: Workshop on Logic, Language, Information and Computation (view)
searching for Information and Computation 225 found (292 total)
alternate case: information and Computation
Aditi Sen De
(1,025 words)
[view diff]
case mismatch in snippet
view article
find links to article
Aditi Sen De is an Indian scientist, a professor in quantum information and computation group at the Harish-Chandra Research Institute, Prayagraj. SheOutline of computer science (1,053 words) [view diff] case mismatch in snippet view article find links to article
computing science) is the study of the theoretical foundations of information and computation and their implementation and application in computer systemsInstitute for Logic, Language and Computation (502 words) [view diff] exact match in snippet view article find links to article
Cognitive Modelling, Logic, Games and Social Agency and Quantum Information and Computation. The ILLC is involved in several international collaborationsSolovay–Kitaev theorem (3,329 words) [view diff] case mismatch in snippet view article find links to article
In quantum information and computation, the Solovay–Kitaev theorem says that if a set of single-qubit quantum gates generates a dense subgroup of SU(2)Biological computation (581 words) [view diff] case mismatch in snippet view article find links to article
organisms perform computations, and that as such, abstract ideas of information and computation may be key to understanding biology. As a field, biological computationMeasurement in quantum mechanics (8,316 words) [view diff] no match in snippet view article find links to article
In quantum physics, a measurement is the testing or manipulation of a physical system to yield a numerical result. A fundamental feature of quantum theoryJohn Woods (logician) (619 words) [view diff] exact match in snippet view article
Professor of Logic. He is also affiliated with the Group on Logic, Information and Computation within the Department of Informatics at King's College LondonRan Canetti (1,777 words) [view diff] exact match in snippet view article find links to article
He is also associate editor of the Journal of Cryptology and Information and Computation. His main areas of research span cryptography and informationProgramming Computable Functions (882 words) [view diff] exact match in snippet view article find links to article
M. E. & Ong, C.-H. L. (2000). "On Full Abstraction for PCF". Information and Computation. 163 (2): 285–408. doi:10.1006/inco.2000.2917. Abramsky, S.,Antony Valentini (1,370 words) [view diff] case mismatch in snippet view article find links to article
2005, doi:10.1098/rspa.2004.1394 Antony Valentini: Subquantum information and computation, 2002, Pramana Journal of Physics, vol. 59, no. 2, August 2002Giorgi Japaridze (2,612 words) [view diff] exact match in snippet view article find links to article
pages 1–62. G. Japaridze, "Introduction to clarithmetic II". Information and Computation 247 (2016), pages 290-312. G. Japaridze, "Introduction to clarithmeticNicolas J. Cerf (486 words) [view diff] exact match in snippet view article find links to article
of Technology. He is the director of the Center for Quantum Information and Computation at the Université Libre de Bruxelles. Together with ChristophRenato Renner (448 words) [view diff] exact match in snippet view article find links to article
Quantum Information Theory. His research interests include Quantum Information and Computation, the Foundations of Quantum Physics and Quantum thermodynamicsInteractive computation (195 words) [view diff] exact match in snippet view article find links to article
Sonderegger, Turing Machines, Transition Systems, and Interaction. J. Information and Computation 194:2 (2004), pp. 101-128 P. Wegner, Interactive foundationsQuantum Computation and Quantum Information (828 words) [view diff] exact match in snippet view article find links to article
Quantum Computation and Quantum Information" (PDF). Quantum Information and Computation. 1: 95–96. doi:10.26421/QIC1.2-5. Mermin, N. David (2003). "FromUnique negative dimension (192 words) [view diff] exact match in snippet view article find links to article
lower bound on the number of examples needed for learning". Information and Computation. 82 (3): 247–261. doi:10.1016/0890-5401(89)90002-3. S2CID 1925579Pierre Wolper (167 words) [view diff] exact match in snippet view article find links to article
Pierre (1994), "Reasoning about infinite computations" (PDF), Information and Computation, 115 (1), Boston, MA: Academic Press: 1–37, doi:10.1006/incoDenotational semantics (3,769 words) [view diff] exact match in snippet view article find links to article
Riecke, J.G. (July 1995). "Kripke Logical Relations and PCF". Information and Computation. 120 (1): 107–116. doi:10.1006/inco.1995.1103. S2CID 6886529Quantum information (4,542 words) [view diff] case mismatch in snippet view article find links to article
techniques led to increased interest in the field of quantum information and computation. In the 1980s, interest arose in whether it might be possibleSandu Popescu (1,563 words) [view diff] case mismatch in snippet view article find links to article
is co-editor and co-author of the first textbook on quantum information and computation. In 2015, Popescu appeared on Science Channel's Through the WormholeCharles H. Bennett (physicist) (839 words) [view diff] case mismatch in snippet view article
through noisy channels, part of the larger field of quantum information and computation theory. Together with others he also introduced the concept ofK. Birgitta Whaley (1,232 words) [view diff] exact match in snippet view article find links to article
UC Berkeley, Whaley is the director of the Berkeley Quantum Information and Computation Center, a member of the executive board for the Center for QuantumHarish-Chandra Research Institute (861 words) [view diff] exact match in snippet view article find links to article
Rajesh Gopakumar. HRI faculty member in the area of Quantum Information and Computation includes Arun K. Pati, Aditi Sen De and Ujjawal Sen. BesidesType safety (3,647 words) [view diff] exact match in snippet view article find links to article
(15 November 1994). "A Syntactic Approach to Type Soundness". Information and Computation. 115 (1): 38–94. doi:10.1006/inco.1994.1093. ISSN 0890-5401.List of unsolved problems in information theory (600 words) [view diff] exact match in snippet view article find links to article
not known. Adriaans, Pieter. "Open Problems in the Study of Information and Computation". Retrieved 21 June 2013. Cover, Thomas (1991-08-26). ElementsState complexity (3,375 words) [view diff] exact match in snippet view article find links to article
simulation of self-verifying automata by deterministic automata". Information and Computation. 209 (3): 528–535. doi:10.1016/j.ic.2010.11.017. ISSN 0890-5401PSPACE-complete (1,564 words) [view diff] exact match in snippet view article find links to article
(1964), "Classes of languages and linear-bounded automata", Information and Computation, 7 (2): 207–223, doi:10.1016/s0019-9958(64)90120-2, MR 0169724Quantum image processing (2,142 words) [view diff] exact match in snippet view article find links to article
Donkor, Eric; Pirich, Andrew R; Brandt, Howard E (eds.). Quantum Information and Computation. Vol. 5105. pp. 134–147. Bibcode:2003SPIE.5105..137V. doi:10Scott A. Smolka (382 words) [view diff] case mismatch in snippet view article find links to article
finite state processes, and three problems of equivalence." Information and computation 86, no. 1 (1990): 43–68. VanGlabbeek, Rob J., Scott A. SmolkaComputable measure theory (85 words) [view diff] exact match in snippet view article find links to article
"A computable approach to measure and integration theory", Information and Computation 207:5, pp. 642–659. Stephen G. Simpson (2009), Subsystems ofBoolean grammar (502 words) [view diff] exact match in snippet view article find links to article
(2010). Okhotin, Alexander (2004-10-10). "Boolean Grammars". Information and Computation. 194 (1): 19–48. doi:10.1016/j.ic.2004.03.006. Okhotin, AlexanderComputing (5,172 words) [view diff] case mismatch in snippet view article find links to article
business and computer science, using the theoretical foundations of information and computation to study various business models and related algorithmic processesQMA (1,845 words) [view diff] exact match in snippet view article find links to article
quantum spin systems on a two-dimensional square lattice". Quantum Information and Computation. 8 (10): 900–924. arXiv:quant-ph/0504050. Bibcode:2005quant.phSelf-verifying finite automaton (468 words) [view diff] exact match in snippet view article find links to article
One-Way Communication Complexity, OBDDs, and Finite Automata". Information and Computation. 169 (2): 284–296. doi:10.1006/inco.2001.3040. ISSN 0890-5401Schrödinger's cat (4,819 words) [view diff] exact match in snippet view article find links to article
original on 2015-05-19. Tetlow, Philip (2012). Understanding Information and Computation: From Einstein to Web Science. Gower Publishing, Ltd. p. 321Michael Nielsen (684 words) [view diff] case mismatch in snippet view article find links to article
of July 2023. In 2007, Nielsen shifted his focus from quantum information and computation to “the development of new tools for scientific collaborationUC Berkeley College of Chemistry (1,211 words) [view diff] exact match in snippet view article find links to article
Nanoengineering Institute Berkeley Nanotechnology Club Berkeley Quantum Information and Computation Center Berkeley Stem Cell Center California Research AllianceAll one polynomial (449 words) [view diff] exact match in snippet view article find links to article
"Structure of parallel multipliers for a class of fields GF(2m)", Information and Computation, 83 (1): 21–40, doi:10.1016/0890-5401(89)90045-X. Reyhani-MasolehStar-free language (542 words) [view diff] exact match in snippet view article find links to article
(1965). "On finite monoids having only trivial subgroups" (PDF). Information and Computation. 8 (2): 190–194. doi:10.1016/s0019-9958(65)90108-7. Lawson (2004)Π-calculus (4,833 words) [view diff] exact match in snippet view article find links to article
page 10, by R. Milner, J. Parrow and D. Walker published in Information and Computation 100(1) pp.1-40, Sept 1992 Robin Milner, Communicating and MobileVolunteer computing (1,829 words) [view diff] case mismatch in snippet view article find links to article
resources". Proceedings of the first international conference on Information and computation economies (in Charleston, South Carolina). New York, New York:Weighted majority algorithm (machine learning) (302 words) [view diff] exact match in snippet view article
Warmuth, M. (1994). "The Weighted Majority Algorithm" (PDF). Information and Computation. 108 (2): 212–261. doi:10.1006/inco.1994.1009. Littlestone, NBeijing Jiaotong University (1,227 words) [view diff] exact match in snippet view article find links to article
Tourism Management 120901K Security Management 120106TK Science Information and Computation Science 070102 School of Science Opto-electronic InformationNormal form (abstract rewriting) (1,285 words) [view diff] exact match in snippet view article
"Unique normal forms for lambda calculus with surjective pairing". Information and Computation. 80 (2): 97–113. doi:10.1016/0890-5401(89)90014-X. "logic - WhatAWPP (269 words) [view diff] exact match in snippet view article find links to article
Stuart A.; Li, Lide (2003). "An oracle builder's toolkit". Information and Computation. 182 (2): 95–136. doi:10.1016/S0890-5401(03)00018-X. MR 1971487Giovanni Pighizzini (358 words) [view diff] exact match in snippet view article find links to article
(2014). "Two-way automata making choices only at the endmarkers". Information and Computation. 239: 71–86. arXiv:1110.1263. doi:10.1016/j.ic.2014.08.009. ISSN 0890-5401Eugenio Moggi (99 words) [view diff] exact match in snippet view article find links to article
Eugenio (1991). "Notions of Computation and Monads" (PDF). Information and Computation. 93 (1): 55–92. doi:10.1016/0890-5401(91)90052-4. Available atHeap (data structure) (2,689 words) [view diff] exact match in snippet view article
(1993), "An Optimal Algorithm for Selection in a Min-Heap", Information and Computation (PDF), vol. 104, Academic Press, pp. 197–214, doi:10.1006/incoQuantum logic gate (10,122 words) [view diff] exact match in snippet view article find links to article
Michael (2006-01-01). "The Solovay-Kitaev algorithm". Quantum Information and Computation. 6 (1). Section 5.1, equation 23. arXiv:quant-ph/0505030. doi:10Joseph Sifakis (1,104 words) [view diff] exact match in snippet view article find links to article
June 1994). "Symbolic Model Checking for Real-Time Systems". Information and Computation. 111 (2): 193–244. doi:10.1006/inco.1994.1045. hdl:1813/6182Jugal Kalita (186 words) [view diff] exact match in snippet view article find links to article
Colorado Springs. (UCCS) Jugal Kalita is founder of the Language Information and Computation (LINC) Lab at the University of Colorado Colorado Springs (UCCS)Automata theory (3,843 words) [view diff] exact match in snippet view article find links to article
Algebras". Meseguer, J., Montanari, U.: 1990 Petri nets are monoids. Information and Computation 88:105–155 John E. Hopcroft; Rajeev Motwani; Jeffrey D. UllmanGreibach normal form (396 words) [view diff] exact match in snippet view article find links to article
Robert (1999). "Greibach Normal Form Transformation Revisited". Information and Computation. 150 (1): 112–118. CiteSeerX 10.1.1.47.460. doi:10.1006/incoList ranking (471 words) [view diff] exact match in snippet view article find links to article
(1989), "Faster optimal parallel prefix sums and list ranking", Information and Computation, 81 (3): 334–352, doi:10.1016/0890-5401(89)90036-9. Tarjan, RobertQuantum neural network (2,542 words) [view diff] exact match in snippet view article find links to article
"Quantum Algorithm design using dynamic learning". Quantum Information and Computation. 8 (1–2): 12–29. arXiv:0808.1558. doi:10.26421/QIC8.1-2-2. S2CID 18587557Cognitive linguistics (3,346 words) [view diff] exact match in snippet view article find links to article
perspective" (PDF). 23rd Pacific Asia Conference on Language, Information and Computation: 365–374. Retrieved 2020-05-31. Feyaerts, Kurt; Boeve, LievenSet constraint (919 words) [view diff] exact match in snippet view article find links to article
Podelski, Andreas (2002). "Set Constraints with Intersection". Information and Computation. 179 (2): 213–229. doi:10.1006/inco.2001.2952. Charatonik, WStrong monad (432 words) [view diff] exact match in snippet view article find links to article
Eugenio (July 1991). "Notions of computation and monads" (PDF). Information and Computation. 93 (1): 55–92. doi:10.1016/0890-5401(91)90052-4. Muscholl, AncaSpanning tree (3,265 words) [view diff] exact match in snippet view article find links to article
Jerrum, M. (2008), "Inapproximability of the Tutte polynomial", Information and Computation, 206 (7): 908–929, arXiv:cs/0605140, doi:10.1016/j.ic.2008.04FKT algorithm (1,402 words) [view diff] exact match in snippet view article find links to article
perfect matchings in K3,3-free graphs and related problems". Information and Computation. 80 (2): 152–164. doi:10.1016/0890-5401(89)90017-5. hdl:1813/6700Sharp-SAT (1,342 words) [view diff] exact match in snippet view article find links to article
"Complexity of Generalized Satisfiability Counting Problems". Information and Computation. 125: 1–12. doi:10.1006/inco.1996.0016. hdl:10068/41883. LichtensteinPartial k-tree (496 words) [view diff] exact match in snippet view article find links to article
"All structured programs have small tree width and good register allocation", Information and Computation, 142 (2): 159–181, doi:10.1006/inco.1997.2697.Itoh–Tsujii inversion algorithm (206 words) [view diff] exact match in snippet view article find links to article
Itoh and S. Tsujii. A Fast Algorithm for Computing Multiplicative Inverses in GF(2m) Using Normal Bases. Information and Computation, 78:171–177, 1988.AFNLP (208 words) [view diff] exact match in snippet view article find links to article
Computational Linguistics PACLIC: Pacific Asia Conference on Language, Information and Computation PRICAI: Pacific Rim International Conference on AI ICCPOL: InternationalQuantum non-equilibrium (1,175 words) [view diff] case mismatch in snippet view article find links to article
1098/rspa.2011.0598 (full text) Antony Valentini: Subquantum information and computation, 2002, Pramana Journal of Physics, vol. 59, no. 2, August 2002Syntactic monoid (1,550 words) [view diff] exact match in snippet view article find links to article
(1965). "On finite monoids having only trivial subgroups" (PDF). Information and Computation. 8 (2): 190–194. doi:10.1016/s0019-9958(65)90108-7. StraubingInformation system (5,872 words) [view diff] case mismatch in snippet view article find links to article
business and computer science using the theoretical foundations of information and computation to study various business models and related algorithmic processesLeonard Susskind (2,690 words) [view diff] case mismatch in snippet view article find links to article
Hat (FRW/CFT duality) Most recently, application of ideas from information and computation theory, such as the complexity equals action conjecture, to theNP-intermediate (1,326 words) [view diff] exact match in snippet view article find links to article
Condon, Anne (1992). "The complexity of stochastic games". Information and Computation. 96 (2): 203–224. doi:10.1016/0890-5401(92)90048-K. MR 1147987Integer overflow (3,338 words) [view diff] exact match in snippet view article find links to article
Matthias (1994). "A Syntactic Approach to Type Soundness". Information and Computation. 115 (1): 38–94. doi:10.1006/inco.1994.1093. Macrakis, StavrosPursuit–evasion (1,322 words) [view diff] exact match in snippet view article find links to article
(1994). "The vertex separation and search number of a graph". Information and Computation. 113 (1): 50–79. doi:10.1006/inco.1994.1064. Fomin, F.V.; ThilikosPursuit–evasion (1,322 words) [view diff] exact match in snippet view article find links to article
(1994). "The vertex separation and search number of a graph". Information and Computation. 113 (1): 50–79. doi:10.1006/inco.1994.1064. Fomin, F.V.; ThilikosConstructor theory (1,025 words) [view diff] case mismatch in snippet view article find links to article
that can express counterfactuals, thus allowing the laws of information and computation to be viewed as laws of physics. In constructor theory, a transformationInduction of regular languages (3,272 words) [view diff] exact match in snippet view article find links to article
(1987). "Learning Regular Sets from Queries and Counterexamples". Information and Computation. 75 (2): 87–106. doi:10.1016/0890-5401(87)90052-6. Bollig; Habermehl;Mihalis Yannakakis (1,447 words) [view diff] exact match in snippet view article find links to article
Yannakakis, Timing verification by successive approximation, Information and Computation, v.118 n.1, pp. 142–157, April 1995. Groce, A., Peled, D., andUCLA Henry Samueli School of Engineering and Applied Science (1,359 words) [view diff] exact match in snippet view article find links to article
Sensing (CENS) Center for High Frequency Electronics Center for Information and Computation Security (CICS) Center for Scalable and Integrated Nano-ManufacturingGame semantics (2,739 words) [view diff] case mismatch in snippet view article find links to article
Hyland and H.L.Ong On Full Abstraction for PCF: I, II, and III. Information and computation, 163(2), 285-408. E.J. Genot and J. Jacot, Logical DialoguesModular exponentiation (2,802 words) [view diff] exact match in snippet view article find links to article
Circuits for Modular Multiplication and Exponentiation". Quantum Information and Computation. 12 (5–6): 0361–0394. arXiv:1202.6614. Bibcode:2012arXiv1202Uyghur language (4,961 words) [view diff] exact match in snippet view article find links to article
Proceedings of the 30th Pacific Asia Conference on Language, Information and Computation: Oral Papers. 2016. Abdurehim, Esmael (2014). The Lopnor DialectSimon's problem (3,087 words) [view diff] exact match in snippet view article find links to article
Preskill, John (1998). Lecture Notes for Physics 229: Quantum Information and Computation. pp. 273–275. Aaronson, Scott (2018). Introduction to QuantumUncomputation (273 words) [view diff] exact match in snippet view article find links to article
"Quantum Lower Bound for Recursive Fourier Sampling". Quantum Information and Computation ():, 00. 3 (2): 165–174. arXiv:quant-ph/0209060. Bibcode:2002quantKleene algebra (1,914 words) [view diff] exact match in snippet view article find links to article
for Kleene Algebras and the Algebra of Regular Events" (PDF). Information and Computation. 110 (2): 366–390. doi:10.1006/inco.1994.1037. — An earlier versionComputational complexity theory (6,302 words) [view diff] exact match in snippet view article find links to article
Vikraman; Kurur, Piyush P. (2006), "Graph isomorphism is in SPP", Information and Computation, 204 (5): 835–852, doi:10.1016/j.ic.2006.02.002. Schöning, UweRational monoid (633 words) [view diff] exact match in snippet view article find links to article
1987). "Easy multiplications I. The realm of Kleene's theorem". Information and Computation. 74 (3): 173–197. doi:10.1016/0890-5401(87)90020-4. Zbl 0642F-coalgebra (929 words) [view diff] exact match in snippet view article find links to article
Automata and Fixed Point Logics: a Coalgebraic Perspective. Information and Computation, 204 (2006) 637-678. CALCO 2009: Conference on Algebra and CoalgebraClitic (4,961 words) [view diff] exact match in snippet view article find links to article
(1995). "Clitic Analyses of Korean "Little Words"". Language, Information and Computation Proceedings of the 10th Pacific Asia Conference: 97–102. ArchivedInduced matching (809 words) [view diff] exact match in snippet view article find links to article
Tan, Huan (2017), "Exact algorithms for maximum induced matching", Information and Computation, 256: 196–211, doi:10.1016/j.ic.2017.07.006, MR 3705425Reverse engineering (6,896 words) [view diff] exact match in snippet view article find links to article
(1987). "Learning regular sets from queries and counterexamples". Information and Computation. 75 (2): 87–106. doi:10.1016/0890-5401(87)90052-6. C.Y. Cho,Binary decision diagram (2,937 words) [view diff] exact match in snippet view article find links to article
Detlef (2002). "The nonapproximability of OBDD minimization". Information and Computation. 172 (2): 103–138. doi:10.1006/inco.2001.3076. Rice, MichaelUniversity of Colorado Colorado Springs (3,110 words) [view diff] exact match in snippet view article find links to article
division Jugal Kalita - Computer Science Professor, Language Information and Computation (LINC) Lab Garrett Swasey - UCCS police officer who died in theList of NP-complete problems (2,749 words) [view diff] exact match in snippet view article find links to article
Louxin (2003), "Distinguishing string selection problems", Information and Computation, 185 (1): 41–55, doi:10.1016/S0890-5401(03)00057-9, MR 1994748Quantum Fourier transform (3,148 words) [view diff] exact match in snippet view article find links to article
2001) John Preskill, Lecture Notes for Physics 229: Quantum Information and Computation (CIT, September 1998) Wolfram Demonstration Project: QuantumQuantum algorithm (4,558 words) [view diff] exact match in snippet view article find links to article
algorithms and applications in quantum complexity theory". Quantum Information and Computation. 8 (1): 147–180. arXiv:quant-ph/0603069. Bibcode:2006quant.phPrecoloring extension (412 words) [view diff] exact match in snippet view article find links to article
of some colorful problems parameterized by treewidth" (PDF), Information and Computation, 209 (2): 143–153, doi:10.1016/j.ic.2010.11.026, MR 2790022 HerzbergChannel system (computer science) (2,797 words) [view diff] exact match in snippet view article
Bengt (1996). "Verifying Programs with Unreliable Channels". Information and Computation. 127 (2): 91–101. doi:10.1006/inco.1996.0053. Schnoebelen, PhStar height problem (1,353 words) [view diff] exact match in snippet view article find links to article
"Algorithms for Determining Relative Star Height and Star Height". Information and Computation. 78 (2): 124–169. doi:10.1016/0890-5401(88)90033-8. LombardySynchronizing word (882 words) [view diff] exact match in snippet view article find links to article
Turku (WSA 2004). Jürgensen, H. (2008), "Synchronization", Information and Computation, 206 (9–10): 1033–1044, doi:10.1016/j.ic.2008.03.005 Volkov,Arun (given name) (1,305 words) [view diff] case mismatch in snippet view article
Pati, an Indian physicist notable for his research in quantum information and computation. Arun Kolatkar (1932–2004), Indian poet. Arun Krushnaji KambleP versus NP problem (7,720 words) [view diff] exact match in snippet view article find links to article
Vikraman; Kurur, Piyush P. (2006). "Graph isomorphism is in SPP". Information and Computation. 204 (5): 835–852. doi:10.1016/j.ic.2006.02.002. Schöning, UweInstitution (computer science) (1,110 words) [view diff] exact match in snippet view article
Tarlecki (1988), "Specifications in an arbitrary institution", Information and Computation, 76 (2–3): 165–210, doi:10.1016/0890-5401(88)90008-9 R. DiaconescuGeorge Armitage Miller (4,262 words) [view diff] case mismatch in snippet view article find links to article
performance improved with reinforcement—and using the tools of information and computation to place hypotheses on a sound theoretical framework and to analyzeShor's algorithm (5,708 words) [view diff] exact match in snippet view article find links to article
Circuits for Modular Multiplication and Exponentiation". Quantum Information and Computation. 12 (5–6): 361–394. arXiv:1202.6614. Bibcode:2012arXiv1202.6614MHalting problem (7,232 words) [view diff] exact match in snippet view article find links to article
Bengt (1996). "Verifying Programs with Unreliable Channels". Information and Computation. 127 (2): 91–101. doi:10.1006/inco.1996.0053. Collected worksRandomization (2,646 words) [view diff] exact match in snippet view article find links to article
"Testing probabilistic equivalence through Reinforcement Learning". Information and Computation. 227: 21–57. doi:10.1016/j.ic.2013.02.002. ISSN 0890-5401. SedgwickMajorana fermion (4,879 words) [view diff] exact match in snippet view article find links to article
costs using dislocation codes and arbitrary ancillas". Quantum Information and Computation. 15 (11–12): 0962–0986. arXiv:1408.3379. Bibcode:2014arXiv1408POVM (3,068 words) [view diff] exact match in snippet view article find links to article
Publishers, 1993. J. Preskill, Lecture Notes for Physics: Quantum Information and Computation, Chapter 3, http://theory.caltech.edu/~preskill/ph229/index.htmlArrangement of hyperplanes (1,804 words) [view diff] exact match in snippet view article find links to article
Stefan (1993), "Point location in arrangements of hyperplanes", Information and Computation, 106 (2): 286–303, doi:10.1006/inco.1993.1057, MR 1241314. OrlikHybrid automaton (917 words) [view diff] exact match in snippet view article find links to article
pages 3–34, 1995. Nancy Lynch, Roberto Segala, Frits Vaandrager, Hybrid I/O Automata. Information and Computation, volume 185(1), pages 103–157, 2003.System F (2,529 words) [view diff] exact match in snippet view article find links to article
Scedrov, Andre (1994). "An extension of system F with subtyping". Information and Computation, vol. 9. North Holland, Amsterdam. pp. 4–56. doi:10.1006/incoInversion (discrete mathematics) (1,903 words) [view diff] exact match in snippet view article
Vladimir; Wood, Derick (1989). "A new measure of presortedness". Information and Computation. 83 (1): 111–119. doi:10.1016/0890-5401(89)90050-3. Skiena, StevenOutline of science (4,455 words) [view diff] case mismatch in snippet view article find links to article
computer science, the study of the theoretical foundations of information and computation Library scientist – interdisciplinary or multidisciplinary fieldAlternating-time temporal logic (520 words) [view diff] exact match in snippet view article find links to article
Thomas A.; Piterman, Nir (2010-06-01). "Strategy logic" (PDF). Information and Computation. Special Issue: 18th International Conference on ConcurrencyToric code (3,878 words) [view diff] exact match in snippet view article find links to article
"Limitations of passive protection of quantum information". Quantum Information and Computation. 10 (7&8): 580. arXiv:0911.3843. doi:10.26421/qic10.7-8. ISSN 1533-7146Clique problem (9,876 words) [view diff] exact match in snippet view article find links to article
(2002), "Finding cliques by quantum adiabatic evolution", Quantum Information and Computation, 2 (3): 181–191, arXiv:quant-ph/0012104, Bibcode:2000quant.phSubtyping (3,590 words) [view diff] exact match in snippet view article find links to article
Science, pages 51–67. Springer-Verlag, 1984. Full version in Information and Computation, 76(2/3):138–164, 1988. Cook, Hill & Canning 1990. Pierce, chQuantum pseudo-telepathy (2,770 words) [view diff] exact match in snippet view article find links to article
multi-player game into the framework of pseudo-telepathy". Quantum Information and Computation. 5 (7): 538–550. arXiv:quant-ph/0408052. Bibcode:2004quant.phBinary heap (4,887 words) [view diff] exact match in snippet view article find links to article
(1990). "A characterization of heaps and its applications". Information and Computation. 86: 69–86. doi:10.1016/0890-5401(90)90026-E. Atkinson, M.D.;Quantum entanglement (12,919 words) [view diff] exact match in snippet view article find links to article
"Strong NP-Hardness of the Quantum Separability Problem". Quantum Information and Computation. 10 (3&4): 343–360. arXiv:0810.4507. doi:10.26421/QIC10.3-4-11Cristian S. Calude (1,171 words) [view diff] exact match in snippet view article find links to article
Frank (2016). "Finite state incompressible infinite sequences". Information and Computation. 247: 23–36. doi:10.1016/j.ic.2015.11.003. hdl:2292/21343. CaludeG. D. Birla Award for Scientific Research (355 words) [view diff] exact match in snippet view article find links to article
Recipient Field Institution 2023 Prof. Aditi Sen(De) Quantum Information and Computation Harish-Chandra Research Institute 2022 Prof. Narayan PradhanBoolean satisfiability problem (5,312 words) [view diff] exact match in snippet view article find links to article
Flogel, A. (1995). "Resolution for Quantified Boolean Formulas". Information and Computation. 117 (1). Elsevier: 12–18. doi:10.1006/inco.1995.1025. MooreA New Kind of Science (3,473 words) [view diff] exact match in snippet view article find links to article
Review of A New Kind of Science (Postscript file)". Quantum Information and Computation. 2 (5): 410–423. doi:10.26421/QIC2.5-7. "ZUSE-FREDKIN-THESIS"Separable state (2,379 words) [view diff] exact match in snippet view article find links to article
Strong NP-Hardness of the Quantum Separability Problem, Quantum Information and Computation, Vol. 10, No. 3&4, pp. 343-360, 2010. arXiv:0810.4507. HofmannHorn-satisfiability (1,048 words) [view diff] exact match in snippet view article find links to article
Flogel, A. (1995). "Resolution for Quantified Boolean Formulas". Information and Computation. 117 (1). Elsevier: 12–18. doi:10.1006/inco.1995.1025. LewisCivil Aviation Flight University of China (1,006 words) [view diff] case mismatch in snippet view article find links to article
management Traffic engineering Computer science and technology Information and computation science English Cabin attendants Air safety guard Air securityBrian Josephson (5,928 words) [view diff] case mismatch in snippet view article find links to article
"Quantum theory is now being fruitfully combined with theories of information and computation. These developments may lead to an explanation of processes stillKolmogorov complexity (7,143 words) [view diff] exact match in snippet view article find links to article
points, statistical behavior, complexity and entropy" (PDF). Information and Computation. 208: 23–41. arXiv:0801.0209. doi:10.1016/j.ic.2009.05.001. S2CID 5555443Yaron Oz (451 words) [view diff] case mismatch in snippet view article find links to article
supersymmetry, classical and quantum gravity, superstrings, quantum information and computation. Currently, Oz has published more than 160 scientific articlesTemporal Process Language (479 words) [view diff] exact match in snippet view article find links to article
Proc\\|&X\\|&\Omega \\|&Proc\setminus a\\|&0\\\end{matrix}}} Matthew Hennessy and Tim Regan : A Process Algebra for Timed Systems. Information and Computation, 1995.Alternating finite automaton (808 words) [view diff] exact match in snippet view article find links to article
"Descriptional and computational complexity of finite automata—A survey". Information and Computation. 209 (3): 456–470. doi:10.1016/j.ic.2010.11.013. ISSN 0890-5401Böhm tree (1,841 words) [view diff] exact match in snippet view article find links to article
Sets in the Infinitary Lambda Calculus" (PDF). Logic, Language, Information and Computation. Lecture Notes in Computer Science. Vol. 6642. pp. 210–227. doi:10List of Scottish inventions and discoveries (6,561 words) [view diff] case mismatch in snippet view article find links to article
Texas Tech University Press. ISBN 0-89672-414-X Logic, language, information and computation: 15th international workshop, WoLLIC 2008, Edinburgh, UK, JulyRow polymorphism (656 words) [view diff] exact match in snippet view article find links to article
inference for record concatenation and multiple inheritance". Information and Computation. 93 (Selections from 1989 IEEE Symposium on Logic in ComputerRandomized weighted majority algorithm (2,401 words) [view diff] exact match in snippet view article find links to article
N.; Warmuth, M. (1994). "The Weighted Majority Algorithm". Information and Computation. 108 (2): 212–261. doi:10.1006/inco.1994.1009. "COS 511: FoundationsBell's theorem (9,985 words) [view diff] exact match in snippet view article find links to article
multi-player game into the framework of pseudo-telepathy". Quantum Information and Computation. 5 (7): 538–550. arXiv:quant-ph/0408052. Bibcode:2004quant.phTerm indexing (873 words) [view diff] exact match in snippet view article find links to article
2004 A. Riazanov and A. Voronkov, Efficient Instance Retrieval with Standard and Relational Path Indexing, Information and Computation, 199(1–2), 2005Cantor's isomorphism theorem (2,979 words) [view diff] exact match in snippet view article find links to article
Christian (2013), "Isomorphism of regular trees and words", Information and Computation, 224: 71–105, arXiv:1102.2782, doi:10.1016/j.ic.2013.01.002,Heapsort (5,718 words) [view diff] exact match in snippet view article find links to article
variant of BOTTOM-UP HEAPSORT is less than n log n + 1.1n". Information and Computation. 97 (1): 86–96. doi:10.1016/0890-5401(92)90005-Z. Tenenbaum,Quantum mind (8,593 words) [view diff] exact match in snippet view article find links to article
original on 2015-05-19. Tetlow, Philip (2012). Understanding Information and Computation: From Einstein to Web Science. Gower Publishing, Limited. p. 321Multiplication algorithm (6,422 words) [view diff] exact match in snippet view article find links to article
multiplication on randomized ordered read-once branching programs" (PDF). Information and Computation. 186 (1): 78–89. doi:10.1016/S0890-5401(03)00118-4. Knuth, DonaldUniversity College of Science, Technology and Agriculture (5,189 words) [view diff] case mismatch in snippet view article find links to article
Indian Physicist and currently associate professor in quantum information and computation group at Harish-Chandra Research Institute, Allahabad.) KalobaranBiexciton (1,930 words) [view diff] case mismatch in snippet view article find links to article
physics, biexcitons are created from two free excitons. In quantum information and computation, it is essential to construct coherent combinations of quantumViliam Geffert (313 words) [view diff] exact match in snippet view article find links to article
Pighizzini, Giovanni (2007). "Complementing two-way finite automata". Information and Computation. 205 (8): 1173–1187. doi:10.1016/j.ic.2007.01.008. ISSN 0890-5401Language equation (1,105 words) [view diff] exact match in snippet view article find links to article
"Computational completeness of equations over sets of natural numbers". Information and Computation. 237: 56–94. CiteSeerX 10.1.1.395.2250. doi:10.1016/j.ic.2014Prakash Panangaden (873 words) [view diff] case mismatch in snippet view article find links to article
probabilistic and concurrent computation, logics and duality and quantum information and computation. Despite the enormous breadth of his research, he has made significantRainer Blatt (1,167 words) [view diff] exact match in snippet view article find links to article
Audretsch (Ed.): Entangled World: The Fascination of Quantum Information and Computation. Wiley 2006 ISBN 978-3-527-40470-4 Quantum Optics and SpectroscopyClassifier (linguistics) (6,154 words) [view diff] exact match in snippet view article
Proceedings of the 15th Pacific Asia Conference on Language, Information and Computation, PACLIC 2001, Hong Kong, China, February 1-3, 2001: 259–270.Wavelet Tree (681 words) [view diff] exact match in snippet view article find links to article
Giancarlo, G. Manzini, The myriad virtues of Wavelet Trees, Information and Computation, Volume 207, Issue 8, August 2009, Pages 849-866 G. Navarro,Matthew Hastings (291 words) [view diff] exact match in snippet view article find links to article
classical statistical mechanics on expander graphs". Quantum Information and Computation. 14 (1&2): 144–180. arXiv:1301.1363. doi:10.26421/qic14.1-2-9Growing context-sensitive grammar (410 words) [view diff] exact match in snippet view article find links to article
"Growing Context-Sensitive Languages and Church-Rosser Languages". Information and Computation. 141: 1–36. doi:10.1006/inco.1997.2681. Gundula Niemann and JensJuhani Karhumäki (362 words) [view diff] exact match in snippet view article find links to article
Complexity Method for Measuring Nondeterminism in Finite Automata". Information and Computation. 172 (2): 202–217. doi:10.1006/inco.2001.3069. ISSN 0890-5401Well-structured transition system (1,001 words) [view diff] exact match in snippet view article find links to article
Analysis of Programs with Well Quasi-ordered Domains (2000), Information and Computation, Vol. 160 issues 1-2, pp. 109--127 Alain Finkel and PhilippeFaron Moller (416 words) [view diff] exact match in snippet view article find links to article
Srba, On the Computational Complexity of Bisimulation, Redux, Information and Computation , Volume 194(2), Elsevier (2004), pp129–143. F Moller and G StruthEar decomposition (1,901 words) [view diff] exact match in snippet view article find links to article
(1992), "Parallel recognition of series–parallel graphs" (PDF), Information and Computation, 98 (1): 41–55, doi:10.1016/0890-5401(92)90041-D, MR 1161075Orthogonal convex hull (1,508 words) [view diff] exact match in snippet view article find links to article
(1987), "Optimal computation of finitely oriented convex hulls", Information and Computation, 72 (2): 150–166, doi:10.1016/0890-5401(87)90045-9. Rawlins,Interaction nets (1,878 words) [view diff] exact match in snippet view article find links to article
S2CID 19458687. Lafont, Yves (1997). "Interaction Combinators". Information and Computation. 137 (1). Academic Press, Inc.: 69–101. doi:10.1006/inco.1997Elementary cellular automaton (2,803 words) [view diff] exact match in snippet view article find links to article
Elementary, Finite and Linear vN-Regular Cellular Automata, Information and Computation, vol. 274, 104533. Section 3. https://doi.org/10.1016/j.ic.2020Green's relations (2,295 words) [view diff] exact match in snippet view article find links to article
1987). "Easy multiplications I. The realm of Kleene's theorem". Information and Computation. 74 (3): 173–197. doi:10.1016/0890-5401(87)90020-4. Zbl 0642Robotic sensing (3,690 words) [view diff] exact match in snippet view article find links to article
and Competitiveness of Exploring Polygons by Mobile Robots." Information and Computation 209 (1): 74-88. Dahiya, Ravinder S.; Valle, Maurizio (2013).Monad (functional programming) (9,422 words) [view diff] exact match in snippet view article
Eugenio (1991). "Notions of computation and monads" (PDF). Information and Computation. 93 (1): 55–92. CiteSeerX 10.1.1.158.5275. doi:10.1016/0890-5401(91)90052-4Reduction strategy (2,602 words) [view diff] exact match in snippet view article find links to article
Takahashi, M. (April 1995). "Parallel Reductions in λ-Calculus". Information and Computation. 118 (1): 120–127. doi:10.1006/inco.1995.1057. Blanc, Tomasz;Computational social choice (1,676 words) [view diff] exact match in snippet view article find links to article
single-peaked preferences are more open to manipulation and control". Information and Computation. 209 (2): 89–107. arXiv:0909.3257. doi:10.1016/j.ic.2010.09.001Courcelle's theorem (3,088 words) [view diff] exact match in snippet view article find links to article
second-order logic of graphs. I. Recognizable sets of finite graphs", Information and Computation, 85 (1): 12–75, doi:10.1016/0890-5401(90)90043-H, MR 1042649Clifford gates (934 words) [view diff] exact match in snippet view article find links to article
qubit unitaries generated by Clifford and T gates". Quantum Information and Computation. 13 (7–8): 607–630. arXiv:1206.5236. doi:10.26421/QIC13.7-8-4List of British innovations and discoveries (13,317 words) [view diff] case mismatch in snippet view article find links to article
Maxwell Popular Astronomy By Simon Newcomb Logic, language, information and computation: 15th international workshop, WoLLIC 2008, Edinburgh, UK, JulyLudwig Staiger (445 words) [view diff] exact match in snippet view article find links to article
F. Stephan. Finite state incompressible infinite sequences, Information and Computation 247 (2016), 23-36. Staiger, L. "On Oscillation-Free Chaitin h-RandomFrobenius algebra (3,229 words) [view diff] exact match in snippet view article find links to article
"Monoidal computer I: Basic computability by string diagrams", Information and Computation, 226: 94–116, arXiv:1208.5205, doi:10.1016/j.ic.2013.03.007,Penny graph (1,962 words) [view diff] exact match in snippet view article find links to article
simple randomized sieve algorithm for the closest-pair problem", Information and Computation, 118 (1): 34–37, doi:10.1006/inco.1995.1049, MR 1329236 BowenJerry M. Chow (924 words) [view diff] exact match in snippet view article find links to article
for arbitrary error detection", Proceedings of SPIE Quantum Information and Computation XIII, 95001G (2015), doi:10.1117/12.2192740 "APS Fellow Archive"Unambiguous finite automaton (1,220 words) [view diff] exact match in snippet view article find links to article
Alexander (2012). "Unambiguous finite automata over a unary alphabet". Information and Computation. 212: 15–36. doi:10.1016/j.ic.2012.01.003. ISSN 0890-5401.Chromatic polynomial (4,274 words) [view diff] exact match in snippet view article find links to article
Jerrum, M. (2008), "Inapproximability of the Tutte polynomial", Information and Computation, 206 (7): 908, arXiv:cs/0605140, doi:10.1016/j.ic.2008.04.003Rüdiger Valk (848 words) [view diff] exact match in snippet view article find links to article
Safe States in Banker-like Resource Allocation Problems. In: Information and Computation. 75 (1987), pp. 232–263. (with D. Hauschildt) Bridging the GapFractional Fourier transform (3,733 words) [view diff] exact match in snippet view article find links to article
"Quantum simulations of one dimensional quantum systems". Quantum Information and Computation. 16: 1125–1168. arXiv:1503.06319v2. Shi, Jun; Zhang, NaiTong;Louxin Zhang (840 words) [view diff] exact match in snippet view article find links to article
theorem and two algorithms for reticulation-visible networks". Information and Computation. 252: 161–175. doi:10.1016/j.ic.2016.11.001. ISSN 0890-5401.Outline of technology (7,173 words) [view diff] case mismatch in snippet view article find links to article
Computer science – the study of the theoretical foundations of information and computation and of practical techniques for their implementation and applicationDigital infinity (2,459 words) [view diff] case mismatch in snippet view article find links to article
some kind of digital computer operating inside the human brain. Information and computation reside in patterns of data and in relations of logic that areCurry–Howard correspondence (6,197 words) [view diff] exact match in snippet view article find links to article
Eugenio (1991), "Notions of Computation and Monads" (PDF), Information and Computation, 93 (1): 55–92, doi:10.1016/0890-5401(91)90052-4 Sørenson, Morten;Bernhard Steffen (computer scientist) (475 words) [view diff] exact match in snippet view article
generative, and stratified models of probabilistic processes". Information and Computation. 121: 59–80. doi:10.1006/inco.1995.1123. S2CID 180902. SpringerMarcin Schroeder (569 words) [view diff] case mismatch in snippet view article find links to article
articles on subjects from general algebra, philosophy and theory of information and computation, as well as philosophy and history of science, logic, foundationsMultiple dispatch (5,881 words) [view diff] exact match in snippet view article find links to article
(1995). "A calculus for overloaded functions with subtyping". Information and Computation. 117 (1): 115–135. doi:10.1006/inco.1995.1033. Castagna, GiuseppeEffective dimension (2,034 words) [view diff] exact match in snippet view article find links to article
Staiger (1993). "Kolmogorov complexity and Hausdorff dimension". Information and Computation. 103 (2): 159–194. doi:10.1006/inco.1993.1017. Elvira MayordomoThree-stage quantum cryptography protocol (778 words) [view diff] exact match in snippet view article find links to article
Michael R; Lomonaco, Samuel J; Myers, John M (eds.). Quantum Information and Computation XII. Vol. 9123. p. 912308. doi:10.1117/12.2050164. S2CID 62145124Murray Eden (993 words) [view diff] exact match in snippet view article find links to article
ISSN 0019-9958. Meyer, Albert R. (1987-01-01). "A change of name". Information and Computation. 72 (1): iii. doi:10.1016/0890-5401(87)90047-2. ISSN 0890-5401Sample complexity (2,202 words) [view diff] exact match in snippet view article find links to article
lower bound on the number of examples needed for learning". Information and Computation. 82 (3): 247. doi:10.1016/0890-5401(89)90002-3. Anthony, Martin;Subject-oriented business process management (1,509 words) [view diff] exact match in snippet view article find links to article
(1992). "A Calculus of Mobile Processes, Parts I and II" (PDF). Information and Computation. 100 (1): 1–77. doi:10.1016/0890-5401(92)90008-4. hdl:20.500Covariance and contravariance (computer science) (6,691 words) [view diff] exact match in snippet view article
version: — (February 1988). "A semantics of multiple inheritance". Information and Computation. 76 (2/3): 138–164. CiteSeerX 10.1.1.116.1298. doi:10.1016/0890-5401(88)90007-7Swap test (1,053 words) [view diff] exact match in snippet view article find links to article
Nearest-Neighbor Methods for Supervised and Unsupervised Learning". Quantum Information and Computation. 15 (3–4). Rinton Press, Incorporated: 316–356. arXiv:1401.2142Belief revision (7,932 words) [view diff] exact match in snippet view article find links to article
Alberto O. Mendelzon (1995). Updates and subjunctive queries. Information and Computation, 2(116):241–252. G. Grahne, Alberto O. Mendelzon, and P. ReveszSergio Albeverio (1,684 words) [view diff] case mismatch in snippet view article find links to article
Entanglement and decoherence: mathematics and physics of quantum information and computation. Oberwolfach Rep. 2 (1), pp. 185–255 (2005) (EMS Publ.) withGermán Sierra (5,112 words) [view diff] case mismatch in snippet view article find links to article
physics, conformal field theory, exactly solved models, quantum information and computation and number theory. He has authored two books entitled, QuantumNLTS conjecture (1,106 words) [view diff] exact match in snippet view article find links to article
classical statistical mechanics on expander graphs". Quantum Information and Computation. 14 (1&2): 144–180. arXiv:1301.1363. doi:10.26421/qic14.1-2-9Anti-unification (3,058 words) [view diff] exact match in snippet view article find links to article
"A modular order-sorted equational generalization algorithm". Information and Computation. 235: 98–136. doi:10.1016/j.ic.2014.01.006. hdl:2142/25871. PurelyCem Say (489 words) [view diff] exact match in snippet view article find links to article
"Unbounded-error quantum computation with small space bounds". Information and Computation 209 (6), 873-892 Cem Say has an active profile in popular mediaCésar Hidalgo (2,149 words) [view diff] case mismatch in snippet view article find links to article
Hidalgo explains economic growth as a consequence of the growth of information and computation in the universe. The book starts by explaining the physical mechanismsDafydd Gibbon (1,996 words) [view diff] exact match in snippet view article find links to article
"Invited Speakers". The 23rd Pacific Asia Conference on Language, Information and Computation. Retrieved 23 July 2018. "Dafydd Gibbon". ORCID. Retrieved 23Effect algebra (2,129 words) [view diff] exact match in snippet view article find links to article
"Effect algebras, presheaves, non-locality and contextuality". Information and Computation. 261: 336–354. doi:10.1016/j.ic.2018.02.012. hdl:2066/193535Christoph Walther (1,280 words) [view diff] exact match in snippet view article find links to article
Walther; Thomas Kolbe (2000). "On Terminating Lemma Speculations". Information and Computation. 162 (1–2): 96–116. doi:10.1006/inco.1999.2859. Christoph Walther;Glossary of quantum computing (5,481 words) [view diff] case mismatch in snippet view article find links to article
qubits with multiple states. Solovay–Kitaev theorem In quantum information and computation, the Solovay–Kitaev theorem says, roughly, that if a set of single-qubitMichel Raynal (1,499 words) [view diff] exact match in snippet view article find links to article
Trackability: A Minimal Characterization and Its Protocol". Information and Computation. 165 (2): 144–173. doi:10.1006/inco.2000.2906. Hélary, J.-M.;Dale Miller (academic) (1,311 words) [view diff] exact match in snippet view article
Logic programming in a fragment of intuitionistic linear logic. Information and Computation, 110(2), 327–365. Miller, D., & Tiu, A. (2005). A proof theoryGlossary of computer science (23,798 words) [view diff] case mismatch in snippet view article find links to article
computer science, the study of the theoretical foundations of information and computation and their application. computer security The protection of computerMultiparty communication complexity (1,175 words) [view diff] exact match in snippet view article find links to article
BNS lower bound for multi-party protocols is nearly optimal", Information and Computation, 112 (1): 51–54, doi:10.1006/inco.1994.1051, MR 1277711. BruckUniversity of Kurdistan (Iran) (2,269 words) [view diff] exact match in snippet view article
– Astronomy and Astrophysics * Theoretical Physics- Quantum Information and Computation * Theoretical Physics- Gravity & Cosmology * Photonics * * BiologyComplementation of automata (231 words) [view diff] exact match in snippet view article find links to article
Giovanni (2007-08-01). "Complementing two-way finite automata". Information and Computation. 205 (8): 1173–1187. doi:10.1016/j.ic.2007.01.008. ISSN 0890-5401Kim Guldstrand Larsen (1,583 words) [view diff] exact match in snippet view article find links to article
"Bisimulation through probabilistic testing. Information and computation". Information and Computation. 94 (1): 1–28. doi:10.1016/0890-5401(91)90030-6Hindley–Milner type system (8,445 words) [view diff] exact match in snippet view article find links to article
Scedrov, Andre (1994). "An extension of system F with subtyping". Information and Computation, vol. 9. North Holland, Amsterdam. pp. 4–56. doi:10.1006/incoDependence logic (4,500 words) [view diff] exact match in snippet view article find links to article
(2009), 'Team Logic and Second-Order Logic'. In Logic, Language, Information and Computation, pp. 230–241. Kontinen, Juha and Väänänen, Jouko (2009), 'OnK-sorted sequence (1,581 words) [view diff] exact match in snippet view article find links to article
Vladimir; Wood, Derick (October 1989). "A new measure of presortdness". Information and Computation. 83 (1): 111–119. doi:10.1016/0890-5401(89)90050-3.LIVAC Synchronous Corpus (1,334 words) [view diff] exact match in snippet view article find links to article
Proceedings of the 34th Pacific Asia Conference on Language, Information and Computation. 2020. Tsou, B. K. (2022). Some Salient as well as DivergentVivek Shende (895 words) [view diff] exact match in snippet view article find links to article
Igor L. (2009). "On the CNOT-cost of TOFFOLI gates". Quantum Information and Computation. 9 (5&6): 461–486. arXiv:0803.2316. doi:10.26421/QIC8.5-6-8.List of people from Uttar Pradesh (10,485 words) [view diff] case mismatch in snippet view article find links to article
Aditi Sen De is an Indian scientist, a professor in quantum information and computation group at the Harish-Chandra Research Institute, Allahabad. AmitaClifford group (1,349 words) [view diff] exact match in snippet view article find links to article
"Optimal synthesis of linear reversible circuits". Quantum Information and Computation. 8 (3). arXiv:quant-ph/0302002. Maslov, Dmitri; Roetteler, MartinZX-calculus (2,725 words) [view diff] case mismatch in snippet view article find links to article
factor. The ZX-calculus has been used in a variety of quantum information and computation tasks. It has been used to describe measurement-based quantumIncompressibility method (3,534 words) [view diff] exact match in snippet view article find links to article
Vitanyi, "Tape versus queue and stacks: The lower bounds", Information and Computation, 78:1(1988), 56–85. doi:10.1016/0890-5401(88)90003-X D. E. KnuthDmitri Maslov (709 words) [view diff] exact match in snippet view article find links to article
single-qubit unitaries generated by Clifford and T gates". Quantum Information and Computation. 12 (7–8): 607–630. arXiv:1206.5236. Maslov, Dmitri (2016-02-10)Unknowability (1,250 words) [view diff] exact match in snippet view article find links to article
and hypotheses steer atomic clocks," Proc. SPIE 9123, Quantum Information and Computation XII, 91230T (22 May 2014); https://doi.org/10.1117/12.2054945DARPA Quantum Network (1,261 words) [view diff] exact match in snippet view article find links to article
Greg Troxel, Proceedings AeroSense 2003, Volume 5105, Quantum Information and Computation, 2003. "The DARPA Quantum Network", Chip Elliott, December 2004Deafness in the Philippines (4,087 words) [view diff] exact match in snippet view article find links to article
Philippine Languages". 23rd Asia Pacific Conference on Language, Information and Computation: 646–653 – via ACL Anthology. Deaf Sponsorship - Why Become anHuman rights and encryption (8,171 words) [view diff] case mismatch in snippet view article find links to article
computer science. It can generally be defined as "the protection of information and computation using mathematical techniques." Encryption and cryptography areFlip distance (1,422 words) [view diff] exact match in snippet view article find links to article
(2021). "An fpt2 FPT algorithm for the flip distance problem". Information and Computation. 281. Elsevier BV: 104708. arXiv:1910.06185. doi:10.1016/j.icList-labeling problem (2,507 words) [view diff] exact match in snippet view article find links to article
Deletions in a Sequentially Ordered File in Good Worst-Case Time", Information and Computation, vol. 97, pp. 150–204. Dietz, Paul F.; Seiferas, Joel I.; ZhangHindustani verbs (5,206 words) [view diff] exact match in snippet view article find links to article
Proceedings of the 25th Pacific Asia Conference on Language, Information and Computation. Singapore: Institute of Digital Enhancement of Cognitive ProcessingIgor L. Markov (2,624 words) [view diff] exact match in snippet view article find links to article
"Efficient Synthesis of Linear Reversible Circuits". Quantum Information and Computation. 8 (3–4): 282–294. arXiv:quant-ph/0302002. doi:10.26421/QIC8Refocusing (semantics) (2,786 words) [view diff] exact match in snippet view article
(2009). "A rewriting logic approach to operational semantics". Information and Computation. 207 (2): 305–340. doi:10.1016/j.ic.2008.03.026. hdl:2142/11265Glossary of logic (29,838 words) [view diff] no match in snippet view article find links to article
Moortgat, Michael; Queiroz, Ruy de (2019-06-23). Logic, Language, Information, and Computation: 26th International Workshop, WoLLIC 2019, Utrecht, The Netherlands