The FacetedDBLP logo    Search for: in:

Disable automatic phrases ?     Syntactic query expansion: ?

Searching for phrase cycle-free (changed automatically) with no syntactic query expansion in all metadata.

Publication years (Num. hits)
1973-1994 (16) 1995-2000 (15) 2001-2004 (16) 2005-2007 (16) 2008-2009 (16) 2010-2017 (18) 2018-2021 (17) 2022-2023 (9)
Publication types (Num. hits)
article(71) inproceedings(52)
GrowBag graphs for keyword ? (Num. hits/coverage)

Group by:
The graphs summarize 50 occurrences of 44 keywords

Results
Found 123 publication records. Showing 123 according to the selection in the facets
Hits ? Authors Title Venue Year Link Author keywords
43John Kenneth Truss Elementary Properties of Cycle-free Partial Orders and their Automorphism Groups. Search on Bibsonomy Order The full citation details ... 2001 DBLP  DOI  BibTeX  RDF cycle-free, first order, partial order, automorphism group
42Thomas Linke, Hans Tompits, Stefan Woltran On Acyclic and Head-Cycle Free Nested Logic Programs. Search on Bibsonomy ICLP The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
33Klaus Wich Universal Inherence of Cycle-Free Context-Free Ambiguity Functions. Search on Bibsonomy ICALP The full citation details ... 2002 DBLP  DOI  BibTeX  RDF
29Guy Kortsarz, Michael Langberg, Zeev Nutov Approximating Maximum Subgraphs without Short Cycles. Search on Bibsonomy APPROX-RANDOM The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
25Yehuda Koren, Stephen C. North, Chris Volinsky Measuring and extracting proximity graphs in networks. Search on Bibsonomy ACM Trans. Knowl. Discov. Data The full citation details ... 2007 DBLP  DOI  BibTeX  RDF Connection subgraph, cycle-free escape probability, escape probability, proximity subgraph, random walk, graph mining, proximity
25Yehuda Koren, Stephen C. North, Chris Volinsky Measuring and extracting proximity in networks. Search on Bibsonomy KDD The full citation details ... 2006 DBLP  DOI  BibTeX  RDF connection subgraph, cycle-free escape probability, escape probability, proximity subgraph, random walks, proximity
25Tapan J. Chakraborty, Vishwani D. Agrawal Design for high-speed testability of stuck-at faults. Search on Bibsonomy VLSI Design The full citation details ... 1996 DBLP  DOI  BibTeX  RDF design for high-speed testability, stuck-at fault detection, signal transition, timing hazard, multivalue algebra, dh-robust test, sequential feedback, reconvergent fanout, cycle-free sequential circuit, fault diagnosis, logic testing, delays, design for testability, logic design, sequential circuits, partial scan, test generation algorithm, critical path delay
24Stephen L. Bloom, Zoltán Ésik, Werner Kuich Cycle-Free Finite Automata in Partial Iterative Semirings. Search on Bibsonomy CAI The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
24Thomas R. Halford, Alex J. Grant, Keith M. Chugg Which Codes Have 4-Cycle-Free Tanner Graphs? Search on Bibsonomy IEEE Trans. Inf. Theory The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
21Werner Kuich Cycle-Free N-Algebraic Systems. Search on Bibsonomy Theoretical Computer Science The full citation details ... 1981 DBLP  DOI  BibTeX  RDF
19Klaus Wich Sublinear Ambiguity. Search on Bibsonomy MFCS The full citation details ... 2000 DBLP  DOI  BibTeX  RDF
18Jack B. Dennis General Parallel Computation can be Performed with a Cycle-Free Heap. Search on Bibsonomy IEEE PACT The full citation details ... 1998 DBLP  DOI  BibTeX  RDF heap storage management, nondeterminate merge, stream processing, functional programming languages
17José João Almeida, Eliana Grande, Georgi Smirnov On solving cycle-free context-free grammar equivalence problem using numerical analysis. Search on Bibsonomy J. Comput. Lang. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
17Wittawat Kositwattanarerk Pseudocodeword-free criterion for codes with cycle-free Tanner graph. Search on Bibsonomy Des. Codes Cryptogr. The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
17Wittawat Kositwattanarerk Pseudocodeword-Free Criterion for Codes with Cycle-Free Tanner Graph. Search on Bibsonomy CoRR The full citation details ... 2017 DBLP  BibTeX  RDF
15Pierre Genevès, Nabil Layaïda, Alan Schmitt Efficient static analysis of XML paths and types. Search on Bibsonomy PLDI The full citation details ... 2007 DBLP  DOI  BibTeX  RDF satisfiability, modal logic, XPath, type checking
13Gianfranco Bilardi, Franco P. Preparata Size-time complexity of Boolean networks for prefix computations. Search on Bibsonomy J. ACM The full citation details ... 1989 DBLP  DOI  BibTeX  RDF
12Ahmed Abdullah, Francesco Musolino, Paolo Stefano Crovetti Limit-Cycle Free, Digitally-Controlled Boost Converter Based on DDPWM. Search on Bibsonomy IEEE Access The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
12Mingjie Sun, Jimin Xiao, Eng Gee Lim, Yao Zhao 0001 Cycle-Free Weakly Referring Expression Grounding With Self-Paced Learning. Search on Bibsonomy IEEE Trans. Multim. The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
12Tom Kelly, Sid Kolichala, Caleb McFarland, Jatong Su The independence ratio of 4-cycle-free planar graphs. Search on Bibsonomy CoRR The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
12Zeinab Roostaie, Mohammad Gholami, Farzad Parvaresh 4-Cycle Free Spatially Coupled LDPC Codes with an Explicit Construction. Search on Bibsonomy CoRR The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
12Sean English, Tomás Masarík, Grace McCourt, Erin Meger, Michael S. Ross, Sam Spiro Linear Bounds for Cycle-Free Saturation Games. Search on Bibsonomy Electron. J. Comb. The full citation details ... 2022 DBLP  DOI  BibTeX  RDF
12Kalpana Singh, V. Krishna Rao Kandanvli, Haranath Kar Limit Cycle-Free Realization of Discrete-Time Delayed Systems with External Interference and Finite Wordlength Nonlinearities. Search on Bibsonomy Circuits Syst. Signal Process. The full citation details ... 2022 DBLP  DOI  BibTeX  RDF
12Emily McMillon, Christine A. Kelley Cycle-Free Windows of SC-LDPC Codes. Search on Bibsonomy ISIT The full citation details ... 2022 DBLP  DOI  BibTeX  RDF
12J. J. Garcia-Luna-Aceves, Bradley R. Smith, Judith T. Samson SCRIP: Safe and Cycle-Free Multi-Path Routing. Search on Bibsonomy MILCOM The full citation details ... 2022 DBLP  DOI  BibTeX  RDF
12J. J. Garcia-Luna-Aceves Safe, Fast, and Cycle-Free Multi-Path Routing Using Vouchers. Search on Bibsonomy LCN The full citation details ... 2022 DBLP  DOI  BibTeX  RDF
12Sylwia Cichacz, Agnieszka Görlich, Zsolt Tuza Z2× Z2-cordial cycle-free hypergraphs. Search on Bibsonomy Discuss. Math. Graph Theory The full citation details ... 2021 DBLP  DOI  BibTeX  RDF
12Mengyu Cao, Benjian Lv, Kaishun Wang, Sanming Zhou Extremal even-cycle-free subgraphs of the complete transposition graphs. Search on Bibsonomy Appl. Math. Comput. The full citation details ... 2021 DBLP  DOI  BibTeX  RDF
12Mengyu Cao, Benjian Lv, Kaishun Wang On even-cycle-free subgraphs of the doubled Johnson graphs. Search on Bibsonomy Appl. Math. Comput. The full citation details ... 2021 DBLP  DOI  BibTeX  RDF
12Taesung Kwon, Jong Chul Ye Cycle-Free CycleGAN Using Invertible Generator for Unsupervised Low-Dose CT Denoising. Search on Bibsonomy IEEE Trans. Computational Imaging The full citation details ... 2021 DBLP  DOI  BibTeX  RDF
12Sean English, Tomás Masarík, Grace McCourt, Erin Meger, Michael S. Ross, Sam Spiro Linear Bounds for Cycle-free Saturation Games. Search on Bibsonomy CoRR The full citation details ... 2021 DBLP  BibTeX  RDF
12Taesung Kwon, Jong Chul Ye Cycle-free CycleGAN using Invertible Generator for Unsupervised Low-Dose CT Denoising. Search on Bibsonomy CoRR The full citation details ... 2021 DBLP  BibTeX  RDF
12Ahmet Serdar Tan, Onur Sahin, Sungkwon Hong CRC Aided Short-Cycle Free BP Decoding for Polar Codes. Search on Bibsonomy ISNCC The full citation details ... 2021 DBLP  DOI  BibTeX  RDF
12Evan Gravelle, Sonia Martínez Using time-inconsistent wait-time functions for cycle-free coordinated traffic intersections. Search on Bibsonomy IFAC J. Syst. Control. The full citation details ... 2020 DBLP  DOI  BibTeX  RDF
12Andreas Bärmann, Patrick Gemander, Maximilian Merkert The clique problem with multiple-choice constraints under a cycle-free dependency graph. Search on Bibsonomy Discret. Appl. Math. The full citation details ... 2020 DBLP  DOI  BibTeX  RDF
12Ang Li, David Wentzlaff Cycle-Free FPGA Routing Graphs. Search on Bibsonomy FPGA The full citation details ... 2020 DBLP  DOI  BibTeX  RDF
12Ang Li, Ting-Jung Chang, David Wentzlaff Automated Design of FPGAs Facilitated by Cycle-Free Routing. Search on Bibsonomy FPL The full citation details ... 2020 DBLP  DOI  BibTeX  RDF
12C. G. Parthipan, Priyanka Kokil Limit-Cycle Free Realization of Digital Filters. Search on Bibsonomy SPCOM The full citation details ... 2020 DBLP  DOI  BibTeX  RDF
12Jingjun Bao, Lijun Ji Two Orthogonal 4-Cycle-Free One-Factorizations of Complete Graphs. Search on Bibsonomy Graphs Comb. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
12Priyanka Kokil, Xavier S. Arockiaraj, Haranath Kar Criterion for limit cycle-free state-space digital filters with external disturbances and generalized overflow non-linearities. Search on Bibsonomy Trans. Inst. Meas. Control The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
12Hans E. De Meyer, Bernard De Baets Cycle-Free Cuts of the Reciprocal Relation Generated by Random Variables that are Pairwisely Coupled by a Frank Copula. Search on Bibsonomy SMPS The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
12Sung-Mo Kang, Myoung-Chul Park, Hyo-Sung Ahn Distance-Based Cycle-Free Persistent Formation: Global Convergence and Experimental Test With a Group of Quadcopters. Search on Bibsonomy IEEE Trans. Ind. Electron. The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
12Evan Gravelle, Sonia Martínez A cycle-free coordinated traffic intersection policy using time-inconsistent wait-time functions. Search on Bibsonomy CCTA The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
12Hossam M. Abdelghaffar, Hao Yang 0025, Hesham A. Rakha Developing a de-centralized cycle-free nash bargaining arterial traffic signal controller. Search on Bibsonomy MT-ITS The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
12Mohammad Gholami, Akram Nassaj Row and Column Extensions of 4-Cycle Free LDPC Codes. Search on Bibsonomy IEEE Commun. Lett. The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
12Kai Kruppa, Sven Pfeiffer, Gerwald Lichtenberg, Frank Brinker, Winfried Decking, Klaus Flöttmann, Olaf Krebs, Holger Schlarb, Siegfried Schreiber High Precision Temperature Control of Normal-conducting RF GUN for a High Duty Cycle Free-Electron Laser. Search on Bibsonomy SIMULTECH The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
12Karel De Loof, Bernard De Baets, Hans E. De Meyer Cycle-free cuts of mutual rank probability relations. Search on Bibsonomy Kybernetika The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
12József Balogh, Ping Hu, Bernard Lidický, Hong Liu 0010 Upper bounds on the size of 4- and 6-cycle-free subgraphs of the hypercube. Search on Bibsonomy Eur. J. Comb. The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
12Anna B. Khmelnitskaya, Dolf Talman Tree, web and average web values for cycle-free directed graph games. Search on Bibsonomy Eur. J. Oper. Res. The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
12András Gyárfás, Gábor N. Sárközy Rainbow matchings and cycle-free partial transversals of Latin squares. Search on Bibsonomy Discret. Math. The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
12René van den Brink, Gerard van der Laan, Nigel Moes A strategic implementation of the Average Tree solution for cycle-free graph games. Search on Bibsonomy J. Econ. Theory The full citation details ... 2013 DBLP  DOI  BibTeX  RDF
12Thomas R. Halford, Keith M. Chugg, Marcus T. Urie Conditionally Cycle-Free Graphical Models for Coset Codes. Search on Bibsonomy IEEE Trans. Inf. Theory The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
12Satoko Ryuo, Keisuke Sato, Yoshitsugu Yamamoto Parameterized fairness axioms on cycle-free graph games. Search on Bibsonomy J. Glob. Optim. The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
12Morteza Esmaeili, Mostafa Javedankherad 4-Cycle Free LDPC Codes Based on Difference Sets. Search on Bibsonomy IEEE Trans. Commun. The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
12Kwang-Kyo Oh, Hyo-Sung Ahn Local asymptotic convergence of a cycle-free persistent formation of double-integrators in three-dimensional space. Search on Bibsonomy ISIC The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
12Zoltán Füredi, Lale Özkahya On even-cycle-free subgraphs of the hypercube. Search on Bibsonomy J. Comb. Theory, Ser. A The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
12Kwang-Kyo Oh, Hyo-Sung Ahn Distance-based control of cycle-free persistent formations. Search on Bibsonomy ISIC The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
12Amin Sakzad, Mohammad-Reza Sadeghi 0001 On cycle-free lattices with high rate label codes. Search on Bibsonomy Adv. Math. Commun. The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
12Zoltán Füredi, Lale Özkahya On even-cycle-free subgraphs of the hypercube. Search on Bibsonomy Electron. Notes Discret. Math. The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
12Mariusz Meszka k-Cycle Free One-Factorizations of Complete Graphs. Search on Bibsonomy Electron. J. Comb. The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
12Zoltán Füredi, Lale Özkahya On 14-Cycle-Free Subgraphs of the Hypercube. Search on Bibsonomy Comb. Probab. Comput. The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
12Sinisa T. Vrecica, Rade T. Zivaljevic Cycle-free chessboard complexes and symmetric homology of algebras. Search on Bibsonomy Eur. J. Comb. The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
12David E. Brown, J. Richard Lundgren, Li Sheng 0001 A characterization of cycle-free unit probe interval graphs. Search on Bibsonomy Discret. Appl. Math. The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
12Tolga Eren 3-cycle-free persistence for cooperative control of formations with acyclic control structure. Search on Bibsonomy ICONS The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
12P. Jean-Jacques Herings, Gerard van der Laan, Dolf Talman The average tree solution for cycle-free graph games. Search on Bibsonomy Games Econ. Behav. The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
12Marcelo Oliveira Camponez, Ana Cristina Staut Simmer, Mário Sarcinelli Filho Low-noise zero-input, overflow, and constant-input limit cycle-free implementation of state space digital filters. Search on Bibsonomy Digit. Signal Process. The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
12Thomas R. Halford, Keith M. Chugg Conditionally Cycle-Free Generalized Tanner Graphs: Theory and Application to High-Rate Serially Concatenated Codes. Search on Bibsonomy ISIT The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
12Per Håkan Lundow, Klas Markström Broken-Cycle-Free Subgraphs and the Log-Concavity Conjecture for Chromatic Polynomials. Search on Bibsonomy Exp. Math. The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
12Thomas R. Halford, Keith M. Chugg Conditionally Cycle-Free Generalized Tanner Graphs: Theory and Application to High-Rate Serially Concatenated Codes Search on Bibsonomy CoRR The full citation details ... 2006 DBLP  BibTeX  RDF
12Thomas R. Halford, Keith M. Chugg, Alex J. Grant Which Codes Have 4-Cycle-Free Tanner Graphs? Search on Bibsonomy ISIT The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
12Thomas Lam A result on 2k-cycle-free bipartite graphs. Search on Bibsonomy Australas. J Comb. The full citation details ... 2005 DBLP  BibTeX  RDF
12Sheryl L. Howard, Siavash Sheikh Zeinoddin, Christian Schlegel, Vincent C. Gaudet Short-cycle-free interleaver design for increasing minimum squared Euclidean distance. Search on Bibsonomy ISIT The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
12Thomas Linke, Hans Tompits, Stefan Woltran On acyclic and head-cycle free nested logic programs. Search on Bibsonomy NMR The full citation details ... 2004 DBLP  BibTeX  RDF
12G. David Forney Jr. Codes on graphs: constraint complexity of cycle-free realizations of linear codes. Search on Bibsonomy IEEE Trans. Inf. Theory The full citation details ... 2003 DBLP  DOI  BibTeX  RDF
12Mohammad-Reza Sadeghi 0001, Daniel Panario Low density parity check lattices based on construction D' and cycle-free Tanner graphs. Search on Bibsonomy Algebraic Coding Theory and Information Theory The full citation details ... 2003 DBLP  BibTeX  RDF
12Jing Li 0066, Krishna R. Narayanan, Costas N. Georghiades An efficient decoding algorithm for cycle-free convolutional codes and its applications. Search on Bibsonomy GLOBECOM The full citation details ... 2001 DBLP  DOI  BibTeX  RDF
12Jamel Lakhal, Luc Litzler An NC Algorithm for the Perfect Matching Problem in Larger cycle-free Graphs. Search on Bibsonomy Electron. Notes Discret. Math. The full citation details ... 1999 DBLP  DOI  BibTeX  RDF
12A. Djebbari, Jean Michel Rouvaen, Al. Djebbari, M. Faouzi Belbachir, Sid Ahmed Elahmar A new approach to the design of limit cycle-free IIR digital filters using eigenfilter method. Search on Bibsonomy Signal Process. The full citation details ... 1999 DBLP  DOI  BibTeX  RDF
12Tuvi Etzion, Ari Trachtenberg, Alexander Vardy Which codes have cycle-free Tanner graphs? Search on Bibsonomy IEEE Trans. Inf. Theory The full citation details ... 1999 DBLP  DOI  BibTeX  RDF
12Felix Lazebnik, Vasiliy A. Ustimenko, Andrew J. Woldar Polarities and 2k-cycle-free graphs. Search on Bibsonomy Discret. Math. The full citation details ... 1999 DBLP  DOI  BibTeX  RDF
12Mamdouh F. Fahmy, G. M. Abdel-Raheem, Mohammed Abo-Zahhad Synthesis of fixed point limit-cycle-free digital filters with low roundoff noise. Search on Bibsonomy Int. J. Circuit Theory Appl. The full citation details ... 1995 DBLP  DOI  BibTeX  RDF
12Wei-Ping Liu, Ivan Rival, Nejib Zaguia Automorphisms, isotone self-maps and cycle-free orders. Search on Bibsonomy Discret. Math. The full citation details ... 1995 DBLP  DOI  BibTeX  RDF
12Bruce W. Bomar Low-roundoff-noise limit-cycle-free implementation of recursive transfer functions on a fixed-point digital signal processor. Search on Bibsonomy IEEE Trans. Ind. Electron. The full citation details ... 1994 DBLP  DOI  BibTeX  RDF
12Felix Lazebnik, Vasiliy A. Ustimenko, Andrew J. Woldar Properties of Certain Families of 2k-Cycle-Free Graphs. Search on Bibsonomy J. Comb. Theory, Ser. B The full citation details ... 1994 DBLP  DOI  BibTeX  RDF
12Timo I. Laakso, Markus Lang, Tapio Saramäki Design of Limit-Cycle-Free Recursive Transfer Functions for Fixed-Point Direct Form Implementation. Search on Bibsonomy ISCAS The full citation details ... 1994 DBLP  DOI  BibTeX  RDF
12Olivia M. Carducci The strong perfect graph conjecture holds for diamonded odd cycle-free graphs. Search on Bibsonomy Discret. Math. The full citation details ... 1992 DBLP  DOI  BibTeX  RDF
12Themistocles Politof, Appajosyula Satyanarayana Network Reliability and Inner-Four-Cycle-Free Graphs. Search on Bibsonomy Math. Oper. Res. The full citation details ... 1986 DBLP  DOI  BibTeX  RDF
12Vimal Singh On the realization of two's complement overflow limit cycle free state-space digital filters. Search on Bibsonomy Proc. IEEE The full citation details ... 1986 DBLP  DOI  BibTeX  RDF
12Akinori Nishihara Design of limit-cycle-free digital biquad filters. Search on Bibsonomy ICASSP The full citation details ... 1986 DBLP  DOI  BibTeX  RDF
12Rainer Prinoth Construction of Distributed Systems from Cycle-Free Finite Automata. Search on Bibsonomy European Workshop on Applications and Theory of Petri Nets The full citation details ... 1982 DBLP  DOI  BibTeX  RDF
12Oswin Aichholzer, Thomas Hackl, Birgit Vogtenhuber, Clemens Huemer, Ferran Hurtado, Hannes Krasser On the number of plane graphs. Search on Bibsonomy SODA The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
12Shunsuke Koshita, Masahide Abe, Masayuki Kawamata Gramian-Preserving Frequency Transformation for State-Space Digital Filters. Search on Bibsonomy APCCAS The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
12Orna Kupferman, Moshe Y. Vardi On Bounded Specifications. Search on Bibsonomy LPAR The full citation details ... 2001 DBLP  DOI  BibTeX  RDF
9Qinghua Guo 0001, Li Ping 0001 LMMSE turbo equalization based on factor graphs. Search on Bibsonomy IEEE J. Sel. Areas Commun. The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
9Martin Gebser, Joohyung Lee 0002, Yuliya Lierler Head-Elementary-Set-Free Logic Programs. Search on Bibsonomy LPNMR The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
9Sundararajan Sankaranarayanan, Bane Vasic Iterative Decoding of Linear Block Codes: A Parity-Check Orthogonalization Approach. Search on Bibsonomy IEEE Trans. Inf. Theory The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
9Mainak Chaudhuri, Mark A. Heinrich Exploring Virtual Network Selection Algorithms in DSM Cache Coherence Protocols. Search on Bibsonomy IEEE Trans. Parallel Distributed Syst. The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
6Luca Iocchi, Thomas Lukasiewicz, Daniele Nardi, Riccardo Rosati 0001 Reasoning about actions with sensing under qualitative and probabilistic uncertainty. Search on Bibsonomy ACM Trans. Comput. Log. The full citation details ... 2009 DBLP  DOI  BibTeX  RDF qualitative and probabilistic uncertainty, description logics, sensing, Reasoning about actions, imprecise probabilities, action languages
6Paolo Pilozzi, Danny De Schreye Proving Termination by Invariance Relations. Search on Bibsonomy ICLP The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
6Manfred Droste, Robert Gray, John Kenneth Truss Construction of Some Uncountable 2-Arc-Transitive Bipartite Graphs. Search on Bibsonomy Order The full citation details ... 2008 DBLP  DOI  BibTeX  RDF Mathematics Subject Classification (2000) 05C75, 06A06
Displaying result #1 - #100 of 123 (100 per page; Change: )
Pages: [1][2][>>]
Valid XHTML 1.1! Valid CSS! [Valid RSS]
Maintained by L3S.
Previously maintained by Jörg Diederich.
Based upon DBLP by Michael Ley.
open data data released under the ODC-BY 1.0 license